Ad-hoc On-demand Distance Vector Improving the Ad-hoc On-demand Distance Vector Stephen Walter Protocol

Issues with Wireless Networks Some environments have no existing routers or wired infrastructure Expensive Physically impossible Setup time Inflexible to change

Ad-hoc Solutions Use existing computers to act as routers Use protocol to discover the path (routing) Traditional routing algorithms no longer work well

Protocol Classes Proactive Reactive Ready to go Whole topology On-demand Little maintenance Cell operations Ready to go Whole topology Updates changes Overhead costs Bandwidth Battery power Inflexible

Ad-hoc On-demand Distance Vector (AODV) Charles E. Perkins, 1999 Reactive protocol Fast discovery Loop free On-demand

AODV Route Discovery Destination Starting Point

AODV Route Discovery

AODV Route Discovery

AODV Route Discovery

AODV Route Discovery

AODV Route Discovery

AODV Route Discovery

AODV Route Discovery

AODV Route Maintenance AODV Route Maintenance Broken Link in Route

AODV Route Maintenance

AODV Issues Delay in connections Floods network Expensive repairs System dependant (simple repair) (long chain)

Proposed Protocol Combine successful ideas to build a more effective protocol Multi-radio Multi-path Hybrid Tiered Structure

Multi-radio Allows routes to operate without confliction Requests for longer distances use higher bands

Multi-path Efficient use of original request flood Stable Connections Less Rediscovery Requests Increased Capacity

Hybrid Flesh out gaps Increase performance Fixed Connection Hybrid Flesh out gaps Increase performance Allow seamless transitions between structures

Questions