Abstract
In this study, we have proposed a multipath routing protocol for Mobile Ad Hoc Networks. Multipath routing overcomes various problems that occur in data delivery through a single path. The proposed protocol selects multiple neighbor nodes of source node to establish multiple paths towards destination. These nodes are selected based on their minimum remaining distance from destination. We have computed the length of various paths and average hops count for different node density in the network. We have considered only three paths for our evaluation. The results show that path-2 gives better results in term of hop count and path length among three paths.
Highlights
INTRODUCTIONA Mobile Ad-hoc Network (MANET) (Siva and Manoj, 2008; Ram and Redi, 2002) is an interconnection of autonomous mobile hosts (mobile devices i.e., mobile phone, laptop, iPod, PDAs etc.) that can communicate without any support of infrastructure
A Mobile Ad-hoc Network (MANET) (Siva and Manoj, 2008; Ram and Redi, 2002) is an interconnection of autonomous mobile hosts that can communicate without any support of infrastructure
Battery power of mobile device is important in the network because depletion of battery power may result in partition of the network
Summary
A Mobile Ad-hoc Network (MANET) (Siva and Manoj, 2008; Ram and Redi, 2002) is an interconnection of autonomous mobile hosts (mobile devices i.e., mobile phone, laptop, iPod, PDAs etc.) that can communicate without any support of infrastructure. Otherwise intermediate nodes help to relay data from source to destination. The mobility nodes, impacts the topology of the network. Due to dynamic topology (Marjan et al, 2012) of the network routing in MANET is a challenging issue. Single path routing is not always sufficient to disseminate data toward destination. In this study we have proposed a multipath protocol assuming that there are k (k = 1, 2, 3...) paths between source and destination pair. For the analysis of the protocol we have computed average path lengths of various paths and hop count. Through this we want to find best possible three paths among k paths based on minimum hop count and minimum path length
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Research Journal of Applied Sciences, Engineering and Technology
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
