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

The Research of Ad Hoc Network Routing Protocols

2014 ◽  
Vol 926-930 ◽  
pp. 2626-2629
Author(s):  
Qi Sun
Keyword(s):  
Wireless Ad Hoc Networks ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Network Routing ◽  
Network Size ◽  
Node Number ◽  
Topology Changes ◽  
Dynamic Source ◽  
Hoc Networks

Wireless Ad Hoc network routing algorithm is one of the core technologies of wireless Ad Hoc networks. Ad Hoc network is dynamic topology on characteristic, mainly reflected on the network node number and node movement, which lead to network topology changes, in order to study the Ad Hoc network size and topology changes influence on packet delivery, time delay and routing control, through experiment it is concluded that, the dynamic source routing protocol is an ideal choice.

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.

Energy Efficiency in Ad-Hoc On Demand Distance Vector and Dynamic Source Routing Protocols Using High Energy First Algorithm for Mobile Ad-Hoc Networks

2020 ◽  
Vol 17 (4) ◽  
pp. 1920-1924
Author(s):  
M. Vanitha ◽  
A. Rajiv ◽  
M. Sathya Priya
Keyword(s):  
Energy Efficiency ◽  
Routing Protocols ◽  
Ad Hoc ◽  
High Energy ◽  
Source Routing ◽  
On Demand ◽  
Dynamic Source ◽  
Distance Vector ◽  
Mobile Ad Hoc ◽  
Hoc Networks

The main issue that occurs in battery powered applications in Mobile Ad Hoc networks (MANETs) is energy efficiency. Routing protocols are mainly based on energy related parameters which are used to extend the lifetime of networks. In most of the situations Shortest path routing protocols are used in MANETs which do not consider the energy awareness. Hence power failure of the nodes affect the life time of the network. In this paper we focus on Energy efficiency in Ad-hoc On Demand Distance Vector (AODV) and Dynamic Source Routing (DSR) protocol by using High Energy First (HEF) algorithm to overcome the shortcomings that occur in MANETs due to increase in node density. Simulations are performed using NS-2 and we have compared the performance of AODV and DSR using HEF with the performance of existing DSR and AODV to prove the maximization of lifetime of the network. Simulation results show that the proposed protocols with HEF are efficient than the existing protocols.

Self-adaptive multi-purpose Grey Wolf optimization for efficient routing of wireless ad hoc networks

2018 ◽  
Vol 09 (05) ◽  
pp. 1850036
Author(s):  
Sandeep Raskar ◽  
Kamatchi Iyer
Keyword(s):  
Wireless Ad Hoc Networks ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Network Routing ◽  
Grey Wolf Optimizer ◽  
Grey Wolf ◽  
Least Cost Path ◽  
Shortest Path Routing ◽  
Hoc Networks ◽  
The Cost

One of the well-known issues in the field of network routing is the Shortest Path Routing (SPR). The objective is to find the least-cost path with minimum delay and link breaks. Even though there are many algorithms to solve SPR, the cost, as well as link breaks, are indeed more thought-provoking in the real-time application. This paper intends to develop a routing approach that solves the challenges like route establishment and route recovery. The selection of the optimal route is done by adopting a generalized multi-purpose optimization algorithm named Grey Wolf Optimizer. Along with this, this paper adopts Neural Network (NN) to predict the node movements in the ad hoc network. The proposed routing algorithm is compared to the conventional approaches, and the significance of the approach is described clearly.

scholarly journals Comparative Performance Analysis of Ad-Hoc Routing Protocol using NS-2 Simulator

2012 ◽  
pp. 50-54
Author(s):  
Prashant Rewagad ◽  
Nisha A. Lodha
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Network Routing ◽  
Performance Comparison ◽  
Ad Hoc Routing ◽  
Comparative Performance ◽  
Mobile Ad Hoc

Mobile Ad hoc Network is a collection of mobile nodes in which the wireless links are frequently broken down due to mobility and dynamic infrastructure. Routing is a significant issue and challenge in ad hoc networks. In Mobile ad hoc network, due to mobility of nodes network topology change frequently and thus, routing become challenging task to transfer the data from source to destination. A variety of routing protocols with varying network conditions are analyzed to find an optimized route from a source to some destination. This paper is based on performance comparison of two popular mobile ad-hoc network routing protocols using simulator i.e. DSR, ADOV. On the network simulation platform, a systematically simulation and research has been carried out on the performance of two routing protocols, and how the network environments impact on the performance of routing protocol.

Analyzing Performance of Ad hoc Routing Protocols under Various Constraints

2012 ◽  
pp. 152-166
Author(s):  
Lalitsen Sharma ◽  
Supriya Gupta
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Routing Protocols ◽  
Ad Hoc ◽  
Centralized Control ◽  
Ad Hoc Routing ◽  
Dynamic Source ◽  
Network Topologies ◽  
Mobile Ad Hoc ◽  
Hoc Networks

The mobility of nodes in mobile ad hoc networks and absence of any centralized control cause unpredictable changes in the network topologies. This makes routing a challenging task. Several routing protocols for mobile ad-hoc networks have come into existence. The protocols are classified in mainly in three categories: proactive, reactive, and hybrid. In this chapter, a study of one of each of the proactive and reactive protocols (respectively, Destination Sequence Distance Vector routing [DSDV], and Dynamic Source Routing [DSR]) is presented. The performance of above said protocols has been measured under varying mobility environment using NS-2 simulator based upon three quality metrics: average end-to-end delay, throughput, and jitter.

scholarly journals Analysis of Blackhole Attack in AODV and DS

2018 ◽  
Vol 8 (5) ◽  
pp. 3092
Author(s):  
Niranjan Panda ◽  
Binod Kumar Pattanayak
Keyword(s):  
Routing Protocols ◽  
Ad Hoc ◽  
Black Hole Attack ◽  
Source Routing ◽  
On Demand ◽  
Dynamic Source Routing ◽  
Blackhole Attack ◽  
Dynamic Source ◽  
Distance Vector ◽  
Hoc Networks

<p class="western" style="margin-top: 0.21cm; margin-bottom: 0cm; line-height: 100%;" lang="en-US" align="justify"><span>Mo</span><strong><span>b</span></strong><span>ile Ad-Hoc Networks (MANETs) are supreme ruler and demoralization wireless scheme. MANETs are infrastructure less i.e. their structure is not fixed, and the nodes be able to move about and can leave the network whenever they want. The nodes are to perform as more over router and host. In MANETs, the node can be in contact with every node as their configuration is not fixed and the nodes starts transmitting the packets to each other for the establishment of the connection. To hitch the link, the nodes make use of some routing protocols like Ad-Hoc On Demand Distance Vector (AODV), Dynamic Source Routing (DSR), and DestinationSequenced Distance Vector (DSDV). Security in MANET is the key matter meant for the fundamental utility of network. There are many attacks caused in MANET. Blackhole attack is one that occurs in MANET. A Black hole attack is an attack where the node, which is malicious advertise itself as having the optimal route to the destination and drops all the packets instead of forwarding further to the destination. Here, we have shown the blackhole attack in AODV and DSR. Through simulation we evaluate the performance of the two above protocols under blackhole attack.</span></p>

scholarly journals A survey on MANET protocols in wireless sensor networks

2018 ◽  
Vol 7 (2.31) ◽  
pp. 1
Author(s):  
C Cynthia, Prudhvi Krishna Saguturu ◽  
Komali Bandi ◽  
Srikanth Magulluri ◽  
T Anusha
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Wireless Sensor ◽  
On Demand ◽  
Dynamic Source ◽  
Distance Vector ◽  
Demand Routing ◽  
Hoc Networks

In Wireless sensor networks and ad hoc networks nodes have a freedom to move from one place to another, they are self-configuring this type of the structure fulfil the requirements of several application. A survey on the different MANET protocols will be done in this paper. Mainly this paper will focus on the Quality of Service on the different parameters like Throughput and Delay between different protocols like AODV (Ad Hoc on Demand Distance Vector), DSDV (Destination-Sequenced Distance-Vector Routing), DSR (Dynamic Source Routing), and TORA (Temporary Ordered Routing Algorithm). DSDV is called as proactive protocol because they know everything about the nodes in the network before the communication start. DSR, AODV, TORA protocols are called reactive protocol because nodes in this network do not know anything about network. They are also called ON-DEMAND routing protocols. After this analysis you will come to know which MANET protocol is best for different application. 

scholarly journals Flaws in Endair-A Secure Routing Protocol for MANETS

2013 ◽  
pp. 287-292
Author(s):  
B. Swetha ◽  
S. Ajay Kumar ◽  
TVS Prasad Gupta
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Ad Hoc ◽  
Network Routing ◽  
Secure Routing ◽  
Node Mobility ◽  
Ad Hoc Routing ◽  
Security Proof ◽  
Hoc Networks

Routing is the one of the essential criteria at network level in mobile ad hoc networks. Ad hoc network routing protocols are difficult to design, and secure because unable to handle rapid node mobility and network topology changes. It has been realized by many researchers, and several “secure” routing protocols have been proposed for ad hoc networks. However, the security of those protocols has mainly been analyzed by informal means only. In this paper, we argue that flaws in ad hoc routing protocols can be very subtle, and we advocate a more systematic way of analysis. This approach is based on the simulation paradigm, which has already been used extensively for the analysis of key establishment protocols, but to the best of our knowledge, it has not. A new ondemand source routing protocol, called endairA, and demonstrate the usage of our framework by proving security. It is analyzed and shown that the security proof for the route discovery algorithm, endairA is flawed due to hidden channel attack. To overcome this flaw of EndairA algorithm, we uses acknowledgement based reply to find a secured route which provides more security and overcomes the hidden channel attack in the existing approaches.

Sign in / Sign up

Export Citation Format

Share Document