Skip to main content
SpringerLink
Log in

Locating and Bypassing Holes in Sensor Networks

  • Published:
Mobile Networks and Applications Aims and scope Submit manuscript

Abstract

In real sensor network deployments, spatial distributions of sensors are usually far from being uniform. Such networks often contain regions without enough sensor nodes, which we call holes. In this paper, we show that holes are important topological features that need to be studied. In routing, holes are communication voids that cause greedy forwarding to fail. Holes can also be defined to denote regions of interest, such as the “hot spots” created by traffic congestion or sensor power shortage. In this paper, we define holes to be the regions enclosed by a polygonal cycle which contains all the nodes where local minima can appear. We also propose simple and distributed algorithms, the Tent rule and BoundHole, to identify and build routes around holes. We show that the boundaries of holes marked using BoundHole can be used in many applications such as geographic routing, path migration, information storage mechanisms and identification of regions of interest.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. P. Bose, P. Morin, I. Stojmenovic and J, Urrutia, Routing with guaranteed delivery in ad hoc wireless networks. In Proceedings of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DialM ’99) (1999) pp. 48–55.

  2. S. Bruck, J. Gao and A. Jiang, Localization and routing in sensor networks by local angle information. In Proc. 6th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc’05), (May 2005)

  3. D. Ganesan and D. Estrin, DIMENSIONS: Why do we need a new data handling architecture for sensor networks? In Proceedings of the ACM Workshop on Hot Topics in Networks (ACM Princeton, NJ, USA, Oct. 2002), pp. 143–148.

  4. J. Gao, L.J. Guibas, J. Hershberger, L. Zhang and A. Zhu, Geometric spanner for routing in mobile networks. In Proc. 2nd ACM Symposium in Mobile Ad Hoc Networking and Computing, (2001) pp. 45–55.

  5. B. Karp and H. Kung, GPSR: Greedy perimeter stateless routing for wireless networks. In Proceedings of the 6th Annual International Conference on Mobile Computing and Networking (MobiCom), (2000) pp. 243–254.

  6. E. Karnakis, H. Singh and J. Urrutia, Compass routing on geometric networks. In Proc. 11th Canadian Conference on Computational Gemetry (Vancouver, Aug. 1999) pp. 51–54.

  7. F. Kuhn, R. Wattenhofer and A. Zollinger, Asymptotically optimal geometric mobile ad-hoc routing. In Proceedings of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, (2002) pp. 24–33.

  8. F. Kuhn, R. Wattenhofer and A. Zollinger, Worst-case optimal and average-case efficient geometric ad-hoc routing. In Proc. 4th ACM Symposium on Mobile Ad Hoc Networking and Computing, (2003) pp. 267–278.

  9. J. Li, J. Jannotti, D.S.J.D. Couto, D. R. Karger and R. Morris, A scalable location service for geographic ad-hoc rorting. In Proceedings of the 6th Annual International Conference on Mobile Computing and Networking (MobiCom), (2003) pp. 120–130.

  10. X. Li, G. Calinescu, P. Wan and Y. Wang, Localized delaunay triangulation with application in ad hoc wireless networks. IEEE Transaction on Parallel and Distributed System 14(10) (2003) 1035–1047.

    Google Scholar 

  11. J. Liebeherr, M. Nahas and W. Si, Application-layer multicasting with delaunay triangulation overlays, IEEE Journal on Selected Areas in Communications, 20(8) (2002) 1472–1488.

    Article  Google Scholar 

  12. M. Mauve, J. Widmer and H. Hartenstein, A survey on position-based routing in mobile ad hoc networks. IEEE Network Magazine, 15(6) (2001) 30–39.

    Article  Google Scholar 

  13. F.P. Preparata and M.I. Shamos, Computational Geometry: An Introduction (Springer-Verlag, New York, NY, 1985).

    Google Scholar 

  14. S. Ratnasamy, B. Karp, L. Yin, F. Yu, D. Estrin, R. Govindan and S. Shenker, GHT: A geographic hash table for data-centric storage in sensornets. In Proceedings of the 1st ACM International Workshop on Wireless Sensor Networks and Applications (WSNA) (2002) pp. 78–87.

  15. J. Urrutia, Routing with guaranteed delivery in geometric and wirelss networks. In I. Stojmenovic, editor, Handbook of Wireless Networks and Mobile Computing (John Wiley and Sons, 2002) pp. 393–406.

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, Stanford University, Stanford, CA, 94305, USA

    Qing Fang

  2. Center for the Mathematics of Information, California Institute of Technology, Pasadena, CA, 91125, USA

    Jie Gao

  3. Department of Computer Science, Stanford University, Stanford, CA, 94305, USA

    Leonidas J. Guibas

Authors
  1. Qing Fang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jie Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Leonidas J. Guibas
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Qing Fang.

Additional information

Qing Fang is currently a Ph.D. student in Department of Electrical Engineering at Stanford University. Her research interests include algorithm, architecture and protocol design for wireless sensor networks and ad hoc communication. She received her MS in Electrical Engineering from University of Texas at Austin in Fall 1995 and worked in the industry as a system software engineer before joining Stanford in 1999.

Jie Gao received her Ph.D. degree from department of computer science at Stanford University in 2004 and her B.S. degree from University of Science and Technology of China in 1999. She joined State University of New York, Stony Brook as an assistant professor in Fall 2005. Her research interests are algorithms design and analysis, ad hoc communication and sensor networks and computational geometry.

Leonidas J. Guibas heads the Geometric Computation group in the Computer Science Department of Stanford University. He is a member of the Computer Graphics and Artifical Intelligence Laboratories and works on algorithms for sensing, modeling, reasoning, rendering, and acting on the physical world. Professor Guibas’ interests span computational geometry, geometric modeling, computer graphics, computer vision, sensor networks, robotics, and discrete algorithms–-all areas in which he has published and lectured extensively.

Leonidas Guibas obtained his Ph.D. from Stanford in 1976, under the supervision of Donald Knuth. His main subsequent employers were Xerox PARC, MIT, and DEC/SRC. He has been at Stanford since 1984 as Professor of Computer Science. At Stanford he has developed new courses in algorithms and data structures, geometric modeling, geometric algorithms, and sensor networks. Professor Guibas is an ACM Fellow.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fang, Q., Gao, J. & Guibas, L.J. Locating and Bypassing Holes in Sensor Networks. Mobile Netw Appl 11, 187–200 (2006). https://doi.org/10.1007/s11036-006-4471-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11036-006-4471-y

Keywords

Search

Navigation