ITTC

Yufei Cheng

Implementation of DSDV is NS-3

Yufei Cheng
Department of Electrical Engineering & Computer Science Information Technology & Telecommunications Research Center The University of Kansas EECS 882 Presentation

yfcheng@ittc.ku.edu

2009-10-28

DSDV Implementation

20052006 James P.G. Sterbenz

ITTC

Yufei Cheng

DSDV implementation
Abstract
This paper presents a routing protocol for ad-hoc network. The basic idea of the design is to operate each mobile node as a specialized router, which periodically advertises its view of interconnection topology to all other nodes within the network. The author makes modification to Bellman Ford routing mechanism and addresses the problem of looping properties. The DSDV code in NS2 covers more detail about the routing protocol than the paper, and I will include some corresponding code for core function of DSDV. The presentation will also cover some differences between AODV and DSDV.

2009-10-28

DSDV implementation

ITTC

Yufei Cheng

DSDV implementation
Outline
Basic function of DSDV Comparison of AODV and DSDV Direction of future work for project Conclusion

2009-10-28

DSDV implementation

ITTC

Yufei Cheng

DSDV implementation
Basic function of DSDV Comparison of AODV and DSDV Direction of future work for project Conclusion

2009-10-28

DSDV implementation

ITTC

Yufei Cheng

Overview of Routing Methods

Link-State Distance-Vector

2009-10-28

DSDV Implementation

ITTC

Yufei Cheng

Overview of Routing Methods

Link-State
Each node maintains view of cost for each link Periodically broadcast is used to keep updated

Problem:
View of the cost affected by delay, partitioned network, etc. Formation of routing loop

2009-10-28

DSDV Implementation

ITTC

Yufei Cheng

Overview of Routing Methods

Distance-Vector (Distributed Bellman-Ford)
Every node i maintains , for each destination x Treat k as next-hop if equals Each node broadcasts its estimate of shortest

2009-10-28

DSDV Implementation

ITTC

Yufei Cheng

Core function of DSDV

Route advertisements Route table entry Responding to topology changes Route selection Summary

2009-10-28

DSDV Implementation

ITTC

Yufei Cheng

Core function of DSDV

Route Advertisements
Route table entry tagged with sequence number
Originated by destination In order to avoid forming loops

Each node advertises routing table to neighbors Routing tables update periodically
Deal with topology changes

2009-10-28

DSDV Implementation

ITTC

Yufei Cheng

Core function of DSDV

Route Table Entry
Data includes in the broadcast
New sequence number Destinations address Hops required to reach destination Sequence number received regarding that destination

2009-10-28

DSDV Implementation

10

ITTC

Yufei Cheng

Core function of DSDV

Route Table Entry

The advertised table of MH4 (one node)

2009-10-28 DSDV Implementation 11

ITTC

Yufei Cheng

Core function of DSDV

Route Table Entry
Broken links
Detected directly or indirectly Described as a metric of Later sequence number with a finite metric
Triggers an immediate route update

2009-10-28

DSDV Implementation

12

ITTC
Responding to Topology Changes
Two kinds of adjustments (Between periodic advertisement)
Full dump packets
Contains all available routing updates Multiple NPDUs (network protocol data units) of size Transmitted infrequently when movement is seldom

Yufei Cheng

Core function of DSDV

Incremental packets
Contains only information since last full dump One NPDU of size Transmitted more frequently compared to full dump

2009-10-28

DSDV Implementation

13

ITTC

Yufei Cheng

Core function of DSDV

Route Selection
Two ways to decide new route
Routes with later sequence number be preferred If same sequence number, the better metric be preferred Keep record of settling time of route-weighted average time that routes to a destination will fluctuate before receiving the route with best metric (Why?)

2009-10-28

DSDV Implementation

14

ITTC

Yufei Cheng

Core function of DSDV

Route Selection
Problem:
MH9 to MH2 has 12 hops, MH9 to MH6 has 11 hops, yet route from MH2 arrives first, the route

information will fluctuate even no movement has occurred

Solution:
Delay the advertisement of such routes by settling time

2009-10-28

DSDV Implementation

15

ITTC

Yufei Cheng

DSDV implementation
Outline
Basic function of DSDV Comparison of AODV and DSDV Direction of future work for project Conclusion

2009-10-28

DSDV Implementation

16

ITTC

Yufei Cheng

DSDV vs. AODV

DSDV
Proactive
Contains all the active links in the table Calculate the shortest path Update table when node moves Immediately knows whether node is reachable or not Data is transmitted immediately High overheads

2009-10-28

DSDV Implementation

17

ITTC

Yufei Cheng

DSDV vs. AODV

AODV
Reactive
Find route on demand Cache request from other nodes No static overhead Can not immediately transmit data Calculate the shortest path

2009-10-28

DSDV Implementation

18

ITTC

Yufei Cheng

DSDV implementation
Outline
Basic function of DSDV Comparison of AODV and DSDV Direction of future work for project Conclusion

2009-10-28

DSDV Implementation

19

ITTC

Yufei Cheng

Direction of Future Work

Dig into AODV NS-3 codes and know how it works Cut off AODV functions and leave a clean work place Push DSDV functions in piece by piece

2009-10-28

DSDV Implementation

20

ITTC

Yufei Cheng

Direction of Future Work

Work Load Distribution
Yufei: Routing
Have a clear view of both DSDV and AODV functions (partly finished) Transfer the core part of routing protocol

Hemanth: Packet & Table

Understand P & T of both DSDV and AODV Make sure they could be realized smoothly

Chris: Queue & Neighbor

Understand Q & N of both DSDV and AODV Make sure they could be realized smoothly
2009-10-28 DSDV Implementation 21

ITTC

Yufei Cheng

DSDV implementation
Basic function of DSDV Comparison of AODV and DSDV Direction of future work for project Conclusion

2009-10-28

DSDV Implementation

22

ITTC

Yufei Cheng

Conclusion
DSDV relies on periodic advertisement to keep routing table updated, it is effective for creating adhoc networks for small population of mobile nodes AODV is on-demand routing protocol and does not require node to contain complete list of routes The implementation of DSDV will base on the code of AODV in NS-3

2009-10-28

DSDV Implementation

23

ITTC

Yufei Cheng

Acknowledgements
Thanks to the help and guidance from Dr. Sterbenz, Justin, and Egemen

2009-10-28

DSDV Implementation

24

ITTC

Yufei Cheng

References
Highly Dynamic Destination-Sequenced DistanceVector Routing (DSDV) for Mobile Computers, Charles E. Perkins, Pravin Bhagwat Ad-hoc On-Demand Distance Vector Routing, Charles E. Perkins, Elizabeth M. Royer

2009-10-28

DSDV Implementation

25