Channel assignment, link scheduling, routing, and rate control for multi-channel wireless mesh networks with directional antennas

Hee Tae Roh, Jang-Won Lee

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

The wireless mesh network (WMN) has attracted significant interests as a broadband wireless network to provide ubiquitous wireless access for broadband services. Especially with incorporating multiple orthogonal channels and multiple directional antennas into the WMN, each node can communicate with its neighbor nodes simultaneously without interference between them. However, as we allow more freedom, we need a more sophisticated algorithm to fully utilize it and developing such an algorithm is not easy in general. In this paper, we study a joint channel assignment, link scheduling, routing, and rate control problem for the WMN with multiple orthogonal channels and multiple directional antennas. This problem is inherently hard to solve, since the problem is formulated as a mixed integer nonlinear problem (MINLP). However, despite of its inherent difficulty, we develop an algorithm to solve the problem by using the generalized Benders decomposition approach [2]. The simulation results show the proposed algorithm provides the optimal solution to maximize the network utility, which is defined as the sum of utilities of all sessions.

Original languageEnglish
Article number000123
Pages (from-to)884-891
Number of pages8
JournalJournal of Communications and Networks
Volume18
Issue number6
DOIs
Publication statusPublished - 2016 Dec 1

Fingerprint

Wireless mesh networks (WMN)
Scheduling
Antennas
Wireless networks
Decomposition

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Networks and Communications

Cite this

@article{c98cc10993f9401ab8b5517ffd21eb87,
title = "Channel assignment, link scheduling, routing, and rate control for multi-channel wireless mesh networks with directional antennas",
abstract = "The wireless mesh network (WMN) has attracted significant interests as a broadband wireless network to provide ubiquitous wireless access for broadband services. Especially with incorporating multiple orthogonal channels and multiple directional antennas into the WMN, each node can communicate with its neighbor nodes simultaneously without interference between them. However, as we allow more freedom, we need a more sophisticated algorithm to fully utilize it and developing such an algorithm is not easy in general. In this paper, we study a joint channel assignment, link scheduling, routing, and rate control problem for the WMN with multiple orthogonal channels and multiple directional antennas. This problem is inherently hard to solve, since the problem is formulated as a mixed integer nonlinear problem (MINLP). However, despite of its inherent difficulty, we develop an algorithm to solve the problem by using the generalized Benders decomposition approach [2]. The simulation results show the proposed algorithm provides the optimal solution to maximize the network utility, which is defined as the sum of utilities of all sessions.",
author = "Roh, {Hee Tae} and Jang-Won Lee",
year = "2016",
month = "12",
day = "1",
doi = "10.1109/JCN.2016.000123",
language = "English",
volume = "18",
pages = "884--891",
journal = "Journal of Communications and Networks",
issn = "1229-2370",
publisher = "Korean Institute of Communication Sciences",
number = "6",

}

Channel assignment, link scheduling, routing, and rate control for multi-channel wireless mesh networks with directional antennas. / Roh, Hee Tae; Lee, Jang-Won.

In: Journal of Communications and Networks, Vol. 18, No. 6, 000123, 01.12.2016, p. 884-891.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Channel assignment, link scheduling, routing, and rate control for multi-channel wireless mesh networks with directional antennas

AU - Roh, Hee Tae

AU - Lee, Jang-Won

PY - 2016/12/1

Y1 - 2016/12/1

N2 - The wireless mesh network (WMN) has attracted significant interests as a broadband wireless network to provide ubiquitous wireless access for broadband services. Especially with incorporating multiple orthogonal channels and multiple directional antennas into the WMN, each node can communicate with its neighbor nodes simultaneously without interference between them. However, as we allow more freedom, we need a more sophisticated algorithm to fully utilize it and developing such an algorithm is not easy in general. In this paper, we study a joint channel assignment, link scheduling, routing, and rate control problem for the WMN with multiple orthogonal channels and multiple directional antennas. This problem is inherently hard to solve, since the problem is formulated as a mixed integer nonlinear problem (MINLP). However, despite of its inherent difficulty, we develop an algorithm to solve the problem by using the generalized Benders decomposition approach [2]. The simulation results show the proposed algorithm provides the optimal solution to maximize the network utility, which is defined as the sum of utilities of all sessions.

AB - The wireless mesh network (WMN) has attracted significant interests as a broadband wireless network to provide ubiquitous wireless access for broadband services. Especially with incorporating multiple orthogonal channels and multiple directional antennas into the WMN, each node can communicate with its neighbor nodes simultaneously without interference between them. However, as we allow more freedom, we need a more sophisticated algorithm to fully utilize it and developing such an algorithm is not easy in general. In this paper, we study a joint channel assignment, link scheduling, routing, and rate control problem for the WMN with multiple orthogonal channels and multiple directional antennas. This problem is inherently hard to solve, since the problem is formulated as a mixed integer nonlinear problem (MINLP). However, despite of its inherent difficulty, we develop an algorithm to solve the problem by using the generalized Benders decomposition approach [2]. The simulation results show the proposed algorithm provides the optimal solution to maximize the network utility, which is defined as the sum of utilities of all sessions.

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

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

U2 - 10.1109/JCN.2016.000123

DO - 10.1109/JCN.2016.000123

M3 - Article

AN - SCOPUS:85010506958

VL - 18

SP - 884

EP - 891

JO - Journal of Communications and Networks

JF - Journal of Communications and Networks

SN - 1229-2370

IS - 6

M1 - 000123

ER -