Interference-aware multicasting in Wireless Mesh Networks

Sudheendra Murthy, Abhishek Goswami, Arunabha Sen

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

5 Citations (Scopus)

Abstract

Multicasting is one of the most important applications in Wireless Ad hoc Networks and the currently emerging Wireless Mesh Networks. In such networks, interference due to the shared wireless medium is a prime factor in determining the data rate achievable by a multicast application. In this research work, we present an interferenceaware multicast routing algorithm that takes into account the effects of interference to determine the maximum bandwidth multicast structure. We characterize the problem of computing maximum bandwidth multicast structure as a graph problem of finding minimum degree weakly induced subgraph in a graph subject to the connectivity and interference constraints. We establish the intractability of the problem and provide efficient heuristic that performs close to the optimal in most of the cases. We also present the design of a more practical distributed algorithm. The simulation results demonstrate the benefits of our heuristic over Shortest Path Tree and Minimum Steiner Tree approximation algorithms.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages299-310
Number of pages12
Volume4479 LNCS
StatePublished - 2007
Event6th International IFIP-TC6 Networking Conference - NETWORKING 2007 Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet - Atlanta, GA, United States
Duration: May 14 2007May 18 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4479 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other6th International IFIP-TC6 Networking Conference - NETWORKING 2007 Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet
CountryUnited States
CityAtlanta, GA
Period5/14/075/18/07

Fingerprint

Multicasting
Wireless Mesh Networks
Wireless mesh networks (WMN)
Multicast
Interference
Bandwidth
Wireless ad hoc networks
Approximation algorithms
Routing algorithms
Parallel algorithms
Heuristics
Shortest Path Tree
Multicast Routing
Steiner Tree
Prime factor
Wireless Ad Hoc Networks
Tree Algorithms
Minimum Degree
Induced Subgraph
Routing Algorithm

Keywords

  • Minimum interference multicast
  • NP-complete
  • Weakly induced connected subgraph
  • Wireless Mesh Network

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Murthy, S., Goswami, A., & Sen, A. (2007). Interference-aware multicasting in Wireless Mesh Networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4479 LNCS, pp. 299-310). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4479 LNCS).

Interference-aware multicasting in Wireless Mesh Networks. / Murthy, Sudheendra; Goswami, Abhishek; Sen, Arunabha.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4479 LNCS 2007. p. 299-310 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4479 LNCS).

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

Murthy, S, Goswami, A & Sen, A 2007, Interference-aware multicasting in Wireless Mesh Networks. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 4479 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4479 LNCS, pp. 299-310, 6th International IFIP-TC6 Networking Conference - NETWORKING 2007 Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet, Atlanta, GA, United States, 5/14/07.
Murthy S, Goswami A, Sen A. Interference-aware multicasting in Wireless Mesh Networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4479 LNCS. 2007. p. 299-310. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Murthy, Sudheendra ; Goswami, Abhishek ; Sen, Arunabha. / Interference-aware multicasting in Wireless Mesh Networks. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4479 LNCS 2007. pp. 299-310 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{6605aaeb84e643bbb9d19c84eaa5821b,
title = "Interference-aware multicasting in Wireless Mesh Networks",
abstract = "Multicasting is one of the most important applications in Wireless Ad hoc Networks and the currently emerging Wireless Mesh Networks. In such networks, interference due to the shared wireless medium is a prime factor in determining the data rate achievable by a multicast application. In this research work, we present an interferenceaware multicast routing algorithm that takes into account the effects of interference to determine the maximum bandwidth multicast structure. We characterize the problem of computing maximum bandwidth multicast structure as a graph problem of finding minimum degree weakly induced subgraph in a graph subject to the connectivity and interference constraints. We establish the intractability of the problem and provide efficient heuristic that performs close to the optimal in most of the cases. We also present the design of a more practical distributed algorithm. The simulation results demonstrate the benefits of our heuristic over Shortest Path Tree and Minimum Steiner Tree approximation algorithms.",
keywords = "Minimum interference multicast, NP-complete, Weakly induced connected subgraph, Wireless Mesh Network",
author = "Sudheendra Murthy and Abhishek Goswami and Arunabha Sen",
year = "2007",
language = "English (US)",
isbn = "9783540726050",
volume = "4479 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "299--310",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Interference-aware multicasting in Wireless Mesh Networks

AU - Murthy, Sudheendra

AU - Goswami, Abhishek

AU - Sen, Arunabha

PY - 2007

Y1 - 2007

N2 - Multicasting is one of the most important applications in Wireless Ad hoc Networks and the currently emerging Wireless Mesh Networks. In such networks, interference due to the shared wireless medium is a prime factor in determining the data rate achievable by a multicast application. In this research work, we present an interferenceaware multicast routing algorithm that takes into account the effects of interference to determine the maximum bandwidth multicast structure. We characterize the problem of computing maximum bandwidth multicast structure as a graph problem of finding minimum degree weakly induced subgraph in a graph subject to the connectivity and interference constraints. We establish the intractability of the problem and provide efficient heuristic that performs close to the optimal in most of the cases. We also present the design of a more practical distributed algorithm. The simulation results demonstrate the benefits of our heuristic over Shortest Path Tree and Minimum Steiner Tree approximation algorithms.

AB - Multicasting is one of the most important applications in Wireless Ad hoc Networks and the currently emerging Wireless Mesh Networks. In such networks, interference due to the shared wireless medium is a prime factor in determining the data rate achievable by a multicast application. In this research work, we present an interferenceaware multicast routing algorithm that takes into account the effects of interference to determine the maximum bandwidth multicast structure. We characterize the problem of computing maximum bandwidth multicast structure as a graph problem of finding minimum degree weakly induced subgraph in a graph subject to the connectivity and interference constraints. We establish the intractability of the problem and provide efficient heuristic that performs close to the optimal in most of the cases. We also present the design of a more practical distributed algorithm. The simulation results demonstrate the benefits of our heuristic over Shortest Path Tree and Minimum Steiner Tree approximation algorithms.

KW - Minimum interference multicast

KW - NP-complete

KW - Weakly induced connected subgraph

KW - Wireless Mesh Network

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

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

M3 - Conference contribution

AN - SCOPUS:37249011862

SN - 9783540726050

VL - 4479 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 299

EP - 310

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -