Multicast overlay spanning trees in ad hoc networks: Capacity bounds, protocol design and performance evaluation

Authors:
Georgios Rodolakis;Anis Laouiti;Philippe Jacquet;Amina Meraihi Naimi
Affiliations:
INRIA, BP 105 Rocquencourt, 78153 Le Chesnay Cedex, France;GET/INT, 91000 Evry, France;INRIA, BP 105 Rocquencourt, 78153 Le Chesnay Cedex, France;INRIA, BP 105 Rocquencourt, 78153 Le Chesnay Cedex, France
Venue:
Computer Communications
Year:
2008

Citing 12
Cited 4

Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems

Journal of the ACM (JACM)
Scaling of multicast trees: comments on the Chuang-Sirbu scaling law

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Approximation algorithms

Approximation algorithms
Adaptive demand-driven multicast routing in multi-hop wireless ad hoc networks

MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Is the internet fractal?

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On-demand multicast routing protocol in multihop wireless mobile networks

Mobile Networks and Applications
Geometry of information propagation in massively dense ad hoc networks

Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Multicast Scaling Properties in Massively Dense Ad Hoc Networks

ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Workshops - Volume 02
The capacity of wireless networks

IEEE Transactions on Information Theory
An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability

Operations Research Letters
The core-assisted mesh protocol

IEEE Journal on Selected Areas in Communications
Multicast over wireless mobile ad hoc networks: present and future directions

IEEE Network: The Magazine of Global Internetworking

Mobility-based multicast routing algorithm for wireless mobile Ad-hoc networks: A learning automata approach

Computer Communications
Learning automata-based algorithms for solving stochastic minimum spanning tree problem

Applied Soft Computing
A link stability-based multicast routing protocol for wireless mobile ad hoc networks

Journal of Network and Computer Applications
A learning automata-based heuristic algorithm for solving the minimum spanning tree problem in stochastic graphs

The Journal of Supercomputing

Quantified Score

Hi-index	0.24

Visualization

Abstract

We study the benefits of multicast routing in the performance of wireless ad hoc networks. In particular we show that if a node wishes to communicate with n distinct destinations, multicast can reduce the overall network load by a factor O(n), when used instead of unicast. One of the implications of this scaling property consists in a significant increase of the total capacity of the network for data delivery. Hence, we show that the aggregate multicast capacity of wireless ad hoc networks is O(n) larger than the unicast capacity, when the group size n is small compared to the total number of nodes in the network. We discuss how these information theoretic results can be taken into consideration in the operation of a multicast protocol for wireless mesh networks using Multicast Overlay Spanning Trees (MOST). We perform simulations of the MOST protocol to compare with the theoretical results, and we present a fully working implementation for real network environments.