Three-Dimensional Greedy Anti-Void Routing for Wireless Sensor Networks

檔案

日期

2009-12-01

類型

期刊名稱

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS

卷期與頁次

第 8 卷第 12 期,頁 5796–5800

ISSN

1536-1276

語言

英文

摘要

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.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Liu, W.-J., & Feng, K.-T. (2009). Three-Dimensional Greedy Anti-Void Routing for Wireless Sensor Networks. IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 8(12), 5796–5800. https://doi.org/10.1109/TWC.2009.12.090220

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/6377