Finding barriers with minimum number of sensors in wireless sensor networks

IEEE International Conference on Communications

Volumn , Issue , 2010, Pages

  He, Jun ^a   Shi, Hongchi ^a  

^a Texas State University San Marcos   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLETE SOLUTIONS; COVERAGE PROBLEM; DISTRIBUTED SOLUTIONS; INTRUDER DETECTION; NEW APPROACHES; OPEN PROBLEMS; PROTECTED AREAS; TIME COMPLEXITY;

ALGORITHMS; ENVIRONMENTAL PROTECTION; SECURITY OF DATA; SENSOR NETWORKS; SENSOR NODES; TELECOMMUNICATION EQUIPMENT;

WIRELESS SENSOR NETWORKS;

EID: 77955343572     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICC.2010.5501987     Document Type: Conference Paper

References (8)

1. S. Kumar, T. H. Lai, and A. Arora, "Barrier coverage with wireless sensors," in MobiCom '05: Proceedings of the 11th annual international conference on Mobile computing and networking. New York, NY, USA: ACM, 2005, pp. 284-298.
2. D. W. Gage, "Command control for many-robot systems," in Unmanned Systems Magazine, 1992, pp. 22-24.
3. A. Chen, S. Kumar, and T. H. Lai, "Designing localized algorithms for barrier coverage," in MobiCom '07: Proceedings of the 13th annual ACM international conference on Mobile computing and networking. New York, NY, USA: ACM, 2007, pp. 63-74.
4. B. Liu, O. Dousse, J. Wang, and A. Saipulla, "Strong barrier coverage of wireless sensor networks," in MobiHoc '08: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing. New York, NY, USA: ACM, 2008, pp. 411-420.
5. J. Edmonds and R. M. Karp, "Theoretical improvements in algorithmic efficiency for network flow problems," J. ACM, vol. 19, no. 2, pp. 248-264, 1972.
6. D. P. Bertsekas, "Distributed relaxation methods for linear network flow problems," in Decision and Control, 1986 25th IEEE Conference on, vol. 25, 1986, pp. 2101-2106.
7. A. Goldberg and R. Tarjan, "Solving minimum-cost flow problems by successive approximation," in STOC '87: Proceedings of the nineteenth annual ACM symposium on Theory of computing. New York, NY, USA: ACM, 1987, pp. 7-18.
8. A. V. Goldberg, "Efficient graph algorithms for sequential and parallel computers," Cambridge, MA, USA, Tech. Rep., 1987.