Asymptotic Critical Transmission Radii for Greedy Forward Routing in Wireless Ad Hoc Networks
檔案
- 000266069700032.pdf (339.9 KB, Adobe PDF)
日期
2009-05-01
系所
期刊名稱
IEEE TRANSACTIONS ON COMMUNICATIONS
卷期與頁次
第 57 卷第 5 期,頁 1433–1443
ISSN
0090-6778
語言
英文
摘要
In wireless ad hoe networks, greedy forward routing is a localized geographic routing algorithm in which one node discards a packet if none of its neighbors is closer to the destination of the packet than itself, or otherwise forwards the packet to the neighbor closest to the destination. If all nodes have the same transmission radii, the critical transmission radius for greedy forward routing is the smallest transmission radius which ensures packets can be delivered by greedy forward routing through any source-destination pair. In this paper, we study asymptotic critical transmission radii of randomly deployed wireless ad hoc networks. Assume network nodes are represented by a Poisson point process of density n over a unit-area convex compact region whose boundary curvature is bounded. We show that the ratio of critical transmission radii to root ln n/pi n is asymptotically almost surely equal to root 1/(2/3 - root 3/2 pi) approximate to 1.6.
所屬典藏
會議論文引用此條目
Wan, P.-J., Yi, C.-W., Wang, L., Yao, F., & Jia, X. (2009). Asymptotic Critical Transmission Radii for Greedy Forward Routing in Wireless Ad Hoc Networks. IEEE TRANSACTIONS ON COMMUNICATIONS, 57(5), 1433–1443. https://doi.org/10.1109/TCOMM.2009.05.070307
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/27643