ad hoc networks, nodes, multicast, routing
Routing in a mobile ad hoc network is challenging because nodes can move at any time, invalidating a previously-discovered route. Multicast routing is even more challenging, because a source needs to maintain a route to potentially many group members simultaneously. Providing scalable solutions to this problem typically requires building a hierarchy or an overlay network to reduce the cost of route discovery and maintenance. In this paper, we show that a much simpler alternative is possible, by using source specific semantics and relying on the unicast routing protocol to find all routes. This separation of concerns enables the multicast routing protocol to focus on minimizing join latency, repair latency, and control overhead. We design a routing protocol based on these principles and demonstrate its effectiveness through simulations.
Original Publication Citation
Manoj Pandey and Daniel Zappala, "Scalable Multicast Routing for Ad Hoc Networks", The Fourth International Workshop on Localized Communication and Topology Protocols for Ad Hoc Networks (LOCAN), October 28.
BYU ScholarsArchive Citation
Pandey, Manoj and Zappala, Daniel, "Scalable Multicast Routing for Ad Hoc Networks" (2008). All Faculty Publications. 167.
Physical and Mathematical Sciences
© 2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Copyright Use Information