arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0907.3616cs.NIcs.ITmath.IT
收藏

单小区密集Ad Hoc无线网络的最优路由和功率控制

Optimal Routing and Power Control for a Single Cell, Dense, Ad Hoc Wireless Network

Venkatesh Ramaiyan, Anurag Kumar, Eitan Altman

摘要:

我们考虑一个密集的,ad hoc无线网络,局限于一个小区域。无线网络作为单个小区来操作,即,一次只支持一个成功的传输。数据包通过多跳中继在源目的地对之间发送。我们假设节点自组织成一个多跳网络,使所有的跳跃长度为d米,其中d是一个设计参数。存在基于竞争的多址方案,并且假定每个节点总是具有要发送的数据,或者源自它,或者来自传输分组(饱和假设)。在这种情况下,我们试图最大限度地提高网络的传输容量的测量(以比特米每秒测量)在功率控制(在衰落环境中)和跳距d,受到平均功率约束。我们首先认为,对于一个密集的收集节点局限于一个小区域,单细胞操作是有效的单用户解码收发器。然后,密集的ad hoc无线网络(如上所述)作为一个单一的细胞,我们研究的跳长和功率控制,最大限度地提高了传输容量为一个给定的网络功率约束。

英文摘要:

We consider a dense, ad hoc wireless network, confined to a small region. The wireless network is operated as a single cell, i.e., only one successful transmission is supported at a time. Data packets are sent between sourcedestination pairs by multihop relaying. We assume that nodes self-organise into a multihop network such that all hops are of length d meters, where d is a design parameter. There is a contention based multiaccess scheme, and it is assumed that every node always has data to send, either originated from it or a transit packet (saturation assumption). In this scenario, we seek to maximize a measure of the transport capacity of the network (measured in bit-meters per second) over power controls (in a fading environment) and over the hop distance d, subject to an average power constraint. We first argue that for a dense collection of nodes confined to a small region, single cell operation is efficient for single user decoding transceivers. Then, operating the dense ad hoc wireless network (described above) as a single cell, we study the hop length and power control that maximizes the transport capacity for a given network power constraint.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑