scholarly journals A Stable Backup Routing Protocol for Wireless Ad Hoc Networks

Sensors ◽  
2020 ◽  
Vol 20 (23) ◽  
pp. 6743
Author(s):  
Fan Zhang ◽  
Gangqiang Yang
Keyword(s):  
Ad Hoc Networks ◽  
Wireless Ad Hoc Networks ◽  
High Speed ◽  
Ad Hoc ◽  
Path Selection ◽  
Delivery Ratio ◽  
Average Delay ◽  
Heavy Load ◽  
Packet Delivery ◽  
Hoc Networks

High-speed mobility and heavy-load traffic in mobile Ad hoc networks (MANET) may result in frequent topology changes and packet loss. To guarantee packet delivery, a novel stable backup routing (SBR) scheme is put forward in this paper, which consists of the establishment of backup routes and route maintenance. In SBR, backup routes are set up by overhearing MAC signals, and the bit error rate is considered in path selection for improving stability. To repair broken links effectively and reasonably, qualified backup routes are classified into three categories with different priorities, based on which the relevant nodes decide how to reconstruct the forwarding path. Extensive simulations demonstrate that our proposed method outperforms other comparable backup routing mechanisms in terms of packet delivery ratio, average delay and control overhead.

scholarly journals A Bipolar Traffic Density Awareness Routing Protocol for Vehicular Ad Hoc Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-12 ◽  
Author(s):  
David Chunhu Li ◽  
Li-Der Chou ◽  
Li-Ming Tseng ◽  
Yi-Ming Chen ◽  
Kai-Wei Kuo
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Path Selection ◽  
Traffic Density ◽  
Delivery Ratio ◽  
Packet Delivery ◽  
Hoc Networks

To support an increasing amount of various new applications in vehicular ad hoc networks (VANETs), routing protocol design has become an important research challenge. In this paper, we propose a Bipolar Traffic Density Awareness Routing (BTDAR) protocol for vehicular ad hoc networks. The BTDAR aims at providing reliable and efficient packets delivery for dense and sparse vehicle traffic network environments. Two distinct routing protocols are designed to find an optimal packet delivery path in varied vehicular networks. In dense networks, a link-stability based routing protocol is designed to take vehicles connectivity into consideration in its path selection policy and maximize the stability of intervehicle communications. In sparse networks, a min-delay based routing protocol is proposed to select an optimal route by analyzing intermittent vehicle connectivity and minimize packets delivery latency. Intervehicles connectivity model is analyzed. The performance of BTDAR is examined by comparisons with three distinct VANET routing protocols. Simulation results show that the BTDAR outperforms compared counterpart routing protocols in terms of packet delivery delay and packet delivery ratio.

scholarly journals Channel Contention-Based Routing Protocol for Wireless Ad Hoc Networks

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Noor Mast ◽  
Muhammad Altaf Khan ◽  
M. Irfan Uddin ◽  
Syed Atif Ali Shah ◽  
Atif Khan ◽  
...  
Keyword(s):  
Ad Hoc Networks ◽  
Wireless Ad Hoc Networks ◽  
Routing Protocol ◽  
Ad Hoc ◽  
Source Node ◽  
Delivery Ratio ◽  
Routing Overhead ◽  
Intermediate Node ◽  
Packet Delivery ◽  
Hoc Networks

With the development of wireless technology, two basic wireless network models that are commonly used, known as infrastructure and wireless ad hoc networks (WANETs), have been developed. In the literature, it has been observed that channel contention is one of the main reasons for packet drop in WANETs. To handle this problem, this paper presents a routing protocol named CCBR (Channel Contention Based Routing). CCBR tries to determine a least contended path between the endpoints to increase packet delivery ratio and to reduce packet delay and normalized routing overhead. Moreover, throughout the active data section, each intermediate node computes its channel contention value. If an intermediate node detects an increase in channel contention, it notifies the source node. Then the source node determines another least contended route for transmission. The advantages of CCBR are verified in our NS2-based performance study, and the results show that CCBR outperforms ad hoc on-demand distance vector (AODV) in terms of packet delivery ratio, end-to-end delay, and routing overhead by 4% to 9%.

scholarly journals Cross-Layer Path Configuration for Energy-Efficient Communication over Wireless Ad Hoc Networks

2007 ◽  
Vol 2007 ◽  
pp. 1-9 ◽  
Author(s):  
Hong-Chuan Yang ◽  
Kui Wu ◽  
Wu-Sheng Lu
Keyword(s):  
Ad Hoc Networks ◽  
Wireless Ad Hoc Networks ◽  
Energy Efficient ◽  
Ad Hoc ◽  
Optimization Problems ◽  
Cross Layer ◽  
Delivery Ratio ◽  
Packet Delivery ◽  
Battery Capacity ◽  
Hoc Networks

We study the energy-efficient configuration of multihop paths with automatic repeat request (ARQ) mechanism in wireless ad hoc networks. We adopt a cross-layer design approach and take both the quality of each radio hop and the battery capacity of each transmitting node into consideration. Under certain constraints on the maximum tolerable transmission delay and the required packet delivery ratio, we solve optimization problems to jointly schedule the transmitting power of each transmitting node and the retransmission limit over each hop. Numerical results demonstrate that the path configuration methods can either significantly reduce the average energy consumption per packet delivery or considerably extend the average lifetime of the multihop route.

scholarly journals DSDV Extension to Enhance the Performance of Ad Hoc Networks in High Diverse-Velocity Environments

2020 ◽  
Vol 14 (06) ◽  
pp. 95
Author(s):  
Mada’ Abdel Jawad ◽  
Saeed Salah ◽  
Raid Zaghal
Keyword(s):  
Ad Hoc Networks ◽  
High Speed ◽  
Ad Hoc ◽  
Performance Metrics ◽  
Delivery Ratio ◽  
Network Simulator ◽  
Mobile Nodes ◽  
Average Delay ◽  
Congested Networks ◽  
Hoc Networks

<p class="0abstractCxSpFirst">Mobile Ad-Hoc Networks (MANETs) are characterized as decentralized control networks. The mobile nodes route and forward data based on their routing information without the need for routing devices. In this type of networks, nodes move in an unstructured environment where some nodes are still fixed, others are moving in a constant velocity, and others move with diverse velocities; and thus, they need special protocols to keep track of network changes and velocity changes among the nodes. Destination Sequenced Distance-Vector (DSDV) routing protocol is one of the most popular proactive routing protocols for wireless networks. This protocol has a good performance in general, but with high speed nodes and congested networks its performance degrades quickly.</p><p class="0abstractCxSpLast">In this paper we propose an extension to the DSDV (we call it Diverse-Velocity DSDV) to address this problem. The main idea is to modify the protocol to include node speed, determine update intervals and the duration of settling time. To evaluate the performance of the new protocol, we have carried a number of simulation scenarios using the Network Simulator tool (NS-3) and measured relevant parameters such as: packet delivery ratio, throughput, end-to-end delay, and routing overhead. We have compared our results with the original DSDV and some of its new variants. The new protocol has demonstrated a noticeable improvement of performance in all scenarios, and the measured performance metrics outperform the others except the average delay where the performance of the new protocol was modest.</p>

A Bandwidth and Energy Aware QoS Routing Protocol for Enhanced Performance in Ad-hoc Networks

2019 ◽  
Vol 9 (2) ◽  
pp. 203-213
Author(s):  
Priyanka Bharadwaj ◽  
Surjeet Balhara
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocol ◽  
Ad Hoc ◽  
Qos Routing ◽  
Delivery Ratio ◽  
Energy Aware ◽  
Multimedia Services ◽  
Average Delay ◽  
Hoc Networks

Background & Objective: There are some challenging issues such as providing Quality of Service (QoS), restricted usage of channels and shared bandwidth pertaining to ad-hoc networks in a dynamic topology. Hence, there is a requirement to support QoS for the application environment and multimedia services in ad-hoc networks with the fast growing and emerging development of information technology. Eventually, bandwidth is one of the key elements to be considered. Methods: Energy aware QoS routing protocol in an ad-hoc network is presented in this article. Results and Conclusion: The simulation results indicate that the improved protocol outperforms Adhoc On-Demand Distance Vector (AODV) routing protocol in terms of QoS metric such as throughput, packet delivery ratio, loss rate and average delay.

Performance Analysis of TCP Variants using AODV and DSDV Routing Protocols in MANETs

2019 ◽  
Vol 13 ◽  
Author(s):  
Rajnesh Singh ◽  
Neeta Singh ◽  
Aarti Gautam Dinker
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocols ◽  
Ad Hoc ◽  
Packet Delivery Ratio ◽  
Transport Layer ◽  
Destination Node ◽  
Delivery Ratio ◽  
Packet Delivery ◽  
Two Measures ◽  
Hoc Networks

TCP is the most reliable transport layer protocol that provides reliable data delivery from source to destination node. TCP works well in wired networks but it is assumed that TCP is less preferred for ad-hoc networks. However, for application in ad-hoc networks, TCP can be modified to improve its performance. Various researchers have proposed improvised variants of TCP by only one or two measures. These one or two measures do not seem to be sufficient for proper analysis of improvised version of TCP. So, in this paper, the performance of different TCP versions is investigated with DSDV and AODV routing Protocols. We analyzed various performance measures such as throughput, delay, packet drop, packet delivery ratio and number of acknowledgements. The simulation results are carried out by varying number of nodes in network simulator tool NS2. It is observed that TCP Newreno achieved higher throughput and packet delivery ratio with both AODV and DSDV routing protocols.Whereas TCP Vegas achieved minimum delay and packet loss with both DSDV and AODV protocol. However TCP sack achieved minimum acknowledgment with both AODV and DSDV routing protocols. In this paper the comparison of all these TCP variants shows that TCP Newreno provides better performance with both AODV and DSDV protocols.

scholarly journals Enhancing Reactive Ad Hoc Routing Protocols with Trust

2022 ◽  
Vol 14 (1) ◽  
pp. 28
Author(s):  
Yelena Trofimova ◽  
Pavel Tvrdík
Keyword(s):  
Wireless Ad Hoc Networks ◽  
Routing Protocols ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Sensor Nodes ◽  
Delivery Ratio ◽  
Ad Hoc Routing ◽  
Trust Mechanism ◽  
Packet Delivery ◽  
Hoc Networks

In wireless ad hoc networks, security and communication challenges are frequently addressed by deploying a trust mechanism. A number of approaches for evaluating trust of ad hoc network nodes have been proposed, including the one that uses neural networks. We proposed to use packet delivery ratios as input to the neural network. In this article, we present a new method, called TARA (Trust-Aware Reactive Ad Hoc routing), to incorporate node trusts into reactive ad hoc routing protocols. The novelty of the TARA method is that it does not require changes to the routing protocol itself. Instead, it influences the routing choice from outside by delaying the route request messages of untrusted nodes. The performance of the method was evaluated on the use case of sensor nodes sending data to a sink node. The experiments showed that the method improves the packet delivery ratio in the network by about 70%. Performance analysis of the TARA method provided recommendations for its application in a particular ad hoc network.

Sign in / Sign up

Export Citation Format

Share Document