Maximal breach in wireless sensor networks: Geometric characterization and algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4837 LNCS, Issue , 2008, Pages 126-137

  Duttagupta, Anirvan ^a   Bishnu, Arijit ^b   Sengupta, Indranil ^b  

^a Nucleodyne Systems Inc   (United States)

^b INDIAN INSTITUTE OF TECHNOLOGY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC ASPECTS; GEOMETRIC CHARACTERIZATION; LOWER BOUNDS; MAXIMAL BREACH; NP-HARD; OF SENSORS; OPTIMAL ALGORITHMS; OPTIMIZ ATION PROBLEMS; QUALITY OF SURVEILLANCE;

CONTROL THEORY; GEOMETRY; HYBRID SENSORS; LAW ENFORCEMENT; NUCLEAR PROPULSION; OPTIMIZATION; SENSOR NETWORKS; SENSORS; WIRELESS NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

WIRELESS SENSOR NETWORKS;

EID: 49949099156     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77871-4_12     Document Type: Conference Paper

References (14)

1. Megerian, S., Koushanfar, F., Potkonjak, M., Srivastava, M.B.: Worst and Best-Case Coverage in Sensor Networks. IEEE Trans. on Mobile Computing 4(1), 84-92 (2005)
2. Li, X.-Y., Wan, P.-J.: Coverage in Wireless Ad-hoc Sensor Networks. IEEE Trans. on Computers 52(6), 53-763 (2003)
3. Huang, C.-F., Tseng, Y.-C.: The Coverage Problem in Wireless Sensor Networks. In: Proc. of the 2nd ACM International Conference on Wireless Sensor Networks and Applications, ACM Press, New York (2003)
4. Urrutia, J.: Routing with guaranteed delivery in geometric and wireless networks. In: Hand-book of Wireless Networks and. Mobile Computing, pp. 393-406. John Wiley & Sons, Chichester (2002)
5. Pottie, G.J., Kaiser, W.J.: Wireless Integrated Network Sensors. Communications of the ACM 43, 51-58 (2000)
6. Borriello, G., Want, R.: Embedded Computation Meets the World Wide Web. Communications of the ACM 43 (May 2000)
7. Ye, W., Heidemann, J., Estrin, D.: An Energy Efficient MAC Protocol for Wireless Sensor Networks. In: Proc. of Infocom 2002, vol. 3, pp. 3-12. IEEE CS Press, Los Alamitos (2002)
8. DuttaGupta, A., Bishnu, A., Sengupta, I.: Optimisation Problems Based on the Maximal Breach Path Measure for Wireless Sensor Network Coverage. In: Madria, S.K., Claypool, K.T., Kannan, R., Uppuluri, P., Gore, M.M. (eds.) ICDCIT 2006. LNCS, vol. 4317, Springer, Heidelberg (2006)
9. de Berg, M., Van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry Algorithms and Applications. Springer, Heidelberg (1997)
10. Aurenhammer, F.: Voronoi Diagrams - A Survey of a Fundamental Geometric Data Structure. ACM Computing Surveys 23(3) (September 1991)
11. Fowler, R., Paterson, M., Tanimoto, S.: Optimal Packing and Covering in the Plane are NP-Complete. Information Processing Letters 12(3), 133-137 (1981)
12. Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. JACM 32, 130-136 (1985)
13. Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity, ch. 12. Prentice Hall, Englewood Cliffs (2001)
14. DuttaGupta, A., Bishnu, A., Sengupta, I.: Maximal Breach in Wireless Sensor Networks: Geometric Characterization and Algorithms. In: ALGOSENSORS 2007. Preproceedings, pp. 142-163 (2007) ISBN 978-83-7125-158-0