Browse > Article
http://dx.doi.org/10.3745/JIPS.2009.5.3.145

Topological Boundary Detection in Wireless Sensor Networks  

Dinh, Thanh Le (College of Technology, Vietnam National University)
Publication Information
Journal of Information Processing Systems / v.5, no.3, 2009 , pp. 145-150 More about this Journal
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
Wireless sensor network; Hole; Boundary detection; 2-neighbor graph;
Citations & Related Records
연도 인용수 순위
  • Reference
1 J. Bruck, J. Gao, and A. Jiang, “Map: Medial-Axis- Based Geometric Routing in Sensor Networks”, Proc. MobiCom, 2005   DOI
2 D. De Couto and R. Morris, “Location Proxies and Intermediate Node Forwarding for Practical Geographic Forwarding”, MIT-LCS-TR824, 2001
3 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
4 S. P. Fekete, A. Kraoller, D. P. Sterer, S. Fischer, and C. Buschmann, “Neighborhood-Based Topology Recognition in Sensor Networks”, In ALGOSENSORS, 2004
5 Stefan Funke, “Topological Hole Detection in Wireless Sensor Networks and its Applications”, DIALM, 2005   DOI
6 Stefan Funke, Nikola Milosavljevi´c, “Guaranteed- Delivery Geographic Routing under Uncertain Node Locations”, In INFOCOM, 2007   DOI
7 L. Guibas Q. Fang, J. Gao, V. de Silva, and L. Zhang, “Glider: Gradient Landmark-Based Distributed Routing for Sensor Networks”, In INFOCOM, 2005   DOI
8 A. Rao, S. Ratnasamy, C. Papadimitriou, S. Shenker, and I. Stoica, “Geographic Routing without Location Information”, In Proc. MobiCom, 2003   DOI
9 E. Royer and C. Toh, “A Review of Current Routing Protocols for Ad-hoc Mobile Wireless Networks”, In IEEE Personal Communications, 1999   DOI   ScienceOn
10 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   DOI   ScienceOn
11 H. Attiya, J. Welch, “Distributed Computing: Fundamentals, Simulations and Advanced Topics, Second Edition”, John Wiley & Sons, 2004
12 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
13 T. Moscibroda and R. Wattenhofer, “Maximal Independent Sets in Radio Networks”, The 24th ACM Symp. on the Principles of Distributed Computing (PODC), 2005   DOI