Motion-Aware Routing in Vehicular Ad-hoc Networks

1. Motion-Aware Routing in Vehicular Ad-hoc Networks Christopher Cardé March 13, 2003

2. Introduction & Outline • Mobile Ad-hoc Networks (MANETs) • Overview • Vehicular applications • Motion-aware Routing • Concept • Competing ideas • Simulation Christopher Cardé, Motion-Aware Routing

3. Mobile Ad-hoc Networks • Characteristics: • Non-infrastructure network of nodes • Moving nodes → changing topology • Develop routes proactively or on-demand • Goals (in general, vary by application) • Global availability • Low power / high efficiency • Low latency • High bandwidth Christopher Cardé, Motion-Aware Routing

4. Mobile Ad-Hoc Networks • Many protocols & approaches: • AODV (Ad-hoc On-demand Distance Vector) • DSR (Dynamic Source Routing) • Research areas, more “exotic” approaches: • LUNAR • Geocasting Christopher Cardé, Motion-Aware Routing

5. Mobile Ad-Hoc Networks • Applications: • Air-dropped sensor network • Battlefield communications • Search & rescue operations • Inter-vehicular networking Christopher Cardé, Motion-Aware Routing

6. Vehicular Networks • Why network vehicles? • Share traffic, safety hazard information • Distributed traffic statistic generation • Extend reach of infrastructure networks • Lower infrastructure costs! • Provide information / entertainment services to passengers. Christopher Cardé, Motion-Aware Routing

7. Vehicular Networks • Road network has special properties • At microscopic scale, generalizes to line with bidirectional traffic flow. • Exploit this to reduce topology “churn” by choosing peers moving with you instead of against? Christopher Cardé, Motion-Aware Routing

8. Motion-Vector Routing • Proposal: • Include motion vector in neighbor advertisements. • Prefer neighbors with similar motion vectors • Goal: • Reduce rate of topology change • Reduce frequency of route changes • Increase efficiency & availability Christopher Cardé, Motion-Aware Routing

9. Motion-Vector Routing • Goal: • Improve this: Christopher Cardé, Motion-Aware Routing

10. Motion-Vector Routing • Goal: • To this: • Route will change less frequently! Christopher Cardé, Motion-Aware Routing

11. Motion-Vector Routing • Competing / similar idea: • Location-based routing • Chooses neighbors / routes based on location • Requires GPS / other absolute positioning • Increased processing overhead • Single position vector does not show trends • Motion-vector routing, if it works, would be cheaper and simpler to implement. Christopher Cardé, Motion-Aware Routing

12. Simulation • Validating the concept: • Home-brew Java time-stepped simulation • OO architecture allows pluggable: • Motion models • Routing strategies Christopher Cardé, Motion-Aware Routing

13. Simulation • The plan: • Assume average duration of “in-range” with neighbor ≈ average rate of topology change. • Use as metric to evaluate algorithm’s effectiveness • Use several motion models • “Random” motion model (used as baseline in many MANET papers) • Grid motion model • More complex road networks • On each motion model, try: • Standard (range-based) neighbor selection • Motion-aware routing Christopher Cardé, Motion-Aware Routing

14. Simulation • Results not yet ready • Simulation not fully tested • Some unreasonable numbers being generated • Can’t tell how well it works yet! Christopher Cardé, Motion-Aware Routing

15. Conclusion • An area of important future research • Special properties might be exploited to improve performance • In paper: • Simulation results • Further technical details of simulator • Any questions? Christopher Cardé, Motion-Aware Routing