Average Case Network Lifetime on an Interval with Adjustable Sensing Ranges

Given n sensors on an interval, each of which is equipped with an adjustable sensing radius and a unit battery charge that drains in inverse linear proportion to its radius, what schedule will maximize the lifetime of a network that covers the entire interval? Trivially, any reasonable algorithm is at least a 2-approximation for this Sensor Strip Cover problem, so we focus on developing an efficient algorithm that maximizes the expected network lifetime under a random uniform model of sensor distribution. We demonstrate one such algorithm that achieves an expected network lifetime within 12 % of the theoretical maximum. Most of the algorithms that we consider come from a particular family of RoundRobin coverage, in which sensors take turns covering predefined areas until their battery runs out.

[1]  Jie Wu,et al.  Improving network lifetime using sensors with adjustable sensing ranges , 2006, Int. J. Sens. Networks.

[2]  Mohammad Ilyas,et al.  Handbook of Sensor Networks: Compact Wireless and Wired Sensing Systems , 2004 .

[3]  Jie Wu,et al.  Maximum network lifetime in wireless sensor networks with adjustable sensing ranges , 2005, WiMob'2005), IEEE International Conference on Wireless And Mobile Computing, Networking And Communications, 2005..

[4]  Dror Rawitz,et al.  Should I Stay or Should I Go? Maximizing Lifetime with Relays , 2012, 2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems.

[5]  Jie Wang,et al.  Barrier Coverage of Line-Based Deployed Wireless Sensor Networks , 2009, IEEE INFOCOM 2009.

[6]  Dror Rawitz,et al.  Changing of the Guards: Strip Cover with Duty Cycling , 2012, SIROCCO.

[7]  Esther M. Arkin,et al.  Minimum-cost coverage of point sets by disks , 2006, SCG '06.

[8]  Joseph S. B. Mitchell,et al.  Connecting a Set of Circles with Minimum Sum of Radii , 2011, WADS.

[9]  Matt Gibson,et al.  On clustering to minimize the sum of radii , 2008, SODA '08.

[10]  Sushil K. Prasad,et al.  A distributed algorithmic framework for coverage problems in Wireless Sensor Networks , 2008, IPDPS.

[11]  Mihaela Cardei,et al.  Coverage in Wireless Sensor Networks , 2004, Handbook of Sensor Networks.

[12]  Harald Niederreiter,et al.  Probability and computing: randomized algorithms and probabilistic analysis , 2006, Math. Comput..

[13]  Matt Gibson,et al.  Optimally Decomposing Coverings with Translates of a Convex Polygon , 2011, Discret. Comput. Geom..

[14]  Ding-Zhu Du,et al.  Improving Wireless Sensor Network Lifetime through Power Aware Organization , 2005, Wirel. Networks.

[15]  Yang Xiao,et al.  A Survey of Energy-Efficient Scheduling Mechanisms in Sensor Networks , 2006, Mob. Networks Appl..

[16]  Kenji Leibnitz,et al.  A uniform airdrop deployment method for large-scale wireless sensor networks , 2011, Int. J. Sens. Networks.

[17]  G. Calinescu,et al.  EFFICIENT ENERGY MANAGEMENT IN SENSOR NETWORKS , 2004 .

[18]  Dror Rawitz,et al.  Set it and forget it - approximating the set once strip cover problem , 2013, SPAA.

[19]  David Peleg,et al.  Polynomial time approximation schemes for base station coverage with minimum total radii , 2005, Comput. Networks.

[20]  Amotz Bar-Noy,et al.  Maximizing Network Lifetime on the Line with Adjustable Sensing Ranges , 2011, ALGOSENSORS.

[21]  Jie Wu,et al.  Energy-Efficient Node Scheduling Models In Sensor Networks With Adjustable Ranges , 2005, Int. J. Found. Comput. Sci..

[22]  Suresh Venkatasubramanian,et al.  Restricted strip covering and the sensor cover problem , 2007, SODA '07.

[23]  Vittorio Bilò,et al.  Geometric Clustering to Minimize the Sum of Cluster Sizes , 2005, ESA.