Routing and Location Management in Mobile Ad-h.PPTVIP

Routing in Mobile Ad hoc Networks Sumesh J. Philip CSE620 Fall 2004 Contents Introduction to Ad hoc networks Conventional routing drawback Table Driven (WRP, DSDV) On Demand (DSR, AODV, TORA) Performance Evaluation Location based routing (LAR, DREAM) Hybrid routing (ZRP) Summary Mobile Ad hoc Network Collection of mobile nodes forming a network Hosts use wireless RF transceivers as network interface Omni directional (broadcast) Highly directional (point – point) Combination Arbitrary movement and coverage pattern Connectivity in the form of random, multi-hop graphs Highly co-operative, each host is an independent router Applications “Ad hoc” – centric Conferences/meetings Search and Rescue Automated battlefields Data – centric Collecting information in large, dynamic, energy constrained networks (sensors) Revenue – centric Increasing coverage and capacity Constraints and Issues No centralized administration or standard support services Frequent and unpredictable network topology changes Routing and mobility management Channel access/bandwidth availability Hidden/Exposed station problem Lack of symmetrical links Power limitation Conventional Routing Protocols ? Not designed for highly dynamic, low bandwidth networks “Count-to-infinity” problem and slow convergence for DV Loop formation during temporary node failures and network partitions Protocols that use flooding techniques (for e.g. LS) create excessive traffic and control overhead Ad hoc Routing Protocols Proactive Protocols Table driven Continuously evaluate routes No latency in route discovery Large capacity to keep network information current A lot of routing information may never be used Reactive Protocols On Demand Route discovery by global search Bottleneck due to latency of route discovery May not be appropriate for real-time communication Wireless Routing Protocol (WRP) Predecessor to destination (next to last hop) in the shortest path used Eliminates the “Count-to-infinity” problem a