Geographic routing for wireless networks

摘要: Distributed shortest-path routing protocols for wired networks either describe the entire topology of a network or provide digest to every router. They continually update state describing at all routers as changes find correct routes destinations. Hence, robustly, they generate protocol message traffic proportional product number in and rate topological change network. Current ad-hoc protocols, designed specifically mobile, wireless networks, exhibit similar scaling properties. It is reliance these on concerning links network, path between source destination, that responsible their poor scaling. We present Greedy Perimeter Stateless Routing (GPSR), novel datagram uses positions packet's destination make packet forwarding decisions. GPSR makes greedy decisions using only information about router's immediate neighbors topology. When reaches region where impossible, algorithm recovers by around perimeter region. By keeping local topology, scales better per-router than destinations increases. Under mobility's frequent changes, can use new quickly. We protocol, extensive simulation mobile compare its performance with Dynamic Source Routing. Our simulations demonstrate GPSR's scalability densely deployed networks.