TY - GEN
T1 - Link scheduling with power control for throughput enhancement in multihop wireless networks
AU - Jian, Tang
AU - Xue, Guoliang
AU - Chandler, Christopher
AU - Weiyi, Zhang
PY - 2005
Y1 - 2005
N2 - 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.
AB - 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.
KW - Cross-layer optimization
KW - Fairness
KW - Link scheduling
KW - Power control
KW - QoS
UR - http://www.scopus.com/inward/record.url?scp=33845414146&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33845414146&partnerID=8YFLogxK
U2 - 10.1109/QSHINE.2005.29
DO - 10.1109/QSHINE.2005.29
M3 - Conference contribution
AN - SCOPUS:33845414146
SN - 0769524230
SN - 9780769524238
T3 - Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks, Qshine 2005
BT - Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks, Qshine 2005
T2 - 2nd International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks, Qshine 2005
Y2 - 22 August 2005 through 23 August 2005
ER -