Journal
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS
Volume 8, Issue 12, Pages 5796-5800Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TWC.2009.12.090220
Keywords
Greedy routing; void problem; unit ball graph; three-dimensional; wireless sensor network
Funding
- Aiming for the Top University
- Elite Research Center Development Plan
- MediaTek research center at National Chiao Tung University
- Universal Scientific Industrial (USI) Co., Taiwan
- [NSC 96-2221-E-009-016]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available