Dynamic Source Routing Algorithm Research Articles

End to end delay distribution analysis and interference aware high throughput for Wireless Mesh Networks

The wireless mesh network is an innovative and efficient wireless communication approach with immense potential to transform future wireless networks. This cutting-edge wireless technology provides a wide range of wireless services for personal, local, campus, and metropolitan environments. The wireless mesh network consists of a cluster of mobile wireless nodes that can dynamically and instantaneously create random and temporary network topologies, forming a wireless ad-hoc network. Ad hoc wireless networks are particularly advantageous due to their cost-effectiveness and ease of deployment. In order to further optimize the performance of ad-hoc networks, different routing algorithms such as Ad-hoc On-Demand Distance Vector Routing (AODV), Dynamic Source Routing Algorithm (DSR) and Destination Sequenced Distance Vector (DSDV) have been thoroughly researched via simulation.

Design and Analysis of Improved Dynamic Source Routing Protocol in Vehicular Ad-Hoc Network

Background and Objective: The present issues faced by the transport systems include enormous traffic jams and congestion, unexpected road accidents, unwanted time delays, pedestrians' crossings on main roads, wastage of fuel, and many more. ITS and some other technologies work together to overcome such factors contributing to a much more desirable transport system. This paper aims to identify the security measures that could increase the security of the routing protocol and improve the performance of the DSR routing protocol. If the number of establishing links is frequently broken, then the performance of the DSR routing protocol is not very good. A new modified DSR algorithm has been designed that would help in reducing the network overhead and increase the network quality. A comparison between the performances of both algorithms has also been studied, and the results show that improved DSR routing protocol has better efficiency in parameters like end-to-end network load delays and packet delivery ratio. Methods & Materials: The paper mainly focuses on securing the Dynamic Source routing algorithm by designing its modified version and simulating it. We have Proposed Modified DSR and discussed so far that the basic functionality of the DSR algorithm, its advantages and disadvantages. The main drawbacks include the end-to-end Delay, network overhead and packet delivery ratio. Following is a modified version of the dynamic source routing algorithm, which tries to overcome all the limitations of the basic algorithm at a certain level. In the Dynamic Source Routing algorithm, the Route Maintenance phase is used for the successful propagation of the packet within the network. The nodes that are involved in the transmission acknowledge the receiving of the packet to the preceding node. Results and Discussion: The present study aims at modifying the existing algorithm and designing a new modified algorithm that has less routing overhead, less Delay in packet transmission and high network quality. Modified DSR routing algorithm is examined on the parameters like E-2-E delay, Normalize Routing Overhead, PDR. When we compare the performance of the proposed method with the Existing protocol AODV, and DSR at a number of nodes equal to 50 then we get the Proposed DSR, which has the least end-to-end Delay among all the three protocols. Conclusion: In this paper, acomparison of Exiting DSR and Modified DSR in terms of end-to-end Delay, routing load and packet delivery ratio is made. After studying the readings, the conclusion drawn was that there is less network overhead and a high delivery ratio in modified DSR as compared to the existing DSR algorithm. The corrupted and destroyed packets are detected by the receiver, and in DSR, the mobility of mobile nodes is moderate. Under certain conditions, bidirectional and unidirectional links can be accepted. DSR routing protocols are highly dependent on the parameters such as area size, packet size, packet type, and others.

Decentralized Link Failure Prevention Routing (DLFPR) Algorithm for Efficient Internet of Things

This work implements a Decentralized Links Failure Prevention (DLFP) routing algorithm to promote enhanced and efficient Internet of Things (IoT). The work increases the mobility as well as an opportunity for loss of IoT node meeting links due to both mobility and blockers/interferers. The proposed algorithm overcomes loss issues as well as works in dynamically allocating alternate route from other IoT nodes available in near and selecting for efficient route in the network. When the link fails, bandwidth is reduced and coverage area problems for packets sending from source to destination is managed. The proposed algorithm works with light-weight wireless mesh based route handling techniques. In such case, reduced link failure, removal of route discovery latency, communication cost and control overheads, energy consumptions and network life time are to be handled with care. To address these issues, the proposed algorithm enhances the Packet Delivery Ratio (PDR) as well as transmission packet efficiently received through destination node. The ability of Dynamic Alternate Routing (DAR) to relay node handling capabilities and to improve the communication link availability of IoT nodes has ultimately increased the PDR. Simulation work was done using Network Simulator 3 (NS3) and the results show that the performance is better when compared with existing Dynamic Source Routing (DSR) and Energy Efficient Delay Tolerant Routing (EEDTR) algorithm.

An Enhanced Dynamic Source Routing Algorithm for the Mobile Ad-Hoc Network using Reinforcement learning under the COVID-19 Conditions

Today, the use of computer networks is evident in all walks of life, including mobile phones, vehicles, personal computers, the workplace and more. Creating and operating networks between each of the above-mentioned devices require good infrastructure to be able to communicate between these devices. To solve this problem, there were networks called ad-hoc networks, which were able to network with each other without the need for specific infrastructure and only through direct and wireless communication between the equipment. But how to make the right connections in these types of networks, as well as high-speed communication for devices, are also challenges for researchers. In this study, we try to implement the communication between these devices by the DSR routing algorithm and, using the Q learning technique of the reinforced learning algorithm, we enhance it to respond to QOS in Ad-Hoc mobile networks compared to previous solutions. In addition to what has been improved in this article. In the following articles, we will try to improve the discussion of communication security using this method and also apply this method to routing VANETs networks.

Lifetime Estimation and Measurement for Wireless Ad Hoc Networks

Mobile ad-hoc networks (MANET) is a popular choice for “wireless communication network” due to ease of deployment. Nodes in MANET are battery operated, movable, and compact. They can sense, manipulate and communicate data wirelessly. Limited battery power of the nodes is one of the major constraints of MANET. This paper proposes a network lifetime model that considers residual energy and actual discharge rate of the battery along with the energy consumption in different modes like transmit, receive, sleep, idle, active and processing while calculating the lifetime. A circuit implementation of node with Arduino Mega 2560, ZigBee transceiver, 2100 mAh NiMH rechargeable battery was done to compare lifetime with conventional dynamic source routing (DSR) and modified Least Max Dynamic Source Routing (LMDSR) algorithms. The DSR algorithm always selects the shortest path between source and destination nodes. But the LMDSR algorithm also considers the residual battery levels of the nodes to avoid overuse of the node(s) with low battery. This will prevent the early exhaustion of node(s) which may be the reason for reduced network lifetime. The result analysis shows that the implementation of LMDSR algorithm improves the network lifetime on an average by 31% and reduces the energy consumption by 21% with a slight decrease in throughput.

Performance Evaluation of DSR for MANETs with Channel Fading

Due to the fact that it does not rely on any infrastructure to operate, Mobile Ad Hoc Networks (MANETs) have been experiencing an exponential period of interest and potential application. In these networks, no central entity controls its operation, and rather the devices cooperatively control and coordinate the network. The aim of the current work is to study the performance of Dynamic Source Routing (DSR) algorithm for MANETs. Extensive experiments in different scenarios with several parameters under free space, two-ray ground and shadowing propagation models were performed. The study presented here indicates distinct network performance results depending on the propagation model used. For instance, it shows that the algorithm has difficulties to maintain routes in environments with severe fading. In addition, management of radio power so that the packet transmissions are tailored to reach only the desired nodes seems to be a good compromise between interference and coverage.

SEAT-DSR: Spatial and energy aware trusted dynamic distance source routing algorithm for secure data communications in wireless sensor networks

This paper propose a novel secure routing mechanism called Spatial and Energy Aware Trusted Dynamic Distance Source Routing (SEAT-DSR) algorithm for enhancing the network life time of wireless sensor networks. Here, the spatial information, energy level, and the effectiveness of data quality are equalized by the Quality of Service (QoS) based energy aware routing algorithms. In addition to this approach, a standard clustering algorithm is also incorporates for grouping the wireless sensor nodes based on the trust score, spatial information, energy level and the distance between the nodes. In this SEAT-DSR is also capable of making decision over the evaluation metrics that are decided and expressed the QoS. Moreover, a new hierarchical trust mechanism is also introduced in this model which adopts multi-attributes of many wireless sensor nodes according to the data communication speed, data size, energy consumption, and the recommendation. This new hierarchical trust method relies over an improved the sliding window time by considering the presence of various attacks frequency to identify the attackers by discovering their anomalous behaviour. The proposed SEAT-DSR is evaluated by conducting many experiments in a simulation environment that creates by using Network Simulator-2 (NS2). The experimental results of the proposed algorithm are proved that the average packet transfer rate is increased drastically than the existing secure routing methodologies.

A novel dynamic reputation-based source routing protocol for mobile ad hoc networks

Routing in mobile ad hoc networks is based on the cooperation of the network’s nodes. The presence of selfish nodes that do not cooperate in this task drastically reduces the number of delivered packets. In order to find the better paths that include nodes willing to cooperate, we propose a new routing algorithm based on the reputation of the nodes. In our proposal, each node locally assigns a reputation value to the rest of the nodes in the network and next it uses the assigned reputation values to find out the better routing paths, in order to minimize the overall packet loss ratio. We assume that nodes have a stationary routing behavior, but we also include a mechanism to detect changes in their behavior. Our approach has been evaluated in the presence of selfish nodes, in order to compare it with the dynamic source routing algorithm, obtaining a reduction in the packet loss ratio at the expenses of a small increase in the number of hops taken by the packets to reach their destinations.

Analyzing Throughput of MANET with Reduced Packet Loss

This research paper analyses the throughput capacity of Mobile Ad hoc Network (MANET) with reduced packet loss. The nodes are then discovered using Medium Access Control (MAC) 802.11 protocol. It has the capability to discover the neighbor nodes automatically and the next node of the throughput for each node is determined using Flooding algorithm. In this algorithm, each node try to forward every information to every one of its nearest source node and then it receives the acknowledgement from the destination nodes. After initializing the source and destination node, the shortest path between the source and destination node is determined using K- Nearest Neighbor (KNN) algorithm. It calculates the distance between the nodes and sort the nearest neighbor based on the minimum distance. The routing is performed with the help of Dynamic Source Routing (DSR) algorithm which allows each dispatcher to decide on and control the routes used in routing packets. The packet loss gets reduced by considering the throughput of nodes. Here the Operating System is Linux Simulation software and then Network Simulator version 2 tool was used.

A MODIFIED ROUTE DISCOVERY APPROACH FOR DYNAMIC SOURCE ROUTING (DSR) PROTOCOL IN MOBILE AD-HOC NETWORKS

Mobile Ad-hoc networks (MANETs) involved in many applications, whether commercial or military because of their characteristics that do not depend on the infrastructure as well as the freedom movement of their elements, but in return has caused this random mobility of the nodes many of the challenges, where the routing is considered one of these challenges. There are many types of routing protocols that operate within MANET networks, which responsible for finding paths between the source and destination nodes with the modernization of these paths which are constantly changing due to the dynamic topology of the network stemming from the constant random movement of the nodes. The DSR (Dynamic Source Routing) routing protocol algorithm is one of these routing protocols which consist of two main stages; route discovery and maintenance, where the route discovery algorithm operates based on blind flooding of request messages. blind flooding is considered as the most well known broadcasting mechanism, it is inefficient in terms of communication and resource utilization, which causing increasing the probability of collisions, repeating send several copies of the same message, as well as increasing the delay. Hence, a new mechanism in route discovery stage and in caching the routes in DSR algorithm according to the node's location in the network and the direction of the broadcast is proposed for better performance especially in terms of delay as well as redundant packets rate. The implementation of proposed algorithms showed positive results in terms of delay, overhead, and improve the performance of MANETs in general. Keywords: MANET; DSR Protocol; Threshold, Broadcasting

Bionic Optimization Based Stability and Congestion Aware Routing Algorithm for Airborne Highly Dynamic Network

Airborne highly dynamic ad hoc UAV network has features of high node mobility, fast changing network topology, and complex application environment. The performance of traditional routing algorithms is so poor over aspects such as end to end delay, data packet delivery ratio, and routing overhead that they cannot provide efficient communication for multi-UAVs carrying out missions synergistically. A bionic optimization based stability and congestion aware routing algorithm—BSCAR algorithm—is proposed to solve these problems. This algorithm integrates biological behavior and dynamic source routing algorithm, which can sense the congestion level of routes and the stability of routes. Ant colony optimization algorithm and the mathematical model of Physarum's behavior exert effort in the process of route discovery and maintenance. The level of pheromone in routes is chosen as a standard to choose route and calculated by the mathematical model of Physarum's behavior. A new volatilization mechanism of pheromone is also introduced into the algorithm. Meanwhile, the algorithm can make adjustment to the variance of UAV formation to prevent the compromise of the network performance. The simulation results show that the BSCAR algorithm has superiority over traditional algorithms and it is dependable in battlefield environment.

Context Aware Routing in MANET with Hybrid ACO and Artificial Bees Colony Algorithm

The recent usage of small, portable and low cost devices has increased with most of them communicating through a wireless medium. As such devices self-organize, reconfigure without a fixed infrastructure, they form an ad hoc network known as Mobile Ad hoc Network (MANET). Mobile nodes ensure a dynamic, but an unpredictable topology, making routing challenging. Many routing protocols were suggested, with the numbers increasing daily. Context aware routing is a new MANET routing trend based on setting network context through a conceptual model. This study proposes context aware routing with a hybrid Ant Colony Optimization (ACO) -Artificial Bee Colony (ABC) algorithm to select optimal routes. Simulations are with limited nodes in a MANET. Performance evaluation is through parameters like end to end delay, retransmission attempts and throughput. The results revealed that ANT BEE algorithm improves performance when compared with Dynamic Source Routing (DSR) and ABC algorithm.

Ant colony optimization based enhanced dynamic source routing algorithm for mobile Ad-hoc network

Due to the dynamic nature of the Mobile Ad-hoc Network (MANET), routing in MANET becomes challenging especially when certain QoS requirements (like high data packet delivery ratio, low end to end delay, low routing overhead, and low energy consumption) are to be satisfied. Though a number of routing protocols have been proposed aiming to fulfill some of these QoS requirements but none of them can support all these requirements at the same time. In this paper, we propose an enhanced version of the well-known Dynamic Source Routing (DSR) scheme based on the Ant Colony Optimization (ACO) algorithm, which can produce a high data packet delivery ratio in low end to end delay with low routing overhead and low energy consumption. In our scheme, when a node needs to send a packet to another node, like DSR, it first checks the cache for existing routes. When no routes are known, the sender node locally broadcasts the Route Request control packets (called the Req.Ant packets) to find out the routes. This is similar to the biological ants initially spreading out in all directions from their colony in search of food. Now, the ants, after finding the food source, come back to the colony and deposit pheromone on their way so that other ants get informed about the paths. Similarly, in our routing scheme, the Req.Ant packets propagate through the network according to our novel route discovery scheme and gathers information of the route (i.e. total length of the route, congestion along the route and end to end path reliability of the route), till it reaches the destination node. When the destination node receives a Req.Ant packet, it sends back Rep.Ant (Route Reply control packet) which consists the route information of the corresponding Req.Ant to the source node through the same route. On receiving such Rep.Ant packets from different routes, the source node comes to know about those routes. Under the ant colony framework, the best route is selected by the pheromone level of the route. Similarly, here we calculate the pheromone level of a route based on the number of hops in the route, the congestion along the route and end to end path reliability of the route.The route with the highest pheromone count will be selected for data packet delivery. We also propose a novel pheromone decay technique for route maintenance. The simulation results show that our ACO based Enhanced DSR (E-Ant-DSR) outperforms the original DSR and other ACO based routing algorithms.

Agent-based trusted on-demand routing protocol for mobile ad-hoc networks

The routing performance in mobile ad hoc networks (MANETs) relies on the co-operation of the individual nodes that constitute the network. The existence of misbehaving nodes may paralyze the routing operation in MANETs. To overcome this behavior, the trustworthiness of the network nodes should be considered in the route selection process combined with the hop count. The trustworthiness is achieved by measuring the trust value for each node in the network. In this paper, a new protocol based on self monitoring (agent-based) and following the dynamic source routing (DSR) algorithm is presented. This protocol is called agent-based trusted dynamic source routing protocol for MANETs. The objective of this protocol is to manage trust information locally with minimal overhead in terms of extra messages and time delay. This objective is achieved through installing in each participated node in the network a multi-agent system (MAS). MAS consists of two types of agents: monitoring agent and routing agent. A new mathematical and more realistic objective model for measuring the trust value is introduced. This model is weighted by both number and size of routed packets to reflect the "selective forwarding" behavior of a node. The performance evaluation via simulation shows that our protocol is better than standard and trusted DSR. The simulation is done over a variety of environmental conditions such as number of malicious nodes, host density and movement rates.

Power Control DSR Routing in Tunnel Environment Monitoring

As one of important technologies of IOT (Internet of Things), WSN (Wireless Sensor Networks) has been used in tunnel environmental monitoring. Tunnel environment monitoring has its particularity that WSN nodes show linear topologies. Traditional routing algorithms in WSN do not consider the linear topology of sensor nodes in tunnel and are difficult to realize long-time data transmission in limited battery power. In this paper, we propose Power Control Dynamic Source Routing algorithm (PC-DSR) by the thought of cross-layer design. Routing table is established according to the distance between nodes and the residual energy of nodes and optimum transmission power is calculated in order to save nodes’ power and prolong the life-time of the whole networks. Simulation results show that the novel algorithm can save node's transmission power, which increase the WSN lifetime of 12.3%.

Simulation and Implementation of an Attractiveness based On-Demand Routing Algorithm for Wireless Sensor Networks

A sensor network with an on-demand data centric routing strategy is presented. The routing between the sensor nodes and the data sink(s) (base station/s) is based on attractiveness-metric (Pa) gradients for the data forwarding decisions within the network. The performance of Pa based routing was simulated by the multi-agent simulation tool NetLogo and compared with the popular and widely used Dynamic Source Routing (DSR) algorithm. Additionally, to test the long term stability and the performance of the Pa based routing algorithm, several sensor nodes for local temperature and humidity measurement were placed in wine yards to monitor the risk of downy mildew infection.

A Source Based On-Demand Data Forwarding Scheme for Wireless Sensor Networks

Wireless Sensor Networks (WSNs) are becoming more important in the medical and environmental field. The authors propose an on-demand routing protocol using sensor attractiveness-metric (Pa) gradients for data forwarding decisions within the network. Attractiveness-based routing provides an efficient concept for data-centric routing in wireless sensor networks. The protocol works on-demand, is source-initiated, has a flat hierarchy and has its origin in the idea of pheromone-based routing. The algorithm supports node-to-sink data traffic and is therefore a lightweight approach to generalized multihop routing algorithms in WSNs. The performance evaluation of the proposed protocol is done by extensive simulation using a multi-agent based simulation environment called NetLogo. The efficiency of the attractiveness-based routing algorithm is compared in simulations with the well known Dynamic Source Routing algorithm (DSR). The authors conclude that the Pabased routing algorithm is well suited for easy to set up WSNs because of its simplicity of implementation and its adaptability to different scenarios by adjustable weighting factors for the node’s attractiveness metric.

Performance of improved dynamic source routing algorithm for military communication logistics

Mobile ad-hoc networks (MANETs) are autonomous, self-configuring and dynamic networks that operate without the support of any fixed infrastructure. Such networks are excellent candidates for military logistics which requires identification of location of sensitive frights and other communication need. Ad hoc routing protocol supports nodes mobility with multi-hop routing overwhelming the limitations of radio coverage in remote locations. Most of the present routing protocols are not designed to adapt congestion which is the dominant reason for packet loss, longer delay and jitter. In this paper, the original DSR protocol was modified to monitor the occurrence of congestion by using multiple resource utilisation thresholds as QoS attributes and trigger multi-path-routing during the periods of congestion to improve QoS. This paper also deals with the effects of mobility on the modified routing protocol. The NS-2 simulation results showed that a significant improvement in performance of modified DSR was achieved and decreases the network congestion with the use of multi-path routing.

Congestion Aware and Adaptive Dynamic Source Routing Algorithm with Load-balancing in MANETs

The explosive growth in the use of real-time multimedia applications in mobile devices requires quality of service (QoS) support for effective communication. Network congestion is the main reason for packet loss, longer delay and jitter in streaming multimedia applications. Most of the present routing protocols are not designed to adapt congestion. In this paper, the original DSR protocol is modified to define the occurrence of congestion by monitoring and reporting multiple resource utilization thresholds as QoS attributes and use multi-path-routing and load-balancing during the periods of congestion to improve QoS in MANETs for CBR multimedia applications. NS-2 simulation was extensively carried out to evaluate the performance of the modified DSR in terms of throughput, jitter and end-to-end delay. The results were compared with the original DSR in random node movements under varying traffic loads of 10, 15 and 20 CBR traffic flows to completely assess the applicability of the modified DSR. Simulation results showed that the proposed protocol can significantly improve the network performance for low and medium traffic load in multimedia based mobile ad hoc networks by extending the network lifetime and providing fewer packet losses than the original DSR.

NPR – A new QoS-based routing protocol for mobile ad-hoc networks

Ad-hoc on-demand networks have received a significant interest in the literature. Many routing schemes for such networks focus on finding an optimal path. In this paper, however, we consider the routing problem from the viewpoint of sustaining QoS (quality of service) requirement. Some algorithms such as MP-DSR already have considered this problem in terms of the end-to-end reliability requirement. While the Multi-Path Dynamic Source Routing (MP-DSR) algorithm is capable of resolving the issue to a certain extent, it only considers disjoint paths between a pair of source and destination nodes. In reality due to mobility of nodes there may not exist such disjoint paths. In this paper the proposed approach is independent of the nature of the paths, and yet it achieves the required reliability to satisfy QoS requirement.