A Study of MANET Routing Protocols in Heterogeneous Networks: A Review and Performance Comparison
Abstract
:1. Introduction
1.1. Heterogeneous MANET Environment
1.2. Research Challenges
1.3. Research Scope and Contributions
- Comparative analysis of MANET routing protocols in heterogeneous environments: We thoroughly review and compare the performance of four selected MANET routing protocols (AODV, OLSR, BATMAN, and DYMO) in a heterogeneous MANET. To this end, we analyze the impact of various node types on the QoS parameters, such as the end-to-end delays, throughput, and packet delivery ratios. We provide insights into the performance of the routing protocols in heterogeneous networks.
- Evaluation of the node types impacting the QoS parameters: This study highlights the significance of the node heterogeneity in MANETs and its effect on the system performance. Using the simulator, we measure the QoS metrics for heterogeneous nodes, thereby informing future implementations of MANETs in real-world applications.
- Guidance for next-generation wireless networks: The findings of this research offer valuable insights that can assist network researchers and engineers in developing next-generation wireless networks capable of accommodating heterogeneous networking constraints. By understanding the performance issues associated with various MANET routing protocols, this paper contributes to the ongoing advancement of efficient and robust wireless communication systems.
1.4. Structure of the Paper
2. MANET Routing Protocols: Background and a Review of the Literature
2.1. MANET Classification
- Reactive (on-demand) routing protocol: Reactive protocols look to set up routes that are available on-demand. Suppose nodes want to establish a communication channel with a node with no path. In that case, these routing protocols will try to develop a route connecting two nodes to engage in communication [16]. Every node in a reactive routing protocol obtains a route to a destination in an on-demand fashion, which means that a source node demands a path to the destination when it is needed. Reactive protocols do not maintain up-to-date routes to any destination in the network and do not generally exchange periodic control messages. Reactive protocols were designed to reduce the overheads in proactive protocols by maintaining information for active routes only. The performance of the AODV protocol has been a focal point of MANET research, particularly regarding its application in heterogeneous environments. The authors of [27] enhanced the AODV protocol specifically for heterogeneous MANETs, demonstrating that modifications to routing mechanisms can significantly improve network performance. Their findings suggest that adopting AODV to consider node capabilities, such as the transmission rates and mobility patterns, can lead to reduced end-to-end delay and increased throughput.
- Proactive (table-driven) routing protocol: Every node in the network has one or more routes to any possible destination in its routing table at any given time. Each node maintains routing information concerning every other node (or nodes located in a specific part) in the network. The emphasis behind proactive protocols is that control messages are exchanged between nodes periodically [28,29]. Messages can be sent to inform and enable nodes to know their local network, exchanging knowledge of the network topology amongst all the nodes within a network. The authors of [30] conducted a comprehensive survey of the routing protocols in MANETs, highlighting the inherent challenges and solutions associated with different protocols. Their study outlines how the dynamic nature of MANETs, characterized by node mobility and varying transmission capabilities, complicates routing decisions. They emphasize that a robust understanding of the operational environment and the characteristics of the nodes is critical to optimizing the protocol performance. The advantage of proactive protocols is that the required routes are immediately available. Still, the downside of this is that the bandwidth suffers due to the flooding of control messages and periodic updates of the network topology amongst the nodes locally.
- Hybrid routing protocols: Hybrid routing protocols are a combination of both distance-vector routing and link-state routing. Hybrid protocols aim to work out the kinks that both distance-vector and link-state protocols have by having the ability to choose which protocol is most suitable for use [31,32]. Every node acts reactively in the region close to its proximity and proactively outside that region or zone. Hybrid protocols are a new generation of protocols that are both proactive and reactive in nature. This protocol is designed to increase the scalability by allowing the nodes near each other work together to form a backbone to reduce the route discovery overheads.
2.2. MANET Routing Protocols Considered
- AODV routing protocol: AODV is a reactive routing protocol that combines with the DSR (dynamic source routing) protocol and is a descendant of the proactive routing protocol DSDV (destination sequence distance vector) [16]. With this protocol, when an active node desires a route to a node that is not active, it broadcasts a route request (RREQ) packet across the network. This is known as the route discovery process—the source node creates a RREQ packet that contains the (i) source and destination IP addresses; (ii) source and destination sequence numbers; and (iii) broadcast ID number (is initiated each time a source node uses a route request packet). These broadcasts flow across the network through flooding, sending control packets to every node connected except for the source node. This allows for the discovery of available routes. Once one node receives the RREQ packet, an intermediate node (that is not the destination node) may send a route reply (RREP) packet. This packet notifies the source node that they are not the destination node and that it has a route to the destination with the corresponding sequence number. The sequence number may be greater or equal to that contained in the RREQ packet. Once the source receives RREP packets, it forwards the data packets to their original destination. If any node moves, whether the destination node or the intermediate nodes, link failures may result in route error (RERR) messages being sent to other nodes. If a source node moves, then the route discovery process starts again, and we must send new RREQ packets. RERR messages are sent to all the nodes connected within the network and mark the destination route as an invalid route—the distance to destination then becomes infinity in the routing table. If the source node still needs to connect to the route, the route discovery process is re-initiated.
- OLSR protocol: OLSR is a proactive routing protocol, and it reduces the overhead by using multipoint relay (MPRs) nodes that the protocol uses to retransmit the control message and is one of the main features of the OLSR routing protocol [14]. Due to its protective nature, one of the significant advantages of the OLSR protocol is that routes are immediately available when needed. This protocol can be split into three main modules: (i) neighbor/link sensing; (ii) optimized flooding/forwarding (multipoint relaying); and (iii) link-state messaging and route calculation. Using the pure link state protocol causes full flooding of the control packets among the nodes. All the nodes receive the HELLO message and flood it with all their neighbors, and this will lead to an increase in the overhead of the network. Packets are forwarded by hop-by-hop routing—meaning that each node can use the most recent information to route packets. Only nodes selected as MPRs can forward control traffic, thus reducing the size of the original control message [17,18]. Topology control (TC) messages are used along with the forwarding of multipoint relays to disseminate neighbor information throughout the network.
- Link-state routing often requires the topology database to be correctly synchronized across the network, whereas OLSR does not bother with reliability. Instead, it floods the topology data enough to ensure that the topology database does not go unsynchronized for long periods. The primary importance of the OLSR routing protocol is to reduce this flooding of the control packets in the network by application of the MPR technique.
- DYMO routing protocol: The DYMO routing protocol has most recently been developed and is the successor to the AODV routing protocol. It was implemented as an application layer module in the INET framework. The protocol shares and inherits many of AODV’s features, such as route discovery, sequence numbers for loop freedom and route error (RERR) messages [7,16]. The protocol aims to have a much simpler design that helps to lower the system requirements from the nodes and simplify its implementation. Path accumulation is another feature that this routing protocol has inherited from the DSR (dynamic source routing) protocol. These accumulated paths provide information that the nodes are processing route discovery packets. From there, these routes that have been discovered are learned and used to route packets. The major difference between DYMO and its predecessor, AODV, is that the latter can only generate route table entries for the destination node and next hop node. DYMO, on the other hand, stores routes newly discovered for each intermediate hop. What this means, essentially, is that instead of skipping intermediate nodes as AODV does, DYMO learns the routes to discover new paths to the destination nodes.
- BATMAN protocol: Due to the shortcomings of OLSR, the BATMAN protocol was introduced [17,18]. The weaknesses included routes regularly going up and down due to routing tables being unnecessarily flushed due to loops. In BATMAN, all the nodes connected broadcast HELLO packets, also known as originator messages, at periodic stages to their neighbors. These messages consist of their unique address and sequence number, and each neighbor changes the sending address to its address and re-broadcasts messages from there. On receiving the message, the originator makes a bidirectional link to confirm that the link detected can be used in both directions [31]. The currency of the message is then checked against the sequence number. This protocol does not maintain the full route to its destination. Instead, each node along the route only maintains information about the next link, which can be used to find the best route. BATMAN’s objective is to maximize the probability of delivering a message and it does not attempt to check the quality of each detected link, it just checks to ensure that the link is there. The links are then compared in terms of the total of the originator messages that were received within the current window.
2.3. Related Work
3. Simulation Environment and Settings
3.1. The INET Framework
3.2. Modeling the Network and Mobility Issues
3.3. Simulation Parameter Settings
- Fixed PDAs (no mobility).
- Laptops (low mobility), speed ranging from 1 to 2 Mbps.
- Mobile phones (high mobility), speed from 10 to 15 Mbps
- Radio transmission ranges of all the nodes in the network (2 to 5 mW).
3.4. Performance Metrics
3.5. Simulation Control and Setup
4. Results and Discussion
4.1. Delay Performance
4.2. Throughput Performance
4.2.1. Node Throughput for AODV Routing Protocol
4.2.2. Node Throughput for BATMAN Routing Protocol
4.2.3. Node Throughput for DYMO Routing Protocol
4.2.4. Node Throughput for OLSR Routing Protocol
4.3. Packet Delivery Ratio
4.4. Model Validation
- Animation—simulating the average speed yielded information about the types of messages being sent across the network—contents, their sources, and destinations.
- Parameter variability and sensitivity analysis—systematically varying the simulation parameters and analyzing the impact that they have on the outputs (results).
- Face validity—seeking advice and opinions from experts to see whether a model concept is acceptable and reasonable to use for simulation.
5. Summary of Research Findings and Practical Implications
- End-to-end delay performance
- Throughput performance
- Packet delivery ratio performance
5.1. Real-World Implications
5.2. Limitations
6. Conclusions and Future Directions
Author Contributions
Funding
Institutional Review Board Statement
Informed Consent Statement
Data Availability Statement
Acknowledgments
Conflicts of Interest
References
- Loo, J.; Mauri, J.L.; Ortiz, J.H. Mobile Ad Hoc Networks: Current Status and Future Trends; CRC Press: Boca Raton, FL, USA, 2020; ISBN 978-1-138-49296-2. [Google Scholar]
- Abid, S.A.; Othman, M.; Shah, N. A Survey on Dht-Based Routing for Large-Scale Mobile Ad Hoc Networks. ACM Comput. Surv. 2014, 47, 20. [Google Scholar] [CrossRef]
- Yang, B.; Wu, Z.; Shen, Y.; Jiang, X.; Shen, S. On Delay Performance Study for Cooperative Multicast MANETs. Ad Hoc Netw. 2020, 102, 102117. [Google Scholar] [CrossRef]
- Kanellopoulos, D.; Sharma, V.K. Survey on Power-Aware Optimization Solutions for MANETs. Electronics 2020, 9, 1129. [Google Scholar] [CrossRef]
- Kancharakuntla, D.; El-Ocla, H. EBR: Routing Protocol to Detect Blackhole Attacks in Mobile Ad Hoc Networks. Electronics 2022, 11, 3480. [Google Scholar] [CrossRef]
- Kang, M.W.; Chung, Y.W. An Improved Hybrid Routing Protocol Combining MANET and DTN. Electronics 2020, 9, 439. [Google Scholar] [CrossRef]
- Safa, H.; Karam, M.; Moussa, B. PHAODV: Power Aware Heterogeneous Routing Protocol for MANETs. J. Netw. Comput. Appl. 2014, 46, 60–71. [Google Scholar] [CrossRef]
- Chavhan, S.; Venkataram, P. Emergent Intelligence Based QoS Routing in MANET. Proc. Procedia Comput. Sci. 2015, 52, 659–664. [Google Scholar] [CrossRef]
- Adam, S.M.; Hassan, R. Delay Aware Reactive Routing Protocols for QoS in MANETs: A Review. J. Appl. Res. Technol. 2013, 11, 844–850. [Google Scholar] [CrossRef]
- Amri, H.A.; Abolhasan, M.; Wysocki, T. Scalability of MANET Routing Protocols for Heterogeneous and Homogenous Networks. Comput. Electr. Eng. 2010, 36, 752–765. [Google Scholar] [CrossRef]
- Mazhar, N.; Farooq, M. A Hybrid Artificial Immune System (AIS) Model for Power Aware Secure Mobile Ad Hoc Networks (MANETs) Routing Protocols. Appl. Soft Comput. J. 2011, 11, 5695–5714. [Google Scholar] [CrossRef]
- Ramalingam, R.; Muniyan, R.; Dumka, A.; Singh, D.P.; Mohamed, H.G.; Singh, R.; Anand, D.; Noya, I.D. Routing Protocol for MANET Based on QoS-Aware Service Composition with Dynamic Secured Broker Selection. Electronics 2022, 11, 2637. [Google Scholar] [CrossRef]
- Muchtar, F.; Abdullah, A.H.; Hassan, S.; Masud, F. Energy Conservation Strategies in Host Centric Networking Based MANET: A Review. J. Netw. Comput. Appl. 2018, 111, 77–98. [Google Scholar] [CrossRef]
- Castellanos, W.; Carlos Guerri, J.; Chacon, M. Improving Video Transmission over Heterogeneous Networks; Improving Video Transmission over Heterogeneous Networks. IEEE Lat. Am. Trans. 2018, 16, 2987–2995. [Google Scholar] [CrossRef]
- Benjbara, C.; Habbani, A.; Mouchfiq, N. New Multipath OLSR Protocol Version for Heterogeneous Ad Hoc Networks. J. Sens. Actuator Netw. 2022, 11, 3. [Google Scholar] [CrossRef]
- Nabati, M.; Maadani, M.; Pourmina, M.A. AGEN-AODV: An Intelligent Energy-Aware Routing Protocol for Heterogeneous Mobile Ad-Hoc Networks. Mob. Networks Appl. 2021, 27, 576–587. [Google Scholar] [CrossRef]
- Guillen-Perez, A.; Montoya, A.M.; Sanchez-Aarnoutse, J.C.; Cano, M.D. A Comparative Performance Evaluation of Routing Protocols for Flying Ad-Hoc Networks in Real Conditions. Appl. Sci. 2021, 11, 4363. [Google Scholar] [CrossRef]
- Kiran, K.; Kaushik, N.; Sharath, S.; Shenoy, P.; Venugopal, K.R.; Prabhu, V.T. Experimental Evaluation of BATMAN and BATMAN-Adv Routing Protocols in a Mobile Testbed. In Proceedings of the IEEE Region 10 Conference, Jeju, Republic of Korea, 28–31 October 2018. [Google Scholar]
- Kumar, S.; Singh, A. Performance Analysis of OLSR and AODV Protocols in Mobile Ad Hoc Networks. Int. J. Comput. Appl. 2021, 183, 25–30. [Google Scholar]
- Ahmed, R.; Abbas, A. Improved routing in MANET with optimized multi path routing fine tuned with hybrid modeling. J. King Saud Univ. Comput. Inf. Sci. 2020, 34, 2443–2450. [Google Scholar] [CrossRef]
- Ahmed, R.; Abbas, A. A Survey on MANET Routing Protocols: Issues and Challenges. J. King Saud Univ. Comput. Inf. Sci. 2020, 32, 1–14. [Google Scholar]
- Taha, A.; Awais, M. Comparative Study of Hybrid Routing Protocols for MANETs under Different Mobility Models. Future Gener. Comput. Syst. 2023, 141, 675–688. [Google Scholar]
- Yang, F.; Li, H.; Zhao, L. Trust-Based Routing Protocol for MANETs with Heterogeneous Nodes. J. Comput. Netw. Commun. 2022, 1–12. [Google Scholar] [CrossRef]
- Ghosh, S.; Mal, K. Energy-Efficient Routing in MANETs: A Review of Recent Advancements. Ad Hoc Netw. 2024, 132, 102682. [Google Scholar] [CrossRef]
- Kunz, T.; Alhalimi, R. Energy-Efficient Proactive Routing in MANET: Energy Metrics Accuracy. Ad Hoc Netw. 2010, 8, 755–766. [Google Scholar] [CrossRef]
- Chen, J.; Zhang, Y.; Liu, W. Enhancing the Performance of AODV Protocol in Heterogeneous MANETs. Wirel. Netw. 2022, 28, 2175–2190. [Google Scholar]
- Alshehri, A.; Badawy, A.H.A.; Huang, H. FQ-AGO: Fuzzy Logic q-Learning Based Asymmetric Link Aware and Geographic Opportunistic Routing Scheme for MANETs. Electronics 2020, 9, 576. [Google Scholar] [CrossRef]
- Alnumay, W.; Ghosh, U.; Chatterjee, P. A Trust-Based Predictive Model for Mobile Ad Hoc Network in Internet of Things. Sensors 2019, 19, 1467. [Google Scholar] [CrossRef]
- Zhao, J.; Wu, H. A Survey on Routing Protocols in Mobile Ad Hoc Networks: Challenges and Solutions. J. Netw. Comput. Appl. 2023, 204, 103405. [Google Scholar]
- Srilakshmi, U.; Veeraiah, N.; Alotaibi, Y.; Alghamdi, S.A.; Khalaf, O.I.; Subbayamma, B.V. An Improved Hybrid Secure Multipath Routing Protocol for MANET. IEEE Access 2021, 9, 163043–163053. [Google Scholar] [CrossRef]
- Sholander, P.; Yankopolus, A.; Coccoli, P.; Arfl, S.S.T.; Research Site, R. Experimental comparison of hybrid and proactive MANET routing protocols. In Proceedings of the Communications Conference (MILCOM 2002), Anaheim, CA, USA, 7–10 October 2002. [Google Scholar]
- Sommer, C.; Dietrich, I.; Dressler, F. Simulation of Ad Hoc Routing Protocols Using OMNeT++: A Case Study for the DYMO Protocol. Mob. Netw. Appl. 2010, 15, 786–801. [Google Scholar] [CrossRef]
Reference | Scope | Routing Algorithm Addressed | Proactive/ Reactive? | Heterogeneous Nodes? | Simulation? |
---|---|---|---|---|---|
[15] | Routing protocols and their overheads | AODV, OLSR | Reactive | - | √ |
[26] | On-demand routing | AODV | Reactive | - | √ |
[29] | Periodic control message exchanges | OLSR | Proactive | - | √ |
[28] | Proactive protocols | OLSR | Proactive | - | √ |
[32] | Hybrid protocols | Hybrid | Both | - | √ |
[31] | Scalability in hybrid protocols | Hybrid | Both | - | √ |
[7] | DYMO routing and path accumulation | DYMO | Reactive | - | √ |
[17] | BATMAN protocol and its message delivery | BATMAN | Reactive | - | √ |
[18] | Challenges in OLSR and BATMAN | OLSR, BATMAN | Reactive | - | √ |
[27] | AODV in heterogeneous MANETs | AODV | Reactive | - | √ |
[19] | OLSR and AODV in mobile ad hoc networks | OLSR, AODV | Both | - | √ |
[22] | Surveys MANET routing protocols | General | Both | - | √ |
[24] | Reviews of energy-efficient routing MANETs | General | Both | - | √ |
[23] | Hybrid routing protocols for MANETs | Hybrid | Both | - | √ |
[30] | Routing protocols in MANETs | General | Both | - | √ |
Our work | Performance comparison of AODV, OLSR, BATMAN and DYMO in heterogenous networks | Both | √ | √ |
Parameter | Value |
---|---|
Number of nodes | 2 PDA (fixed node), 5 laptops, and 5 mobile phones |
Node type | PDA (fixed); mobile hosts: 10 to 15 Mbps; laptops: 1 to 2 Mbps |
Simulation time | 600 s |
Simulation trajectory | 600 × 600 m |
Routing protocols | AODV, OLSR, BATMAN, DYMO |
MAC protocol | IEEE 802.11 g; 2.4 GHz |
Mobility type | Random waypoint mobility |
Mobility waiting time | 0.1 sec (default) |
Communication port | UDP |
Transmitter power | 2 to 5 mW (milliwatts) |
Bitrate | 54 Mbps |
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).
Share and Cite
Sarkar, N.I.; Ali, M.J. A Study of MANET Routing Protocols in Heterogeneous Networks: A Review and Performance Comparison. Electronics 2025, 14, 872. https://doi.org/10.3390/electronics14050872
Sarkar NI, Ali MJ. A Study of MANET Routing Protocols in Heterogeneous Networks: A Review and Performance Comparison. Electronics. 2025; 14(5):872. https://doi.org/10.3390/electronics14050872
Chicago/Turabian StyleSarkar, Nurul I., and Md Jahan Ali. 2025. "A Study of MANET Routing Protocols in Heterogeneous Networks: A Review and Performance Comparison" Electronics 14, no. 5: 872. https://doi.org/10.3390/electronics14050872
APA StyleSarkar, N. I., & Ali, M. J. (2025). A Study of MANET Routing Protocols in Heterogeneous Networks: A Review and Performance Comparison. Electronics, 14(5), 872. https://doi.org/10.3390/electronics14050872