Determining a sequence of stable multicast Steiner trees in mobile ad hoc networks

Authors:
Natarajan Meghanathan
Affiliations:
Jackson State University, MS
Venue:
Proceedings of the 44th annual Southeast regional conference
Year:
2006

Citing 5
Cited 1

Neighbor supporting ad hoc multicast routing protocol

MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
PatchODMRP: An Ad-hoc Multicast Routing Protocol

ICOIN '01 Proceedings of the The 15th International Conference on Information Networking
MERIT: a scalable approach for protocol assessment

Mobile Networks and Applications
Unit disk graph approximation

Proceedings of the 2004 joint workshop on Foundations of mobile computing
Stochastic properties of the random waypoint mobility model

Wireless Networks

Review: Review of multicast routing mechanisms in mobile ad hoc networks

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that given the complete knowledge of future topology changes, it is possible to determine the sequence of stable multicast Steiner trees (called the stable mobile multicast Steiner tree) in a multicast session such that the number of tree transitions is minimal. The algorithm to determine the stable mobile multicast Steiner tree and the minimum number of tree transitions is called OptTreeTrans. It is based on the following greedy approach: whenever a multicast Steiner tree is required, choose the Steiner tree that will exist for the longest time. The above strategy is repeated over the duration of the multicast session. We prove that OptTreeTrans gives the optimal number of tree transitions and simultaneously yields the stable mobile multicast Steiner tree. We study the performance of OptTreeTrans in terms of the number of tree transitions and the number of links constituting the Steiner tree for different conditions of node mobility and network density.