On the partially overlapped channel assignment on wireless mesh network backbone: A game theoretic approach

Pedro B.F. Duarte, Zubair Md. Fadlullah, Athanasios V. Vasilakos, Nei Kato

Research output: Contribution to journalArticlepeer-review

149 Citations (Scopus)

Abstract

The Wireless Mesh Network (WMN) has already been recognized as a promising broadband access network technology from both academic and commercial perspective. In order to improve the performance of WMNs, extensive research efforts have been dedicated towards finding means to increase the number of simultaneous transmissions in the network while avoiding signal interference among radios. In case of WMNs based on IEEE 802.11 b/g standards, most recent research works have relied upon the usage of orthogonal channels for solving the Channel Assignment (CA) problem. In this paper, we explore the possibility of exploiting Partially Overlapped Channels (POCs) by introducing a novel game theoretic distributed CA algorithm. Our proposed algorithm outperforms both the conventional orthogonal channel approach and the recent heuristic CA algorithms using POC. The proposed algorithm is shown to achieve near-optimal performance in the average case. In addition, the upper bound Price of Anarchy for Multi-Radio Multi-Channel (MRMC) networks is derived to evaluate the effectiveness of the proposed approach.

Original languageEnglish
Article number6117767
Pages (from-to)119-127
Number of pages9
JournalIEEE Journal on Selected Areas in Communications
Volume30
Issue number1
DOIs
Publication statusPublished - 2012 Jan 1

Keywords

  • Wireless Mesh Networks (WMNs)
  • channel assignment problem
  • game theory
  • partially overlapped channels
  • potential games

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'On the partially overlapped channel assignment on wireless mesh network backbone: A game theoretic approach'. Together they form a unique fingerprint.

Cite this