Article

Algorithmic models for sensor networks

Authors:

Roger WattenhoferAuthors Info & Claims

IPDPS'06: Proceedings of the 20th international conference on Parallel and distributed processing

Page 177

Published: 25 April 2006 Publication History

Abstract

Developing algorithms for sensor networks--and proving their correctness and performance-, requires simplifying but still realistic models. This paper surveys various models in use today and puts them into perspective. In addition, we propose interesting models which are not widely adopted by the community so far.

References

[1]

L. Barrière, P. Fraigniaud, and L. Narayanan. Robust Position-based Routing in Wireless Ad Hoc Networks with Unstable Transmission Ranges. In Proc. 5th Intl. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM), pages 19-27, 2001.

Digital Library

[2]

J.-H. Chang and L. Tassiulas. Energy Conserving Routing in Wireless Ad-hoc Networks. In Proc. IEEE Infocom, pages 22-31, 2000.

[3]

B. N. Clark, C. J. Colbourn, and D. S. Johnson. Unit Disk Graphs. Discrete Mathematics, 86:165-177, 1990.

Digital Library

[4]

A. E. F. Clementi, G. Huiban, and P. Penna. On the Approximation Ratio of the MST-Based Heuristic for the Energy-Efficient Broadcast Problem in Static Ad-Hoc Radio Networks. In Proc. 17th International Symposium on Parallel and Distributed Processing (IPDPS), Washington, DC, USA, 2003.

Digital Library

[5]

O. Dousse, P. Thiran, and M. Hasler. Connectivity in Ad-hoc and Hybrid Networks. In Proc. IEEE Infocom, 2002.

[6]

A. El Fawal, J.-Y. Le Boudec, R. Merz, B. Radunovic, J. Widmer, and G. M. Maggio. Trade-off Analysis of PHY-Aware MAC in Low-Rate Low-Power UWB Networks. IEEE Communications Magazine, December 2005.

Digital Library

[7]

D. Ganesan, D. Estrin, A. Woo, D. Culler, B. Krishnamachari, and S.Wicker. Complex Behavior at Scale: An Experimental Study of Low-Power Wireless Sensor Networks. Technical report, UCLA Computer Science Technical Report UCLA/CSD-TR 02-0013, 2002.

[8]

A. Gupta, R. Krauthgamer, and J. R. Lee. Bounded Geometries, Fractals, and Low-Distortion Embeddings. In Proc. 44th Annual IEEE Symp. on Foundations of Computer Science (FOCS), page 534, 2003.

Digital Library

[9]

P. Gupta and P. Kumar. The Capacity of Wireless Networks. Trans. Information Theory, 46(2):388-404, 2000.

Digital Library

[10]

S. O. Krumke, M. V. Marathe, and S. S. Ravi. Models and Approximation Algorithms for Channel Assignment in Radio Networks. Wireless Networks, 7(6):575-584, 2001.

Digital Library

[11]

F. Kuhn, T. Moscibroda, T. Nieberg, and R. Wattenhofer. Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs. In Proc. 19th Intl. Symp. on Distributed Computing (DISC), 2005.

Digital Library

[12]

F. Kuhn, T. Moscibroda, and R. Wattenhofer. What Cannot Be Computed Locally! In Proc. 23rd ACM Symp. on the Principles of Distributed Computing (PODC), 2004.

Digital Library

[13]

F. Kuhn, T. Moscibroda, and R. Wattenhofer. On the Locality of Bounded Growth. In Proc. 24th ACM Symp. on Principles of Distributed Computing (PODC, pages 60-68, 2005.

Digital Library

[14]

F. Kuhn, T. Nieberg, T. Moscibroda, and R. Wattenhofer. Local Approximation Schemes for Ad-hoc and Sensor Networks. In Proc. Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), pages 97-103, 2005.

Digital Library

[15]

F. Kuhn and R. Wattenhofer. Constant-time Distributed Dominating Set Approximation. In Proc. 22nd Annual Symp. on Principles of Distributed Computing (PODC), pages 25-32, 2003.

Digital Library

[16]

F. Kuhn, R. Wattenhofer, and A. Zollinger. Ad-hoc Networks Beyond Unit Disk Graphs. In Proc. 1st ACM Joint Workshop on Foundations of Mobile Computing (DIALMPOMC), 2003.

Digital Library

[17]

F. Kuhn, R.Wattenhofer, and A. Zollinger. Worst-Case Optimal and Average-case Efficient Geometric Ad-hoc Routing. In Proc. 4th ACM Int. Symp. on Mobile Ad Hoc Networking & Computing (MobiHoc), pages 267-278, 2003.

Digital Library

[18]

F. Meyer auf de Heide, C. Schindelhauer, K. Volbert, and M. Grunewald. Energy, Congestion and Dilation in Radio Networks. In Proc. 14th Annual ACM Symp. on Parallel Algorithms and Architectures (SPAA), pages 230-237, 2002.

Digital Library

[19]

T. Moscibroda, P. von Rickenbach, and R. Wattenhofer. Analyzing the Energy-Latency Trade-off during the Deployment of Sensor Networks. In Proc. IEEE Infocom, 2006.

[20]

T. Moscibroda and R. Wattenhofer. Coloring Unstructured Radio Networks. In Proc. 17th Annual ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), pages 39- 48, 2005.

Digital Library

[21]

T. Moscibroda and R. Wattenhofer. The Complexity of Connectivity in Wireless Networks. In Proc. IEEE Infocom, 2006.

[22]

D. Peleg. Distributed Computing: A Locality-sensitive Approach. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2000.

Digital Library

[23]

V. Raghunathan, C. Schurgers, S. Park, and M. Srivastava. Energy AwareWireless Microsensor networks. IEEE Signal Processing Magazine, 19(2):40-50, 2002.

[24]

T. Rappaport. Wireless Communications: Principles and Practices. Prentice Hall, 1996.

Digital Library

[25]

I. Stojmenović, A. Nayak, and J. Kuruvila. Design Guidelines for Routing Protcols in Ad Hoc and Sensor Networks with a Realistic Physical Layer. IEEE Communications Magazine, March 2005.

Digital Library

[26]

P.-J. Wan, K. M. Alzoubi, and O. Frieder. Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks. Mobile Networks and Applications, 9(2):141- 149, 2004.

Digital Library

[27]

Y. Wang, X.-Y. Li, P.-J. Wan, and O. Frieder. Sparse Power Efficient Topology forWireless Networks. J. of Parallel and Distributed Computing, 2002.

Digital Library

Cited By

Halldórsson MKonrad C(2018)Computing large independent sets in a single roundDistributed Computing10.1007/s00446-017-0298-y31:1(69-82)Online publication date: 1-Feb-2018
https://dl.acm.org/doi/10.1007/s00446-017-0298-y
Chlebus BVaya S(2016)Distributed communication in bare-bones wireless networksProceedings of the 17th International Conference on Distributed Computing and Networking10.1145/2833312.2833454(1-10)Online publication date: 4-Jan-2016
https://dl.acm.org/doi/10.1145/2833312.2833454
Daum SKuhn F(2015)Tight Bounds for MIS in Multichannel Radio NetworksProceedings of the 29th International Symposium on Distributed Computing - Volume 936310.1007/978-3-662-48653-5_38(573-587)Online publication date: 7-Oct-2015
https://dl.acm.org/doi/10.1007/978-3-662-48653-5_38
Show More Cited By

Algorithmic models for sensor networks
1. Networks
  1. Network types

Recommendations

K-Hop Coverage and Connectivity Aware Clustering in Different Sensor Deployment Models for Wireless Sensor and Actuator Networks

In wireless sensor and actuator networks, WSAN, actuators often act as cluster headers. Since the transmission range of actuator is much larger than that of sensor, both of the coverage of actuator and the connectivity of sensor-actuator require to be ...
Sensor scheduling for p-percent coverage in wireless sensor networks

We study sensor scheduling problems of p-percent coverage in this paper and propose two scheduling algorithms to prolong network lifetime due to the fact that for some applications full coverage is not necessary and different subareas of the monitored ...
The optimization of sensor relocation in wireless mobile sensor networks

Wireless Sensor Networks (WSNs) have been an active research area these years due to their broad range of potential applications. Several research issues, which include energy-aware routing, sensor deployment problems, data aggregation, etc., have been ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

IPDPS'06: Proceedings of the 20th international conference on Parallel and distributed processing

April 2006

399 pages

ISBN:1424400546

Sponsors

IEEE CS TCPP: IEEE Computer Society Technical Committee on Parallel Processing

In-Cooperation

IEEE TCCA: IEEE Computer Society Technical Committee on Computer Architecture
SIGARCH: ACM Special Interest Group on Computer Architecture
IEEE Computer Society Technical Committee on Distributed Processing

Publisher

IEEE Computer Society

United States

Publication History

Published: 25 April 2006

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

24
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Halldórsson MKonrad C(2018)Computing large independent sets in a single roundDistributed Computing10.1007/s00446-017-0298-y31:1(69-82)Online publication date: 1-Feb-2018
https://dl.acm.org/doi/10.1007/s00446-017-0298-y
Chlebus BVaya S(2016)Distributed communication in bare-bones wireless networksProceedings of the 17th International Conference on Distributed Computing and Networking10.1145/2833312.2833454(1-10)Online publication date: 4-Jan-2016
https://dl.acm.org/doi/10.1145/2833312.2833454
Daum SKuhn F(2015)Tight Bounds for MIS in Multichannel Radio NetworksProceedings of the 29th International Symposium on Distributed Computing - Volume 936310.1007/978-3-662-48653-5_38(573-587)Online publication date: 7-Oct-2015
https://dl.acm.org/doi/10.1007/978-3-662-48653-5_38
Balcan MKrehbiel SPiliouras GShin J(2014)Near-Optimality in Covering Games by Exposing Global InformationACM Transactions on Economics and Computation10.1145/25978902:4(1-22)Online publication date: 28-Oct-2014
https://dl.acm.org/doi/10.1145/2597890
Daum SGhaffari MGilbert SKuhn FNewport CFatourou PTaubenfeld G(2013)Maximal independent sets in multichannel radio networksProceedings of the 2013 ACM symposium on Principles of distributed computing10.1145/2484239.2484257(335-344)Online publication date: 22-Jul-2013
https://dl.acm.org/doi/10.1145/2484239.2484257
Jurdzinski TKowalski DStachowiak G(2013)Distributed deterministic broadcasting in uniform-power ad hoc wireless networksProceedings of the 19th international conference on Fundamentals of Computation Theory10.1007/978-3-642-40164-0_20(195-209)Online publication date: 19-Aug-2013
https://dl.acm.org/doi/10.1007/978-3-642-40164-0_20
Daum SKuhn FNewport C(2012)Efficient symmetry breaking in multi-channel radio networksProceedings of the 26th international conference on Distributed Computing10.1007/978-3-642-33651-5_17(238-252)Online publication date: 16-Oct-2012
https://dl.acm.org/doi/10.1007/978-3-642-33651-5_17
Bermond JGargano LPerénnes SRescigno AVaccaro U(2011)Optimal time data gathering in wireless networks with omni-directional antennasProceedings of the 18th international conference on Structural information and communication complexity10.5555/2032229.2032265(306-317)Online publication date: 26-Jun-2011
https://dl.acm.org/doi/10.5555/2032229.2032265
Bonifaci VKorteweg PMarchetti-Spaccamela AStougie L(2011)Minimizing flow time in the wireless gathering problemACM Transactions on Algorithms10.1145/1978782.19787887:3(1-20)Online publication date: 15-Jul-2011
https://dl.acm.org/doi/10.1145/1978782.1978788
Bonifaci VKorteweg PMarchetti-Spaccamela AStougie L(2011)The distributed wireless gathering problemTheoretical Computer Science10.1016/j.tcs.2010.10.018412:8-10(633-641)Online publication date: 1-Mar-2011
https://dl.acm.org/doi/10.1016/j.tcs.2010.10.018
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Table of Contents