Neighbor supporting ad hoc multicast routing protocol
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Adaptive Core Selection and Migration Method for Multicast Routing in Mobile Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Mobile Computing
Online Multicasting for Network Capacity Maximization in Energy-Constrained Ad Hoc Networks
IEEE Transactions on Mobile Computing
Localized Operations for Distributed Minimum Energy Multicast Algorithm in Mobile Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
CLTC: A Cluster-Based Topology Control Framework for Ad Hoc Networks
IEEE Transactions on Mobile Computing
Scalable routing protocols for mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
Multicast over wireless mobile ad hoc networks: present and future directions
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.24 |
Since network resource of mobile ad hoc network (MANET) is limited due to the contention-based wireless communication channel at the medium access layer and energy of mobile nodes is constrained due to the energy-limited batteries, the scalability issue is one of main research topics in developing MANET routing algorithms. Therefore, this paper analyzes the message complexities of group shared tree (GST) and source-specific tree (SST) that are implemented in most MANET multicast routing algorithms. Simulation demonstrates that in a wireless ad hoc network where SST and GST are well maintained during the simulation, SST algorithm is able to achieve very competitive performance (i.e. less message complexity) under the multiple packet transmissions, in comparison with GST where no core selection algorithm is adopted.