Paper Info
Title
Scalable Multicast Routing For Ad Hoc Networks
Abstract
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.
Year
DOI
Venue
2008
10.1109/MAHSS.2008.4660088
2008 FIFTH IEEE INTERNATIONAL CONFERENCE ON MOBILE AD-HOC AND SENSOR SYSTEMS, VOLS 1 AND 2
Keywords
Field
DocType
routing protocols,ad hoc networks,mobile communication,separation of concerns,protocols,routing protocol,separation of concern,ad hoc network,overlay network,multicast,routing,mobile ad hoc network,maintenance engineering,unicast,nodes
Protocol Independent Multicast,Dynamic Source Routing,Computer science,Enhanced Interior Gateway Routing Protocol,Computer network,Wireless Routing Protocol,Optimized Link State Routing Protocol,Distance Vector Multicast Routing Protocol,Routing protocol,Zone Routing Protocol,Distributed computing
Conference
ISSN
Citations 
PageRank 
2155-6806
2
0.43
References 
Authors
13
3
Name
Order
Citations
PageRank
Manoj Pandey141.48
Cisco Systems212322.05
Daniel Zappala330926.66