Consideration with Dynamic Routing Security - International Journal ...

Visweswara Rao,,Int.J.Computer Technology & Applications,Vol 3 (2), 592-606 

ISSN:2229-6093 

Consideration with Dynamic Routing Security 

VISWESWARARAO BOLLA, 

Research Scholar, Department of computer science, Mother Theresa Institute of Science&Technology,Sankiteka 

nagar, Sathupally, khammam, A.P, India. 

E_Mail:bvissumtech.rao6@gmail.com 

Sri D.PAVANKUMAR 

Associate professor,Department of computer science, Mother Theresa Institute of Science&Technology,Sankiteka 

nagar, Sathupally, khammam, A.P, India. 

Abstract 

One of the major issues for data 

communication over wired and 

wireless networks is the security. the 

past work is on the designs of 

cryptography algorithms and system 

infrastructures. Dynamic routing 

algorithm called improved dynamic 

routing with security consideration, 

which is based on the concept of Zone 

Routing Protocol (ZRP) that could 

randomize delivery paths for data 

transmission. The algorithm is easy to 

implement and compatible with 

popular routing protocols, such as the 

Routing Information Protocol (RIP) in 

wired networks and Destination- 

Sequenced Distance Vector (DSDV) 

protocol in wireless networks, without 

introducing extra control messages. 

This algorithm is mainly proposed to 

improve the and to overcome the 

limitations existing with the present 

cryptographic algorithms and 

protocols. Although some designs like 

IP security, Secure Socket Layer 

provide essential security, E-Mail 

security 

they 

unavoidably introduce substantial 

overheads in the Gateway/Host 

performance and effective network 

bandwidths. 

Key words: 

Dynamic Routing, ZRP, DSDV, RIP, 

Secure socket Layer, Bellman Ford 

Algorithm 

INTRODUCTION 

In the past decades, various 

security enhanced measures have 

been proposed to improve the security 

and to control traffic of data 

transmission over public networks. 

Existing work on securityenhanced 

– data transmission includes 

the designs of cryptography 

algorithms and system infrastructures 

and security enhanced routing 

methods and techniques. Their 

common objectives are often to defeat 

various threats 

over the Internet, including 

eavesdropping, session hijacking, etc. 

Among many well-known designs for 

the systems based on cryptography, 

592


ISSN:2229-6093 

the IP Security (IPSec) and the Secure 

Socket Layer (SSL) are popularly 

supported and implemented in many 

systems and platforms. Although 

IPSec and SSL do greatly improve the 

security level for data transmission, 

they introduce over heads, especially 

on gateway/host performance and 

effective network bandwidth which 

are For example, the data 

transmission overhead is 6 cycles/byte 

over an Intel Pentium II with the 

Linux IP stack alone, and the 

overhead increases to 62 cycles/byte 

when Advanced Encryption Standard 

(AES) is used for 

encryption/decryption for IPSec. 

Another alternative for security 

enhanced data transmissions is to 

dynamically route packets between 

each source and its destination so that 

the chance for system break-in, due to 

successful interception of consecutive 

packets for a session, is low. The 

intention of security-enhanced routing 

is different from the adopting of 

multiple paths between a source and a 

destination (say server to client for 

example) to increase the throughput 

of data transmission. A secure routing 

protocol is proposed to improve the 

security of end-to-end data 

transmission based on multiple path 

deliveries. The set of multiple paths 

between each source and its 

destination is determined in an online 

fashion, and extra control message 

exchanging is needed and a secure 

stochastic routing mechanism is 

proposed to improve routing security. 

Similar to the work proposed by an 

engineer a set of paths is discovered 

for each source and its destination in 

an online fashion based on message 

flooding. Thus, there is a need of 

mass of control messages. Yang and 

Papavassiliou explored the trading of 

the security level and problems with 

the traffic dispersion. They proposed 

a traffic dispersion scheme which will 

help in reducing the probability of 

eavesdropped information along the 

used paths provided that the set of 

data delivery paths is discovered in 

advance. Although excellent research 

have been proposed for securityenhanced 

routing, many of them rely 

on the discovery of multiple paths 

either in an online or offline fashion. 

For 

those online path searching 

approaches, the discovery of multiple 

paths involves a number of control 

signals over the World Wide Web 

(Internet). On the other hand, the 

finding of paths in an offline fashion 

might not be to networks with a 

dynamic changing configuration. So, 

we will propose a dynamic routing 

algorithm which is very effective in 

providing security data delivery 

without introducing any extra control 

messages. 

SECURE SOCKET LAYER 

In Secure Socket Layer we 

concern with the implementation of 

the client and server entities and the 

SSL transaction between respective 

client and server. This transaction 

593


ISSN:2229-6093 

comprises of the authentication, key 

exchange and large data transfer. Our 

implementation ensures secure and 

reliable communication (message 

exchange) and data transfer (files) 

between the two entities. Now-a-days 

Information is one of the most 

valuable resources in the world. 

Whether it is a personal letter or an 

industrial secret, all information or 

data has a worth to someone. This 

considers issues of security and 

privacy for such information or data 

that is stored. It discusses the reasons 

for wishing to provide security for the 

data and the methods available for 

doing so. For secure transferring of 

information between the sockets at 

distant places which mainly requires 

security so that the message or data 

may not be tampered while it has been 

transferred. When a client and server 

communicate with each other, SSL 

ensures that the connection is private 

and secure by providing 

authentication and encryption. 

Authentication confirms that the 

server and the client are trustworthy. 

Encryption then creates a secure 

“tunnel” between the two, which 

prevents any unauthorized system 

from reading the data. SSL enabled 

clients (such as a Netscape or 

Microsoft browser) and SSL-enabled 

servers (such as Apache or IIS) 

confirm each other’s identities using 

digital certificates. Digital certificates 

are issued by trusted third parties 

called Certificate Authorities (or CAs) 

and provide information about an 

individual’s claimed identity, as well 

as their public key. By validating 

digital certificates both parties can 

ensure that an imposter has not 

intercepted a transmission. 

Bellman Ford Algorithm 

Bellman-Ford algorithm computes 

single source shortest paths in a 

weighted digraph. For graphs with 

only non-negative edge weights, the 

faster Dijkstra's algorithm also gives 

solution to the problem. Thus, 

Bellman–Ford is used for graphs with 

negative edge weights. 

Bellman–Ford’s basic structure is 

very similar to Dijkstra's algorithm, 

but instead of greedily selecting the 

minimum-weight node not yet 

processed to relax, it simply relaxes 

all the edges, and does this |V | − 1 

times, where |V | is the number of 

vertices in the graph. The repetitions 

allow minimum distances to 

accurately propagate throughout the 

graph, since, in the absence of 

negative cycles, the shortest path can 

only visit each node at most once. 

Unlike the greedy approach, which 

depends on some specific structural 

assumptions derived from positive 

weights, this straightforward approach 

extends to the general case. 

procedure BellmanFord(list vertices, 

list edges, vertex source) 

// This implementation takes in a 

graph, represented as lists of vertices 

594


ISSN:2229-6093 

// and edges, and modifies the 

vertices so that their distance and 

// predecessor attributes store the 

shortest paths. 

// Step 1: initialize graph 

for each vertex v in vertices: 

if v is source then v.distance := 0 

else v.distance := infinity 

v.predecessor := null 

// Step 2: relax edges repeatedly 

for i from 1 to size(vertices)-1: 

for each edge uv in edges: // uv is 

the edge from u to v 

u := uv.source 

v := uv.destination 

if u.distance + uv.weight < 

v.distance: 

v.distance := u.distance + 

uv.weight 

v.predecessor := u 

// Step 3: check for negative-weight 

cycles 

for each edge uv in edges: 

u := uv.source 

v := uv.destination 

if u.distance + uv.weight < 

v.distance: 

error "Graph contains a 

negative-weight cycle" 

Routing Information Protocol (RIP) 

The Routing Information Protocol 

(RIP) is a dynamic routing protocol 

used in local and wide area networks. 

As such it is classified as an interior 

routing algorithm. It was first defined 

in RFC 1058 (1988). The protocol has 

since been extended several times, 

resulting in RIP Version 2 (RFC 

2453). Both versions are still in use 

today, however, they are considered 

technically obsolete by more 

advanced techniques, Open Shortest 

Path First (OSPF) and the OSI 

protocol IS-IS. RIP has also been 

adapted for use in IPv6 networks, a 

standard known as RIPng. 

. 

Destination-Sequenced Distance 

Vector routing 

Destination-Sequenced Distance- 

Vector Routing (DSDV) is a tabledriven 

routing scheme for ad hoc 

mobile networks based on the 

Bellman-Ford algorithm. It was 

developed by C. Perkins and 

P.Bhagwat in 1994. The main 

contribution of the algorithm was to 

solve the Routing Loop problem. 

Each entry in the routing table 

contains a sequence number, the 

sequence numbers are generally even 

if a link is present; else, an odd 

number is used. The number is 

generated by the destination, and the 

emitter needs to send out the next 

update with this number. Routing 

information is distributed between 

nodes by sending full dumps 

infrequently and smaller incremental 

updates more frequently. 

Advantage: 

DSDV was one of the early 

algorithms available. It is quite 

suitable for creating ad hoc networks 

595


ISSN:2229-6093 

with small number of nodes. Since no 

formal specification of this algorithm 

is present there is no commercial 

implementation of this algorithm. 

Many improved forms of this 

algorithm have been suggested. 

Multipath routing 

Current routing schemes typically 

focus on discovering a single 

"optimal" path for routing, according 

to some desired metric. Accordingly, 

traffic is always routed over a single 

path, which often results in substantial 

waste of network resources. Multipath 

Routing is an alternative approach 

that distributes the traffic among 

several "good paths instead of routing 

all traffic along a single "best" path. 

Equal-cost multi-path (ECMP) is a 

routing technique for routing packets 

along multiple paths of equal cost. 

The forwarding engine identifies 

paths by next-hop. When forwarding 

a packet the router must decide which 

next-hop (path) to use. 

Zone Routing Protocol 

The Zone Routing Protocol (ZRP) 

was introduced in 1997 by Haas and 

Pearlman. It is either a proactive or 

reactive protocol. It is a hybrid 

routing protocol. It combines the 

advantages from proactive (for 

example AODV) and reactive routing 

(OLSR). It takes the advantage of proactive 

discovery within a node's local 

neighbourhood (Intrazone Routing 

Protocol (IARP)), and using a reactive 

protocol for communication between 

these neighbourhoods (Interzone 

Routing Protocol(IERP)). The 

Broadcast Resolution Protocol (BRP) 

is responsible for the forwarding of a 

route request. It shown in the Fig 1. 

Zrp divides its network in different 

zones. That's the nodes local 

neighbourhood. Each node may be 

within multiple overlapping zones, 

and each zone may be of a different 

size. The size of a zone is not 

determined by geographical 

measurement. It is given by a radius 

of length, where the number of hops 

is the perimeter of the zone. Each 

node has its own zone. radius=2-Hop 

E, D, B, J, E and H are border-nodes 

Fig 1 Zone Routing Protocol 

596


ISSN:2229-6093 

Before constructing a zone and 

determine border nodes, a node needs 

to know about its local neighbors. A 

node may use the media access 

control (MAC) protocols to learn 

about its direct neighbors. It also may 

require a Neighbor Discovery 

Protocol (NDP).ZRP does not strictly 

specify the protocol used but allows 

for local independent 

implementations. NDP relies on the 

transmission of hello messages by 

each node. When the node for 

example node A gets a response from 

a node B which has received the 

"Hello"-messages, the node A notice 

that it has a direct point-to-point 

connection with that node B. 

PROBLEM ANALYSIS 

A security-enhanced dynamic 

routing algorithm based on distributed 

routing information widely supported 

in existing networks. In general, 

routing protocols over networks could 

be classified roughly into two kinds: 

distance-vector algorithms and linkstate 

algorithms 

Distance-vector algorithms rely on 

the exchanging of distance 

information among neighboring nodes 

for the seeking of routing paths. 

Examples of distance-vector based 

routing algorithms include RIP and 

DSDV. Link-state algorithms used in 

the Open Shortest Path First protocol 

[19] are for global routing in which 

the network topology is known by all 

nodes. Our goal is to propose a 

distance-vector-based algorithm for 

dynamic routing to improve the 

security of data transmission. Before 

further discussions, our problem and 

system model shall be defined. 

Notations and Data Structures 

We propose to rely on existing 

information exchanged among 

neighboring nodes (referred to as 

routers as well in this paper) for the 

seeking of routing paths. In ZRP .each 

node Ni maintains a routing table (see 

Table 1a) in which each entry is 

associated with a tuple (t,WNi,t‚ 

Nexthop), where t, WNi, t, and Next 

hop denote some unique destination 

node, an estimated minimal cost to 

send a packet to t, and the next node 

along the minimal-cost path to the 

destination node, respectively. With 

the objective of this work in the 

randomization of routing paths, the 

routing table shown in Table 1a is 

extended to accommodate our 

security-enhanced dynamic routing 

algorithm. In the extended routing 

table (see Table 1b), we propose to 

associate each entry with a tuple (t, 

WNi,t‚CtNi,HtNi) CtNi is a set of 

node candidates for the next hop (note 

that the candidate selection will be 

elabo-rated in Procedure 2 of Section 

3.2), where one of the next hop 

candidates that have the minimal cost 

is marked. HtNi a set of tuples, 

records the history for packet 

deliveries through the node Ni to the 

destination node t. Each tuple (Nj,hNj 

597


ISSN:2229-6093 

module was immediately modified to 

make it error free. The test cases used 

to evaluate the system are given 

below: 

1. Test Case: When a link/node failure 

is occurred. 

Expected Result : When a link/node 

failure is occurred, the data packets 

are transmitted by using the backup 

route. 

2. Test Case : When a link/node 

failure is recovered. 

Expected Result : When a link/node 

failure is recovered, the data packets 

are transmitted by using the original 

route. 

EXPERIMENTAL RESULTS 

The simulation of Secure Hybrid 

broadcast Routing Protocol was 

conducted in NS-allinone-2.34, on an 

Intel core i3 processor and 1 GB of 

RAM running Ubuntu10.0 Lts. 

A. Network topology 

In the proposed Network scenario, 

we simulated two types of field 

configurations: 50 nodes distributed 

over a 700m x 700m terrain and 50 

nodes over a 1200m x 1200m terrain. 

Node transmission range was taken to 

be 250m. The initial positions of the 

nodes were random. Node mobility 

was simulated according to the 

random waypoint mobility model, in 

which each node travels to a 

randomly selected location at a 

configured speed and then pauses for 

a configured pause time, before 

choosing another random location and 

repeating the same steps. We ran 

simulations for a constant node speeds 

of 0, 1, 5…and 10 m/s, with pause 

time fixed at 30 seconds. 

B. Simulation Results and Analysis 

In this section we present and 

analyse the observed results for each 

of the performance metric discussed 

in the previous section under the 

network and security setup. The 

resulting data were plotted using Gnu 

plot. Each data point in the resulting 

graphs is an average of simulations 

runs with identical configuration but 

different randomly generated mobility 

patterns. To compare the 

performances of the protocols, the 

following metrics are used. Packet 

delivery ratio: The ratio of the data 

packets successfully delivered at 

destination. 

i. Average Packet Delivery ratio 

Figure below shows the observed 

results for average packet delivery 

fraction for both the networks. As 

shown in the figure, the packet 

delivery fraction obtained using 

Hybrid Routing with Security 

Consideration (HBRA) is above 96% 

in all scenarios and almost identical or 

higher than that obtained using ZRP. 

This suggests that HBRA is highly 

effective in discovering and 

maintaining routes for delivery of data 

packets, even with relatively high 

node show the experimental results 

of the throughput under different 

traffic loads 

601


ISSN:2229-6093 

FIG1: E½SimPSl _ for AT&T US topology 

602


ISSN:2229-6093 

FIG2: Effect of l on available paths for AT&T US and DANTE Europe topoliges 

. 

603


ISSN:2229-6093 

Shows the experimental results of 

E½ SimPSlDDRA_with_Randomized 

Selector, DDRA without Randomized 

Selector, ECRA, and SPRA under the 

AT&T topology. From this figure, we 

observe that our DDRA-based 

methodologies greatly outperform 

SPRA and ECRA for all l values 

under investigation,1 1hich indicates 

that our DDRA provides larger path 

variation and, thus, more secure 

packet routing. Also, the E½SimPSl _ 

values for SPRA, ECRA, and 

DDRA_without_Randomized 

Selector increase as l increases.The 

increasing rates for SPRA and ECRA 

are much larger than those for 

DDRA_without_RandomizedSelector 

especially when l is large. 

Specifically, the E½SimPSl _ value 

for SPRA is the same as the length of 

minimal-cost path because all packets 

always go through the minimal-cost 

path between source-destination 

pairs.Onthe other hand,whenl 

increases, E½SimPSl _ for 

DDRA_with_RandomizedSelector 

increases and then decreases. For all l 

values, the performance of 

DDRA_with_Randomized Selector is 

better than that of 

DDRA_without_RandomizedSelector 

. The RandomizedSelector can 

prevent from selecting the previous 

nexthop for the current packet 

delivery and therefore avoids that 

consecutive packets are transmitted to 

the same nexthop 

Fig. shows the impact of l on the 

average number ðANÞ of available 

paths for each source-destination pair 

in AT&T US and DANTE Europe 

topologies. The figure indicates that 

AN increases as increases. Also, we 

observe that for a fixed l, there are 

more available paths in the AT&T US 

topology that those in the DANTE 

Europe topology. The reason is that 

the average number of links between 

the nodes in the AT&T US topology 

is larger than that in the DANTE 

Europe topology.Thus, 

more nexthop candidates can be 

selected in the AT&T US topology 

than in the DANTE Europe topology 

while packets are transmitted over the 

network by using our proposed 

security-enhanced dynamic routing 

algorithm. 

604


ISSN:2229-6093 

CONCLUSIONS 

FUTUREWORK 

AND 

References 

The simulation results for 

Hybrid broadcast Routing with 

Security Consideration under different 

mobility patterns and traffic scenarios 

show that the proposed protocol is as 

efficient as ZRP in discovering and 

maintaining routes. However, the 

impact of the overhead caused is 

almost insignificant and negligible as 

compared to the proposed degree of 

security, which provides compared to 

its other counterparts. 

The advantages of a multipath 

approach are clearly exemplified. We 

can conclude that the multipath 

approach can increase confidentiality. 

[1]. C. Siva Ram Murthy and B. S 

Manoj, “AdHoc Wireless Networks, 

Architecture and Protocols”, Prentice 

Hall PTR, 2004. 

[2]. Stefano Basagni, Macro Conti, 

Silvia Giordano andIvan Stojmenovic, 

“Mobile Ad Hoc Networks”, IEEE 

press, A john Wily & Sons, INC. 

publication, 2003. 

[3]. Haas Z. J., Pearlman M. R., and 

Samar P., “The Zone Routing 

Protocol(ZRP)”,IETF Internet Draft, 

draft-ietf-manet-zone-zrp-04.txt, July 

2002. 

[4]. Jan Schaumann, “Analysis of 

Zone Routing Protocol”, Course 

CS765, Stevens Institute of 

Technology Hoboken, New Jersey, 

USA, 8th December 2002. 

[5]. George Aggelou,“Mobile Ad Hoc 

Networks”, 2nd edition, Mc GRAW 

Hill professional engineering,2004. 

[6]. T.H. Cormen, C.E. Leiserson, and 

R.L. Rivest, Introduction to 

Algorithms. MIT Press, 1990. 

605


ISSN:2229-6093 

[7]. I. Gojmerac, T. Ziegler, F. 

Ricciato, and P. Reichl, “Adaptive 

Multipath Routing for Dynamic 

Traffic 

[8].willam stallings cryptography and 

network security fourth edition 

[9]. Bellman, Richard (1958), "On a 

routing problem", Quarterly of 

Applied Mathematics 16: 87–90, 

MR0102435. 

606

Consideration with Dynamic Routing Security - International Journal ...

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?