scholarly journals Self-Adaptive Trust Based ABR Protocol for MANETs UsingQ-Learning

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Anitha Vijaya Kumar ◽  
Akilandeswari Jeyapal
Keyword(s):  
Ad Hoc ◽  
Weighted Average ◽  
Complex Problem ◽  
Secure Routing ◽  
Delivery Ratio ◽  
Mobile Nodes ◽  
Trust Value ◽  
Security Challenges ◽  
Hoc Networks ◽  
The Stability

Mobile ad hoc networks (MANETs) are a collection of mobile nodes with a dynamic topology. MANETs work under scalable conditions for many applications and pose different security challenges. Due to the nomadic nature of nodes, detecting misbehaviour is a complex problem. Nodes also share routing information among the neighbours in order to find the route to the destination. This requires nodes to trust each other. Thus we can state that trust is a key concept in secure routing mechanisms. A number of cryptographic protection techniques based on trust have been proposed.Q-learning is a recently used technique, to achieve adaptive trust in MANETs. In comparison to other machine learning computational intelligence techniques,Q-learning achieves optimal results. Our work focuses on computing a score usingQ-learning to weigh the trust of a particular node over associativity based routing (ABR) protocol. Thus secure and stable route is calculated as a weighted average of the trust value of the nodes in the route and associativity ticks ensure the stability of the route. Simulation results show thatQ-learning based trust ABR protocol improves packet delivery ratio by 27% and reduces the route selection time by 40% over ABR protocol without trust calculation.

A Survey of Efficient Trust Management Schemes in Mobile Ad-Hoc Network

2021 ◽  
pp. 151-172
Author(s):  
J. Kaur ◽  
S. Kaur
Keyword(s):  
Trust Management ◽  
Ad Hoc ◽  
Delivery Ratio ◽  
Detection Accuracy ◽  
Mobile Nodes ◽  
Trust Value ◽  
Mobile Hosts ◽  
Wireless Medium ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Mobile Ad Hoc Networks (MANETs) are comprised of an arrangement of self-sorting mobile hosts furnished with wireless interaction devices gathered in groups without the need of any settled framework as well as centralized organization to maintain a system over radio connections. Every mobile node can react as a host and also, the router freely utilizes the wireless medium inside the correspondence range to deal with the interaction between huge quantities of individual mobile nodes by framing a correspondence system and trading the information among them without using any described group of the base station. A trust-based model in MANET estimates and sets up trust relationship among objectives. Trust-based routing is utilized to keep away data from different attackers like a wormhole, DOS, black-hole, selfish attack and so forth. Trust can be executed in different steps like reputation, subjective rationale and from the supposition of the neighboring node. A trust estimation approach not just watches the behavior of neighbor nodes, additionally it screens the transmission of the information packet in the identification of the route for exact estimation of trust value. A survey is carried out to find some of the limitations behind the existing works which has been done by the researchers to implement various approaches thus to build the trust management framework. Through the survey, it is observed that existing works focused only on the authenticated transmission of the message, how it transmits packets to the destination node securely using a trust-based scheme. And also, it is observed that the routing approach only focused on the key management issues. Certain limitation observed in the implemented approaches of existing work loses the reliability of framework. Thus, to withstand these issues it is necessary to establish a reliable security framework that protects the information exchanged among the users in a network while detecting various misbehaving attacks among the users. Confidentiality, as well as the integrity of information, can be secured by combining context-aware access control with trust management. The performance parameters should be evaluated with the previous works packet delivery ratio, packet drop, detection accuracy, number of false positives, and overhead.

scholarly journals Simulation of Cryptographic Algorithms in IPSec on Ad-Hoc Networks

2017 ◽  
Vol 28 (1) ◽  
pp. 31-46
Author(s):  
A.A. Adas A.A. Adas
Keyword(s):  
Ad Hoc Networks ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Data Communication ◽  
Secure Routing ◽  
Security Model ◽  
Mobile Nodes ◽  
New Paradigm ◽  
Hoc Networks ◽  
Ipsec Protocol

This paper focuses on secure data communication between nodes in Ad-Hoc networks by employing IPSec (Internet Protocol Security). In wireless communication, Ad-Hoc network is a new paradigm since, which is used for highly sensitive and emergency operations. Ad-Hoc network is considered a number of mobile nodes that are connected through wireless interfaces and moves arbitrarily. Ensuring security is one of the main issues due to its infrastructure less solutions. This research aims for IPSec protocol that provides security for an Ad-Hoc networking in a various applications. IPSec incorporates security model, i.e. AES (Advanced Encryption Standard) into its framework. In this work, we consider the problem of incorporating security mechanisms to securing data communication for Ad-Hoc networks. We look at AODV routing protocol (Ad-Hoc On-Demand Distance Vector) in detail and it is used for secure routing. Simulation of IPSec protocol is simulated using NS-3 simulator. Results from NS-3 simulator is compared with AH, ESP, and AES in terms of Quality of Service parameters throughput, average processing time and average end-to-end delay.

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 ANALYSIS OF BLACK HOLE ATTACK DURING ROUTE DISCOVERY PHASE OF AODV IN MANET

2020 ◽  
Vol 4 (11) ◽  
pp. 75-80
Author(s):  
Lalit Tripathi ◽  
Kanojia Sindhuben
Keyword(s):  
Black Hole ◽  
Ad Hoc ◽  
Delivery Ratio ◽  
Route Discovery ◽  
Mobile Nodes ◽  
Black Hole Attack ◽  
Discovery Phase ◽  
Hoc Networks ◽  
Result Analysis ◽  
The Impact

MANET (Mobile ad hoc networks) is a collection of wireless mobile nodes dynamically forming an infrastructure less network. Several routing protocols are designed for routing of packets in MANET. One of them is AODV (Ad hoc on demand Distance Vector) protocol whose performance is better for higher mobile nodes. It is more vulnerable to black hole attack by the malicious node. Black hole attack is a network layer attack in MANET that tries to hamper the routing process. During route discovery phase it sends false reply to the nodes and dropped data packets. In this paper, first we have implemented black hole attack in AODV and then analyzed the impact of black hole attack under deferent metrics like throughput, packet delivery ratio and packet loss. Simulator NS-2.35 is used for implementation and result analysis.

scholarly journals ASDSR: An Adaptive Stable DSR Routing Protocol for Mobile Ad-hoc Networks

2020 ◽  
Vol 14 (08) ◽  
pp. 164
Author(s):  
Hutaf Salah Al-Deen Natoureah ◽  
Huda Abd El-Raheem Karajeh ◽  
Alaa' Abd El-Aziz Abu Serhan
Keyword(s):  
Routing Protocol ◽  
Ad Hoc ◽  
Delivery Ratio ◽  
Specific Group ◽  
Dynamic Nature ◽  
Packet Delivery ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
The Stability ◽  
Network Flooding

<p class="Abstract">Abstract—The process of finding a route between the transmitter and the receiver node in the Mobile Adhoc Networks (MANets) is a renewed issue that is becoming more and more interesting to the researchers as this type of networks  grow and expand. The dynamic nature of MANET and the limited capabilities of wireless nodes in terms of memory size and battery charge are the most important obstacles to the routing (path-finding) process between nodes. In this research, we introduced a new protocol based on the well-known DSR protocol to add a mechanism that controls the RREQ Flooding process, which aims to reach more stable (life-long) routes while reducing the overhead of routing process caused by link breakage between nodes and reduce the overhead of network flooding with RREQ messages with each attempt to find a path. In this proposed mechanism, a specific group is selected from within the devices adjacent to the transmitter to be sent RREQ so that these devices are selected based on the stability evaluation criterion. The stability criterion is calculated based on three weighted factors: the speed of the node, the out-degree value (the number of adjacent nodes), and the number of tracks stored in the device memory. The proportion of devices selected is automatically changed adaptively to ensure that the expected throughput of this network is achieved. The proposed protocol was tested using simulation where results showed that ASDSR proved an enhancement in route stability about (0.13), and a decrease in the number of deleted routes by (9%), while maintaining the expected packet delivery ratio of the original DSR by about (0.86).</p>

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.

scholarly journals A-ZHLS: adaptive ZHLS routing protocol for heterogeneous mobile adhoc networks

2018 ◽  
Vol 7 (3) ◽  
pp. 1626
Author(s):  
M V. Narayana ◽  
Aparnarajesh Atmakuri
Keyword(s):  
Routing Protocol ◽  
Ad Hoc ◽  
Mobile Nodes ◽  
Data Packets ◽  
Hybrid Routing ◽  
Novel Approach ◽  
Efficiency And Effectiveness ◽  
Hoc Networks ◽  
Set Up ◽  
The Stability

The routing protocols in MANET are mainly classified into two type’s i.e. pro-active and reactive based protocol based on its problems in the network. One of the prime and foremost issues, which have gained a lot of scope, is its dynamic nature of the networks i.e. the stability of nodes is not guaranteed in the network. Hence, this leads to loss of data packets that needs for its retransmission. Many advancements and Novel protocols have been devised in recent years for efficiency and effectiveness in the ad hoc networks. However, hybrid routing proto-cols that inculcates the nature of reactive and proactive has gained a lot of importance. ZHLS is one of the Hybrid routing protocol, and is a two tier hierarchal routing that divides the area into zones in which mobile nodes move randomly. The process of promoting ZHLS protocol is purely based on homogeneous scenarios which mean the nodes in the network are statistically identical, but there is lack of studies for heterogeneous set-up where mobile nodes act in a different way in an identical network. In this paper, we try to propose a novel approach known as “Adaptive-ZHLS: AZHLS” that can be suitable for heterogeneous scenarios. Experimental set up and simulated results will show that AZHLS provides higher packet delivery fraction as compared with the traditional one. 

scholarly journals A Key Exchange Approach for Proficient and Secure Routing in Mobile Adhoc Networks

2017 ◽  
Vol 11 (4) ◽  
pp. 43
Author(s):  
L Raghavendar Raju ◽  
C R K Reddy Reddy
Keyword(s):  
Ad Hoc Networks ◽  
Ad Hoc ◽  
Key Exchange ◽  
Point Of View ◽  
Secure Routing ◽  
Delivery Ratio ◽  
Mobile Adhoc Networks ◽  
Adhoc Networks ◽  
Secure Routing Protocols ◽  
Hoc Networks

<p>Mobile ad hoc networks (MANETs) are collection of wireless mobile devices with restricted broadcast range and resources. Communication is achieved by relaying data along appropriate routes that are dynamically discovered and maintained through collaboration between the nodes. Discovery of such routes is a major task, both from efficiency and security point of view. This paper presents a proficient and secure routing, based on asymmetric authentication using key exchange approach (KEA). The proposed mechanism ensures secure routing and quality of service in MANETs and minimizes the network overhead. The KEA mechanism can be effectively used to develop a new routing protocol for Mobile Adhoc Networks which will provide maximum security against all kinds of attacks. In this paper, KEA is compared with other secure routing protocols like EEACK, AODV, and ARIADANE, to evaluate the efficiency of KEA in Ad Hoc Networks. The empirical results shows that there is an increase of 20% packet delivery ratio and a reduction of 10% routing overhead.</p>

scholarly journals A Routing Protocol Based on Mobility Prediction for Mobile Ad Hoc Networks

2014 ◽  
Vol 10 (1) ◽  
pp. 24 ◽  
Author(s):  
Ahmed Bisengar
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc ◽  
Transmission Range ◽  
Time Interval ◽  
Mobile Nodes ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
The Stability ◽  
Link Duration

In Mobile Ad hoc Networks (MANETs), where nodes have limited transmitting power, the transmission is typically multi-hop. The network topology changes frequently due to the unpredictable movement of mobile nodes because each node is free to move arbitrarily with different speeds. Thus, when one node enters in the transmission range of another node a link between those two nodes is established, and an existent link is broken when either node is out of the transmission range of the other. We refer as link duration, the time interval during in which the link still established.This paper presents a novel mobility metric for mobile ad hoc networks, called link duration (LD) that measures the stability of an active link. This mobility metric is introduced to represent relative mobility between nodes in multi-hop distance.

Sign in / Sign up

Export Citation Format

Share Document