Using Node Mobility to Enhance Greedy Forwarding in Geographic Routing for Mobile Ad Hoc Networks Investigators: Sol M. Shatz, Department of Computer Science, Primary Grant Support: U. S. Army Research Office • Node mobility is normally considered a hazard for geographic routing, causing a degradation of performance or even persistent routing failures. • This research seeks to exploit mobility to enhance greedy forwarding in geographic routing, especially for those applications with loose delay constraints. • Two ways to move a packet: (1) Transmission Hops (TH), and (2) Physical Motion (PM). • Trade-offs: TH produces short delay, however it incurs significant resource consumption and is vulnerable to local-maximum problems. Use both TH and PM to optimize packet routing. • Motion Potential: Combines node mobility attributes with node position information as a metric to be used in selecting a next-hop node. • New approach called Mobility-based Adaptive Greedy Forwarding (MAGF) • Our method can enhance routing performance in terms of route hop-count (energy) and packet delivery rate, especially under the scenarios of low network density and high node mobility. • Uses low computation overhead at each step of forwarding, maintaining the pure localized decision making of conventional geographic routing. • Future research would focus on: (1) energy-delay trade-off study; (2) long-term mobility pattern predication accuracy.