Are Ad Hoc On-demand Distance Vector Research Articles

Energy-Saving Routing Protocols for Smart Cities

In recent decades, expansion in urban areas has faced issues such as management of public waste, noise, mobility, and air quality, among others. In this scenario, Internet of Things (IoT) and Wireless Sensor Network (WSN) scenarios are being considered for Smart Cities solutions based on the deployment of wireless remote sensor nodes to monitor large urban areas. However, as the number of nodes increases, the amount of data to be routed increases significantly as well, meaning that the choice of the data routing process has great importance in terms of the energy consumption and lifetime of the network. In this work, we describe and evaluate the energy consumption of routing protocols for WSN-based Smart Cities applications in LoRa-based mesh networks, then propose a novel energy-saving radio power adjustment (RPA) routing protocol. The Cupcarbon network simulator was used to evaluate the performance of different routing protocols in terms of their data package delivery rate, average end-to-end delay, average jitter, throughput, and load consumption of battery charge. Additionally, a novel tool for determining the range of nodes based on the Egli propagation model was designed and integrated into Cupcarbon. The routing protocols used in this work are Ad Hoc On-Demand Distance Vector (AODV), Dynamic Source Routing (DSR), and Distance Vector Routing (DVR). Our simulation results show that AODV presents the best overall performance, DSR achieves the best results for power consumption, and DVR is the best protocol in terms of latency. Finally, the proposed RPA routing protocol presents power savings of 11.32% compared to the original DSR protocol.

Performance Estimation of a Wireless Sensor Network with a Mobile Sink Moving in Different Trajectories at Different Velocities

Background: Throughout the past few years, numerous Medium Access Control (MAC) protocols, routing protocols, node deployment mechanisms and duty cycle variation schemes have been designed for achieving high throughput, low delay and jitter, and long network lifetime in Wireless Sensor Networks (WSNs). In a WSN with static sink, voluminous sensors transmit their sensed data to the sink node. The coordinators mutually present in the range of sensors and sink have to forward a number of packets, which cause rapid depletion of their battery. These coordinators become dead too early resulting in the breakage of the communication channel and formation of energy holes. However, to save energy with a static sink, the duty cycle should be short. A mobile sink is a better option than a static sink if the duty cycle is long, as it balances energy consumption among the sensors. It is well observed that the mobile sink is capable of acquiring homogeneous energy depletion leading to stretched lifetime enhancing network performance. Methods: The vital benefaction of this paper is to present a simulation-based analysis of the network performance with a mobile sink having different trajectories of path traversed at different velocities. The intent is to find out the most appropriate and efficient trajectory and a particular velocity for a specific WSN with 100 nodes. The terrain area of the network is 210×210 m2 with the communication range of 20 m. The routing, network and MAC protocols implemented are Ad hoc On-Demand Distance Vector (AODV), Internet Protocol version 4 (IPv4) and Institute of Electrical and Electronics Engineers (IEEE) 802.15.4 respectively. This paper has evaluated and analyzed the influence of lawn mower, elliptical and circular trajectories of a mobile sink moving at different velocities of 0.5, 1 and 2 m/s. The optimum performance is achieved at the velocity of 2 m/s for a circular trajectory of the mobile sink. It is observed that performance has significantly varied with the variation of trajectories and velocities. The notion of precise utilization of sink mobility improves the performance than a static sink. It is equally important to determine the most effective mechanism to implement mobile sinks and to find out the most appropriate scheme out of them. Results: The attainment parameters just as total messages received, average end to end delay (seconds), jitter (seconds), throughput (bits per second), number of packets dropped, number of packets dropped due to channel access failure, residual battery (mAh) and network lifetime (hours) for different trajectories such as lawn mower, elliptical and circular at different speeds of 0.5, 1 and 2 m/s of the sink node are evaluated and compared. The simulation results present that the circular trajectory and the velocity of 2 m/s have provided optimum performance. Conclusion: The objective was to precisely analyze and evaluate the influence of different trajectories of a mobile sink moving at different velocities in a WSN of 100 nodes to determine the most effective and appropriate trajectory and velocity to optimize the attainments. The intent is to uniform the power exhaustion amidst the sensors. The purpose was to gain the attention of researchers of this field to significantly contribute to novel research.

Discovery Routing Time Speed Comparison of AODV, OLSR and ZRP protocols on MANET

Mobile Ad hoc Network (MANET) is a wireless network that contains a collection of nodes without infrastructure and interconnected to communicate. MANET works dynamically when a group of nodes moves spontaneously, so the network topology can change quickly and cannot be predicted. It causes changes in wireless network topology according to existing conditions. The node functions in determining the route to be selected. Ad Hoc networks have limited transmission range, so routing is needed to send data over the network. The problem with mobile nodes is that routing must provide a path when the node changes. The speed of a node obtaining information is affected by the routing protocol used in the network. Each routing protocol has different capabilities in network speed, so the discovery routing time for each routing is also different. The selected routing protocols are Ad Hoc On-Demand Distance Vector (AODV), Optimized Link-state (OLSR), and Zone Routing Protocol (ZRP). The study will conduct a comparative analysis of ad hoc network initialization speeds on AODV, OLSR, and ZRP routing protocols. The parameter tested is the speed of routing discovery. After the data is collected, an analysis is carried out by looking at the routing discovery speed of each routing protocol. The test results show that each of the routing protocols examined, the AODV routing protocol, has a faster routing discovery time than the OLSR and ZRP routing protocols.

Performance Evaluation of Ad-Hoc On-Demand Distance Vector and Optimized Link State Routing Protocols in Mobile Ad-Hoc Networks

Mobile Ad-hoc Networks (MANETs) are self-sufficient networks that can work without the need for centralized controls, pre-configuration to the routes or advance infrastructures. The nodes of a MANET are autonomously controlled, which allow them to act freely in a random manner within the MANET. The nodes can leave their MANET and join other MANETs at any time. These characteristics, however, might negatively affect the performance of the routing protocols and the overall topology of the networks. Subsequently, MANETs comprise specially designed routing protocols that reactively and/or proactively perform the routing. This paper evaluates and compares the performance of two routing protocols which are Ad-Hoc On-Demand Distance Vector (AODV) and Optimized Link State Routing (OLSR) in MANET environment. The study includes implementing a simulation to examine the performance of the routing protocols based on the variables of the nodes’ number and network size. The evaluation results show that the AODV outperforms the OLSR in most of the simulated cases. The results further show that the number of nodes and network size have a great impact on the Throughput (TH), Packet Delivery Ratio (PDR), and End-to-End delay (E2E) of the network.

Advanced Adaptive Routing Algorithm forHighway and City Scenarios in VANET

The paper proposes a new hybrid routing algorithm for VANET (Vehicular Ad- Hoc Network). The proposed algorithm aims at improving the performance parameter of the routing such as end to end delay, throughput and packets loss in city and highway scenario. The algorithm is such that it takes into account both these scenarios in the same routing platform which enables the way for optimization of the routing parameters. The scheme is based on the existing routing protocols that are Ad-hoc on Demand Distance Vector (AODV) and Optimize Link State Routing (OLSR). The algorithm takes into account the merits and demerits of both the protocols in the city and highway scenario and integrate them together to give an effective new proposed algorithm. The main idea lies with integration of the two protocols for using them in both scenarios by measuring the speed of the node (vehicle) which will lets us determine the protocol to be used while routing in the network.

Performance Comparison of IACO,AODV Networking Routing Protocols

There are several standard protocols for Mobile Ad hoc Networks (MANET) that have been developed for devices with higher computing features. The Efficient routing protocols can provide significant benefits to mobile ad hoc networks, in terms of both performance and reliability. Many routing protocols for such networks have been proposed so far. Amongst the most popular ones are Ad hoc On-demand Distance Vector (AODV), Improved Ant Colony Optimization (IACO). In this paper we present our observations regarding the performance comparison of the above protocols in mobile ad hoc networks (MANETs). We perform extensive simulations, using NS-2 simulator. The Average end-to-end delay and the Packet Delivery Ratio have been considered as the two performance parameters

Performance Evaluation of AODV, DSR and DYMO Routing Protocol in MANET

A mobile ad-hoc network (MANET) is a kind of wireless ad-hoc network, and is a self-configuring network of mobile routers connected wirelessly. MANET may operate in a standalone fashion, or may be connected to the larger Internet. Many routing protocols have been developed for MANETs over the past few years. This project evaluated three specific MANET routing protocols which are Ad-hoc On-demand Distance Vector (AODV), Dynamic Source Routing (DSR) and Dynamic MANET On-demand routing protocol (DYMO) to better understand the major characteristics of these routing protocols. Different performance aspects were investigated in this project including; packet delivery ratio, routing overhead, throughput and average end-to-end delay. This project used Linux as an operating system based platform and discrete event simulator NS-2 as simulation software to compare the three MANET routing protocols. This project’s results indicated that all routing protocols perform well according to the performance metrics that have been selected. For packet delivery ratio metric, performance of AODV, DSR and DYMO routing protocols are quite similar to each other. The DSR performance is better compared to AODV and DYMO and has stable normalized routing overhead. In terms of throughput, DYMO routing protocol performs the best as compared to AODV and DSR. Finally, for average end to end delay, DYMO and AODV perform well in comparison with DSR.