HARP-Hybrid Ad Hoc Routing Protocol Navid NIKAEIN Christian BONNET Neda NIKAEIN © 2001 Navid Nikaein Eurecom Institute Sophia-Antipolis France

Introduction, Routing, Contribution: DDR & HARP, Analysis, Conclusion Outline  Introduction  Routing in Mobile Ad Hoc Networks  Our Contribution: General Scheme  DDR - Distributed Dynamic Routing Algorithm  HARP - Hybrid Ad Hoc Routing Protocol  Mathematical Analysis  Conclusion and Future Work

Introduction Packet Radio::Multihop::Mobile Ad Hoc Networks. Pros or Cons? Wireless, Mobility, Fully Mobile Infrastructure. Introduction, Routing, Contribution: DDR & HARP, Analysis, Conclusion  Routing

Routing Introduction, Routing, Contribution: DDR & DDRP, Analysis, Conclusion Distributed, Convergent, Dynamic, Loop-free. Scalability (e.g. GPS-based), Fast route establishment, multiple route selection, energy & bandwidth efficiency, fast adaptability to link changes, unidirectional link support. Traffic/Application Requirements Manet Characteristics: Wireless Link Node Mobility Fully Mobile Infrastructure Routing Network Properties Routing Functionalities: Distributing routing info. Routing discovery/computing Forwarding Maintaining

Contribution Introduction, Routing, Contribution: DDR & HARP, Analysis, Conclusion Application HARP DDR Network  Topology Creation With respect to Network Properties  Route Determination With respect to Application Requirements Routing Delay, loss rate, stability, etc. # of nodes, frequency of E2E connection & of topology changes

DDR Basic Idea Network Topology Forest TREE TREE …. TREE ZONE ZONE …. ZONE DDR Introduction, Routing, Contribution: DDR & HARP, Analysis, Conclusion TIME BEACON

HARP Ideas Introduction, Routing, Contribution: DDR & HARP, Analysis, Conclusion  Goal? To establish the most stable path + Zone level routing instead of node level !?  Metric: Zone level stability  Hybrid: intra-zone forwarding & inter-zone routing  Hybrid path maintenance: reactive & proactive

Topology Creation Under DDR Introduction, Routing, Contribution: DDR & HARP, Analysis, Conclusion NID Learned_PN f a, b, s, y, t, x c - d - NID Learned_PN y x, t k c, d b, a, s - INTRA-ZONE TABLE OF NODES k AND f NID NZID Z_Stabilit g z 2 ++ INTER-ZONE TABLE OF NODE d a b f c s y k d t x g v w z h u e in a b f c s y k d t x g v w z h u e i n DDR z1z1 z2z2 z3z3

HARP Routing Model Introduction, Routing, Contribution:DDR & HARP, Analysis, Conclusion Zone level routing Inter-zone routing Intra-zone forwarding Path Maintenance Path Discovery R O U T I N G Intra-zone table Inter-zone table Data Delivery FORWARDING Zone Stability

HARP: Intrazone Forwarding Introduction, Routing, Contribution: DDR & HARP, Analysis, Conclusion A B K F S Y T C D X G V W Z U N E I H Z1Z1 Z3Z3 Z2Z2 DATA Trans.

HARP: Interzone Routing Introduction, Routing, Contribution: DDR & HARP, Analysis, Conclusion A B K F S Y T C N X G V W Z U D E I H Z1Z1 Z3Z3 Z2Z2 LEAF NOD E Path Reques t Selective Filtering Path Selection

HARP: Interzone Routing Introduction, Routing, Contribution: DDR & HARP, Analysis, Conclusion A B K F S Y T C N X G V W Z U D E I H Z1Z1 Z3Z3 Z2Z2 Selective Filtering Path Reply

HARP: Interzone Routing Introduction, Routing, Contribution: DDR & HARP, Analysis, Conclusion A B K F S Y T C N X G V W Z U D E I H Z1Z1 Z3Z3 Z2Z2 DATA Trans.

DDR Complexity Protocol Topology Creation ZHLSN 2 /M+NM ZRPN2N2 DDRN 2 /M N: # of nodes M: # of zones : routing zone radius : amount of intra-zone traffic Introduction, Routing, Contribution: DDR & HARP, Analysis, Conclusion

HARP Analysis Introduction, Routing, Contribution: DDR & HARP, Analysis, Conclusion N: # of nodes M: # of zones P = 1 -1 / M Y: # of nodes affected by path reply The communication overhead (CO) generated to perform path discovery (PD) operation for HARP is: CO PD = P*(N+Y)

Contribution Introduction, Routing, Contribution: DDR & HARP, Analysis, Conclusion ! NOTICE: Our contribution aims for scalability under: medium number of nodes in the network!? medium mobility rate!? HARP DDR

Introduction, Routing, Contribution: DDR & HARP, Analysis, Conclusion Outline  Mobile Ad Hoc Networks  Routing  New Architecture: DDR & HARP?  DDR- Topology Creation  Network Properties  HARP- Route Determination  Appl. Requirments  Mathematical Analysis

DDR+HARP Conclusion  What we gained:  Adaptive Architecture  Limited Path Discovery propagation without GPS  Dynamic Zones  Zone level stability and the tree structure  Hybrid path maintenance: Proactive & Reactive  Performance Evaluation under various condition Introduction, Routing, Contribution:DDR & HARP, Analysis, Conclusion