Distributed Algorithms for Secure Multipath Routing in Attack-Resistant Networks

To proactively defend against intruders from readily jeopardizing single-path data sessions, we propose a distributed secure multipath solution to route data across multiple paths so that intruders require much more resources to mount successful attacks. Our work exhibits several important properties that include: (1) routing decisions are made locally by network nodes without the centralized information of the entire network topology, (2) routing decisions minimize throughput loss under a single-link attack with respect to different session models, and (3) routing decisions address multiple link attacks via lexicographic optimization. We devise two algorithms termed the Bound-Control algorithm and the Lex-Control algorithm, both of which provide provably optimal solutions. Experiments show that the Bound-Control algorithm is more effective to prevent the worst-case single-link attack when compared to the single-path approach, and that the Lex-Control algorithm further enhances the Bound-Control algorithm by countering severe single-link attacks and various types of multi-link attacks. Moreover, the Lex-Control algorithm offers prominent protection after only a few execution rounds, implying that we can sacrifice minimal routing protection for significantly improved algorithm performance. Finally, we examine the applicability of our proposed algorithms in a specialized defensive network architecture called the attack-resistant network and analyze how the algorithms address resiliency and security in different network settings

An enhanced Multipath Strategy in Mobile Ad hoc Routing Protocols

The various routing protocols in Mobile Ad hoc Networks follow different strategies to send the information from one node to another. The nodes in the network are non static and they move randomly and are prone to link failure which makes always to find new routes to the destination. This research mainly focused on the study of the characteristics of multipath routing protocols in MANETS. Two of the multipath routing protocols were investigated and a comparative study along with simulation using NS2 was done between DSR and AODV to propose an enhanced approach to reach the destination maintaining the QoS. A possible optimization to the DSR and AODV routing protocols was proposed to make no node to be overburdened by distributing the load after finding the alternate multipath routes which were discovered in the Route discovery process. The simulation shows that the differences in the protocol highlighted major differences with the protocol performance. These differences have been analyzed with various network size, mobility, and network load. A new search table named Search of Next Node Enquiry Table (SONNET) was proposed to find the best neighbor node. Using SONNET the node selects the neighbor which can be reached in less number of hops and with less time delay and maintaining the QoS