ICISTM 2010: Information Systems, Technology and Management pp 123-132 | Cite as
Distributed Scheduling of a Network of Adjustable Range Sensors for Coverage Problems
Conference paper
Abstract
In this paper, we present two distributed algorithms to maximize the lifetime of Wireless Sensor Networks for target coverage when the sensors have the ability to adjust their sensing and communication ranges. These algorithms are based on the enhancement of distributed algorithms for fixed range sensors proposed in the literature. We outline the algorithms for the adjustable range model, prove their correctness and analyze the time and message complexities. We also conduct simulations demonstrating 20% improvement in network lifetime when compared with the previous approaches. Thus, in addition to sleep-sense scheduling techniques, further improvements in network lifetime can be derived by designing algorithms that make use of the adjustable range model.
Keywords
Sensor Network Sensor Node Wireless Sensor Network Energy Model Network Lifetime
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
- 1.Slijepcevic, S., Potkonjak, M.: Power efficient organization of wireless sensor networks. In: IEEE International Conference on Communications (ICC), vol. 2, pp. 472–476 (2001)Google Scholar
- 2.Lu, J., Suda, T.: Coverage-aware self-scheduling in sensor networks. In: 18th Annual Workshop on Computer Communications (CCW), pp. 117–123 (2003)Google Scholar
- 3.Abrams, Z., Goel, A., Plotkin, S.: Set k-cover algorithms for energy efficient monitoring in wireless sensor networks. In: Third International Symposium on Information Processing in Sensor Networks, pp. 424–432 (2004)Google Scholar
- 4.Cardei, M., Thai, M., Li, Y., Wu, W.: Energy-efficient target coverage in wireless sensor networks. In: INFOCOM 2005, March 2005, vol. 3 (2005)Google Scholar
- 5.Cardei, M., Du, D.Z.: Improving wireless sensor network lifetime through power aware organization. Wireless Networks 11, 333–340 (2005)CrossRefGoogle Scholar
- 6.Prasad, S.K., Dhawan, A.: Distributed algorithms for lifetime of wireless sensor networks based on dependencies among cover sets. In: Aluru, S., Parashar, M., Badrinath, R., Prasanna, V.K. (eds.) HiPC 2007. LNCS, vol. 4873, pp. 381–392. Springer, Heidelberg (2007)CrossRefGoogle Scholar
- 7.Dhawan, A., Prasad, S.K.: Energy efficient distributed algorithms for sensor target coverage based on properties of an optimal schedule. In: Sadayappan, P., Parashar, M., Badrinath, R., Prasanna, V.K. (eds.) HiPC 2008. LNCS, vol. 5374, pp. 269–281. Springer, Heidelberg (2008)CrossRefGoogle Scholar
- 8.Wu, J., Yang, S.: Coverage issue in sensor networks with adjustable ranges. In: Proceedings of 2004 International Conference on Parallel Processing Workshops, ICPP 2004 Workshops, August 2004, pp. 61–68 (2004)Google Scholar
- 9.Zhou, Z., Das, S., Gupta, H.: Variable radii connected sensor cover in sensor networks. In: 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, IEEE SECON 2004, October 2004, pp. 387–396 (2004)Google Scholar
- 10.Cardei, M., Wu, J., Lu, M., Pervaiz, M.: Maximum network lifetime in wireless sensor networks with adjustable sensing ranges. In: IEEE International Conference on Wireless And Mobile Computing, Networking And Communications (WiMob 2005), August 2005, vol. 3, pp. 438–445 (2005)Google Scholar
- 11.Lu, M., Wu, J., Cardei, M., Li, M.: Energy-efficient connected coverage of discrete targets in wireless sensor networks. In: Lu, X., Zhao, W. (eds.) ICCNMC 2005. LNCS, vol. 3619, pp. 43–52. Springer, Heidelberg (2005)CrossRefGoogle Scholar
- 12.Dhawan, A., Vu, C.T., Zelikovsky, A., Li, Y., Prasad, S.K.: Maximum lifetime of sensor networks with adjustable sensing range. In: Proceedings of the International Workshop on Self-Assembling Wireless Networks (SAWN), pp. 285–289 (2006)Google Scholar
- 13.Berman, P., Calinescu, G., Shah, C., Zelikovsky, A.: Efficient energy management in sensor networks. In: Ad Hoc and Sensor Networks, Wireless Networks and Mobile Computing (2005)Google Scholar
- 14.Brinza, D., Zelikovsky, A.: Deeps: Deterministic energy-efficient protocol for sensor networks. In: Proceedings of the International Workshop on Self-Assembling Wireless Networks (SAWN), pp. 261–266 (2006)Google Scholar
- 15.Aung, A.: Distributed algorithms for improving wireless sensor network lifetime with adjustable sensing range. M.S. Thesis, Georgia State University (2007)Google Scholar
- 16.Meguerdichian, S., Potkonjak, M.: Low power 0/1 coverage and scheduling techniques in sensor networks. UCLA Technical Reports 030001 (2003)Google Scholar
- 17.Berman, P., Calinescu, G., Shah, C., Zelikovsky, A.: Power efficient monitoring management in sensor networks. In: Wireless Communications and Networking Conference (WCNC), vol. 4, pp. 2329–2334 (2004)Google Scholar
- 18.Garg, N., Koenemann, J.: Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In: FOCS 1998: Proceedings of the 39th Annual Symposium on Foundations of Computer Science, Washington, DC, USA, p. 300. IEEE Computer Society, Los Alamitos (1998)Google Scholar
- 19.Wang, J., Medidi, S.: Energy efficient coverage with variable sensing radii in wireless sensor networks. In: Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, WiMOB 2007, October 2007, pp. 61–69 (2007)Google Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2010