Link scheduling with power control for throughput enhancement in multihop wireless networks

Jian Tang, Guoliang Xue, Christopher Chandler, Weiyi Zhang

Research output: Contribution to journalArticle

86 Citations (Scopus)

Abstract

Joint scheduling and power control schemes have previously been proposed to reduce power dissipation in wireless ad hoc networks. However, instead of power consumption, throughput is a more important performance concern for some emerging multihop wireless networks, such as wireless mesh networks. This paper examines joint link scheduling and power control with the objective of throughput improvement. The MAximum THroughput link Scheduling with Power Control (MATH-SPC) problem is first formulated and then a mixed integer linear programming (MILP) formulation is presented to provide optimal solutions. However, simply maximizing the throughput may lead to a severe bias on bandwidth allocation among links. To achieve a good tradeoff between throughput and fairness, a new parameter called the demand satisfaction factor (DSF) to characterize the fairness of bandwidth allocation and formulate the MAximum Throughput fAir link Scheduling with Power Control (MATA-SPC) problem is defined. An MILP formulation and an effective polynomial-time heuristic algorithm, namely, the serial linear programming rounding (SLPR) heuristic, to solve the MATA-SPC problem are also presented. Numerical results show that bandwidth can be fairly allocated among all links/flows by solving the MILP formulation or by using the heuristic algorithm at the cost of a minor reduction of network throughput. In addition, extensions to end-to-end throughput and fairness and multiradio wireless multihop networks are discussed.

Original languageEnglish (US)
Pages (from-to)733-742
Number of pages10
JournalIEEE Transactions on Vehicular Technology
Volume55
Issue number3
DOIs
StatePublished - May 2006

Fingerprint

Multi-hop Wireless Networks
Power Control
Power control
Wireless networks
Throughput
Enhancement
Scheduling
Linear programming
Mixed Integer Linear Programming
Fairness
Control Problem
Bandwidth Allocation
Frequency allocation
Heuristic algorithms
Heuristic algorithm
Formulation
Wireless multi-hop Networks
Wireless Mesh Networks
Wireless mesh networks (WMN)
Wireless Ad Hoc Networks

Keywords

  • Cross-layer optimization
  • Fairness
  • Link scheduling
  • Power control
  • QoS
  • Throughput maximization

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

Link scheduling with power control for throughput enhancement in multihop wireless networks. / Tang, Jian; Xue, Guoliang; Chandler, Christopher; Zhang, Weiyi.

In: IEEE Transactions on Vehicular Technology, Vol. 55, No. 3, 05.2006, p. 733-742.

Research output: Contribution to journalArticle

@article{c5ae30ff873e48efa24088b80d4adad3,
title = "Link scheduling with power control for throughput enhancement in multihop wireless networks",
abstract = "Joint scheduling and power control schemes have previously been proposed to reduce power dissipation in wireless ad hoc networks. However, instead of power consumption, throughput is a more important performance concern for some emerging multihop wireless networks, such as wireless mesh networks. This paper examines joint link scheduling and power control with the objective of throughput improvement. The MAximum THroughput link Scheduling with Power Control (MATH-SPC) problem is first formulated and then a mixed integer linear programming (MILP) formulation is presented to provide optimal solutions. However, simply maximizing the throughput may lead to a severe bias on bandwidth allocation among links. To achieve a good tradeoff between throughput and fairness, a new parameter called the demand satisfaction factor (DSF) to characterize the fairness of bandwidth allocation and formulate the MAximum Throughput fAir link Scheduling with Power Control (MATA-SPC) problem is defined. An MILP formulation and an effective polynomial-time heuristic algorithm, namely, the serial linear programming rounding (SLPR) heuristic, to solve the MATA-SPC problem are also presented. Numerical results show that bandwidth can be fairly allocated among all links/flows by solving the MILP formulation or by using the heuristic algorithm at the cost of a minor reduction of network throughput. In addition, extensions to end-to-end throughput and fairness and multiradio wireless multihop networks are discussed.",
keywords = "Cross-layer optimization, Fairness, Link scheduling, Power control, QoS, Throughput maximization",
author = "Jian Tang and Guoliang Xue and Christopher Chandler and Weiyi Zhang",
year = "2006",
month = "5",
doi = "10.1109/TVT.2006.873836",
language = "English (US)",
volume = "55",
pages = "733--742",
journal = "IEEE Transactions on Vehicular Technology",
issn = "0018-9545",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

TY - JOUR

T1 - Link scheduling with power control for throughput enhancement in multihop wireless networks

AU - Tang, Jian

AU - Xue, Guoliang

AU - Chandler, Christopher

AU - Zhang, Weiyi

PY - 2006/5

Y1 - 2006/5

N2 - Joint scheduling and power control schemes have previously been proposed to reduce power dissipation in wireless ad hoc networks. However, instead of power consumption, throughput is a more important performance concern for some emerging multihop wireless networks, such as wireless mesh networks. This paper examines joint link scheduling and power control with the objective of throughput improvement. The MAximum THroughput link Scheduling with Power Control (MATH-SPC) problem is first formulated and then a mixed integer linear programming (MILP) formulation is presented to provide optimal solutions. However, simply maximizing the throughput may lead to a severe bias on bandwidth allocation among links. To achieve a good tradeoff between throughput and fairness, a new parameter called the demand satisfaction factor (DSF) to characterize the fairness of bandwidth allocation and formulate the MAximum Throughput fAir link Scheduling with Power Control (MATA-SPC) problem is defined. An MILP formulation and an effective polynomial-time heuristic algorithm, namely, the serial linear programming rounding (SLPR) heuristic, to solve the MATA-SPC problem are also presented. Numerical results show that bandwidth can be fairly allocated among all links/flows by solving the MILP formulation or by using the heuristic algorithm at the cost of a minor reduction of network throughput. In addition, extensions to end-to-end throughput and fairness and multiradio wireless multihop networks are discussed.

AB - Joint scheduling and power control schemes have previously been proposed to reduce power dissipation in wireless ad hoc networks. However, instead of power consumption, throughput is a more important performance concern for some emerging multihop wireless networks, such as wireless mesh networks. This paper examines joint link scheduling and power control with the objective of throughput improvement. The MAximum THroughput link Scheduling with Power Control (MATH-SPC) problem is first formulated and then a mixed integer linear programming (MILP) formulation is presented to provide optimal solutions. However, simply maximizing the throughput may lead to a severe bias on bandwidth allocation among links. To achieve a good tradeoff between throughput and fairness, a new parameter called the demand satisfaction factor (DSF) to characterize the fairness of bandwidth allocation and formulate the MAximum Throughput fAir link Scheduling with Power Control (MATA-SPC) problem is defined. An MILP formulation and an effective polynomial-time heuristic algorithm, namely, the serial linear programming rounding (SLPR) heuristic, to solve the MATA-SPC problem are also presented. Numerical results show that bandwidth can be fairly allocated among all links/flows by solving the MILP formulation or by using the heuristic algorithm at the cost of a minor reduction of network throughput. In addition, extensions to end-to-end throughput and fairness and multiradio wireless multihop networks are discussed.

KW - Cross-layer optimization

KW - Fairness

KW - Link scheduling

KW - Power control

KW - QoS

KW - Throughput maximization

UR - http://www.scopus.com/inward/record.url?scp=33744524614&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33744524614&partnerID=8YFLogxK

U2 - 10.1109/TVT.2006.873836

DO - 10.1109/TVT.2006.873836

M3 - Article

AN - SCOPUS:33744524614

VL - 55

SP - 733

EP - 742

JO - IEEE Transactions on Vehicular Technology

JF - IEEE Transactions on Vehicular Technology

SN - 0018-9545

IS - 3

ER -