Positive virtual based geographic routing for wireless sensor networks
Ali Ghaffari, Saeid Bahanfar · IEICE Electronics Express · 2012
Communications void in geographical routing protocols effects the performance of these routing protocols. A geographic routing protocol usually uses a greedy forwarding scheme with a recovery policy to solve the void problem. In this paper, we propose a new positive virtual position (PViP) scheme, for solving the local minimum problem. Positive virtual position of nodes are considered when selecting the next optimum neighbor node. Positive virtual position of a node is the average positions of node's itself position and all single-hop neighbor nodes that are closer to the sink than itself. Simulation results demonstrate that proposed scheme increases the success delivery rate compared with other schemes without any significant overhead.