HARP-Hybrid Ad Hoc Routing Protocol

Transkript

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

2 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

3 Introduction Packet Radio::Multihop::Mobile Ad Hoc Networks. Pros or Cons? Wireless, Mobility, Fully Mobile Infrastructure. Routing

4 Routing Manet Characteristics: Traffic/Application Requirements Routing Functionalities: Wireless Link Node Mobility Fully Mobile Infrastructure Routing Distributing routing info. Routing discovery/computing Forwarding Network Properties Maintaining 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. Introduction, Routing, Contribution: DDR & DDRP, Analysis, Conclusion

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

6 DDR Basic Idea Network Topology Forest BEACON DDR TREE TREE. TREE BEACON ZONE ZONE. ZONE TIME

7 HARP Ideas 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

8 Topology Creation Under DDR a b f s c k y t d x i g v u e w z h n DDR a z 1 b f s c k y t d x i g v z 2 w u e z h n z 3 INTER-ZONE TABLE OF NODE d NID NZID Z_Stabilit g z 2 ++ INTRA-ZONE TABLE OF NODES k AND f NID Learned_PN NID Learned_PN f a, b, s, y, t, x y x, t c - k c, d d - b, a, s -

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

10 HARP: Intrazone Forwarding C H B K D G W Z 2 A F Y X V Z DATA Trans. S Z 1 T I Z 3 U E N

11 HARP: Interzone Routing C H LEAF NOD E A B F K Y N X G V W Z Z 2 Selective Filtering Path Reques t S Z 1 T I Z 3 U E Path Selection D

12 HARP: Interzone Routing C H B K N G W Z 2 A F Y X V Z Selective Filtering S Z 1 T I Z 3 U E Path Reply D

13 HARP: Interzone Routing C H B K N G W Z 2 A F Y X V Z DATA Trans. S Z 1 T I Z 3 U E D

14 DDR Complexity N: # of nodes Protocol Topology Creation M: # of zones ρ : routing zone radius 2 ρ : amount of intra-zone traffic ZHLS N 2 /M+NM ZRP Nρ 2 DDR N 2 /M

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

16 Contribution! NOTICE: Our contribution aims for scalability under: medium number of nodes in the network!? HARP DDR medium mobility rate!?

17 Outline ❶ Mobile Ad Hoc Networks ❷ Routing ❸ New Architecture: DDR & HARP? ❹ DDR- Topology Creation Network Properties ❺ HARP- Route Determination Appl. Requirments ❻ Mathematical Analysis

18 What we gained: DDR+HARP Conclusion 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