scholarly journals Greedy Data Transportation Scheme with Hard Packet Deadlines for Wireless Ad Hoc Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
HyungJune Lee
Keyword(s):  
Wireless Ad Hoc Networks ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Mobile Node ◽  
Network Services ◽  
Delivery Ratio ◽  
Mobile Nodes ◽  
Packet Delivery ◽  
Hoc Networks ◽  
Ad Hoc Sensor Networks

We present a greedy data transportation scheme with hard packet deadlines in ad hoc sensor networks of stationary nodes and multiple mobile nodes with scheduled trajectory path and arrival time. In the proposed routing strategy, each stationary ad hoc node en route decides whether to relay a shortest-path stationary node toward destination or a passing-by mobile node that will carry closer to destination. We aim to utilize mobile nodes to minimize the total routing cost as far as the selected route can satisfy the end-to-end packet deadline. We evaluate our proposed routing algorithm in terms of routing cost, packet delivery ratio, packet delivery time, and usability of mobile nodes based on network level simulations. Simulation results show that our proposed algorithm fully exploits the remaining time till packet deadline to turn into networking benefits of reducing the overall routing cost and improving packet delivery performance. Also, we demonstrate that the routing scheme guarantees packet delivery with hard deadlines, contributing to QoS improvement in various network services.

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.

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 Novel Topological Multicast Routing Algorithm (ToMuRo)

2010 ◽  
Vol 8 (01) ◽  
Author(s):  
R Aquino Santos ◽  
L A Villaseñor González ◽  
V Rangel Licea ◽  
A González Potes ◽  
M A García Ruiz ◽  
...  
Keyword(s):  
Wireless Ad Hoc Networks ◽  
Ad Hoc ◽  
Multicast Routing ◽  
Routing Algorithm ◽  
Packet Delivery Ratio ◽  
Delivery Ratio ◽  
Mobility Patterns ◽  
Relay Nodes ◽  
Packet Delivery ◽  
Multicast Routing Algorithm

This paper presents a performance analysis of an enhanced version of the Topological Multicast Routing Algorithm (ToMuRo) on mobile wireless ad‐hoc networks, which includes undecided border nodes. Employing undecided border nodes to forward multicast packets represents a significant enhancement because it optimizes the path discovery process by selecting undecided nodes that can function as multicast relay nodes. Flooding Mechanism and On‐Demand Multicast Routing Protocol (ODMRP) are simulated and compared with both the basic and enhanced versions of the Topological Multicast Routing algorithm. The scenario evaluated considers one multicast transmitter and one, two, and three multicast receivers with various mobility patterns and transmission ranges. The behavior of 250 nodes is evaluated in terms of End to End Delay (EED), jitter, packet delivery ratio, and overhead. Results reveal that the enhanced version of ToMuRo performs better in terms of packet delivery ratio and jitter, while ODMRP performs better with respect to EED and Overhead.

scholarly journals Optimized Adaptive Back off Algorithm for Static and Mobile Wireless Ad hoc Networks

2020 ◽  
Vol 8 (5) ◽  
pp. 998-1002
Keyword(s):  
Ad Hoc Networks ◽  
Wireless Ad Hoc Networks ◽  
Ad Hoc ◽  
Delivery Ratio ◽  
Mobile Nodes ◽  
Medium Access ◽  
Mobile Wireless ◽  
Backoff Algorithm ◽  
Hoc Networks ◽  
Packet Drop

In wireless ad hoc networks with stationary and portable nodules situation, planning a backoff procedure is decisive to evade impact and to increase the act of nodules. Majority of the Medium Access Control (MAC) etiquettes intended for ad hoc networks take up stationary nodules situation. In this paper, an Optimized Adaptive Backoff Algorithm (OABA) is proposed for static and mobile wireless ad hoc networks. In this algorithm, during the back off stage, the type of node is determined as static or mobile. For mobile nodes, their residence time is determined in addition to their priority. Then optimized adaptive backoff algorithm is applied, by checking the type of node. Simulation results have shown that OABA achieves higher delivery ratio with minimized delay, packet drop and energy consumption.

scholarly journals Research on the Difficulty of Mobile Node Deployment’s Self-Play in Wireless Ad Hoc Networks Based on Deep Reinforcement Learning

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Huitao Wang ◽  
Ruopeng Yang ◽  
Changsheng Yin ◽  
Xiaofei Zou ◽  
Xuefeng Wang
Keyword(s):  
Reinforcement Learning ◽  
Ad Hoc Networks ◽  
Wireless Ad Hoc Networks ◽  
Ad Hoc ◽  
Mobile Node ◽  
Machine Learning Algorithms ◽  
Mobile Nodes ◽  
Sample Data ◽  
Hoc Networks ◽  
Dynamic Updating

Deep reinforcement learning is one kind of machine learning algorithms which uses the maximum cumulative reward to learn the optimal strategy. The difficulty is how to ensure the fast convergence of the model and generate a large number of sample data to promote the model optimization. Using the deep reinforcement learning framework of the AlphaZero algorithm, the deployment problem of wireless nodes in wireless ad hoc networks is equivalent to the game of Go. A deployment model of mobile nodes in wireless ad hoc networks based on the AlphaZero algorithm is designed. Because the application scenario of wireless ad hoc network does not have the characteristics of chessboard symmetry and invariability, it cannot expand the data sample set by rotating and changing the chessboard orientation. The strategy of dynamic updating learning rate and the method of selecting the latest model to generate sample data are used to solve the problem of fast model convergence.

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 Performance Evaluation of Routing Protocol on AODV and DSR under Wormhole Attack

2013 ◽  
Vol 1 (2013) ◽  
pp. 1-6 ◽  
Keyword(s):  
Ad Hoc Networks ◽  
Wireless Ad Hoc Networks ◽  
Ad Hoc ◽  
Delivery Ratio ◽  
Mobile Nodes ◽  
Wormhole Attack ◽  
Aodv Protocol ◽  
Dynamic Source ◽  
Hoc Networks ◽  
Scalable Network

Todays Mobile Ad hoc Networks (MANETs) became a popular issue for scientists, and diverse studies have been made to increase the performance of ad hoc networks. In MANET nodes compromise to forward packets for each other communicate beyond their transmission range. The mobile nodes communicate with each other without any infrastructure. As wireless ad-hoc networks lack an infrastructure, they are exposed to a lot of attacks. One of these attacks called Wormhole Attack that two adversary node collaborate together to transmit the packets in out of band channel. In this paper, performance of Ad hoc on-Demand Distance Vector (AODV) Protocol and Dynamic Source Routing (DSR) protocol are evaluated in presence of wormhole attack and without wormhole attack with Constant Bit Rate (CBR) traffic under dissimilar scalable network mobility. Also we evaluate effect and compare it with standard protocol in term of Packet Delivery Ratio, throughput and End to End Delay via simulation, using Network Simulation2 (NS2) for our research

scholarly journals Failure history-based routing protocol for mobile ad hoc networks

2020 ◽  
Vol 9 (1) ◽  
pp. 194
Author(s):  
Khalid Batiha ◽  
Aamal Khaled Ababneh
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Routing Protocol ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Delivery Ratio ◽  
Node Mobility ◽  
Mobile Nodes ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Mobile Ad-hoc NETworks (MANETs) are defined as a collection of mobile nodes that cooperate in order to operate. Nodes in MANETs should build and maintain routes in order to communicate. A routing algorithm is used to manage these routes. MANETs have dynamic topology because of node mobility. The probability of route failure increases when intermediate nodes have higher mobility. This study will propose a routing protocol that depends on the failure history of the nodes from which the route will constructed. The proposed protocol will be implemented over the existing Ad hoc On-Demand Distance Vector (AODV) routing protocol. It is expected that the proposed protocol will improve the packet delivery ratio in the network. 

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.

Sign in / Sign up

Export Citation Format

Share Document