Abstract
An ad hoc network is composed of mobile nodes without the intervention of any fixed infrastructure or central administration. Multicasting is intended for group-oriented communication. A lot many applications depend on one-to-many or many-to-many dissemination of the information. However, in ad hoc environment, multicasting protocols are faced with the challenge of producing multihop routes under dynamic topology and bandwidth constraints. Due to the dynamic topology of MANETs it is very difficult to build optimal multicast trees and maintaining group membership, making even more challenging to implement scalable and robust multicast in Mobile Ad hoc Networks (MANET). A Scalable and Robust Location Aware Multicast Algorithm, called SRLAMA, for mobile ad hoc networks is presented in the paper that is based on creation of shared tree using the physical location of the nodes for the multicast sessions. It constructs a shared bi-directional multicast tree with an alternate root that avoids the network partitioning in case of primary root failurte, which results in better performance even than a shared tree. The algorithm uses the concept of small overlapped zones around each node for employing proactive routing with in the smaller zone. Protocol is based on the location information obtained employing relevant data structure, which effectively reduces the overheads for route searching and shared multicast tree maintenance. It employs a preventive route reconfiguration to avoid the latency in case of link breakages and to prevent the network from splitting.
Highlights
An ad-hoc network is a multihop wireless network formed by a collection of mobile nodes forming a dynamic multi-hop autonomous network [3] without the intervention of any centralized access point or fixed infrastructure
This section introduces a new multicast protocol, Scalable and Robust Location Aware Multicast Algorithm (SRLAMA), which follows the hybrid approach, a mix of proactive and reactive routing using the physical location of the nodes
Shared Multicast Tree with Alternate Root In case of shared multicast tree the protocol depends on a core or root node to maintain the group information which makes the root node overloaded. Due to this shared tree multicast is not suitable from energy balancing point of view because the root of the tree takes on more responsibility for routing, consumes more battery energy, and stops working earlier than other nodes
Summary
An ad-hoc network is a multihop wireless network formed by a collection of mobile nodes forming a dynamic multi-hop autonomous network [3] without the intervention of any centralized access point or fixed infrastructure. Group communication is important in Mobile Ad Hoc Networks (MANET). Many ad hoc network applications which require close association of the member nodes depends on group communication. Many routing protocols for wireless MANETs need a broadcast/multicast as a communication primitive to update their states and maintain the routes between nodes [18]. Even in wired networks maintaining group membership information and building an optimal multicast distribution structure (typically in the form of a routing tree) is challenging. The proposed protocol, scalable and robust location aware multicast algorithm, called SRLAMA, uses the concept of zone and constructs a shared bi-directional multicast tree for its routing operations rather than a mesh, which helps in achieving more efficient multicast delivery.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Distributed and Parallel systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
