Search Results (14)

Mobile Ad Hoc Networks (MANETs) are decentralized wireless networks characterized by dynamic topologies and the absence of fixed infrastructure. These unique features make MANETs critical for applications such as disaster recovery, military operations, and IoT systems. However, they also pose significant challenges for efficient and effective routing. This study evaluates the performance of eight MANET routing protocols: Optimized Link State Routing (OLSR), Destination-Sequenced Distance Vector (DSDV), Ad Hoc On-Demand Distance Vector (AODV), Dynamic Source Routing (DSR), Ad Hoc On-Demand Multipath Distance Vector (AOMDV), Temporally Ordered Routing Algorithm (TORA), Zone Routing Protocol (ZRP), and Geographic Routing Protocol (GRP). Using a custom simulation environment in OMNeT++ 6.0.1 with INET-4.5.0, the protocols were tested under four scenarios with varying node densities (20, 80, 200, and 500 nodes). The simulations utilized the Random Waypoint Mobility model to mimic dynamic node movement and evaluated key performance metrics, including network load, throughput, delay, energy consumption, jitter, packet loss rate, and packet delivery ratio. The results reveal that proactive protocols like OLSR are ideal for stable, low-density environments, while reactive protocols such as AOMDV and TORA excel in dynamic, high-mobility scenarios. Hybrid protocols, particularly GRP, demonstrate a balanced approach; achieving superior overall performance with up to 30% lower energy consumption and higher packet delivery ratios compared to reactive protocols. These findings provide practical insights into the optimal selection and deployment of MANET routing protocols for diverse applications, emphasizing the potential of hybrid protocols for modern networks like IoT and emergency response systems. Full article

A mobile ad-hoc network (MANET) is a network of mobile nodes that dynamically form a transitory network lacking any existence of infrastructure and any form of centralized management. Nodes in ad hoc networks are powered by batteries with a limited lifespan and communicate in a restricted bandwidth. The unpredictable environment of a MANET may run into a major concern in the routing mechanism, therefore the need for a routing protocol with robust performance is still one of the key challenges in MANET deployment. In this work, a comparative comparison and extensive simulation analysis have been carried out for three major routing protocols: destination sequenced distance vector (DSDV), dynamic source routing (DSR) and ad hoc on-demand distance vector (AODV). Protocol evaluation has been extended by considering several simulation arrangements, different classes of traffic load patterns and diverse performance metrics. Based on packet rate change, node quantity and node speed, simulation scenarios were generated. Protocols were investigated against energy consumption, throughput, lost packets, routing load and packet delivery fraction for three types of traffic load patterns regular, irregular and joint traffic. DSR and AODV protocols proved to be more reliable when joint traffic was implemented when node speed and packets variations are considered. DSDV protocol verifies outstanding response over other protocols in terms of energy consumption when either regular or irregular traffic is applied. The simulation results for DSR protocol have verified the superiority over other protocols in 9 simulation scenarios when diverse metrics are considered. DSDV showed optimal performance in 7 cases, especially at low packet rates and in networks with minimum number of nodes. Similarly, AODV protocol showed outstanding performance in 6 scenarios, when higher packet rates and node mobility are considered. Full article

Wireless Sensor Networks (WSN) play a major role in various applications, yet maintaining energy efficiency remains a critical challenge due to their limited energy availability. Network lifetime is one of the primary parameters for analyzing the performance of a WSN. This proposed work aims to improve the network lifetime of a WSN by enhancing its energy utilization through the Enhanced Monkey Search Algorithm (E-MSA). The E-MSA provides an optimum solution for this issue by finding a better routing decision by analyzing the available energy on the nodes and the distance between the source and destination. Additionally, a Class Topper Optimization (CTO) algorithm is also included in the work for determining an efficient node to be the cluster head and lead cluster head. In this technique, the data packets are collected by the lead cluster head from the other cluster heads for sending the information in a sequential manner to the base station for reducing data loss. A simulation model is implemented in the NS2 platform with 700 nodes in a 300 × 300 square meter area with 0.5 J of energy to each node for finding the efficiency of the proposed E-MSA with CTO algorithm over the traditional On-Demand Distance Vector (ODV) and Destination-Sequenced Distance Vector (DSDV) approaches. The experimental outcome indicates that the proposed work can reach a maximum lifetime of 1579 s which is comparatively better than the ODV and DSDV approaches by 212 and 358 s, respectively. Similarly, a packet delivery ratio of 79% is achieved with a throughput of 0.85 Mbps along with a delay of 0.48 s for the operation of all 700 nodes. Full article

Traffic systems have been built as a result of recent technological advancements. In application, dependable communication technology is essential to link any system needs. VANET technology is used to communicate data about intelligent traffic lights, which are focused on infrastructure during traffic accidents and mechanisms to reduce traffic congestion. To ensure reliable data transfer in VANET, appropriate routing protocols must be used. This research aims to improve data transmission in VANETs implemented in intelligent traffic lights. This study investigates the capability of combining the DSDV routing protocol with the routing protocol AODV to boost AODV on an OMNET++ simulator utilizing the 802.11p wireless standard. According to the simulation results obtained by analyzing the delay parameters, network QoS, and throughput on each protocol, the DSDV-AODV routing protocol performs better in three scenarios compared to QoS, delay, and throughput parameters in every scenario that uses network topology adapted to the conditions on the road intersections. The topology with 50 fixed + 50 mobile nodes yields the best results, with 0.00062 s delay parameters, a network QoS of 640 bits/s, and a throughput of 629.437 bits/s. Aside from the poor results on the network QoS parameters, the addition of mobile nodes to the topology influences both the results of delay and throughput metrics. Full article

Different from mobile ad hoc networks (MANETs) and vehicular ad hoc networks (VANETs), a flying ad hoc network (FANET) is a very low-density network where node topology changes rapidly and irregularly. These characteristics, the density, mobility, and speed of flight nodes, affect the performance of FANET. Furthermore, application scenarios and environmental settings could affect the performance of FANETs. In this paper, we analyzed the representative FANET protocols, AODV, DSDV, and OLSR, according to mobility models, SRWP, MP, RDPZ, EGM, and DPR, under the multi-UAV-based reconnaissance scenario. We evaluated them in terms of the number of nodes, network connectivity, mobility model’s reconnaissance rate, speed of nodes, and ground control station (GCS) location. As a result, we found that AODV showed the highest PDR performance (81%) with SRWP in multiple UAV-based reconnaissance scenarios. As for a mobility model under the consideration of reconnaissance rate, SRWP was excellent at 76%, and RDPZ and EGM mobility models were reasonable at 62% and 60%, respectively. We also made several interesting observations such as how when the number of nodes increases, the connectivity of the network increases, but the performance of the routing protocol decreases, and how the GCS location affects the PDR performance of the combination of routing protocols and mobility models. Full article

The most important and emerging characteristic of Wireless Body Area Networks (WBANs), which differentiates them from other wired and wireless area networks, is mobility. Therefore, the routing protocols for WBAN are designed in such a way that they can deal with dynamic changes in topology and provide maximum throughput, packet delivery ratio, average end-to-end delay, and minimum energy consumption. Thus, achieving optimal values for every performance parameter becomes a big challenge. This work investigates the performance of three separate path discovery protocols, such as Destination-Sequenced Distance-Vector Routing (DSDV), Ad Hoc On-demand Distance Vector (AODV), and Ad Hoc On-demand Multipath Distance Vector Routing protocol (AOMDV), for two different mobility models with a fixed-positioned sink. During experimentation, the AOMDV routing protocol achieves a high packet delivery ratio (PDR), average end-to-end delay, and throughput as compared to other routing protocols. Full article

Mobile Ad Hoc Networks (MANETs) are kind of wireless networks where the nodes move in decentralized environments with a highly dynamic infrastructure. Many well-known routing protocols have been proposed, with each having its own design mechanism and its own strengths and weaknesses and most importantly, each protocol being mainly designed for specific applications and scenarios. Most of the research studies in this field used simulation testbeds to analyze routing protocols. Very few contributions suggested the use of analytical studies and mathematical approaches to model some of the existing routing protocols. In this research, we have built a comprehensive mathematical-based model to analyze the Destination-Sequenced Distance Vector protocol (DSDV), one of the main widely deployed proactive protocols and studied its performance on estimating the path duration based on the concepts of the probability density function and the expected values to find the best approximation values in real scenarios. We have tested the validity of the proposed model using simulation scenarios implemented by the Network Simulator tool (NS3). The results extracted from both the mathematical model and the simulation have shown that the path duration is inversely proportional to both the speed of the node and the hop count. Furthermore, it had shown that the path duration estimated from the DSDV protocol is less than the actual path duration, due to the implementation of the settling time concept and keeping the “periodic routes’ update” parameter at a constant level, despite the fact that the node’s speed reduces the effective path utilization. Full article

Vehicular Ad hoc Networks (VANETs) thrive on providing a communication channel between vehicles and infrastructures that facilitate efficient and safe Vehicle-to-Vehicle (V2V) as well as Vehicle-to-Infrastructure (V2I) communications. Reliable and efficient transmission amongst vehicles and Road Side Units (RSUs) is a prime concern of Intelligent Transportation System (ITS). One of the primary challenges involved in vehicular communication is designing an efficient routing mechanism for data dissemination from node to node via a reliable route. The harsh vehicular environment with varied road conditions and obstacles in the signal propagation path induces another challenge. Therefore, this paper presents a comparative analysis of existing routing protocols with propagation models to assist researchers in gaining insight into the existing propagation model and routing protocols. The study also optimizes routing and propagation models for reliable packet dissemination. This work uses a realistic scenario from Open Street Map (OSM), and simulations are performed using SUMO. The trace files generated from SUMO are used for further simulation in NS-3. The simulation results are presented and studied in detail. The results show that the Two-Ray Ground and FRIIS propagation model outperforms the compared models, and the routing protocol OLSR outperforms AODV and DSDV. Full article

In this paper, we designed a beacon-based hybrid routing protocol to adapt to the new forms of intelligent warfare, accelerate the application of unmanned vehicles in the military field, and solve the problems such as high maintenance cost, path failure, and repeated routing pathfinding in large-scale unmanned vehicle network communications for new battlefields. This protocol used the periodic broadcast pulses initiated by the beacon nodes to provide synchronization and routing to the network and established a spanning tree through which the nodes communicated with each other. An NS3 platform was used to build a dynamic simulation environment of service data to evaluate the network performance. The results showed that when it was used in a range of 5 ~ 35 communication links, the beacon-based routing protocol’s PDR was approximately 10% higher than that of AODV routing protocol. At 5 ~ 50 communication links, the result was approximately 20% higher than the DSDV routing protocol. The routing load was not related to the number of nodes and communication link data and the protocol had better performance than traditional AODV and DSDV routing protocol, which reduced the cost of the routing protocol and effectively improved the stability and reliability of the network. The protocol we designed is more suitable for the scenarios of large-scale unmanned vehicle network communication in the future AI battlefield. Full article

The advancements in Industry 4.0 have opened up new ways for the structural deployment of Smart Grids (SGs) to face the endlessly rising challenges of the 21st century. SGs for Industry 4.0 can be better managed by optimized routing techniques. In Mobile Ad hoc Networks (MANETs), the topology is not fixed and can be encountered by interference, mobility of nodes, propagation of multi-paths, and path loss. To extenuate these concerns for SGs, in this paper, we have presented a new version of the standard Optimized Link State Routing (OLSR) protocol for SGs to improve the management of control intervals that enhance the efficiency of the standard OLSR protocol without affecting its reliability. The adapted fault tolerant approach makes the proposed protocol more reliable for industrial applications. The process of grouping of nodes supports managing the total network cost by reducing severe flooding and evaluating an optimized head of clusters. The head of the unit is nominated according to the first defined expectation factor. With a sequence of rigorous performance evaluations under simulation parameters, the simulation results show that the proposed version of OLSR has proliferated Quality of Service (QoS) metrics when it is compared against the state-of-the-art-based conventional protocols, namely, standard OLSR, DSDV, AOMDV and hybrid routing technique. Full article

The MEDIcal WARNing (MEDIWARN) system continuously and automatically monitors the vital parameters of pre-intensive care hospitalized patients and, thanks to an intelligent processing system, provides the medical teams with a better understanding of their patients’ clinical condition, thus enabling a prompt reaction to any change. Since the hospital units generally lack a wired infrastructure, a wireless network is required to collect sensor data in a server for processing purposes. This work presents the MEDIWARN communication system, addressing both the network architecture and a simple, lightweight and configurable routing protocol that fits the system requirements, such as the ability to offer path redundancy and mobility support without significantly increasing the network workload and latency. The novel protocol, called the MultiPath Routing Protocol for MEDIWARN (MP-RPM), was therefore designed as a solution to support low-latency reliable transmissions on a dynamic network while limiting the network overhead due to the control messages. The paper describes the MEDIWARN communication system and addresses the experimental performance evaluation of an implementation in a real use-case scenario. Moreover, the work discusses a simulative assessment of the MEDIWARN communication system performance obtained using different routing protocols. In particular, the timeliness and reliability results obtained by the MP-RPM routing protocol are compared with those obtained by two widely adopted routing protocols, i.e., the Ad-hoc On-demand Distance Vector (AODV) and the Destination-Sequenced Distance-Vector Routing (DSDV). Full article

A cognitive radio ad hoc network (CRAHN) is a mobile network that can communicate without any form of centralized infrastructure. The nodes can learn about the environment and make routing decisions. Furthermore, distributed computing, spectrum mobility, and the Internet of Things have created large data sets, which require more spectrum for data transmission. Unfortunately, the spectrum is a scarce resource that underutilized by licensed users, while unlicensed users are overcrowding the free spectrum. The CRAHNs technology has emerged as a promising solution to the underutilization of the spectrum. The focus of this study is to improve the effectiveness and energy consumption of routing in order to address the routing problem of CRAHNs through the implementation of the optimized cuckoo search algorithm. In CRAHNs, the node and spectrum mobility cause some frequent link breakages within the network, which degrades the performance of the routing protocols. This requires a routing solution to this routing problem. The proposed scheme was implemented in NS2 installed in Linux operating system, with a cognitive radio cognitive network (CRCN) patch. From the experimental results, we observed that the proposed OCS-AODV scheme outperformed CS-DSDV and ACO-AODV schemes. It obtained at least 3.87% packet delivery ratio and 2.56% and lower packets lost. The scheme enabled the mobile nodes to adjust accordingly to minimize energy consumption. If not busy, they switch to an idle state to save battery power. Full article

The proliferation of mobile and IoT devices, coupled with the advances in the wireless communication capabilities of these devices, have urged the need for novel communication paradigms for such heterogeneous hybrid networks. Researchers have proposed opportunistic routing as a means to leverage the potentials offered by such heterogeneous networks. While several proposals for multiple opportunistic routing protocols exist, only a few have explored fuzzy logic to evaluate wireless links status in the network to construct stable and faster paths towards the destinations. We propose FQ-AGO, a novel Fuzzy Logic Q-learning Based Asymmetric Link Aware and Geographic Opportunistic Routing scheme that leverages the presence of long-range transmission links to assign forwarding candidates towards a given destination. The proposed routing scheme utilizes fuzzy logic to evaluate whether a wireless link is useful or not by capturing multiple network metrics, the available bandwidth, link quality, node transmission power, and distance progress. Based on the fuzzy logic evaluation, the proposed routing scheme employs a Q-learning algorithm to select the best candidate set toward the destination. We implemented FQ-AGO on the ns-3 simulator and compared the performance of the proposed routing scheme with three other relevant protocols: AODV, DSDV, and GOR. For precise analysis, we considered various network metrics to compare the performance of the routing protocols. The simulation result validates our analysis and demonstrates remarkable performance improvements in terms of total network throughput, packet delivery ration, and end-to-end delay. FQ-AGO achieves up to 15%, 50%, and 45% higher throughput compared to DSDV, AODV, and GOR, respectively. Meanwhile, FQ-AGO reduces by 50% the end-to-end latency and the average number of hop-count. Full article

A mobile ad hoc network (MANET) is a self-configuring wireless network in which each node could act as a router, as well as a data source or sink. Its application areas include battlefields and vehicular and disaster areas. Many techniques applied to infrastructure-based networks are less effective in MANETs, with routing being a particular challenge. This paper presents a rigorous study into simulation techniques for evaluating routing solutions for MANETs with the aim of producing more realistic simulation models and thereby, more accurate protocol evaluations. MANET simulations require models that reflect the world in which the MANET is to operate. Much of the published research uses movement models, such as the random waypoint (RWP) model, with arbitrary world sizes and node counts. This paper presents a technique for developing more realistic simulation models to test and evaluate MANET protocols. The technique is animation, which is applied to a realistic scenario to produce a model that accurately reflects the size and shape of the world, node count, movement patterns, and time period over which the MANET may operate. The animation technique has been used to develop a battlefield model based on established military tactics. Trace data has been used to build a model of maritime movements in the Irish Sea. Similar world models have been built using the random waypoint movement model for comparison. All models have been built using the ns-2 simulator. These models have been used to compare the performance of three routing protocols: dynamic source routing (DSR), destination-sequenced distance-vector routing (DSDV), and ad hoc n-demand distance vector routing (AODV). The findings reveal that protocol performance is dependent on the model used. In particular, it is shown that RWP models do not reflect the performance of these protocols under realistic circumstances, and protocol selection is subject to the scenario to which it is applied. To conclude, it is possible to develop a range of techniques for modelling scenarios applicable to MANETs, and these simulation models could be utilised for the evaluation of routing protocols. Full article