Dynamic Routing With Security Considerations

Abstract: Security has become one of the major issues for data communication over wired and wireless networks. To enhance the security of data transmission, existing system works on the cryptography based algorithms such as SSL, IPSec. Although IPSec and SSL accounts for great level of security, they introduce overheads. A mass of control messages exchanging also needed in order to adopt multiple path deliveries from source to destination. Different from the past work on the designs of cryptography algorithms and system infrastructures, 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 in wired networks and Destination-Sequenced Distance Vector protocol in wireless networks, without introducing extra control messages. An analytic study on the proposed algorithm is presented, and a series of simulation experiments are conducted to verify the analytic results and to show the capability of the proposed algorithm.

Keywords: dynamic routing, routing protocols, Routing Information Protocol, Destination-Sequenced Distance Vector protocol, Bellman Ford algorithm.