Optimisation Problems Based on the Maximal Breach Path Measure for Wireless Sensor Network Coverage

  • Anirvan DuttaGupta
  • Arijit Bishnu
  • Indranil Sengupta
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4317)


Coverage is a central issue in the design of wireless sensor networks. There are many measures for coverage, based on what aspect of surveillance quality we wish to address. Designing a network that achieves desired standards in terms of the measure chosen is a non-trivial problem. In this paper we take the Maximal Breach Path measure and formulate the sensor-network design problem as a geometric optimisation problem. We present improved polynomial time algorithms for computing the aforesaid measure for a given sensor network. Also, as a first step toward solving the optimisation problem posed in this paper, we present a geometric transformation on a given configuration of sensors that brings the maximal breach to a “local optimal” – in the sense that the resulting breach is the best we can get keeping the topology of the starting configuration intact.


Sensor Network Sensor Node Wireless Sensor Network Voronoi Diagram Binary Search 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Megerian, S., Koushanfar, F., Potkonjak, M., Srivastava, M.B.: Worst and Best-Case Coverage in Sensor Networks. IEEE Transactions on Mobile Computing 4(1), 84–92 (2005)CrossRefGoogle Scholar
  2. 2.
    Meguerdichian, S., Koushanfar, F., Potkonjak, M., Srivastava, M.B.: Coverage Problems in Wireless Ad-hoc Sensor Networks. In: Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies, IEEE INFOCOM 2001 (April 2001)Google Scholar
  3. 3.
    Li, X.-Y., Wan, P.-J., Frieder, O.: Coverage in Wireless Ad-hoc oc Sensor Networks. IEEE Transactions on Computers 52(6), 53–763 (2003)Google Scholar
  4. 4.
    Kumar, S., Lai, T.H., Arora, A.: Barrier Coverage with Wireless Sensors. In: Proceedings of the 11th annual international conference on Mobile computing and networking, MobiCom 2005 (August 2005)Google Scholar
  5. 5.
    Huang, C.-F., Tseng, Y.-C.: The Coverage Problem in Wireless Sensor Networks. In: Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications (September 2003)Google Scholar
  6. 6.
    de Berg, M., Van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry Algorithms and Applications. Springer, Heidelberg (1997)MATHGoogle Scholar
  7. 7.
    Aurenhammer, F.: Voronoi Diagrams - A Survey of a Fundamental Geometric Data Structure. ACM Computing Surveys 23(3) (September 1991)Google Scholar
  8. 8.
    Mehlhorn, K., Näher, S.: The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, Cambridge (1999)Google Scholar
  9. 9.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)MATHGoogle Scholar
  10. 10.
    Melissen, H.: Packing and Covering with Circles, Ph.D. thesis, University of Utrecht (1997)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Anirvan DuttaGupta
    • 1
  • Arijit Bishnu
    • 1
  • Indranil Sengupta
    • 1
  1. 1.Department of Computer Science and EngineeringIndian Institute of TechnologyKharagpurIndia

Personalised recommendations