Barrier coverage with wireless sensors

Proceedings of the Annual International Conference on Mobile Computing and Networking, MOBICOM

Volumn , Issue , 2005, Pages 284-298

  Kumar, Santosh ^a   Lai, Ten H ^a   Arora, Anish ^a  

^a Ohio State University   (United States)

Author keywords

Barrier coverage; Coverage; Critical conditions; Localized algorithms; Network topology; Random geometric graphs; Wireless sensor networks

Indexed keywords

BARRIER COVERAGE; CRITICAL CONDITIONS; LOCALIZED ALGORITHMS; NETWORK TOPOLOGY; RANDOM GEOMETRIC GRAPHS; WIRELESS SENSOR NETWORKS;

ALGORITHMS; ELECTRIC NETWORK TOPOLOGY; GRAPH THEORY; PROBLEM SOLVING; SENSORS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 32144431768     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1080829.1080859     Document Type: Conference Paper

References (25)

1. Extreme scale wireless sensor networking. Technical report, http://www.cse.ohio-state.edu/exscal, 2004.
2. N. Alon and J. H. Spencer. The Probabilistic Method. John Wiley & Sons, 2000.
3. A. Arora and et al. Line in the sand: A wireless sensor network for target detection, classification, and tracking. Computer Networks, 46(5):605-634, 2004.
4. K. Boroczky. Finite Packing and Covering. Cambridge University Press, 2004.
5. H. S. M. Coxeter. Introduction to Geometry. New York, Wiley, 1969.
6. D. W. Gage. Command control for many-robot systems. In AUVS-92, 1992.
7. C. Gui and R Mohapatra. Power conservation and quality of surveillance in target tracking sensor networks. In International Conference on Mobile Computing and Networking (ACM MobiCom), pages 129-143, Philadelphia, PA, 2004.
8. P. Hall. Introduction to the Theory of Coverage Processes. John Wiley & Sons, 1988.
9. C. Huang and Y. Tseng. The coverage problem in a wireless sensor network. In ACM International Workshop on Wireless Sensor Networks and Applications (WSNA), pages 115-121, San Diego, CA, 2003.
10. S. Hynes. Multi-agent simulations (mas) for assessing massive sensor coverage and deployment. Technical report, Master's Thesis, Naval Postgraduate School, 2003.
11. S. Kumar and A. Arora. Echelon topology for node deployment. Technical report, ExScal Note Series: ExScal-OSU-EN00-2004-01-30, The Ohio State University, 2004.
12. S. Kumar, T. H. Lai, and J. Balogh. On k-coverage in a mostly sleeping sensor network. In International Conference on Mobile Computing and Networking (ACM MobiCom), pages 144-158, Philadelphia, PA, 2004.
13. R. R Langlands, C. Pichet, R Pouliot, and Y. Saint-Aubin. On the universality of crossing probabilities in two-domensional percolation. Journal of Statistical Physics, 67(3/4):553-574, 1992.
14. B. Liu and D. Towsley. On the coverage and detectability of large-scale wireless sensor networks. In Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks, 2003.
15. S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M. B. Srivastava. Coverage problems in wireless ad-hoc sensor networks. In IEEE INFOCOM, 2001.
16. S. Meguerdichian, F. Koushanfar, G. Qu, and M. Potkonjak. Exposure in wireless ad-hoc sensor networks. In International Conference on Mobile Computing and Networking (ACM MobiCom), pages 139-150, Rome, Italy, 2001.
17. B. Mohar and N. Robertson. Disjoint essential cycles. Journal of Combinatorial Theory, 68 (2).-324-349, 1996.
18. B. Mohar and C. Thomassen. Graphs on Surfaces. Johns Hopkins University Press, 2001.
19. D. Peleg. Distributed Computing: A Loaclity-Sensitive Approach. Society for Industrial and Applied Mathematics (SIAM), 2000.
20. S. M. Ross. Introduction to Probability Models. Academic Press, 2000.
21. A. Schrijver. Combinatorial Optimization. Springer, 2003.
22. G. Veltri, Q. Huang, G. Qu, and M. Potkonjak. Minimum and maximal exposure path algorithms for wireless embedded sensor networks. In ACM Conference on Ebmedded Networked Sensor Systems (SenSys), 2003.
23. X. Wang, G. Xing, Y. Zhang, C. Lu, R. Pless, and C. Gill. Integrated coverage and connectivity configuration in wireless sensor networks. In ACM Conference on Ebmedded Networked Sensor Systems (SenSys), pages 28-39, Los Angeles, CA, 2003.
24. D. B. West. Introduction to Graph Theory. Prentice Hall, 2001.
25. H. Zhang and J. Hou. On deriving the upper bound of α-lifetime for large sensor networks. In International Symposium on Mobile Ad Hoc Networking and Computing (ACM MobiHoc), pages 121-132, Tokyo, Japan, 2004.