Improved Asymptotic Bounds on Critical Transmission Radius for Greedy Forward Routing in Wireless Ad Hoc Networks
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
137 | en_US |
dc.citation.spage |
131 | en_US |
dc.citation.woscount |
1 | en_US |
dc.contributor.author |
Wang, Lixin | en_US |
dc.contributor.author |
Yi, Chih Wei | en_US |
dc.contributor.author |
Yao, Frances | en_US |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
Department of Computer Science | en_US |
dc.date.accessioned |
2017-04-21T06:49:03Z | |
dc.date.available |
2017-04-21T06:49:03Z | |
dc.date.issued |
2008 | en_US |
dc.description.abstract |
Consider a random wireless ad hoc network represented by a Poisson point process over a unit-area disk with mean n. Let sigma(n) denote its critical transmission radius for greedy forward routing, and beta(0) = 1/(2/3 - root 3/2 pi) approximate to 1.6(2). It was recently proved that for any constant epsilon > 0, it is asymptotically almost sure that (1 - epsilon) root beta(0) 1n n/pi n <= sigma(n) <= (1 + epsilon) root beta(0) 1n n/pi n. In this paper, we obtain tighter asymptotic bounds on sigma(n). Specifically, we prove that for any constant c, the asymptotic probability of sigma(n) <= root beta(0) ln n+c/pi n is at least 1-(1/1/beta(0)-1/3-beta(0)/2)e(-c) and at most e(-beta 0/2e-c) Consequently, for any positive sequence (xi(n) : n >= 1) with xi(n) = o(ln n) and xi(n) -> proportional to, it is asymptotically almost sure that root beta(0) ln n-xi(n)/pi n <= sigma(n) <= root beta(0) ln n+xi(n)/pi n We also conjecture that for any constant c, the asymptotic probability of sigma(n) <= root beta(0) ln n+c/pi n is exactly exp (-(1/1/beta(0)-1/3 - beta(0)/2)e(-c)). | en_US |
dc.identifier.journal |
MOBIHOC'08: PROCEEDINGS OF THE NINTH ACM INTERNATIONAL SYMPOSIUM ON MOBILE AD HOC NETWORKING AND COMPUTING | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/135652 | |
dc.identifier.wosnumber |
WOS:000332843800014 | en_US |
dc.language.iso |
en_US | en_US |
dc.subject |
Wireless ad hoc networks | en_US |
dc.subject |
greedy forward routing | en_US |
dc.subject |
random deployment | en_US |
dc.title |
Improved Asymptotic Bounds on Critical Transmission Radius for Greedy Forward Routing in Wireless Ad Hoc Networks | en_US |
dc.type |
Proceedings Paper | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 會議論文
引用此條目
Wang, L., Yi, C. W., & Yao, F. (2008). Improved Asymptotic Bounds on Critical Transmission Radius for Greedy Forward Routing in Wireless Ad Hoc Networks. MOBIHOC'08: PROCEEDINGS OF THE NINTH ACM INTERNATIONAL SYMPOSIUM ON MOBILE AD HOC NETWORKING AND COMPUTING, 131–137. https://ir.lib.nycu.edu.tw/handle/11536/135652
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/135652