Design & Implementation of Dynamic Routing In Wireless Networks

K.V.Satish Reddy M.Tech (W.M.C) 09881D6513

Objective


Security Enhanced Dynamic Routing methodology in Wireless Networks. Performance Evaluation of various Dynamic Routing methodologies.

Internetwork Security


Design of Cryptography based System.

 

IP Security SSL

 

System Infrastructures. Security Enhanced Routing Methods.

Routing Methods


Two forms of Routing in Packet Switching Networks.

 

Static Routing Dynamic Routing

  

Routing Table. Routing Algorithms. Routing Protocols.

What is Routing?
10.120.2.0 E0 S0 172.16.1.0 S1

Source

Destination

Packet

Network Protocol Connected Learned

Destination Network 10.120.2.0 172.16.1.0 172.17.1.0

Exit Interface E0 S0 S1

Routers must learn destination network that are not directly connected.

Internetwork Routing


Intra-domain routing.


Distance vector algorithms



Protocols


(RIP,DSDV)

Link state algorithms



Protocol


(OSPF)

Inter-domain routing.


Path vector algorithms



Protocol


(BGP)

Data Switching over Internetwork

Data
10.120.2.0

Source

Data
A

Data

Data

Destination

Data
 

172.16.1.0

Circuit Switching Store and Forward Switching

 

Message Switching Packet Switching

 

Datagram service Virtual Circuit Services

1. STATIC ROUTING


Manually Configured Routing. Used in Small Networks. Monitoring data Continuously. Secure Data transfer.

Manually Path is selected

Static Routing Execution Model

Select file to send. File is Encrypted.

Select path to send file. Enter private key for security.

Static Routing Execution Model

Enter path to receive. Enter Private Key.

Received File is Encrypted. Decrypt to get original file sent.

2. DYNAMIC ROUTING


 

Use of Algorithms and Protocols for configuring the network to route data. Large Networks we go for Dynamic Routing. Secure Routing over large networks. Routing Protocols such as (RIP,OSPF,BGP,DSDV and AODV).

2.1 SPRA Dynamic Routing



SPRA- Shortest Path Routing Algorithm. Based on Link state Algorithm used over OSPF protocol. One path with Minimal Cost is selected using Dijkstra Algorithm.

R2
5

R3
2 11 14

R6

R4
9 10 15

R1
1

R5

Network for SPRA

1. Select the source node. Ex (H7) 2. Select the destination node. Ex (H12) 3. Click SPRA to route the data from source node H7 to destination node H12.

 Data route path when SPRA is clicked.

 Data route path when SPRA is clicked.

2.2 ECMP Dynamic Routing



ECMP- Equal Cost MultiPath Routing Algorithm. Based on Distance vector Algorithm used over RIP protocol. More than one path is selected for routing the data.

R2
5 9 11

R3
2

R6

14

R4
9 10 15

R1
1

R5

Network for ECMP

1. Select the source node. Ex (H7) 2. Select the destination node. Ex (H14) 3. Click ECMP to route the data from source node H7 to destination node H14.

 Data route path when ECMP is clicked.

 Data route path when ECMP is clicked.

3. Dynamic Routing In Ad-Hoc Network



All nodes are mobile and are connected dynamically. Every node acts as router and forward traffic. AODV algorithm follows single path routing of data. MARA algorithm follows multiple path routing of data.

Source Destination R2 R3 R3 R2 R6

AODV MARA
R4

R6

R4 R5 R1

R1 R5 Destination

Source

 Network changes instantly in Mobile Ad-hoc Network.

 Network changes instantly in Mobile Ad-hoc Network.

 Network changes instantly in Mobile Ad-hoc Network.

 Data route path when AODV is clicked.

 Data route path when MARA is clicked.

4. Eavesdropping of packets over Internetwork



As the packets are transferred in streams in the above existing algorithms, packets are dropped at instances while routing to destination. Eavesdropping, Spoofing and Session hijacking are some of the attacks on internetwork.

Eavesdropping of packets over Internetwork

Source

Eavesdropper

Destination

Stream of packets are eavesdropped over a specific link (R3-R2).

Eavesdropping of packets Execution Model

Enter the Packets to send from source to destination.

Packets at Router end

5. Existing Systems Disadvantages



 

 

The discovery of paths in an online fashion with extra control signals exchanging with neighboring nodes. Having the same route for consecutive packets. Easy to predict the data transfer path and having the possibility of loss of data. Route discovery latency. Various security threats over internet like Spoofing, Session hijacking and Eavesdropping of packets.

6. DDRA Dynamic Routing



DDRA- Distributed Dynamic Routing Algorithm. Based on Distance vector algorithm compatible with the popular routing protocols RIP and DSDV. Every consecutive packet routed to different node to its former packet to reach destination.

Network for DDRA

Source Node 6 Node 4 Node 1

Node 7 Node 3

Node 9

Node 5

Node 2 Node 10 Destination

Node 8

Routing Table
Destination Node (t) a) Normal Routing table of a distance vector based routing algorithm. b) Extended Routing table of a security enhanced routing algorithm. Destination Node (t) N1 N2 N3 . . Cost 4 5 7 . . Next hop Candidates {N6,N9,N4) {N8,N4} {N6} . . (b) N1 N2 N3 . . Cost 5 2 3 . . Next hop N5 N7 N4 . .

(a) History record of packet deliveries to destination node t {(N2,N6),(N7,N9),(N3,N4).} {(N5,N8),(N10,N8),(N6,N4)} {(N4,N6),(N2,N6),(N9,N6).} . .

Flowchart for DDRA

Source Node Routing table & Link table for Security enhanced routing alg Checks for next node to select

Next Node No Checks for next node to select Yes Destination Node

Selects the random & efficient path dynamically

Network for DDRA (Model-1)

Source Node 6 Node 4 Node 1

Node 7 Node 3

Node 9

Node 5

Node 2 Node 10 Destination

Node 8

DDRA Execution Model

(Distributed Dynamic Routing Algorithm)
1. Login to server node. Ex (node1) 2. Here server node is the source end. 3. As distributed data routing we see one source node and multiple client nodes to reach destination node.

Enter the Client Nodes

 Enter client nodes. Ex (node2,3,5)  Here client node 2 is our destination node.

Client Nodes Connection

 All client nodes used are connected to server node.

Links between Server and Clients Nodes

 Link cost of all client nodes to server node.

Network for DDRA

Source Node 6 Node 4 Node 1

Node 7 Node 3

Node 9

Node 5

Node 2 Node 10 Destination

Node 8

Transfer of File from Source to Destination Node

 Select file to transfer from source to destination node.

Consecutive Packets routed to Different Client Nodes

 Selected File is divided in to 21 packets & consecutive Packets are distributed between client nodes 2,3 & 5 at server node 1 and routed.

Packets Received at Node- 3,5 &2

Some Packets are routed directly to node 2 (destination node) from node 1 and other packets via node 3 & 5.

File taken at node 1 for routing

Nodes 3 & 5 starts routing to Destination node 2

 Packets received to nodes 3 & 5 are routed to the destination node 2 .

All Packets reached to destination node 2

 All Packets received at destination node 2 Via nodes 1, 3 & 5 .

File received to destination node 2

 File transferred from source node 1, received at the destination node 2 .

Network for DDRA (Model-2)

Source Server Client-A Client-D

Client-B

Client-C

Client-F Client-H

Client-G

Destination

Path Selection of Dynamic Routing Algorithms D.D.R.A E.C.M.P S.P.R.A (S.P.R.A),(E.C.M.P) & (D.D.R.A)
Source

Destination

Destination
A

Source

Destination
E

7. Path Similarity of Dynamic Routing Algorithms

1. DDRA based methodology greatly outperform SPRA and ECRA for all l (length of the minimal-cost path) values. 2. The average path similarity for SPRA, ECRA, and DDRA increase as l increases. The increasing rates for SPRA and ECRA are much larger than those for DDRA especially when l is large. 3. DDRA shows wide path variation as the data is distributed.
A ve rage P ath S im ilarity 7 S PRA E CM P D DR A 6

0.5

1.5 2 2.5 3 3.5 Length of The M inim al C os t P ath (l)

4.5

8. Throughput of Dynamic Routing Algorithms

1. The throughput will be degraded when the number of TCP flows increases (i.e., the traffic load) having same bandwidth & traffic load on all paths.
Th roughput 10 9 8 7 6 5 4 3 S PRA E CM P D DR A

2. Multiple paths increase the throughput of data transmission. 3. The performance of DDRA on the throughput is superior as compared with that of ECRA and SPRA.

2 1 0

4 5 6 7 TCP F low s (Traffic Load)

10

9. Proposed System Advantages

   

Consecutive packets are routed dynamically. Less path similarity of packets transferred. Better throughput due to path variation of packets. The discovery of paths in an offline fashion, as history of packet deliveries are maintained. Probability of packet loss due various security attack like eavesdropping of packets is less.

10. Conclusion & Future Scope



Dynamic routing algorithm is completely orthogonal to the work based on the designs of Cryptography algorithms and System Infrastructures. Our Security enhanced dynamic routing could be used with cryptography based system designs to further improve the security of data transmission over networks.

11. References
 

W. Lou and Y. Fang, A Multipath Routing Approach for Secure Data Delivery, Proc. IEEE Military Comm. Conf. (MilCom). J.Yang and S. Papavassiliou, Improving Network Security by Multipath Traffic Dispersion, Proc. IEEE Military Comm. Conf. (MilCom). S. Bohacek, J.P. Hespanha, K. Obraczka, J. Lee, and C. Lim,Enhancing Security via Stochastic Routing, Proc. 11th Intl Conf.Computer Comm. and Networks (ICCCN). I. Gojmerac, T. Ziegler, F. Ricciato, and P. Reichl, Adaptive Multipath Routing for Dynamic Traffic Engineering, Proc. IEEE Global Telecommunications Conf. (GLOBECOM). W. Lou, W. Liu, and Y. Fang, SPREAD: Improving Network Security by Multipath Routing, Proc. IEEE Military Comm. Conf. (MilCom). J.F. Kurose and K.W. Ross, Computer NetworkingA Top-Down Approach Featuring the Internet. Addison Wesley.

Thank U All