An interference-aware channel assignment scheme for wireless mesh networks

Arunabha Sen, Sudheendra Murthy, Samrat Ganguly, Sudeept Bhatnagar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

26 Citations (Scopus)

Abstract

Multichannel communication in a Wireless Mesh Network with routers having multiple radio interfaces significantly enhances the network capacity. Efficient channel assignment and routing is critical for realization of optimal throughput in such networks. In this paper, we investigate the problem of finding the largest number of links that can be activated simultaneously in a Wireless Mesh Network subject to interference, radio and connectivity constraints. Our goal is to activate all such links and we present an interference aware channel assignment algorithm that realizes this goal. We show that the Link Interference Graph created by utilizing a frequently used interference model gives rise to a special class of graphs, known as Overlapping Double-Disk (ODD) graphs. We prove that the Maximum Independent Set computation problem is NP-complete for this special class of graphs. We provide a Polynomial Time Approximation Scheme (PTAS) for computation of the Maximum Independent Set of an ODD graph. We use this PTAS to develop a channel assignment algorithm for a multiradio multichannel Wireless Mesh Network. We evaluate the performance of our channel assignment algorithm by comparing it with the optimal solution obtained by solving an integer linear program. Experimental results demonstrate that our channel assignment algorithm produces near optimal solution in almost all instances of the problem.

Original languageEnglish (US)
Title of host publicationIEEE International Conference on Communications
Pages3471-3476
Number of pages6
DOIs
StatePublished - 2007
Event2007 IEEE International Conference on Communications, ICC'07 - Glasgow, Scotland, United Kingdom
Duration: Jun 24 2007Jun 28 2007

Other

Other2007 IEEE International Conference on Communications, ICC'07
CountryUnited Kingdom
CityGlasgow, Scotland
Period6/24/076/28/07

Fingerprint

Wireless mesh networks (WMN)
Polynomials
Radio interference
Routers
Computational complexity
Throughput
Communication

ASJC Scopus subject areas

  • Media Technology

Cite this

Sen, A., Murthy, S., Ganguly, S., & Bhatnagar, S. (2007). An interference-aware channel assignment scheme for wireless mesh networks. In IEEE International Conference on Communications (pp. 3471-3476). [4289245] https://doi.org/10.1109/ICC.2007.574

An interference-aware channel assignment scheme for wireless mesh networks. / Sen, Arunabha; Murthy, Sudheendra; Ganguly, Samrat; Bhatnagar, Sudeept.

IEEE International Conference on Communications. 2007. p. 3471-3476 4289245.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sen, A, Murthy, S, Ganguly, S & Bhatnagar, S 2007, An interference-aware channel assignment scheme for wireless mesh networks. in IEEE International Conference on Communications., 4289245, pp. 3471-3476, 2007 IEEE International Conference on Communications, ICC'07, Glasgow, Scotland, United Kingdom, 6/24/07. https://doi.org/10.1109/ICC.2007.574
Sen A, Murthy S, Ganguly S, Bhatnagar S. An interference-aware channel assignment scheme for wireless mesh networks. In IEEE International Conference on Communications. 2007. p. 3471-3476. 4289245 https://doi.org/10.1109/ICC.2007.574
Sen, Arunabha ; Murthy, Sudheendra ; Ganguly, Samrat ; Bhatnagar, Sudeept. / An interference-aware channel assignment scheme for wireless mesh networks. IEEE International Conference on Communications. 2007. pp. 3471-3476
@inproceedings{7c781957c5bf4cee9476ae9a691f6eba,
title = "An interference-aware channel assignment scheme for wireless mesh networks",
abstract = "Multichannel communication in a Wireless Mesh Network with routers having multiple radio interfaces significantly enhances the network capacity. Efficient channel assignment and routing is critical for realization of optimal throughput in such networks. In this paper, we investigate the problem of finding the largest number of links that can be activated simultaneously in a Wireless Mesh Network subject to interference, radio and connectivity constraints. Our goal is to activate all such links and we present an interference aware channel assignment algorithm that realizes this goal. We show that the Link Interference Graph created by utilizing a frequently used interference model gives rise to a special class of graphs, known as Overlapping Double-Disk (ODD) graphs. We prove that the Maximum Independent Set computation problem is NP-complete for this special class of graphs. We provide a Polynomial Time Approximation Scheme (PTAS) for computation of the Maximum Independent Set of an ODD graph. We use this PTAS to develop a channel assignment algorithm for a multiradio multichannel Wireless Mesh Network. We evaluate the performance of our channel assignment algorithm by comparing it with the optimal solution obtained by solving an integer linear program. Experimental results demonstrate that our channel assignment algorithm produces near optimal solution in almost all instances of the problem.",
author = "Arunabha Sen and Sudheendra Murthy and Samrat Ganguly and Sudeept Bhatnagar",
year = "2007",
doi = "10.1109/ICC.2007.574",
language = "English (US)",
isbn = "1424403537",
pages = "3471--3476",
booktitle = "IEEE International Conference on Communications",

}

TY - GEN

T1 - An interference-aware channel assignment scheme for wireless mesh networks

AU - Sen, Arunabha

AU - Murthy, Sudheendra

AU - Ganguly, Samrat

AU - Bhatnagar, Sudeept

PY - 2007

Y1 - 2007

N2 - Multichannel communication in a Wireless Mesh Network with routers having multiple radio interfaces significantly enhances the network capacity. Efficient channel assignment and routing is critical for realization of optimal throughput in such networks. In this paper, we investigate the problem of finding the largest number of links that can be activated simultaneously in a Wireless Mesh Network subject to interference, radio and connectivity constraints. Our goal is to activate all such links and we present an interference aware channel assignment algorithm that realizes this goal. We show that the Link Interference Graph created by utilizing a frequently used interference model gives rise to a special class of graphs, known as Overlapping Double-Disk (ODD) graphs. We prove that the Maximum Independent Set computation problem is NP-complete for this special class of graphs. We provide a Polynomial Time Approximation Scheme (PTAS) for computation of the Maximum Independent Set of an ODD graph. We use this PTAS to develop a channel assignment algorithm for a multiradio multichannel Wireless Mesh Network. We evaluate the performance of our channel assignment algorithm by comparing it with the optimal solution obtained by solving an integer linear program. Experimental results demonstrate that our channel assignment algorithm produces near optimal solution in almost all instances of the problem.

AB - Multichannel communication in a Wireless Mesh Network with routers having multiple radio interfaces significantly enhances the network capacity. Efficient channel assignment and routing is critical for realization of optimal throughput in such networks. In this paper, we investigate the problem of finding the largest number of links that can be activated simultaneously in a Wireless Mesh Network subject to interference, radio and connectivity constraints. Our goal is to activate all such links and we present an interference aware channel assignment algorithm that realizes this goal. We show that the Link Interference Graph created by utilizing a frequently used interference model gives rise to a special class of graphs, known as Overlapping Double-Disk (ODD) graphs. We prove that the Maximum Independent Set computation problem is NP-complete for this special class of graphs. We provide a Polynomial Time Approximation Scheme (PTAS) for computation of the Maximum Independent Set of an ODD graph. We use this PTAS to develop a channel assignment algorithm for a multiradio multichannel Wireless Mesh Network. We evaluate the performance of our channel assignment algorithm by comparing it with the optimal solution obtained by solving an integer linear program. Experimental results demonstrate that our channel assignment algorithm produces near optimal solution in almost all instances of the problem.

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

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

U2 - 10.1109/ICC.2007.574

DO - 10.1109/ICC.2007.574

M3 - Conference contribution

AN - SCOPUS:38549153419

SN - 1424403537

SN - 9781424403530

SP - 3471

EP - 3476

BT - IEEE International Conference on Communications

ER -