Link scheduling with power control for throughput enhancement in multihop wireless networks
Link scheduling with power control for throughput enhancement in multihop wireless networks
复制标题
具有功率控制的链路调度，可增强多跳无线网络的吞吐量
DOI：
10.1109/qshine.2005.29
复制
发表时间：
2005
期刊：
影响因子：
--
通讯作者：
Weiyi Zhang
中科院分区：
文献类型：
--
作者：
Jian Tang;G. Xue;C. Chandler;Weiyi Zhang
吞吐量是多跳无线网络的重要性能考虑因素。本文主要研究联合链路调度和功率控制问题，重点研究网络吞吐量最大化问题。我们提出了带功率控制的最大吞吐量链路调度（MATH-SPC）问题，并提出了一个混合整数线性规划（MILP）公式来提供最优解。然而，简单地最大化吞吐量会导致所有链路之间带宽分配的严重偏差。为了同时提高吞吐量和公平性，我们定义了一个新的参数——需求满足因子（DSF）来表征带宽分配的公平性。提出了带功率控制的最大吞吐量公平链路调度（MATA-SPC）问题，并给出了该问题的MILP公式。我们还提出了一种有效的多项式时间启发式算法，即串行LP舍入启发式算法（SLPR）。我们的数值结果表明，通过求解我们的MATA-SPC公式或使用我们的启发式算法，带宽可以在所有链路/流之间公平分配，但代价是网络吞吐量的轻微降低
Throughput is an important performance consideration for multihop wireless networks. In this paper, we study the joint link scheduling and power control problem, focusing on maximizing the network throughput. We formulate the maximum throughput link scheduling with power control (MATH-SPC) problem, and present a mixed integer linear programming (MILP) formulation to provide optimal solutions. However, simply maximizing the throughput leads to a severe bias on bandwidth allocation among all links. In order to enhance both throughput and fairness, we define a new parameter, the demand satisfaction factor (DSF), to characterize the fairness of bandwidth allocation. We formulate the maximum throughput fair link scheduling with power control (MATA-SPC) problem and present an MILP formulation for this problem. We also present an effective polynomial time heuristic algorithm, namely, the serial LP rounding (SLPR) heuristic. Our numerical results show that bandwidth can be fairly allocated among all links/flows by solving our MATA-SPC formulation or using our heuristic algorithm at the cost of a minor reduction of network throughput