Shortest Path Routing Protocol in Scalable Mobile Ad Hoc Networks on Demand Dynamic Randomized Source

Abstract: Increasing the number of nodes in any wireless and mobile ad hoc network environment give birth to various issues such as higher power consumption, minimized data security, degraded QoS (quality of service) and security. Especially networks without having a centralized system (MANETS) is facing severe security issues. There is a major security issue in the malicious nodes while finding the shortest path. In our proposed paper, a simple hybrid AODSR algorithm is developed to find the shortest path routing in a dynamic network. The algorithm used is an efficient coding scheme which traces the malicious nodes length, which depends on the number of nodes in the network. The aim of this paper is to propose an algorithm to find a secure shortest path against malicious nodes. Keywords: MANET, Shortest Path, routing protocol, malicious nodes, PDR, End-to-End delay etc.