K-connectivity in shadowing wireless multi-hop networks
In this paper, we study the network performance of a wireless multi-hop network in terms of the successful link probability and k-connectivity probability by taking into account shadowing. We provide the closed-form analytic results of the successful link probability, and henceforth k-connectivity,...
Saved in:
| Main Authors: | , |
|---|---|
| 其他作者: | |
| 格式: | Conference or Workshop Item |
| 語言: | English |
| 出版: |
2011
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/94351 http://hdl.handle.net/10220/7147 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Nanyang Technological University |
| 語言: | English |
| 總結: | In this paper, we study the network performance of a wireless multi-hop network in terms of the successful link probability and k-connectivity probability by taking into account shadowing. We provide the closed-form analytic results of the successful link probability, and henceforth k-connectivity, in the context of shadowing multi-hop networks. Given a certain number of nodes spatially distributed according to a Poisson point process, we examine the critical density to keep the probability that a node is k-connected close to 1. The impacts of the shadowing on the k-connectivity are illustrated and discussed. The results can be practically used for the design of a wireless multi-hop network. |
|---|