1. 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, Routing, Contribution: DDR & HARP, Analysis, Conclusion

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

3. Traffic/Application Requirements
Routing
Traffic/Application Requirements
Routing Functionalities:
Distributing routing info.
Routing discovery/computing
Forwarding
Maintaining
Manet Characteristics:
Wireless Link
Node Mobility
Fully Mobile Infrastructure
Routing
Network Properties
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

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

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

6. 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
Introduction, Routing, Contribution: DDR & HARP, Analysis, Conclusion

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

8. HARP Routing Model Zone level routing Path Maintenance Inter-zone
Intra-zone
forwarding
Zone Stability
Path
Discovery
FORWARDING
FORWARDING
Data
Delivery
Intra-zone table
Inter-zone table
Introduction, Routing, Contribution:DDR & HARP, Analysis, Conclusion

9. HARP: Intrazone ForwardingC H G W B D Z2 K V X Z A F Y U T S I N
DATA Trans. Z1 Z3 E
Introduction, Routing, Contribution: DDR & HARP, Analysis, Conclusion

10. HARP: Interzone RoutingC H G W B N Z2
LEAF NODE K V
Selective
Filtering X Z A F Y
Path Selection U
Path Request T S I D Z1 Z3 E
Introduction, Routing, Contribution: DDR & HARP, Analysis, Conclusion

11. HARP: Interzone RoutingC H G W B N Z2 K V
Selective
Filtering X Z A F Y
Path Reply U T S I D Z1 Z3 E
Introduction, Routing, Contribution: DDR & HARP, Analysis, Conclusion

12. HARP: Interzone RoutingC H G W B N Z2 K V X Z A F Y U T S I D
DATA Trans. Z1 Z3 E
Introduction, Routing, Contribution: DDR & HARP, Analysis, Conclusion

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

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

15. Contribution HARP DDR Our contribution aims for scalability under:
! 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

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

17. 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