Optimal relay station placement in broadband wireless access networks

Bin Lin, Pin Han Ho, Liang Liang Xie, Xuemin Sherman Shen, J. Tapolcai

Research output: Contribution to journalArticle

75 Citations (Scopus)

Abstract

To satisfy the stringent requirement of capacity enhancement in wireless networks, cooperative relaying is envisioned as one of the most effective solutions. In this paper, we study the capacity enhancement problem by way of Relay Stations (RSs) placement to achieve an efficient and scalable design in broadband wireless access networks. To fully exploit the performance benefits of cooperative relaying, we develop an optimization framework to maximize the capacity as well as to meet the minimal traffic demand by each Subscriber Station (SS). In specific, the problem of joint RS placement and bandwidth allocation is formulated into a mixed-integer nonlinear program. We reformulate it into an integer linear program which is solvable by CPLEX. To avoid exponential computation time, a heuristic algorithm is proposed to efficiently solve the formulated problem. Numerical analysis is conducted through case studies to demonstrate the performance gain of cooperative relaying and the comparison between the proposed heuristic algorithm against the optimal solutions.

Original languageEnglish
Article number5089328
Pages (from-to)259-269
Number of pages11
JournalIEEE Transactions on Mobile Computing
Volume9
Issue number2
DOIs
Publication statusPublished - Feb 2010

Fingerprint

Heuristic algorithms
Frequency allocation
Numerical analysis
Wireless networks

Keywords

  • Cooperative relaying
  • Decode-and-forward
  • Placement problem

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications
  • Software

Cite this

Optimal relay station placement in broadband wireless access networks. / Lin, Bin; Ho, Pin Han; Xie, Liang Liang; Shen, Xuemin Sherman; Tapolcai, J.

In: IEEE Transactions on Mobile Computing, Vol. 9, No. 2, 5089328, 02.2010, p. 259-269.

Research output: Contribution to journalArticle

Lin, Bin ; Ho, Pin Han ; Xie, Liang Liang ; Shen, Xuemin Sherman ; Tapolcai, J. / Optimal relay station placement in broadband wireless access networks. In: IEEE Transactions on Mobile Computing. 2010 ; Vol. 9, No. 2. pp. 259-269.
@article{cb48cdd403404df1af4e887b763eefb9,
title = "Optimal relay station placement in broadband wireless access networks",
abstract = "To satisfy the stringent requirement of capacity enhancement in wireless networks, cooperative relaying is envisioned as one of the most effective solutions. In this paper, we study the capacity enhancement problem by way of Relay Stations (RSs) placement to achieve an efficient and scalable design in broadband wireless access networks. To fully exploit the performance benefits of cooperative relaying, we develop an optimization framework to maximize the capacity as well as to meet the minimal traffic demand by each Subscriber Station (SS). In specific, the problem of joint RS placement and bandwidth allocation is formulated into a mixed-integer nonlinear program. We reformulate it into an integer linear program which is solvable by CPLEX. To avoid exponential computation time, a heuristic algorithm is proposed to efficiently solve the formulated problem. Numerical analysis is conducted through case studies to demonstrate the performance gain of cooperative relaying and the comparison between the proposed heuristic algorithm against the optimal solutions.",
keywords = "Cooperative relaying, Decode-and-forward, Placement problem",
author = "Bin Lin and Ho, {Pin Han} and Xie, {Liang Liang} and Shen, {Xuemin Sherman} and J. Tapolcai",
year = "2010",
month = "2",
doi = "10.1109/TMC.2009.114",
language = "English",
volume = "9",
pages = "259--269",
journal = "IEEE Transactions on Mobile Computing",
issn = "1536-1233",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

TY - JOUR

T1 - Optimal relay station placement in broadband wireless access networks

AU - Lin, Bin

AU - Ho, Pin Han

AU - Xie, Liang Liang

AU - Shen, Xuemin Sherman

AU - Tapolcai, J.

PY - 2010/2

Y1 - 2010/2

N2 - To satisfy the stringent requirement of capacity enhancement in wireless networks, cooperative relaying is envisioned as one of the most effective solutions. In this paper, we study the capacity enhancement problem by way of Relay Stations (RSs) placement to achieve an efficient and scalable design in broadband wireless access networks. To fully exploit the performance benefits of cooperative relaying, we develop an optimization framework to maximize the capacity as well as to meet the minimal traffic demand by each Subscriber Station (SS). In specific, the problem of joint RS placement and bandwidth allocation is formulated into a mixed-integer nonlinear program. We reformulate it into an integer linear program which is solvable by CPLEX. To avoid exponential computation time, a heuristic algorithm is proposed to efficiently solve the formulated problem. Numerical analysis is conducted through case studies to demonstrate the performance gain of cooperative relaying and the comparison between the proposed heuristic algorithm against the optimal solutions.

AB - To satisfy the stringent requirement of capacity enhancement in wireless networks, cooperative relaying is envisioned as one of the most effective solutions. In this paper, we study the capacity enhancement problem by way of Relay Stations (RSs) placement to achieve an efficient and scalable design in broadband wireless access networks. To fully exploit the performance benefits of cooperative relaying, we develop an optimization framework to maximize the capacity as well as to meet the minimal traffic demand by each Subscriber Station (SS). In specific, the problem of joint RS placement and bandwidth allocation is formulated into a mixed-integer nonlinear program. We reformulate it into an integer linear program which is solvable by CPLEX. To avoid exponential computation time, a heuristic algorithm is proposed to efficiently solve the formulated problem. Numerical analysis is conducted through case studies to demonstrate the performance gain of cooperative relaying and the comparison between the proposed heuristic algorithm against the optimal solutions.

KW - Cooperative relaying

KW - Decode-and-forward

KW - Placement problem

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

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

U2 - 10.1109/TMC.2009.114

DO - 10.1109/TMC.2009.114

M3 - Article

VL - 9

SP - 259

EP - 269

JO - IEEE Transactions on Mobile Computing

JF - IEEE Transactions on Mobile Computing

SN - 1536-1233

IS - 2

M1 - 5089328

ER -