Shortest and Efficient Multipath Routing in Mobile ad hoc Network (MANET)

Abstract

Objectives: In this paper, our work is intended to improve the nodes mobility within the network, as it is still in development stage. Methods/Statistical Analysis An automatic system for finding the efficient routing path is still a challenging task. In order to overcome the problem, we propose Short and Efficient Multipath Routing (SEMR) protocol which enables successful routing system by enabling minimum bandwidth in accordance with delay free networking system. Findings: This (SEMR) protocol applies on-demand routing protocols which find shortest route for communication-based on default parameters. The packet transmission consumes less packet loss ratio with minimum data rates. The implementation work is examined by means of performing simulations in NS2. Here the simulation parameters among every node were implemented based on the 802.11 standards according to the parameters. The test case is carried out with 200 nodes which compare the various factors like packet drops, testing the ability in finding the intermediate nodes, bandwidth and time delay. The best fact of Short and Efficient multipath routing (SEMR) methodology is the exchange of different parameters according to the protocol stack. It is also efficient in terms of security on finding the routes compared to the traditional or other mechanisms currently available in the industry. Application/Improvements:The SEMR protocol performance is tested with other existing protocols such as Ad-hoc On-Demand Distance Vector (AODV) and Destination –Sequenced Distance-Vector outing (DSDV). By which the obtained shows that the new scheme is free from fault tolerance with competent in achieving the networking system. Finally, the proposed system is well capable of decision making, especially in the network layers.