Topological Boundary Detection in Wireless Sensor Networks
1
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
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.
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.
참고문헌 (13)
- P. Bose, "Routing with Guaranteed Delivery in Ad-hoc Wireless Networks", Wireless Networks, 7(6), pp.609~616 (2001)
- J. Bruck, "Map:Medial-Axis-Based Geometric Routing in Sensor Networks", Proc. MobiCom (2005)
- Location Proxies and Intermediate Node Forwarding for Practical Geographic Forwarding, "D. De Couto", ~, pp.MIT-LCS-TR824 (2001)
- Q. Fang, "Locating and Bypassing Routing Holes in Sensor Networks", 23rd Conf.of the IEEE Communications Society(INFOCOM) (2004)
- S.P. Fekete, "A New Approach for Boundary Recognition in Geometric Sensor Networks", Proceedings of the 17th Canadian Conference on Computational Geometry, pp.82~85 (2005)
- S. P. Fekete, "Neighborhood-Based Topology Recognition in Sensor Networks", ALGOSENSORS (2004)
- Stefan Funke, "Topological Hole Detection in Wireless Sensor Networks and its Applications", DIALM (2005)
- Stefan Funke, "Guaranteed-Delivery Geographic Routing under Uncertain Node Locations", INFOCOM (2007)
- L. Guibas, "Glider:Gradient Landmark-Based Distributed Routing for Sensor Networks", INFOCOM (2005)
- T. Moscibroda, "Maximal Independent Sets in Radio Networks", The 24th ACM Symp.on the Principles of Distributed Computing(PODC) (2005)
- A. Rao, "Geographic Routing without Location Information", Proc.MobiCom (2003)
- E. Royer, "A Review of Current Routing Protocols for Ad-hoc Mobile Wireless Networks", IEEE Personal Communications (1999)
- H. Attiya, "Distributed Computing:Fundamentals,Simulations and Advanced Topics,Second Edition" (2004), John Wiley & Sons