Optimal Transmission Range for Topology Management in Wireless Sensor Networks

Topology management protocols aim to minimize the number of nodes in densely distributed sensor networks that constitute the topology Most protocols construct the topology with a fixed transmission range (i.e maximum transmission power) With respect to the power consumed by data transmission, it is more efficient to communicate with shorter transmission range, even with the number of nodes in the topology increased In the sense of minimizing the total power consumed by the topology management as well as data transmissions, it is necessary to find an optimal transmission range Moreover, data rate is also an important factor to determine the total transmission energy In this paper, we obtain the optimal transmission range for a given data rate and maximum transmission power to minimize the total power consumption.

[1]  Raphael Yuster,et al.  Connected Domination and Spanning Trees with Many Leaves , 2000, SIAM J. Discret. Math..

[2]  Jonathan M. Borwein,et al.  Mathematics by experiment - plausible reasoning in the 21st century , 2003 .

[3]  J. J. Garcia-Luna-Aceves,et al.  Topology management in ad hoc networks , 2003, MobiHoc '03.

[4]  R. Srikant,et al.  Unreliable sensor grids: coverage, connectivity and diameter , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[5]  Wendi Heinzelman,et al.  Proceedings of the 33rd Hawaii International Conference on System Sciences- 2000 Energy-Efficient Communication Protocol for Wireless Microsensor Networks , 2022 .

[6]  Robert Tappan Morris,et al.  Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks , 2001, MobiCom '01.

[7]  Deborah Estrin,et al.  Medium access control with coordinated adaptive sleeping for wireless sensor networks , 2004, IEEE/ACM Transactions on Networking.

[8]  Mani B. Srivastava,et al.  Topology management for sensor networks: exploiting latency and density , 2002, MobiHoc '02.

[9]  Mani Srivastava,et al.  Energy-aware wireless microsensor networks , 2002, IEEE Signal Process. Mag..

[10]  S. M. Heemstra de Groot,et al.  Power-aware routing in mobile ad hoc networks , 1998, MobiCom '98.

[11]  Ravi Prakash,et al.  Max-min d-cluster formation in wireless ad hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[12]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[13]  Atsuyuki Okabe,et al.  Spatial Tessellations: Concepts and Applications of Voronoi Diagrams , 1992, Wiley Series in Probability and Mathematical Statistics.

[14]  Koen Langendoen,et al.  An adaptive energy-efficient MAC protocol for wireless sensor networks , 2003, SenSys '03.

[15]  Christian Bettstetter,et al.  On the minimum node degree and connectivity of a wireless multihop network , 2002, MobiHoc '02.

[16]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[17]  Guoliang Xing,et al.  Integrated coverage and connectivity configuration in wireless sensor networks , 2003, SenSys '03.

[18]  Deborah Estrin,et al.  ASCENT: adaptive self-configuring sensor networks topologies , 2004, IEEE Transactions on Mobile Computing.

[19]  Deborah Estrin,et al.  An energy-efficient MAC protocol for wireless sensor networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[20]  S. Fossy,et al.  On a Voronoi Aggregative Process Related to a Bivariate Poisson Process , 1996 .

[21]  Deborah Estrin,et al.  Dimensions: why do we need a new data handling architecture for sensor networks? , 2003, CCRV.

[22]  Deborah Estrin,et al.  Geography-informed energy conservation for Ad Hoc routing , 2001, MobiCom '01.

[23]  Yu-Chee Tseng,et al.  Power-saving protocols for IEEE 802.11-based multi-hop ad hoc networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[24]  Samir Khuller,et al.  Approximation Algorithms for Connected Dominating Sets , 1996, Algorithmica.