A distributed algorithmic framework for coverage problems in wireless sensor networks

International Journal of Parallel, Emergent and Distributed Systems

Volumn 24, Issue 4, 2009, Pages 331-348

  Dhawan, Akshaye ^a   Prasad, Sushil K ^a  

^a GEORGIA STATE UNIVERSITY   (United States)

Author keywords

Distributed algorithms; Energy efficiency; Localised algorithms; Maximum lifetime; Scheduling; Wireless sensor networks

Indexed keywords

ALGORITHMIC FRAMEWORK; COVERAGE PROBLEM; DEPENDENCY GRAPHS; DISTRIBUTED ALGORITHMS; FEASIBLE SOLUTION; GENERAL VERSION; K-COVERAGE; LOCAL SOLUTION; LOCALISED ALGORITHMS; MAXIMAL INDEPENDENT SET; MAXIMUM LIFETIME; OPTIMISATIONS; PERFORMANCE IMPROVEMENTS; TARGET COVERAGE;

ENERGY EFFICIENCY; PARALLEL ALGORITHMS; SCHEDULING ALGORITHMS; SENSOR NETWORKS; SET THEORY;

WIRELESS SENSOR NETWORKS;

EID: 68949128768     PISSN: 17445760     EISSN: 17445779     Source Type: Journal    
DOI: 10.1080/17445760902720008     Document Type: Conference Paper

References (27)

1. Z. Abrams, A. Goel, and S. Plotkin, Set k-cover algorithms for energy efficient monitoring in wireless sensor networks, in Third International Symposium on Information Processing in Sensor Networks, 2004, pp. 424-432.
2. I. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, A survey on sensor networks, IEEE Commun. Mag. (2002), pp. 102-114.
3. P. Berman, G. Calinescu, C. Shah, and A. Zelikovsky, Power efficient monitoring management in sensor networks, Wireless Commun. Netw. Conf. 4 (2004), pp. 2329-2334.
4. P. Berman, G. Calinescu, C. Shah, and A. Zelikovsky, Efficient energy management in sensor networks, Ad Hoc and Sensor Networks, Wireless Networks and Mobile Computing, 2005.
5. D. Brinza and A. Zelikovsky, Deeps: Deterministic energy-efficient protocol for sensor networks, in Proceedings of the International Workshop on Self-Assembling Wireless Networks (SAWN), 2006, pp. 261-266.
6. M. Cardei and D.-Z. Du, Improving wireless sensor network lifetime through power aware organization, Wireless Netw. 11 (2005), pp. 333-340.
7. M. Cardei and J. Wu, Energy-efficient coverage problems in wireless ad hoc sensor networks, Comp. Commun. 29(4) (2006), pp. 413-420.
8. M. Cardei, D. MacCallum, M. Xiaoyan Cheng, M. Min, X. Jia, D. Li, and D.-Z. Du, Wireless sensor networks with energy efficient organization, J. Interconnection Netw. 3(3-4) (2002), pp. 213-229.
9. M. Cardei, M.T. Thai, Y. Li, and W. Wu, Energy-efficient target coverage in wireless sensor networks, INFOCOM 2005, 3, March 2005.
10. S.K. Das, N. Deo, and S.K. Prasad, Two minimum spanning forest algorithms for fixed-size hypercube computers, Parallel Comput. 15 (1990), pp. 179-187.
11. A. Dhawan, C.T. Vu, A. Zelikovsky, Y. Li, and S.K. Prasad, Maximum lifetime of sensor networks with adjustable sensing range, in Proceedings of the International Workshop on Self- Assembling Wireless Networks (SAWN), 2006, pp. 285-289.
12. A. Dhawan and S.K. Prasad, A distributed algorithmic framework for coverage problems in wireless sensor networks, in Proceedings International Parallel and Distributed Processing Symposium Workshops (IPDPS), Workshop on Advances in Parallel and Distributed Computational Models (APDCM), 2008, pp. 1-8.
13. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman & Co., New York, NY, USA, 1979.
14. N. Garg and J. Koenemann, Faster and simpler algorithms for multicommodity flow and other fractional packing problems, in FOCS '98: Proceedings of the 39th Annual Symposium on Foundations of Computer Science, IEEE Computer Society, Washington, DC, USA, 1998, p. 300.
15. S. Kumar, T.H. Lai, and J. Balogh, On k-coverage in a mostly sleeping sensor network, in MobiCom '04: Proceedings of the 10th Annual International Conference on Mobile Computing and Networking, ACM, New York, NY, USA, 2004, pp. 144-158.
16. J. Lu and T. Suda, Coverage-aware self-scheduling in sensor networks, in 18th Annual Workshop on Computer Communications (CCW), 2003, pp. 117-123.
17. S. Meguerdichian Miodrag, Low power 0/1 coverage and scheduling techniques in sensor networks, UCLA Technical Reports 030001, 2003.
18. S.K. Prasad and A. Dhawan, Distributed algorithms for lifetime of wireless sensor networks based on dependencies among cover sets, in HiPC: 14th International Conference on High Performance Computing, LNCS 4873 (2007), pp. 381-392.
19. S. Sahni and X. Xu, Algorithms for wireless sensor networks, Int. J. Distrib. Sensor Netw. (2004), p. 1.
20. E. Shih, S.-H. Cho, N. Ickes, R. Min, A. Sinha, A. Wang, and A. Chandrakasan, Physical layer driven protocol and algorithm design for energy-efficient wireless sensor networks, in MobiCom '01: Proceedings of the 7th Annual International Conference on Mobile Computing and Networking, ACM, New York, NY, USA, 2001, pp. 272-287.
21. S. Slijepcevic and M. Potkonjak, Power efficient organization of wireless sensor networks, IEEE Int. Conf. Commun. 2 (2001), pp. 472-476.
22. J.A. Stine and G. De Veciana, Improving energy efficiency of centrally controlled wireless data networks, Wireless Netw. 8(6) (2002), pp. 681-700.
23. D. Tian and N.D. Georganas, A coverage-preserving node scheduling scheme for large wireless sensor networks, in WSNA: Proceedings of the 1st ACM International Workshop on Wireless Sensor Networks and Applications, ACM, New York, NY, USA, 2002, pp. 32-41.
24. G. Xing, X. Wang, Y. Zhang, C. Lu, R. Pless, and C. Gill, Integrated coverage and connectivity configuration for energy conservation in sensor networks, ACM Trans. Sensor Netw. 1(1) (2005), pp. 36-72.
25. F. Ye, G. Zhong, S. Lu, and L. Zhang, Peas: a robust energy conserving protocol for long-lived sensor networks, in IEEE International Conference on Network Protocols (ICNP), 2002, p. 200.
26. H. Zhang and J. Hou, Maintaining sensing coverage and connectivity in large sensor networks, Ad Hoc and Sensor Wireless Networks (AHSWN), 2005.
27. H. Zongheng Zhou and S.G. Das, Connected k-coverage problem in sensor networks. Computer Communications and Networks, ICCCN 2004. Proceedings of the 13th International Conference on, 11-13 October, 2004, pp. 373-378.