Monthly Archives: April 2010

Secure Multipath Adaptive Routing Protocol

Locally multipath adaptive routing (LMAR) protocol, classified as a new reactive distance vector routing protocol for MANETs is proposed in this paper. LMAR can find an ad-hoc path without selfish nodes and wormholes using a random search algorithm in polynomial-time. Also when the primary path fails, it discovers an alternative safe path if network graph remains connected after eliminating selfish/malicious nodes. The main feature of LMAR to seek safe route free of selfish and malicious nodes in polynomial time is its searching algorithm and flooding stage that its generated traffic is equiloaded compared to single-path routing protocols but its ability to bypass the attacks is much better than the other multi-path routing protocols. LMAR concept is introduced to provide the security feature known as availability and a simulator has been developed to analyze its behavior. Efficiency of the route discovery stage is analyzed and compared with the previous algorithms.

Locally Multipath Adaptive Routing Protocol Resilient to Selfishness and Wormholes