AScalableLocationServiceforGeographicAdHocRouting课程.pptVIP

A Scalable Location Service forGeographic Ad Hoc Routing Jinyang Li, John Jannotti, Douglas S. J. De Couto, David R. Karger, Robert Morris MIT Laboratory for Computer Science Overview Motivation for Grid: scalable routing for large ad hoc networks metropolitan area, 1000s of nodes Protocol Scalability: The number of packets each node has to forward and the amount of state kept at each node grow slowly with the size of the network. Current Routing Strategies Traditional scalable Internet routing address aggregation hampers mobility Pro-active topology distribution e.g. DSDV reacts slowly to mobility in large networks On-demand flooded queries e.g. DSR too much protocol overhead in large networks Flooding causes too much packet overhead in big networks Flooding-based on-demand routing works best in small nets. Can we route without global topology knowledge? Geographic Forwarding Scales Well A addresses a packet to G’s latitude, longitude C only needs to know its immediate neighbors to forward packets towards G. Geographic forwarding needs a location service! Possible Designs for a Location Service Flood to get a node’s location LAR, DREAM . excessive flooding messages Central static location server. not fault tolerant too much load on central server and nearby nodes the server might be far away for nearby nodes or inaccessible due to network partition. Every node acts as server for a few others. good for spreading load and tolerating failures. Desirable Properties of a Distributed Location Service Spread load evenly over all nodes. Degrade gracefully as nodes fail. Queries for nearby nodes stay local. Per-node storage and communication costs grow slowly as the network size grows. GLS’s spatial hierarchy 3 Servers Per Node Per Level Queries Search for Destination’s Successors GLS Update level 1 GLS Update level 1 GLS Update level 2 GLS Query Challenges for GLS in a Mobile Network Out-of-date location information in servers. Tradeoff between m