Locating and bypassing routing holes in sensor networks

By Qing Fang, Jie Gao, Leonidas J. Guibas. IEEE INFOCOM 2004, 2004

542 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/cf8fa2819fa37c7c6506571ffe50230a056c8e41

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Yunhao Liu
2. Mo Li
3. Zheng Yang
4. Lirong Jian
5. Xiaoping Wang
6. Alberto Gotta
7. Prashant Pillai
8. Stefano Chessa

In Electrical and Electronic Engineering

1. Yunhao Liu
2. Zheng Yang
3. Alberto Gotta
4. Prashant Pillai
5. Stefano Chessa
6. Salil S. Kanhere
7. Yim-Fun Hu
8. Mo Li

Citations in the corpus

• Virtual-Coordinate-Based Delivery-Guaranteed Routing Protocol in Wireless Sensor Networks (2008, background): “A wireless sensor network consists of several sensors, each of which has the ability to collect, process, and store environmental information as well as to communicate with others via inter-sensor communication.”
• Location, Localization, and Localizability (2010, background): “The knowledge of boundary facilitates the design of routing, load balancing, and network management([23]).”
• Boundary recognition in sensor networks by topological methods (2006, background): “The definition of holes in [6] is intimately associated with geographical forwarding such that a packet can only get stuck at a node on hole boundaries.”
• Wireless sensor networks: A survey on the state of the art and the 802.15.4 and ZigBee standards (2007, background): “[33] observe that face traversal and similar recovery procedures require calculating and maintaining planar graph information at every node in the network which is clearly inefficient given that such information is rarely used and only needed in proximity of network holes.”
• Underground Structure Monitoring with Wireless Sensor Networks (2007, background): “[6] define stuck nodes and propose BOUNDHOLE to find the sensor holes utilizing the strong stuck nodes.”
• The holes problem in wireless sensor networks: a survey (2005, background): “in [44] defined stuck nodes as nodes in the topology where packets can possibly get stuck in greedy multi-hop forwarding due to local minimum and proposed TENT rule to test whether a node in a given topology is a stuck node.”