Select-and-Protest-Based Beaconless Georouting with Guaranteed Delivery in Wireless Sensor Networks

—Recently proposed beaconless georouting algorithms are fully reactive, with nodes forwarding packets without prior knowledge of their neighbors. However, existing approaches for recovery from local minima can either not guarantee delivery or they require the exchange of complete neighborhood information. We describe two general methods that enable completely reactive face routing with guaranteed delivery. The Beaconless Forwarder Planarization (BFP) scheme finds correct edges of a local planar subgraph at the forwarder node without hearing from all neighbors. Face routing then continues properly. Angular Relaying determines directly the next hop of a face traversal. Both schemes are based on the Select and Protest principle. Neighbors respond according to a delay function, if they do not violate the condition for a planar subgraph construction. Protest messages are used to remove falsely selected neighbors that are not in the planar subgraph. We show that a correct beaconless plana...

• Type: Conference
• Year: 2008
• Where: INFOCOM
• Authors: Hanna Kalosha, Amiya Nayak, Stefan Rührup, Ivan Stojmenovic
• Keywords: Communications, INFOCOM 2008, Local Planar Subgraph, Planar Subgraph, Planar Subgraph Construction