Dynamic Routing with Security Considerations
The security of the data is one of the major issues in the case of data in wireless and wired networks. a dynamic routing algorithm that could
randomize delivery paths for data transmission is discussed in this article. This is a step apart from the previous works done on cryptography algorithms and system infrastructures. This algorithm has the advantage that it is easily implementable and is very much compatible with popular routing protocols. One such protocol is the Routing Information Protocol in wired networks and Destination-Sequenced Distance Vector protocol in wireless networks. This can be achieved without introducing any extra control messages.The efficiency of the algorithm is verified by using simulations and the analytic results are verified to underline the capability of the described algorithm. a security-enhanced dynamic routing algorithm based on distributed routing information widely supported in existing networks is attempted. distance-vector algorithms and link-state algorithms are the two kinds of protocols currently used in the networks.

Get the full report here:
http://ntur.lib.ntu.edu.tw/bitstream/246...8/1/15.pdf

Reports is also posted in the previous pages of this thread. Please browse through all the pages of this thread.