An Efficient Bypassing Void Routing Protocol Based on Virtual Coordinate for WSNs

Author

Dejing Zhang ; Enqing Dong

Author_Institution

Dept. of Mech., Electr. & Inf. Eng., Shandong Univ., Weihai, China

Volume

19

Issue

4

fYear

2015

fDate

Apr-15

Firstpage

653

Lastpage

656

Abstract

Inspired by the structure composed of edge nodes without routing voids, a routing protocol based on virtual coordinates is proposed in this letter. The basic idea of the proposed protocol is to transform a random structure composed of edge nodes into a regular one by mapping edge nodes to virtual nodes on a virtual circle. The virtual circle can prevent greedy forwarding from failing by proposed strategies, so that control overhead and the average length of routing paths can be reduced. Simulations show the proposed protocol has higher delivery ratio, shorter path length, and less control packet overhead and energy consumption.

Keywords

greedy algorithms; routing protocols; telecommunication network reliability; telecommunication power management; wireless sensor networks; WSN virtual coordinate; efficient bypassing void routing protocol; greedy forwarding failure prevention; higher delivery ratio; less control packet overhead; less energy consumption; mapping edge nodes; shorter path length; wireless sensor network virtual circle; Delays; Greedy algorithms; Image edge detection; Relays; Routing; Routing protocols; Wireless sensor networks; Wireless sensor networks; geographic routing protocol; routing void; virtual coordinate; wireless sensor networks;

fLanguage

English

Journal_Title

Communications Letters, IEEE

Publisher

ieee

ISSN

1089-7798

Type

jour

DOI

10.1109/LCOMM.2015.2403837

Filename

7042322