Energy-efficient distributed lifetime optimizing scheme for wireless sensor networks

Abstract

In this paper, a sensing model for the coverage analysis of wireless sensor networks is provided. Using this model and Monte Carlo method, the ratio of private range to sensing range required to obtain the desired coverage can be derived considering the scale of deployment area and the number of sensor nodes. Base on the coverage analysis, an energy-efficient distributed node scheduling scheme is proposed to prolong the network lifetime while maintaining the desired sensing coverage, which does not need the geographic or neighbor information of nodes. The proposed scheme can also handle uneven distribution, and it is robust against node failures. Theoretical and simulation results demonstrate its efficiency and usefulness.

Keywords

wireless sensor networks / lifetime optimization / coverage / reliability / Monte Carlo method

References

[1] Kasbekar G S, Bejerano Y, Sarkar S. Lifetime and coverage guarantees through distributed coordinate-free sensor activation [J]. IEEE/ACM Transactions on Networking, 2011, 19(2): 470-483.

[2] Liu M, Cao J, Lou W, et al. Coverage analysis for wireless sensor networks. Mobile Ad-hoc and Sensor Networks[M], 2005, Germany: Springer.

[3] Jain S, Srivastava S. A survey and classification of distributed scheduling algorithms for sensor networks[C]. International Conference on Sensor Technologies and Applications. Valencia, Spain, 2007.

[4] Wu K, Gao Y, Li F, et al. Lightweight deployment-aware scheduling for wireless sensor networks [J]. Mobile Networks and Applications, 2005, 10(6): 837-852.

[5] Tilak S, Abu-Ghazaleh N B, Heinzelman W. Infrastructure tradeoffs for sensor networks [C]. Proceedings of the 1st ACM International Workshop on Wireless Sensor Networks and Applications. Atlanta, USA, 2002.

[6] Cardei M, Du D Z. Improving wireless sensor network lifetime through power aware organization [J]. Wireless Networks, 2005, 11(3): 333-340.

[7] Luo W, Wang J, Guo J, et al. Parameterized complexity of max-lifetime target coverage in wireless sensor networks [J]. Theoretical Computer Science, 2014, 518: 32-41.

[8] Zorbas D, Glynos D, Kotzanikolaou P, et al. Solving coverage problems in wireless sensor networks using cover sets [J]. Ad Hoc Networks, 2010, 8(4): 400-415.

[9] Mohamadi H, Ismail A S, Salleh S. Solving target coverage problem using cover sets in wireless sensor networks based on learning automata [J]. Wireless Personal Communications, 2014, 75(1): 447-463.

[10] Bulut E, Korpeoglu I. Sleep scheduling with expected common coverage in wireless sensor networks [J]. Wireless Networks, 2011, 17(1): 19-40.

[11] Ma S S, Qian J S. Energy balanced non-uniform distribution node scheduling algorithm for wireless sensor networks [J]. Applied Mathematics & Information Sciences, 2014, 8(4): 1997-2003.

[12] Zhang H H, Hou J C. Maintaining sensing coverage and connectivity in large sensor networks [J]. Ad Hoc & Sensor Wireless Networks, 2005, 1(1/2): 89-124.

[13] Walter J C, Barkema G T. An introduction to Monte Carlo methods [J]. Physica A: Statistical Mechanics and Its Applications, 2015, 418: 78-87.

[14] Cho J, Kim G, Kwon T, et al. A distributed node scheduling protocol considering sensing coverage in wireless sensor networks [C]. IEEE 66th Vehicular Technology Conference. Baltimore, USA, 2007.

[15] Hill J, Szewczyk R, Woo A, et al. System architecture directions for networked sensors [J]. Operating Systems Review, 2000, 34(5): 93-104.