On multiple point coverage in wireless sensor networks

2nd IEEE International Conference on Mobile Ad-hoc and Sensor Systems, MASS 2005

Volumn 2005, Issue , 2005, Pages 757-764

  Yang, Shuhui ^a   Dai, Fei ^b   Cardei, Mihaela ^a   Wu, Jie ^a  

^a Florida Atlantic Univ   (United States)

^b North Dakota State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR PROGRAMMING ALGORITHM; MULTIPLE POINT COVERAGE; WIRELESS DEVICES; WIRELESS SENSOR NETWORKS;

ALGORITHMS; APPROXIMATION THEORY; LINEAR PROGRAMMING; SENSOR DATA FUSION; SENSORS; WIRELESS TELECOMMUNICATION SYSTEMS;

COMPUTER NETWORKS;

EID: 33750344786     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MAHSS.2005.1542868     Document Type: Conference Paper

References (26)

1. Z. Abrams, A. Goel, and S. Plotkin. Set k-cover algorithms for energy efficient monitoring in wireless sensor networks. In Proc. of Information Processing in Sensor Networks, 2004.
2. K. Alzoubi, X.-Y. Li, Y. Wang, P.-J. Wan, and O. Frieder. Geometric spanners for wireless ad hoc networks. IEEE Trans. of Parallel and Distributed Systems, 14(5):408-421, 2003.
3. M. Cardei, J. Wu, M. Lu, and M. O. Pervaiz. Maximum network lifetime in wireless sensor networks with adjustable sensing ranges. In Proc. of IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob), 2005.
4. J. Carle and D. Simplot-Ryl. Energy efficient area monitoring by sensor networks. IEEE Computer, 37(2):40-46, 2004.
5. F. Dai and J. Wu. An extended localized algorithm for connected dominating set formation in ad hoc wireless networks. IEEE Transactions on Parallel and Distributed Systems, 15(10):908-920, 2004.
6. F. Dai and J. Wu. On constructing k-connected k-dominating set in wireless networks. In Proc. of IPDPS, Apr. 2005.
7. D. Z. Du. Design and analysis of approximation algorithms. Lecture Notes, Department of Computer Science, University of Minnesota.
8. F. Harary and T. Haynes. Double domination in graphs. ARS Combinatoria, 55:201-213, 2000.
9. D.S. Hochbaum. Approximation Algorithms for NP-hard Problems. PWS Publishing. Boston, MA, 1997.
10. Z. Jiang, R. Kline, J. Wu, and F. Dai. Energy efficient k-coverage in wireless sensor networks with connected dominating set. Submitted for publication, 2005.
11. H. Koubaa and E. Fleury. On the performance of double domination in ad hoc networks. In Proc. of IFIP Medhoc, 2000.
12. C. R. Lin and M. Gerla. Adaptive clustering for mobile wireless networks. IEEE Journal on Selected Areas in Communications, 15(7):1265-1275, 1996.
13. T. Moscibroda and R. Wattenhofer. Efficient computation of maximal independent sets in unstructured multi-hop radio networks. In Proc. of the IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS), 2004.
14. J. Shaikh, J. Solano, I. Stojmenovic, and J. Wu. New metrics for dominating set based energy efficient activity scheduling in ad hoc networks. In Proc. of the International Workshop on Wireless Local Networks (WLN), 2003.
15. S. Slijepcevic and M. Potkonjak. Power efficient organization of wireless sensor networks. In Proc. of ICC, 2001.
16. I. Stojmenovic, M. Seddigh, and J. Zunic. Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks. IEEE Transactions on Parallel and Distributed Systems, 13(1):14-25, 2002.
17. D. Tian and N. Georganas. Connectivity maintenance and coverage preservation in wireless sensor networks. Ad Hoc Networks Journal, accepted to appear.
18. D. Tian and N. Georganas. A coverage-preserving node scheduling scheme for large wireless sensor networks. In Proc. of the 1st ACM Workshop on Wireless Sensor Networks and Applications, 2002.
19. X. Wang, G. Xing, Y. Zhang, C. Lu, R. Pless, and C. Gill. Integrated coverage and connectivity configuration in wireless sensor networks. In Proc. of the 1st ACM Conference on Embedded Networked Sensor Systems, 2003.
20. J. Wu and H. Li. On calculating connected dominating set for efficient routing in ad hoc wireless networks. In Proc. of the 3rd Int'l Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (Dial M), 1999.
21. J. Wu and W. Lou. Forward node set based broadcast in clustered mobile ad hoc networks. Wireless Communications and Mobile Computing, 3(2):141-154, 2003.
22. Y. Xu and J. Heidemann. Geography-informed energy conservation for ad hoc routing. In Proc. of MOBICOM, 2003.
23. T. Yan, T. He, and J. Stankovic. Differentiated surveillance for sensor networks. In Proc. of the First International Conference on Embedded Networked Sensor Systems (SenSys), 2003.
24. F. Ye, G. Zhong, J. Cheng, S. Lu, and L. Zhang. PEAS: A robust energy conserving protocol for long-lived sensor networks. In Proc. of ICDCS, 2003.
25. 3l) potential reduction algorithm for linear programming. Mathematical Programming, 50, 1991.
26. H. Zhang and J. Hou. Maintaining sensing coverage and connectivity in large sensor networks. Technical Report UIUC. UIUCDCS-R-2003-2351, 2003.