11-04-2015, 07:04 PM
[font=Times[/align][/color][/size][/font] New Roman][size=small][color=[align=justify]#000000]
|
srs for dynamic routing with security considerations
|
[font=Times[/align][/color][/size][/font] New Roman][size=small][color=[align=justify]#000000]
14-03-2017, 12:09 PM
Today, one of the main problems for data communication over wired and wireless networks is security. Previous work is in the designs of cryptography algorithms and system infrastructures. Apart from that we will propose a dynamic routing algorithm that could randomize the delivery routes for data transmission. The algorithm is easy to deploy and supports popular routing protocols, such as Routing Information Protocol (RIP) in wired networks and the Destination-Sequenced Distance Vector (DSDV) protocol in wireless networks, without introducing additional control messages. A clear study of the proposed algorithm is presented and a series of simulation experiments are performed to verify the results and to show the capacity of the proposed algorithm. This algorithm is mainly proposed to improve the security and overcome the existing limitations with the current cryptographic algorithms and protocols. Although some designs such as IP Security, Secure Socket Layer provide essential security, they inevitably introduce substantial overhead on Gateway / Host performance and effective network bandwidth. This routing protocol supports the routing information protocol that uses hop-count as its routing metric. So there will be a limited number of jumps and data transmissions are done by randomly selecting a network. This improves security and controls traffic on the network. Therefore, the procedure also includes the use of multi-path routing to select the routes to follow. Use the randomization process to select the number of hops to select to transform the data. The routing table in this algorithm is based on the well-known Bellman-Ford algorithm. Therefore, this overcomes the problems with security and traffic occurred with the increase in the number of networks these days.
|
« Next Oldest | Next Newest »
|
