Interference-aware multicasting in wireless mesh networks

Authors:
Sudheendra Murthy;Abhishek Goswami;Arunabha Sen
Affiliations:
School of Computing and Informatics, Arizona State University, Tempe, AZ;Mobile Devices Software, Motorola;School of Computing and Informatics, Arizona State University, Tempe, AZ
Venue:
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Year:
2007

Citing 8
Cited 1

Approximation algorithms for directed Steiner problems

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
On-Demand Multicasting in Ad-Hoc Networks: Comparing AODV and ODMRP

ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Linear Programming and Network Flows

Linear Programming and Network Flows
Heuristic algorithms for minimum bandwith consumption multicast routing in wireless mesh networks

ADHOC-NOW'05 Proceedings of the 4th international conference on Ad-Hoc, Mobile, and Wireless Networks
A survey of quality of service in IEEE 802.11 networks

IEEE Wireless Communications
Multicast: wired to wireless

IEEE Communications Magazine
A Cross-Layer Optimization Framework for Multihop Multicast in Wireless Mesh Networks

IEEE Journal on Selected Areas in Communications

Load-aware multicast routing metrics in multi-radio multi-channel wireless mesh networks

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

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 interference-aware 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.