Optimal routing, link scheduling and power control in multihop wireless networks
Optimal routing, link scheduling and power control in multihop wireless networks
复制标题
DOI：
10.1109/infcom.2003.1208720
复制
发表时间：
2003-07
期刊：
影响因子：
--
通讯作者：
R. Cruz;A. Santhanam
中科院分区：
文献类型：
--
作者：
R. Cruz;A. Santhanam
本文研究了宽带无线多跳网络中支持高数据速率的联合路由、链路调度和功率控制问题。我们首先解决在给定的关于每条链路的最小平均数据速率的约束下，以及每个节点的峰值传输功率约束下，找到最小化无线多跳网络中的总平均传输功率的最优链路调度和功率控制策略的问题。对多址信号干扰进行了显式建模。我们使用对偶方法，作为寻找最优策略的副产品，我们发现最小总平均功率相对于每条链路的平均数据速率的敏感度。由于最小总平均功率是所需最小平均数据速率的凸函数，因此可以使用将链路权重设置为链路敏感度的最短路径算法来指导搜索全局最优路由。我们给出了几个简单的例子，表明我们的算法可以找到支持数据速率的策略，这是传统方法不可能实现的。此外，我们发现最优分配不一定在最小能量路径上路由流量。
In this paper, we study the problem of joint routing, link scheduling and power control to support high data rates for broadband wireless multihop networks. We first address the problem of finding an optimal link scheduling and power control policy that minimizes the total average transmission power in the wireless multihop network, subject to given constraints regarding the minimum average data rate per link, as well as peak transmission power constraints per node. Multiaccess signal interference is explicitly modeled. We use a duality approach whereby, as a byproduct of finding the optimal policy, we find the sensitivity of the minimal total average power with respect to the average data rate for each link. Since the minimal total average power is a convex function of the required minimum average data rates, shortest path algorithms with the link weights set to the link sensitivities can be used to guide the search for a globally optimum routing. We present a few simple examples that show our algorithm can find policies that support data rates that are not possible with conventional approaches. Moreover, we find that optimum allocations do not necessarily route traffic over minimum energy paths.