Performance study of optimal routing and channel assignment in wireless mesh networks

Ching-Ju Lin; Sung Han Lin; Cheng Fu Chou

doi:10.1109/GLOCOM.2007.914

Performance study of optimal routing and channel assignment in wireless mesh networks

Ching-Ju Lin^*, Sung Han Lin, Cheng Fu Chou

^*Corresponding author for this work

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

4 Scopus citations

Abstract

In multi-channel wireless mesh networks (WMNs), the routing and channel assignment can interdependently determine network capacity. However, Joint Routing and Channel assignment (JRC) is a challenging problem since it must satisfy the Radio Constraint, the Channel Constraint, and the Co-channel Interference Constraint. Recently, many heuristic or suboptimization algorithms have been proposed to address the JRC problem. The aim of this paper is to preform a comprehensive performance study to fairly compare the different approaches. To achieve this goal, a proper benchmark, a Mixed Integer Linear Programming (MILP) model that can optimally configure the routing and channel assignment to get maximum achievable network capacity, is provided in this work as well. The proposed MILP model can help system designers quantitatively evaluate existing heuristic methods and make a better decision by considering the tradeoff between the characteristics of various schemes according to the system requirements.

Original language	English
Title of host publication	IEEE GLOBECOM 2007 - 2007 IEEE Global Telecommunications Conference, Proceedings
Pages	4818-4822
Number of pages	5
DOIs	https://doi.org/10.1109/GLOCOM.2007.914
State	Published - 1 Dec 2007
Event	50th Annual IEEE Global Telecommunications Conference, GLOBECOM 2007 - Washington, DC, United States Duration: 26 Nov 2007 → 30 Nov 2007

Publication series

Name	GLOBECOM - IEEE Global Telecommunications Conference

Conference

Conference	50th Annual IEEE Global Telecommunications Conference, GLOBECOM 2007
Country	United States
City	Washington, DC
Period	26/11/07 → 30/11/07

Access to Document

10.1109/GLOCOM.2007.914

Link to publication in Scopus

Fingerprint Dive into the research topics of 'Performance study of optimal routing and channel assignment in wireless mesh networks'. Together they form a unique fingerprint.

Cite this

@inproceedings{a26a6ac9b13f4ce0bd5ee89ed44fa785,

title = "Performance study of optimal routing and channel assignment in wireless mesh networks",

abstract = "In multi-channel wireless mesh networks (WMNs), the routing and channel assignment can interdependently determine network capacity. However, Joint Routing and Channel assignment (JRC) is a challenging problem since it must satisfy the Radio Constraint, the Channel Constraint, and the Co-channel Interference Constraint. Recently, many heuristic or suboptimization algorithms have been proposed to address the JRC problem. The aim of this paper is to preform a comprehensive performance study to fairly compare the different approaches. To achieve this goal, a proper benchmark, a Mixed Integer Linear Programming (MILP) model that can optimally configure the routing and channel assignment to get maximum achievable network capacity, is provided in this work as well. The proposed MILP model can help system designers quantitatively evaluate existing heuristic methods and make a better decision by considering the tradeoff between the characteristics of various schemes according to the system requirements.",

author = "Ching-Ju Lin and Lin, {Sung Han} and Chou, {Cheng Fu}",

year = "2007",

month = dec,

day = "1",

doi = "10.1109/GLOCOM.2007.914",

language = "English",

isbn = "1424410436",

series = "GLOBECOM - IEEE Global Telecommunications Conference",

pages = "4818--4822",

booktitle = "IEEE GLOBECOM 2007 - 2007 IEEE Global Telecommunications Conference, Proceedings",

note = "null ; Conference date: 26-11-2007 Through 30-11-2007",

}

Lin, C-J, Lin, SH & Chou, CF 2007, Performance study of optimal routing and channel assignment in wireless mesh networks. in IEEE GLOBECOM 2007 - 2007 IEEE Global Telecommunications Conference, Proceedings., 4411824, GLOBECOM - IEEE Global Telecommunications Conference, pp. 4818-4822, 50th Annual IEEE Global Telecommunications Conference, GLOBECOM 2007, Washington, DC, United States, 26/11/07. https://doi.org/10.1109/GLOCOM.2007.914

Performance study of optimal routing and channel assignment in wireless mesh networks. / Lin, Ching-Ju; Lin, Sung Han; Chou, Cheng Fu.

IEEE GLOBECOM 2007 - 2007 IEEE Global Telecommunications Conference, Proceedings. 2007. p. 4818-4822 4411824 (GLOBECOM - IEEE Global Telecommunications Conference).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Performance study of optimal routing and channel assignment in wireless mesh networks

AU - Lin, Ching-Ju

AU - Lin, Sung Han

AU - Chou, Cheng Fu

PY - 2007/12/1

Y1 - 2007/12/1

N2 - In multi-channel wireless mesh networks (WMNs), the routing and channel assignment can interdependently determine network capacity. However, Joint Routing and Channel assignment (JRC) is a challenging problem since it must satisfy the Radio Constraint, the Channel Constraint, and the Co-channel Interference Constraint. Recently, many heuristic or suboptimization algorithms have been proposed to address the JRC problem. The aim of this paper is to preform a comprehensive performance study to fairly compare the different approaches. To achieve this goal, a proper benchmark, a Mixed Integer Linear Programming (MILP) model that can optimally configure the routing and channel assignment to get maximum achievable network capacity, is provided in this work as well. The proposed MILP model can help system designers quantitatively evaluate existing heuristic methods and make a better decision by considering the tradeoff between the characteristics of various schemes according to the system requirements.

AB - In multi-channel wireless mesh networks (WMNs), the routing and channel assignment can interdependently determine network capacity. However, Joint Routing and Channel assignment (JRC) is a challenging problem since it must satisfy the Radio Constraint, the Channel Constraint, and the Co-channel Interference Constraint. Recently, many heuristic or suboptimization algorithms have been proposed to address the JRC problem. The aim of this paper is to preform a comprehensive performance study to fairly compare the different approaches. To achieve this goal, a proper benchmark, a Mixed Integer Linear Programming (MILP) model that can optimally configure the routing and channel assignment to get maximum achievable network capacity, is provided in this work as well. The proposed MILP model can help system designers quantitatively evaluate existing heuristic methods and make a better decision by considering the tradeoff between the characteristics of various schemes according to the system requirements.

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

U2 - 10.1109/GLOCOM.2007.914

DO - 10.1109/GLOCOM.2007.914

M3 - Conference contribution

AN - SCOPUS:39349083168

SN - 1424410436

SN - 9781424410439

T3 - GLOBECOM - IEEE Global Telecommunications Conference

SP - 4818

EP - 4822

BT - IEEE GLOBECOM 2007 - 2007 IEEE Global Telecommunications Conference, Proceedings

Y2 - 26 November 2007 through 30 November 2007

ER -