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 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.

Research of Improvement of GPSR Protocol in Vehicular Ad Hoc Networks

2015 ◽  
Vol 738-739 ◽  
pp. 1115-1118
Author(s):  
Li Cui Zhang ◽  
Xiao Nan Zhu ◽  
Zhi Gang Wang ◽  
Guang Hui Han
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocol ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Packet Delivery Ratio ◽  
Data Packet ◽  
Delivery Ratio ◽  
Packet Delivery ◽  
End To End Delay ◽  
Hoc Networks

Considering the shortcoming of the traditional Greedy Perimeter Stateless Routing Protocol in the Vehicular Ad hoc Networks ,this paper focuses on an improved GPSR protocol based on the density of vehicle flow .This new scheme includes macro-directing algorithm , micro-forwarding strategy and the maintenance of the neighbor list.The simulation result shows that compared with the traditional GPSR protocol, the new GPSR protocol improves data packet delivery ratio, but its average end-to-end delay is slightly larger than before.

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.

FSR Evaluation Using the Suboptimal Operational Values

2009 ◽  
pp. 203-211
Author(s):  
Osama H.S. Khader
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Routing Protocol ◽  
Ad Hoc ◽  
Packet Delivery Ratio ◽  
Delivery Ratio ◽  
Packet Delivery ◽  
Large Populations ◽  
Mobile Ad Hoc ◽  
Hoc Networks

In mobile ad hoc networks, routing protocols are becoming more complicated and problematic. Routing in mobile ad hoc networks is multi-hop because of the limited communication range of wireless radios. Since nodes in the network can move freely and randomly, an efficient routing protocol is needed in order for such networks to be able to perform well in such an environment. In this environment the routing strategy is applied such that it is flexible enough to handle large populations and mobility and be able to minimize the use of the battery. Also it should be designed to achieve maximum packet delivery ratio. Further more, the routing protocol must perform well in terms of fast convergence, low routing delay, and low control overhead traffic. In this paper an improved implementation of the Fisheye State Routing (FSR) protocols is presented, where a new selection routing criteria that utilizes a minimum number of hops is a selection metric. The results obtained from simulation indicate that the fewer number of hops used the better and more efficient the output for packet delivery ratio was generated.

USING NS-2 COMPARISON OF GEOGRAPHICAL AND TOPOLOGICAL MULTICAST ROUTING PROTOCOLS ON WIRELESS AD HOC NETWORKS

2017 ◽  
Vol 5 (4) ◽  
pp. 01-07
Author(s):  
Gulbir Singh ◽  
Dr. Om Prakash Dubey ◽  
Maloy Dey
Keyword(s):  
Ad Hoc Networks ◽  
Wireless Ad Hoc Networks ◽  
Routing Protocol ◽  
Ad Hoc ◽  
Multicast Routing ◽  
Routing Algorithms ◽  
Delivery Ratio ◽  
Mesh Topology ◽  
Multicast Routing Protocol ◽  
Hoc Networks

Performance evaluation of geographical and topological multicast routing algorithms for cellular Wi-Fi ad-hoc networks is offered. Flooding and On-call for Multicast Routing Protocol (ODMRP) are simulated and in comparison with novels protocols: Topological Multicast Routing (ToMuRo) and Geographical Multicast Routing (GeMuRo) in pedestrian and vehicular situations. The situations evaluated recollect one multicast transmitter and one, two and three multicast receivers under numerous mobility and transmission levels. The conduct of 150 nodes is evaluated in terms of cease to end postpone (EED), jitter, packet delivery ratio, and overhead. Consequences display that ToMuRo is suitable for pedestrian eventualities because of its tree-based structure and GeMuRo is right for vehicular situations because its miles based on a mesh topology.

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.

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 A Survey on Applications of Reinforcement Learning in Flying Ad-Hoc Networks

Electronics ◽  
2021 ◽  
Vol 10 (4) ◽  
pp. 449
Author(s):  
Sifat Rezwan ◽  
Wooyeol Choi
Keyword(s):  
Reinforcement Learning ◽  
Ad Hoc Networks ◽  
Wireless Ad Hoc Networks ◽  
Routing Protocol ◽  
Traffic Congestion ◽  
Ad Hoc ◽  
High Mobility ◽  
Flight Trajectory ◽  
Research Issues ◽  
Hoc Networks

Flying ad-hoc networks (FANET) are one of the most important branches of wireless ad-hoc networks, consisting of multiple unmanned air vehicles (UAVs) performing assigned tasks and communicating with each other. Nowadays FANETs are being used for commercial and civilian applications such as handling traffic congestion, remote data collection, remote sensing, network relaying, and delivering products. However, there are some major challenges, such as adaptive routing protocols, flight trajectory selection, energy limitations, charging, and autonomous deployment that need to be addressed in FANETs. Several researchers have been working for the last few years to resolve these problems. The main obstacles are the high mobility and unpredictable changes in the topology of FANETs. Hence, many researchers have introduced reinforcement learning (RL) algorithms in FANETs to overcome these shortcomings. In this study, we comprehensively surveyed and qualitatively compared the applications of RL in different scenarios of FANETs such as routing protocol, flight trajectory selection, relaying, and charging. We also discuss open research issues that can provide researchers with clear and direct insights for further research.

Sign in / Sign up

Export Citation Format

Share Document