Dynamic Routing with Security Considerations

Now-a-days 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. Apart from that we will propose a dynamic routing algorithm 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. A clear study on the proposed algorithm is presented, and a series of simulation experiments are conducted to verify the results and to show the capability of the proposed algorithm. This algorithm is mainly proposed to improve the security 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, they unavoidably introduce substantial overheads in the Gateway/Host performance and effective network bandwidths. This routing protocol is compatible with the Routing Information Protocol which uses hop-count as its Routing metric. So there will be a limited number of hops and data transmissions are done by selecting hops randomly in a network. This improves security as well as controls traffic in the network. So, the procedure also includes using the multipath routing to select the paths to be followed. It uses the randomization process for selecting the number of hops to be selected for transforming the data. The routing table in this algorithm is based on the well-known Bellman-Ford algorithm. So, this overcomes the problems with security and traffic occurred with increase in the number of networks in these days