Journal of Information Processing Systems

Korea Information Processing Society (한국정보처리학회)
권호 표지
DOI QR코드

DOI QR Code

Topological Boundary Detection in Wireless Sensor Networks

  • Published : 2009.09.30
Download PDF
⟨ Previous Next ⟩

Abstract

The awareness of boundaries in wireless sensor networks has many benefits. The identification of boundaries is especially challenging since typical wireless sensor networks consist of low-capability nodes that are unaware of their geographic location. In this paper, we propose a simple, efficient algorithm to detect nodes that are near the boundary of the sensor field as well as near the boundaries of holes. Our algorithm relies purely on the connectivity information of the underlying communication graph and does not require any information on the location of nodes. We introduce the 2-neighbor graph concept, and then make use of it to identify nodes near boundaries. The results of our experiment show that our algorithm carries out the task of topological boundary detection correctly and efficiently.

Keywords

References

  1. P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, “Routing with Guaranteed Delivery in Ad-hoc Wireless Networks”, Wireless Networks, 2001, 7 (6): 609-616 https://doi.org/10.1023/A:1012319418150
  2. J. Bruck, J. Gao, and A. Jiang, “Map: Medial-Axis- Based Geometric Routing in Sensor Networks”, Proc. MobiCom, 2005 https://doi.org/10.1145/1080829.1080839
  3. D. De Couto and R. Morris, “Location Proxies and Intermediate Node Forwarding for Practical Geographic Forwarding”, MIT-LCS-TR824, 2001
  4. Q. Fang, J. Gao, and L. Guibas, “Locating and Bypassing Routing Holes in Sensor Networks”, In 23rd Conf. of the IEEE Communications Society (INFOCOM), 2004
  5. S.P. Fekete, Michael Kaufmann, A.Kroller, Katharina Lehmann, “A New Approach for Boundary Recognition in Geometric Sensor Networks”, Proceedings of the 17th Canadian Conference on Computational Geometry, 2005, pp. 82-85
  6. S. P. Fekete, A. Kraoller, D. P. Sterer, S. Fischer, and C. Buschmann, “Neighborhood-Based Topology Recognition in Sensor Networks”, In ALGOSENSORS, 2004
  7. Stefan Funke, “Topological Hole Detection in Wireless Sensor Networks and its Applications”, DIALM, 2005 https://doi.org/10.1145/1080810.1080819
  8. Stefan Funke, Nikola Milosavljevi´c, “Guaranteed- Delivery Geographic Routing under Uncertain Node Locations”, In INFOCOM, 2007 https://doi.org/10.1109/INFCOM.2007.148
  9. L. Guibas Q. Fang, J. Gao, V. de Silva, and L. Zhang, “Glider: Gradient Landmark-Based Distributed Routing for Sensor Networks”, In INFOCOM, 2005 https://doi.org/10.1109/INFCOM.2005.1497904
  10. T. Moscibroda and R. Wattenhofer, “Maximal Independent Sets in Radio Networks”, The 24th ACM Symp. on the Principles of Distributed Computing (PODC), 2005 https://doi.org/10.1145/1073814.1073842
  11. A. Rao, S. Ratnasamy, C. Papadimitriou, S. Shenker, and I. Stoica, “Geographic Routing without Location Information”, In Proc. MobiCom, 2003 https://doi.org/10.1145/938985.938996
  12. E. Royer and C. Toh, “A Review of Current Routing Protocols for Ad-hoc Mobile Wireless Networks”, In IEEE Personal Communications, 1999 https://doi.org/10.1109/98.760423
  13. H. Attiya, J. Welch, “Distributed Computing: Fundamentals, Simulations and Advanced Topics, Second Edition”, John Wiley & Sons, 2004

Cited by

  1. Location-Free Detection of Network Boundaries vol.11, pp.4, 2015, https://doi.org/10.1145/2795232
  2. Perimeter detection in wireless sensor networks vol.60, pp.2, 2012, https://doi.org/10.1016/j.robot.2011.10.004
  3. Adaptive anomaly control for alleviating the exclusive channel occupation in wireless networks vol.26, pp.6, 2013, https://doi.org/10.1002/dac.2357