Greedy anti-void routing protocol for wireless sensor networks

檔案

日期

2007-07-01

類型

期刊名稱

IEEE COMMUNICATIONS LETTERS

卷期與頁次

第 11 卷第 7 期,頁 562–564

ISSN

1089-7798

語言

英文

摘要

The unreachability problem (i.e. the so-called void problem) which exists in the greedy routing algorithms has been studied for the wireless sensor networks. However, most of the current research work can not fully resolve the problem (i.e. to ensure the delivery of packets) within their formulation. In this letter, the Greedy Anti-void Routing (GAR) protocol is proposed, which solves the void problem by exploiting the boundary finding technique for the Unit Disk Graph (UDG). The proposed Rolling-ball UDG boundary Traversal (RUT) is employed to completely guarantee the delivery of packets from the source to the destination node. The proofs of correctness for the proposed GAR protocol are also given at the end of this letter.

所屬典藏

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

引用此條目

Liu, W.-J., & Feng, K.-T. (2007). Greedy anti-void routing protocol for wireless sensor networks. IEEE COMMUNICATIONS LETTERS, 11(7), 562–564. https://doi.org/10.1109/LCOMM.2007.070311

BibTeX RIS

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

分享

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