Secure Routing Algorithm to minimize the number of Intermediate Nodes in Unicast Network with Multiple Streams

Abstract

Linear Network coding is a technique which can be used to improve the network's efficiency, throughput and scalability as well as resilience to attacks and eavesdropping. Instead of relaying the packets of information received, the intermediate nodes of a network take several packets and combine them together for transmission thereby attaining maximum information flow in the network. However for secure data transmission, minimizing the number of intermediate nodes on multiple streams between the same source and destination pair is a real challenge. This paper aims to develop a secure routing algorithm that minimizes the number of intermediate nodes and maximizing transmission data rate using random linear transformation. This paper also focuses on utilizing the network coding scheme for defending active attacks particularly a wormhole attack using dynamic redundancy algorithm.