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 Effective Analysis of Different Parameters in Ad hoc Network for Different Protocols

2012 ◽  
pp. 234-237
Author(s):  
Kumar Manoj ◽  
S. C. Sharma ◽  
Chandra s
Keyword(s):  
Wireless Ad Hoc Networks ◽  
Routing Protocols ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Network Routing ◽  
Ad Hoc Routing ◽  
On Demand ◽  
Dynamic Source ◽  
Hoc Networks

A wireless Ad-hoc network consists of wireless nodes communicating without the need for a centralized administration, in which all nodes potentially contribute to the routing process. A user can move anytime in an ad hoc scenario and, as a result, such a network needs to have routing protocols which can adopt dynamically changing topology. To accomplish this, a number of ad hoc routing protocols have been proposed and implemented, which include Dynamic Source Routing (DSR), ad hoc on-demand distance vector (AODV) routing, and temporally ordered routing algorithm (TORA). In this paper, we analyze the performance differentials to compare the above-mentioned commonly used ad hoc network routing protocols. We report the simulation results of four different scenarios for wireless ad hoc networks having thirty nodes. The performances of proposed networks are evaluated in terms of number of hops per route, re transmission attempts, traffic sent, traffic received and throughput with the help of OPNET simulator. Channel speed 11Mbps and simulation time 20 minutes were taken. For this above simulation environment, TORA shows better performance over the two on-demand protocols, that is, DSR and AODV

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

Study on a Novel GIS-Based Routing Strategy

2014 ◽  
Vol 644-650 ◽  
pp. 2969-2972
Author(s):  
Yue Wei Wang ◽  
Ding Yi Ji
Keyword(s):  
Routing Protocols ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
High Mobility ◽  
Delivery Ratio ◽  
Scenario Simulation ◽  
Packet Delivery ◽  
Routing Strategy ◽  
Topology Changes ◽  
The City

Given a scenario of Vehicle Ad hoc Network (VANET), this paper presented a GIS-Based routing (GBR) strategy to resolve frequent reconstruction caused by rapid topology changes. Due to the use of road information based on GIS, the protocol can evade permanent or temporary topology holes respectively which frequently occurred in the city scenario. Simulation results showed new routing protocols could achieve better performance in packet delivery ratio and proved GBR’s lower routing overhead, as well as it is better performances in high mobility, compared with DSR in urban vehicle environment.

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 Applicability of Overlay Non-Delay Tolerant Position-Based Protocols in Highways and Urban Environments for VANET

2021 ◽  
Vol 13 (2) ◽  
pp. 9-24
Author(s):  
Mahmoud Ali Al Shugran
Keyword(s):  
Ad Hoc Networks ◽  
Wireless Ad Hoc Networks ◽  
Routing Protocols ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Delivery Ratio ◽  
Hop Count ◽  
On The Road ◽  
Hoc Networks ◽  
Delay Tolerant

Vehicular Ad hoc Networks (VANETs) is new sort in wireless ad-hoc networks. Vehicle-to-Vehicle (V2V) communication is one of the main communication paradigms that provide a level of safety and convenience to drivers and passengers on the road. In such environment, routing data packet is challenging due to frequently changed of network topology because of highly dynamic nature of vehicles. Thus, routing in VANETs in require for efficient protocols that guarantee message transmission among vehicles. Numerous routing protocols and algorithms have been proposed or enhanced to solve the aforementioned problems. Many position based routing protocols have been developed for routing messages that have been identified to be appropriate for VANETs. This work explores the performances of selected unicast non-delay tolerant overlay position-based routing protocols. The evaluation has been conducted in highway and urban environment in two different scenarios. The evaluation metrics that are used are Packet Delivery Ratio (PDR), Void Problem Occurrence (VPO), and Average Hop Count (AHC).

Secure Mobile ad Hoc Networks Based-on Ant Colony: A Comparative Study and State-of-the-art Core-based Networks

2020 ◽  
Vol 10 ◽  
Author(s):  
Tarek S. Sobh
Keyword(s):  
Routing Protocols ◽  
Ad Hoc ◽  
State Of The Art ◽  
Ant Colony ◽  
Delivery Ratio ◽  
Ant Colonies ◽  
Trust Value ◽  
Packet Delivery ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Aim:: This work evaluates existing secure ant colony protocols of MANETs such as ASHFIK, AAMRP, and MANHSI with each other. Here, each node in the proposed ad hoc network protocols is known with a trust value. Each trust value represents the corresponding security level and a node with a higher trust value is authorized to monitor and lead as a core node its neighboring nodes. Background:: Trusted critical MANET is a secure wireless network that is used in different critical applications. Military battlefields are an example of these applications that force on people a number of needed things including robustness and reliable performance within high mobility situations and constraints (e.g. hostile attacks, cost, and battery limits). Objectives:: In this work, the extremely important similarity between the features of critical MANETs and the core-based routing protocols that are based-on ant colonies. Methods:: The metrics used in this evaluation are the availability, reliability, packet delivery ratio, and total overheads, while the performance is serious and stubborn because of the mobility of node, senders' number, and size of a multicast group. Results:: The results of the simulation show that ASHFIK provides better availability, reliability, Packet Delivery Ratio (PDR), and lower total overheads. In addition, the results show that ASHFIK remains consistent performance with a different group size of the network. It means a trusted and scalable network of ant colony core-based routing protocols. Conclusion:: here are existing different mobile ad hoc networks based-on ant colonies. According to our comparative study and state-of-the-art, the ASHFIK protocol can be used as a good routing protocol for critical MANETs that are based-on ant colonies.

Research of Ad Hoc Network Routing Based on NS2 by Performance Comparison

2014 ◽  
Vol 989-994 ◽  
pp. 4633-4636
Author(s):  
Xiao Long Tan ◽  
Jia Zhou ◽  
Wen Bin Wang
Keyword(s):  
Routing Protocols ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Network Routing ◽  
Performance Comparison ◽  
Delivery Ratio ◽  
Routing Overhead ◽  
Packet Delivery ◽  
End To End Delay ◽  
Ns2 Simulation

In recent years,the ad hoc network has been paid extensive attention due to its characteristics of non-center and self-organization.Firstly this paper introduces three typical routing protocols AODV,DSDV,DSR,and the principles of them; then,adopts the NS2 simulation platform to simulate the performance of end-to-end delay,routing overhead and packet delivery ratio by changing the number of nodes and the paused time of nodes.Finally,by comparing the simulating results, the comparison conclusion is provided.

scholarly journals Analyzing the impact of the number of nodes on the performance of the routing protocols in manet environment

2021 ◽  
Vol 10 (1) ◽  
pp. 434-440
Author(s):  
Hussein M. Haglan ◽  
Salama A. Mostafa ◽  
Noor Zuraidin Mohd Safar ◽  
Aida Mustapha ◽  
Mohd. Zainuri Saringatb ◽  
...  
Keyword(s):  
Routing Protocols ◽  
Ad Hoc ◽  
Variable Number ◽  
Delivery Ratio ◽  
Packet Delivery ◽  
Communication Structures ◽  
End To End Delay ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
The Impact

Mobile Ad-hoc Networks (MANETs) are independent systems that can work without the requirement for unified controls, pre-setup to the paths/routes or advance communication structures. The nodes/hubs of a MANET are independently controlled, which permit them to behave unreservedly in a randomized way inside the MANET. The hubs can leave their MANET and join different MANETs whenever the need arises. These attributes, in any case, may contrarily influence the performance of the routing conventions (or protocols) and the general topology of the systems. Along these lines, MANETs include uniquely planned routing conventions that responsively as well as proactively carry out the routing. This paper assesses and looks at the effectiveness (or performance) of five directing conventions which are AOMDV, DSDV, AODV, DSR and OLSR in a MANET domain. The research incorporates executing a simulating environment to look at the operation of the routing conventions dependent on the variable number of hubs. Three evaluation indices are utilized: Throughput (TH), Packet Delivery Ratio (PDR), and End-to-End delay (E2E). The assessment outcomes indicate that the AODV beats other conventions in the majority of the simulated scenarios.

scholarly journals Packet Delivery Ratio and Overhead Reduction for À-GPS Mobile Ad-Hoc Networks

2020 ◽  
Vol 9 (3) ◽  
pp. 743-747
Keyword(s):  
Mobile Ad Hoc Networks ◽  
Routing Protocol ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Delivery Ratio ◽  
Significant Issue ◽  
Packet Delivery ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Now a day’s mobile ad-hoc network (MANET) is engaged by numerous scientists and endeavoring to be conveyed by and by. To accomplish this objective, these two components are a significant issue that we need to consider. The first is "overhead". As it were, messages that is not important to be sent when setting up a system association between versatile hubs. The following issue is the parcel sending rate from source to the goal hub that sufficiently high to ensure a successful system association. This paper is concentrating on improving the exhibition of the Location-Aided Routing Protocol (LAR) regarding overhead decrease by adjusting the calculation of the MANET course disclosure process. The consequence of the reproduction shows that the proposed convention can decrease overhead definitely, growing system lifetime and increment parcel sending rate while contrasting and other traditional conventions.

Sign in / Sign up

Export Citation Format

Share Document