TY - GEN
T1 - Interference-aware multicasting in Wireless Mesh Networks
AU - Murthy, Sudheendra
AU - Goswami, Abhishek
AU - Sen, Arunabha
N1 - Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.
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
U2 - 10.1007/978-3-540-72606-7_26
DO - 10.1007/978-3-540-72606-7_26
M3 - Conference contribution
AN - SCOPUS:37249011862
SN - 9783540726050
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 299
EP - 310
BT - NETWORKING 2007 Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet - 6th International IFIP-TC6 Networking Conference, Proceedings
A2 - Akyildiz, Ian F.
A2 - Sivakumar, Raghupathy
A2 - Ekici, Eylem
A2 - de Oliveira, Jaudelice Cavalcante
A2 - McNair, Janise
PB - Springer Verlag
T2 - 6th International IFIP-TC6 Networking Conference - NETWORKING 2007 Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet
Y2 - 14 May 2007 through 18 May 2007
ER -