Connectivity of Wireless Multihop Networks in a Shadow Fading Environment

Connectivity of Wireless Multihop Networks in a Shadow Fading Environment
复制标题

DOI:
10.1145/940991.940998
复制
发表时间:
2003-09
期刊:
影响因子:
3
通讯作者:
C. Bettstetter;C. Hartmann
C. Bettstetter;C. Hartmann
中科院分区:
计算机科学4区
文献类型:
--
作者:
C. Bettstetter;C. Hartmann

文献摘要

被引文献

相似文献

本文分析了对数正态阴影衰落环境中多跳无线电网络的连接性。假设节点具有相同的传输能力,并且根据同质泊松过程随机分布,我们给出了在给定大小的有界区域上获得几乎肯定连接的子网络所必需的最小节点密度的严格下界。我们推导出这个界限的显式表达式,在各种场景中计算它,并通过模拟验证它的紧密性。数值结果可用于无线传感器和自组织网络的实际设计和仿真。此外,它们还深入了解衰落如何影响多跳网络的拓扑。这解释了为什么高衰落方差有助于网络建立连接。
This article analyzes the connectivity of multihop radio networks in a log-normal shadow fading environment. Assuming the nodes have equal transmission capabilities and are randomly distributed according to a homogeneous Poisson process, we give a tight lower bound for the minimum node density that is necessary to obtain an almost surely connected subnetwork on a bounded area of given size. We derive an explicit expression for this bound, compute it in a variety of scenarios, and verify its tightness by simulation. The numerical results can be used for the practical design and simulation of wireless sensor and ad hoc networks. In addition, they give insight into how fading affects the topology of multihop networks. It is explained why a high fading variance helps the network to become connected.