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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageEnglish
Title of host publicationIEEE GLOBECOM 2007 - 2007 IEEE Global Telecommunications Conference, Proceedings
Pages4818-4822
Number of pages5
DOIs
StatePublished - 1 Dec 2007
Event50th Annual IEEE Global Telecommunications Conference, GLOBECOM 2007 - Washington, DC, United States
Duration: 26 Nov 200730 Nov 2007

Publication series

NameGLOBECOM - IEEE Global Telecommunications Conference

Conference

Conference50th Annual IEEE Global Telecommunications Conference, GLOBECOM 2007
CountryUnited States
CityWashington, DC
Period26/11/0730/11/07

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