Tree-Based Broadcasting in Multihop Radio Networks
IEEE Transactions on Computers
Some computer science issues in ubiquitous computing
Communications of the ACM - Special issue on computer augmented environments: back to the real world
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
The PIM architecture for wide-area multicast routing
IEEE/ACM Transactions on Networking (TON)
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Reliable broadcast in mobile multihop packet networks
MobiCom '97 Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking
Wireless Personal Communications: An International Journal
Compositional Programming Abstractions for Mobile Computing
IEEE Transactions on Software Engineering
An Adaptive Protocol for Reliable Multicast in Mobile Multi-hop Radio Networks
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A Programming Interface for Application-Aware Adaptation in Mobile Computing
A Programming Interface for Application-Aware Adaptation in Mobile Computing
Distributed center-location algorithms
IEEE Journal on Selected Areas in Communications
Deterministic Broadcast and Gossiping Algorithms for Ad hoc Networks
The Journal of Supercomputing
A scalability comparison of GST and SST MANET multicast routing algorithms
Computer Communications
Distributed reformation of core-based group-shared multicast trees in mobile ad hoc networks
Journal of Parallel and Distributed Computing
Adaptive and intelligent path discovery on-demand for wireless networks using service composition
Expert Systems with Applications: An International Journal
A case for tree evolution in QoS multicasting
Computer Communications
Constructing agents blackboard communication architecture based on graph theory
Computer Standards & Interfaces
Placing and maintaining a core node in wireless ad hoc sensor networks
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Robust PIM-SM multicasting using anycast RP in wireless ad hoc networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
SFS3: a simulation framework for self-stabilizing systems
SpringSim '10 Proceedings of the 2010 Spring Simulation Multiconference
A Cluster-Based Approach for Efficient Multi-Source Multicasting in MANETs
Wireless Personal Communications: An International Journal
Minicast: a multicast-anycast protocol for message delivery
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Host selection through collective decision
ACM Transactions on Autonomous and Adaptive Systems (TAAS) - Special section on formal methods in pervasive computing, pervasive adaptation, and self-adaptive systems: Models and algorithms
Hi-index | 0.00 |
Several multicast protocols such as Protocol Independent Multicast (PIM) and Core-Based Trees (CBT) use the notion of group-shared trees. The reason is that construction of minimal-cost tree spanning all members of the multicast group is expensive, hence these protocols use a core-based group-shared tree to distribute packets from all the sources. A core-based tree is a shortest-path tree rooted at some core node. The core node is also referred to as a center node or a rendezvous point. Core nodes may be chosen from some preselected set of nodes or some heuristics may be employed to select core nodes. In this paper, we present distributed core selection and migration protocols for mobile ad hoc networks with dynamically changing network topology. Most protocols for core selection in static networks are not suitable for ad hoc networks, since these algorithms depend on knowledge of entire network topology, which is not available or is too expensive to maintain in an ad hoc network with dynamic topology. The proposed core location method is based on the notion of median node of the current multicast tree instead of the median node of the entire network. The rationale is that the mobile ad hoc network graphs are in general sparse and, hence, the multicast tree is a good approximation of the entire network for the current purpose. Our adaptive distributed core selection and migration method uses the fact that the median of a tree is equivalent to the centroid of that tree. The significance of this observation is due to the fact that the computation of a tree's centroids does not require any distance information. Mobile ad hoc networks have limited bandwidth which needs to be conserved. Hence, we use the cost of multicast tree as the sum of weights of all the links in the tree, which signifies the total bandwidth consumed for multicasting a packet. We compare the cost of shortest-path tree rooted at the tree median, Cost_TM, with the cost of shortest-path tree rooted at the median of the graph, Cost_GM, which requires complete topology information to compute. A network graph model for generating random ad hoc mobile networks is developed to perform this comparison. The simulation results show that for large size networks, the ratio Cost_TM/Cost_GM lies between 0.8 to 1.2 for different multicast groups. Further, as the size of the multicast group increases the ratio approaches 1.