scholarly journals Mobility-Assisted on-Demand Routing Algorithm for MANETs in the Presence of Location Errors

2014 ◽  
Vol 2014 ◽  
pp. 1-11 ◽  
Author(s):  
Trung Kien Vu ◽  
Sungoh Kwon
Keyword(s):  
Ad Hoc ◽  
Routing Algorithm ◽  
Mobility Prediction ◽  
Location Awareness ◽  
Mobile Nodes ◽  
Location Errors ◽  
On Demand ◽  
Demand Routing ◽  
Hoc Networks ◽  
The Impact

We propose a mobility-assisted on-demand routing algorithm for mobile ad hoc networks in the presence of location errors. Location awareness enables mobile nodes to predict their mobility and enhances routing performance by estimating link duration and selecting reliable routes. However, measured locations intrinsically include errors in measurement. Such errors degrade mobility prediction and have been ignored in previous work. To mitigate the impact of location errors on routing, we propose an on-demand routing algorithm taking into account location errors. To that end, we adopt the Kalman filter to estimate accurate locations and consider route confidence in discovering routes. Via simulations, we compare our algorithm and previous algorithms in various environments. Our proposed mobility prediction is robust to the location errors.

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 Modeling and verifying the Ariadne protocol using process algebra

2013 ◽  
Vol 10 (1) ◽  
pp. 393-421 ◽  
Author(s):  
Xi Wu ◽  
Huibiao Zhu ◽  
Yongxin Zhao ◽  
Zheng Wang ◽  
Liu Si
Keyword(s):  
Routing Protocols ◽  
Process Algebra ◽  
Ad Hoc ◽  
Route Discovery ◽  
Mobile Nodes ◽  
On Demand ◽  
Secure Protocol ◽  
Mobile Ad Hoc ◽  
Demand Routing ◽  
Hoc Networks

Mobile Ad Hoc Networks (MANETs) are formed dynamically by mobile nodes without the support of prior stationary infrastructures. In such networks, routing protocols, particularly secure ones are always the essential parts. Ariadne, an efficient and well-known on-demand secure protocol of MANETs, mainly concerns about how to prevent a malicious node from compromising the route. In this paper, we apply the method of process algebra Communicating Sequential Processes (CSP) to model and reason about the Ariadne protocol, focusing on the process of its route discovery. In our framework, we consider the communication entities as CSP processes, including the initiator, the intermediate nodes and the target. Moreover, we also propose an intruder model allowing the intruder to learn and deduce much information from the protocol and the environment. Note that the modeling approach is also applicable to other protocols, which are based on the on-demand routing protocols and have the route discovery process. Finally, we use PAT, a model checker for CSP, to verify whether the model caters for the specification and the non-trivial secure properties, e.g. nonexistence of fake path. Three case studies are given and the verification results naturally demonstrate that the fake routing attacks may be present in the Ariadne protocol.

A Study of Speed Aware Routing for Mobile Ad Hoc Networks

2013 ◽  
pp. 190-212
Author(s):  
Kirthana Akunuri ◽  
Ritesh Arora ◽  
Ivan G. Guardiola
Keyword(s):  
Routing Protocol ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
High Mobility ◽  
Node Mobility ◽  
On Demand ◽  
Expiration Time ◽  
Mobile Ad Hoc ◽  
Demand Routing ◽  
Hoc Networks

The flexibility of movement for the wireless ad hoc devices, referred to as node mobility, introduces challenges such as dynamic topological changes, increased frequency of route disconnections and high packet loss rate in Mobile Ad hoc Wireless Network (MANET) routing. This research proposes a novel on-demand routing protocol, Speed-Aware Routing Protocol (SARP) to mitigate the effects of high node mobility by reducing the frequency of route disconnections in a MANET. SARP identifies a highly mobile node which forms an unstable link by predicting the link expiration time (LET) for a transmitter and receiver pair. NS2 was used to implement the SARP with ad hoc on-demand vector (AODV) as the underlying routing algorithm. Extensive simulations were then conducted using Random Waypoint Mobility model to analyze the performance of SARP. The results from these simulations demonstrated that SARP reduced the overall control traffic of the underlying protocol AODV significantly in situations of high mobility and dense networks; in addition, it showed only a marginal difference as compared to AODV, in all aspects of quality-of-service (QOS) in situations of low mobility and sparse networks.

Routing Algorithms for Mobile Ad Hoc Networks

2010 ◽  
pp. 150-160
Author(s):  
Saad Harous
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Routing Algorithms ◽  
Mobile Nodes ◽  
Energy Aware ◽  
Mobile Ad Hoc ◽  
Demand Routing ◽  
Hoc Networks

In this chapter, we will introduce mobile ad hoc networks and issues related to routing data in such networks. Mobile ad hoc networks (MANET) are multi-hop networks made up of mobile nodes cooperating together to maintain the network connectivity. These kinds of network are very useful in situations where a temporary network is needed, such as military area, disaster area, and so on. MANET routing protocols are divided into two categories: proactive (table driven routing) and reactive (on-demand routing) routing. In conventional routing algorithms, if information is to be sent between two nodes, then the shortest path connecting these two nodes is found and used. However this approach does not take into consideration the fact that these devices are battery-operated, so the energy consumed is very important. A number of energy aware algorithms will be presented and their advantages and disadvantages will be discussed in this chapter. Also we will present and discuss the different metrics considered when designing a power aware routing algorithm

scholarly journals DETECTION AND REMOVAL OF BLACK HOLE IN MOBILE AD-HOC NETWORK (MANET)

2013 ◽  
pp. 88-90
Author(s):  
SHRADDHA RAUT ◽  
SD CHEDE
Keyword(s):  
Black Hole ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Central Administration ◽  
Mobile Nodes ◽  
On Demand ◽  
Aodv Protocol ◽  
Demand Routing ◽  
Hoc Networks

This paper gives information about the detection technique of black hole in the MANET. An ad hoc network is a collection of mobile nodes that dynamically form a temporary network. It operates without the central administration. Hence it becomes more susptable to the attacker .Mostly used on- demand routing protocols used in Ad-Hoc networks is AODV (Ad-Hoc On demand DistanceVector) protocol. The security of the AODV protocol is compromised by a particular of attack called “Black Hole” attack. In this attack, a malicious node advertises itself as having the shortest path to the node whose packets it wants to intercept. To reduce the probability, it is proposed to wait and check the replies from all the neighboring nodes to find a safe route.

scholarly journals Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks

2005 ◽  
Vol 11 (1-2) ◽  
pp. 21-38 ◽  
Author(s):  
Yih-Chun Hu ◽  
Adrian Perrig ◽  
David B. Johnson
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocol ◽  
Ad Hoc ◽  
On Demand ◽  
Demand Routing ◽  
Hoc Networks
Sign in / Sign up

Export Citation Format

Share Document