Distributed coverage in wireless ad hoc and sensor networks by topological graph approaches

Proceedings - International Conference on Distributed Computing Systems

Volumn , Issue , 2010, Pages 106-115

  Dong, Dezun ^a,b   Liu, Yunhao ^b,d   Liu, Kebin ^b,c   Liao, Xiangke ^a  

^a NATIONAL UNIVERSITY OF DEFENSE TECHNOLOGY   (China)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^c SHANGHAI JIAO TONG UNIVERSITY   (China)

^d TSINGHUA NATIONAL LABORATORY FOR INFORMATION SCIENCE AND TECHNOLOGY   (China)

Author keywords

Connectivity; Coverage; Cycle partition; Distributed; Topological graph; Wireless ad hoc and sensor networks

Indexed keywords

CONNECTIVITY; COVERAGE; CYCLE PARTITION; DISTRIBUTED; TOPOLOGICAL GRAPHS; WIRELESS AD HOC AND SENSOR NETWORKS;

AD HOC NETWORKS; ALGEBRA; GRAPH THEORY; INFORMATION USE; SCHEDULING; SENSOR NETWORKS;

WIRELESS SENSOR NETWORKS;

EID: 77955896734     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCS.2010.9     Document Type: Conference Paper

References (24)

1. S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M. Srivastava, "Coverage problems in wireless ad hoc sensor networks," in Proc. of IEEE INFOCOM, 2001.
2. 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 ACM SenSys, 2003.
3. X. Bai, S. Kumar, D. Xuan, Z. Yun, and T.-H. Lai, "Deploying wireless sensors to achieve both coverage and connectivity," in Proc. of ACM MobiHoc, 2006.
4. G. Kasbekar, Y. Bejerano, and S. Sarkar, "Lifetime and coverage guarantees through distributed coordinate-free sensor activation," in Proc. of ACM MobiCom, 2009.
5. C. Zhang, Y. Zhang, and Y. Fang, "Detecting coverage boundary nodes in wireless sensor networks," in Proc. of IEEE ICNSC, 2006.
6. O. Younis, M. Krunz, and S. Ramasubramanian, "Coverage without location information," in Proc. of IEEE ICNP, 2007.
7. Y. Bejerano, "Simple and efficient k-coverage verification without location information," in Proc. of IEEE INFOCOM, 2008.
8. R. Ghrist and A. Muhammad, "Coverage and hole-detection in sensor networks via homology," in Proc. of ACM/IEEE IPSN, 2005.
9. V. de Silva and R. Ghrist, "Coordinate-free coverage in sensor networks with controlled boundaries via homology," International Journal of Robotics Research, vol. 25, no. 12, pp. 1205-1222, 2006.
10. A. Tahbaz-Salehi and A. Jadbabaie, "Distributed coverage verification in sensor networks without location information," in Proc. of IEEE CDC, 2008.
11. M. Cardei and J. Wu, Handbook of Sensor Networks: Compact Wireless and Wired Sensing Systems. CRC Press, 2005, ch. 19, Coverage in Wireless Sensor Networks.
12. L. Wang and Y. Xiao, "A survey of energy-efficient scheduling mechanisms in sensor networks," ACM/Springer Mobile Networks and Applications, vol. 11, no. 5, pp. 723-740, 2006.
13. D. Dong, Y. Liu, and X. Liao, "Fine-grained boundary recognition in wireless ad hoc and sensor networks by topological methods," in Proc. of ACM MobiHoc, 2009.
14. Y. Wang, J. Gao, and J. S. Mitchell, "Boundary recognition in sensor networks by topological methods," in Proc. of ACM MobiCom, 2006.
15. C. Gui and P. Mohapatra, "Power conservation and quality of surveillance in target tracking sensor networks," in Proc. of ACM MobiCom, 2004.
16. Q. Cao, T. F. Abdelzaher, T. He, and J. A. Stankovic, "Towards optimal sleep scheduling in sensor networks for rare-event detection," in Proc. of ACM/IEEE IPSN, 2005.
17. O. Dousse, C. Tavoularis, and P. Thiran, "Delay of intrusion detection in wireless sensor networks," in Proc. of ACM MobiHoc, 2006.
18. P. Balister, Z. Zheng, S. Kumar, and P. Sinha, "Trap Coverage: Allowing Coverage Holes of Bounded Diameter in Wireless Sensor Networks," in Proc. of IEEE INFOCOM, 2009.
19. S. Ren, Q. Li, H. Wang, X. Chen, and X. Zhang, "Design and analysis of sensing scheduling algorithms under partial coverage for object detection in sensor networks," IEEE Transactions on Parallel and Distributed Systems, vol. 18, no. 3, p. 334, 2007.
20. F. Kuhn, T. Moscibroda, and R. Wattenhofer, "Unit disk graph approximation," in Proc. of ACM DIALM-POMC, 2004.
21. P. Vismara, "Union of all the minimum cycle bases of a graph," Electronic Journal of Combinatorics, vol. 4, no. 1, pp. 73-87, 1997.
22. J. Horton, "A polynomial-time algorithm to find the shortest cycle basis of a graph," SIAM Journal on Computing, vol. 16, no. 2, pp. 358-366, 1987.
23. D. Chickering, D. Geiger, and D. Heckerman, "On finding a cycle basis with a shortest maximal cycle," Information Processing Letters, vol. 54, no. 1, pp. 55-58, 1995.
24. L. Mo, Y. He, Y. Liu, J. Zhao, S. Tang, X. Li, and G. Dai, "Canopy closure estimates with greenorbs: Sustainable sensing in the forest," in Proc. of ACM SenSys, 2009.