Abstract
In general, the conventional routing approaches in mobile ad hoc networks (MANETs) provide a route between the source and the target with a minimum hop count. Dynamic source routing (DSR) as a typical prototype of routing protocols relies on the minimum hop count parameter to provide the path without considering any other factors such as energy consumption and node energy level, which significantly affect the routing algorithm performance. To enhance the performance of the DSR, a novel and efficient routing mechanism based on a hybrid approach using the minimum execution time (MET) scheduling and moth flame optimization (MFO) scheme is proposed. This hybridization version of DSR is called the (MET-MFODSR) algorithm, and it aims to improve the routing mechanism through establishing an optimal route with minimum energy consumption, which increases the network lifetime and reduces route failure issues. The proposed MET-MFODSR protocol is implemented using the MATLAB platform, analyzed and evaluated in different simulation environments. The simulation results demonstrate that the suggested routing algorithm is applicative and practicable, and its performance exceeds the performance of the existing Bee DSR (BEEDSR) and Bee-inspired protocol (BeeIP) algorithms.
Highlights
mobile ad hoc networks (MANETs) as an infrastructure-free wireless network can be defined as a nonconcentrated multi-hop remote network which consists of a collection of distributed and autonomous mobile nodes that create a temporary network
3.3.1 Scenario 1: Packet size variations analysis This scenario presents the effect of packet size variations on the performance indexes for minimum execution time (MET)-MFODSR, Bee DSR (BEEDSR), and BEEIP
The MET-MFODSR provides higher throughput than BEEDSR and BEEIP. This is because the application of the MET scheduling algorithm offers an advantage to the MET-MFODSR approach as it increases the delivery and the execution process of Figure 5 illustrates the changes in the average end-to-end delay with different packet sizes for MET-MFODSR, BEEDSR, and BEEIP
Summary
MANETs as an infrastructure-free wireless network can be defined as a nonconcentrated multi-hop remote network which consists of a collection of distributed and autonomous mobile nodes that create a temporary network. In this network, each node can move freely and randomly without predicting their movement which indicates that MANETs have a dynamic topology [1–. In the case of MANETs, there is no centralized administrative role It is a decentralized architecture, which implies that all nodes cooperate to forward data from the source to the destination [4, 5]. The routing mechanism in MANETs is one of the challenging research fields that need to be investigated and solved
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
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: EURASIP Journal on Wireless Communications and Networking
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.
