Connectivity and Transmit-Energy Considerations Between Any Pair of Nodes in a Wireless Ad Hoc Network Subject to Fading
Connectivity and Transmit-Energy Considerations Between Any Pair of Nodes in a Wireless Ad Hoc Network Subject to Fading
复制标题
DOI：
10.1109/tvt.2007.905437
复制
发表时间：
2008-03
影响因子：
6.8
通讯作者：
S. Mukherjee;D. Avidor
中科院分区：
文献类型：
--
作者：
S. Mukherjee;D. Avidor
我们研究了一个ad hoc网络，其中节点的位置分布根据一个均匀的泊松过程强度λ。我们假设所有的节点都配备了一个相同的无线收发器能够令人满意地工作到一定的最大链路损耗。我们的链路模型取决于链路的长度和随机对数正态衰落。每个节点用作数据分组的源和目的地，并且还可以用作中继器，以在由网络路由器确定的多跳路由上传输分组。我们研究了网络的两个重要性质。第一个是连通性，即，给定节点的峰值发射功率，当最多允许t跳时，节点不能与距离D处的随机目的地节点通信的概率。我们提供了t = 1和t = 2时的精确解析结果和t > 2时的迭代下界。我们计算源和目的地之间距离为D的最小跳数路由的平均跳数。第二个属性与功耗有关-当节点由电池供电时，这是一个重要参数。当源节点和目的节点之间的距离为D，且只允许一跳或最多两跳时，推导出每个数据包所需的总传输能量的累积分布函数。我们以图形的方式展示了允许两个跳点而不是一个跳点的好处。
We investigate an ad hoc network where node locations are distributed according to a homogeneous Poisson process with intensity lambda. We assume that all the nodes are equipped with an identical wireless transceiver capable of operating satisfactorily up to a certain maximal link loss. Our link model depends on the length of the link and on random log-normal fading. Each node functions as a source and a destination of data packets and may also serve as a repeater to transport the packets over multihop routes, as determined by the network router. We study two important properties of the network. The first is connectivity, viz., given the peak transmit power of a node, the probability that a node cannot communicate with a random destination node at distance D when at most t hops are allowed. We provide the exact analytical results for t = 1 and t = 2 and an iterative lower bound for t > 2. We calculate the average number of hops of the minimum-hop-count route between a source and a destination at a distance D apart. The second property relates to power consumption - an important parameter when the nodes are battery operated. We derive the cumulative distribution function of the total transmit energy required per data packet when the distance between the source and the destination node is D, and only one or at most two hops, are allowed. We graphically show the benefit of allowing two hops over just one.