Abstract
Coverage is a measure of the quality of surveillance offered by a given network of sensors over the field it protects. Geometric characterization of, and optimization problems pertaining to, a specific measure of coverage - maximal breach - form the subject matter of this paper. We prove lower bound results for maximal breach through its geometric characterization. We define a new measure called average maximal breach and design an optimal algorithm for it. We also show that a relaxed optimization problem for the proposed measure is NP-Hard.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Li, X.-Y., Wan, P.-J.: Coverage in Wireless Ad-hoc Sensor Networks. IEEE Trans. on Computers 52(6), 53–763 (2003)
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)
Urrutia, J.: Routing with guaranteed delivery in geometric and wireless networks. In: Handbook of Wireless Networks and Mobile Computing, pp. 393–406. John Wiley & Sons, Chichester (2002)
Pottie, G.J., Kaiser, W.J.: Wireless Integrated Network Sensors. Communications of the ACM 43, 51–58 (2000)
Borriello, G., Want, R.: Embedded Computation Meets the World Wide Web. Communications of the ACMÂ 43 (May 2000)
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)
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)
de Berg, M., Van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry Algorithms and Applications. Springer, Heidelberg (1997)
Aurenhammer, F.: Voronoi Diagrams - A Survey of a Fundamental Geometric Data Structure. ACM Computing Surveys 23(3) (September 1991)
Fowler, R., Paterson, M., Tanimoto, S.: Optimal Packing and Covering in the Plane are NP-Complete. Information Processing Letters 12(3), 133–137 (1981)
Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. JACM 32, 130–136 (1985)
Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity, ch. 12. Prentice Hall, Englewood Cliffs (2001)
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
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Duttagupta, A., Bishnu, A., Sengupta, I. (2008). Maximal Breach in Wireless Sensor Networks: Geometric Characterization and Algorithms. In: Kutyłowski, M., Cichoń, J., Kubiak, P. (eds) Algorithmic Aspects of Wireless Sensor Networks. ALGOSENSORS 2007. Lecture Notes in Computer Science, vol 4837. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77871-4_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-77871-4_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77870-7
Online ISBN: 978-3-540-77871-4
eBook Packages: Computer ScienceComputer Science (R0)