Dynamic Routing with Security Considerations

Abstract:

Security has become one of the major issues for data communication over wired and wireless networks. 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.

 

Existing System:

Existing work on security-enhanced data transmission includes the designs of cryptography algorithms and system infrastructures and security enhanced routing methods. Their common objectives are often to defeat various threats over the Internet, including eavesdropping, spoofing, session hijacking. so the data are easily affect by hackers.

Proposed System:

In proposed system, a dynamic routing algorithm that could randomize delivery paths for data transmission. It 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. This is a secure routing protocol to improve the security of end-to-end data transmission based on multiple path deliveries. So the data are securely transmitted through network path.

 

Requirement Analysis:

    Software Requirements

Java1.5

Java Swing

Sql Server 2000

Windows Xp.

Hardware Requirements

         Hard disk                   :         60GB

         RAM                :        1GB

                        Processor                  :         P IV