Title: Three-Dimensional Greedy Anti-Void Routing for Wireless Sensor Networks
Authors: Liu, Wen-Jiunn
Feng, Kai-Ten
電信工程研究所
Institute of Communications Engineering
Keywords: Greedy routing;void problem;unit ball graph;three-dimensional;wireless sensor network
Issue Date: 1-Dec-2009
Abstract: Due to the low-cost design nature of greedy-based routing algorithms, it is considered feasible to adopt this type of schemes within the three-dimensional (3D) wireless sensor networks. In the existing research work, the unreachability problem (i.e., the so-called void problem) resulting from the greedy routing algorithms has not been fully resolved, especially under the 3D environment. In this letter, a three-dimensional greedy anti-void routing (3D-GAR) protocol is proposed to solve the 3D void problem by exploiting the boundary finding technique for the unit ball graph (UBG). The proposed 3D rolling-ball UBG boundary traversal (3D-RUT) scheme is employed to guarantee the delivery of packets from the source to the destination node. The correctness proofs, protocol implementation, and performance evaluation for the proposed 3D-GAR protocol are also given in this letter.
URI: http://dx.doi.org/10.1109/TWC.2009.12.090220
http://hdl.handle.net/11536/6377
ISSN: 1536-1276
DOI: 10.1109/TWC.2009.12.090220
Journal: IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS
Volume: 8
Issue: 12
Begin Page: 5796
End Page: 5800
Appears in Collections:Articles


Files in This Item:

  1. 000272732600015.pdf