On the number of channels required for interference-free wireless mesh networks

It appears your Web browser is not configured to display PDF files. Download adobe Acrobat or click here to download the PDF file.

Click here to download the PDF file.


  • Chaudhry, Aizaz
  • Chinneck, John W
  • Hafez, Roshdy HM


Thursday, May 21, 2015


We study the problem of achieving maximum network throughput with fairness among the flows at the nodes in a wireless mesh network, given their location and the number of their half-duplex radio interfaces.
Our goal is to find the minimum number of non-overlapping frequency channels required to achieve interference-free communication. We use our existing Select x for less than x topology control algorithm (TCA)
to build the connectivity graph (CG), which enhances spatial channel reuse to help minimize the number of channels required. We show that the TCA-based CG approach requires fewer channels than the classical
approach of building the CG based on the maximum power. We use multi-path routing to achieve the maximum network throughput and show that it provides better network throughput than the classical
minimum power-based shortest path routing. We also develop an effective heuristic method to determine the minimum number of channels required for interference-free channel assignment.

Keywords: Channel assignment; Fairness; Interference-free; Maximum throughput; Multi-radio multi-channel; Wireless mesh networks


EURASIP Journal on Wireless Communications and Networking

Faculty Name: 

Faculty of Engineering and Design

Department Name: 

Department of Electrical and Computer Engineering

Items in CURVE are protected by copyright, with all rights reserved, unless otherwise indicated. They are made available with permission from the author(s).