A bypassing void routing combining of geographic and virtual coordinate information for WSN

Abstract

Greedy forwarding is efficient in geographic routing, however, it fails inevitably when routing voids are encountered due to the distribution of nodes in wireless sensor network. To solve the void problem, long path and high control packet overhead are usually involved. In this paper, a bypassing void routing protocol combining of geographic and virtual coordinate information is proposed. When routing void is encountered, edges nodes of routing void are assigned virtual coordinates located on a virtual circle and two different forwarding regions around void are established. By utilizing the virtual circle structure and two forwarding regions, greedy forwarding can work without failing. Simulation shows the proposed protocol has shorter path length, less control packet overhead and energy consumption.

GRACO: a geographic GReedy routing with an ACO based void handling technique

“…In geometric void handling techniques, the basic idea is the use of the geometric characteristics to identify void regions. This category includes void prevention solutions, such as the techniques proposed in [18,19,20,21,22,23,24], where holes are discovered in advance for the future use of routing to avoid holes. These solutions usually start by a network discovering phase to detect the boundary nodes and identify the voids and a forwarding mechanism that exclude nodes located on the voids borders from routing process.…”