Prioritized Sweeping Reinforcement Learning Based Routing for MANETs

2017 ◽  
Vol 5 (2) ◽  
pp. 383 ◽  
Author(s):  
Rahul M Desai ◽  
B P Patil
Keyword(s):  
Reinforcement Learning ◽  
Shortest Path ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Network Routing ◽  
Delivery Ratio ◽  
Learning Method ◽  
Shortest Path Routing ◽  
Mobile Ad Hoc ◽  
Prioritized Sweeping

<p class="Default">In this paper, prioritized sweeping confidence based dual reinforcement learning based adaptive network routing is investigated. Shortest Path routing is always not suitable for any wireless mobile network as in high traffic conditions, shortest path will always select the shortest path which is in terms of number of hops, between source and destination thus generating more congestion. In prioritized sweeping reinforcement learning method, optimization is carried out over confidence based dual reinforcement routing on mobile ad hoc network and path is selected based on the actual traffic present on the network at real time. Thus they guarantee the least delivery time to reach the packets to the destination. Analysis is done on 50 Nodes Mobile ad hoc networks with random mobility. Various performance parameters such as Interval and number of nodes are used for judging the network. Packet delivery ratio, dropping ratio and delay shows optimum results using the prioritized sweeping reinforcement learning method.</p>

scholarly journals A Bioinspired Adaptive Congestion-Avoidance Routing for Mobile Ad Hoc Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Huang Qiong ◽  
Yin Pengfei ◽  
Chen Qianbin ◽  
Gong Pu ◽  
Yang Xiaolong
Keyword(s):  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Threshold Value ◽  
Recovery Phase ◽  
Network Routing ◽  
Delivery Ratio ◽  
Route Maintenance ◽  
Random Manner ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Traditional mobile Ad Hoc network routing protocols are mainly based on the Shortest Path, which possibly results in many congestion nodes that incur routing instability and rerouting. To mitigate the side-efforts, this paper proposed a new bioinspired adaptive routing protocol (ATAR) based on a mathematics biology model ARAS. This paper improved the ARAS by reducing the randomness and by introducing a new routing-decision metric “the next-hop fitness” which was denoted as the congestion level of node and the length of routing path. In the route maintenance, the nodes decide to forward the data to next node according to a threshold value of the fitness. In the recovery phase, the node will adopt random manner to select the neighbor as the next hop by calculation of the improved ARAS. With this route mechanism, the ATAR could adaptively circumvent the congestion nodes and the rerouting action is taken in advance. Theoretical analysis and numerical simulation results show that the ATAR protocol outperforms AODV and MARAS in terms of delivery ratio, ETE delay, and the complexity. In particular, ATAR can efficiently mitigate the congestion.

Analysis of Reinforcement Based Adaptive Routing in MANET

2016 ◽  
Vol 2 (3) ◽  
pp. 648 ◽  
Author(s):  
Rahul Desai ◽  
B P Patil
Keyword(s):  
Reinforcement Learning ◽  
Shortest Path ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Learning Algorithms ◽  
High Mobility ◽  
Delivery Ratio ◽  
Shortest Path Routing ◽  
Minimum Number ◽  
Shortest Path Algorithms

<p class="Abstract">This paper describes and evaluates the performance of various reinforcement learning algorithms with shortest path algorithms that are widely used for routing packets through the network. Shortest path routing is the simplest policy used for routing the packets along the path having minimum number of hops. In high traffic or high mobility conditions, the shortest path get flooded with huge number of packets and congestions occurs, So such shortest path does not provides the shortest path and increases delay for reaching the packets to the destination. Reinforcement learning algorithms are adaptive algorithms where the path is selected based on the traffic present on the network at real time. Thus they guarantee the least delivery time to reach the packets to the destination. Analysis done on a 6 by 6 irregular grid and sample ad hoc network shows that performance parameters used for judging the network - packet delivery ratio and delay provides optimum results using reinforcement learning algorithms. </p>

Adaptive Routing for an Ad Hoc Network Based on Reinforcement Learning

2015 ◽  
Vol 11 (2) ◽  
pp. 40-52
Author(s):  
Rahul Desai ◽  
B.P. Patil
Keyword(s):  
Reinforcement Learning ◽  
Shortest Path ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Learning Algorithms ◽  
High Mobility ◽  
Delivery Ratio ◽  
Shortest Path Routing ◽  
Minimum Number ◽  
Shortest Path Algorithms

This paper describes and evaluates the performance of various reinforcement learning algorithms with shortest path algorithms that are widely used for routing packets throughout the network. Shortest path routing is simplest policy used for routing the packets along the path having minimum number of hops. In high traffic or high mobility conditions, the shortest path gets flooded with huge number of packets and congestions occurs, so such shortest path does not provide the shortest path and increases delay for reaching the packets to the destination. Reinforcement learning algorithms are adaptive algorithms where the path is selected based on the traffic present on the network at real time. Thus they guarantee the least delivery time to reach the packets to the destination. Analysis is done on a 6-by-6 irregular grid and sample ad hoc network shows that performance parameters used for judging the network such as packet delivery ratio and delay provide optimum results using reinforcement learning algorithms.

Comparative Assessment and Performance Analysis of Numerous Mobile Ad-Hoc Network Routing Protocols

2019 ◽  
Vol 16 (9) ◽  
pp. 3906-3911
Author(s):  
Karan Singh ◽  
Rajeev Gupta
Keyword(s):  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Network Routing ◽  
Destination Node ◽  
Delivery Ratio ◽  
Mobile Nodes ◽  
Route Maintenance ◽  
Mobile Ad Hoc ◽  
And Performance

Recent progression in the field of information and communication cause increase of packet count over the World Wide Web network. These communicated packets should deliver on time from origin node to destination node using a reliable and shortest route. In this way routing plays an important part in dispatching the packets to destination form the source. This routing becomes more crucial when packets delivery is done in independent mobile nodes which dynamically form a temporary network. This network named as Mobile Ad-Hoc Network and therefore it is said to be particular reason-specific, self-ruling and dynamic. In this paper we analyzed 3 protocols and for a quality of service (i.e., Packet Delivery Ratio) and achieved comparative study of various protocols of routing with respect to Operation of protocols, Route maintenance, Routing table, Route, Route selection, Routing structure, Routing Approaches, Protocol types, Merits and Demerits.

scholarly journals A Secure 3-Way Routing Protocols for Intermittently Connected Mobile Ad Hoc Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-13 ◽  
Author(s):  
Ramesh Sekaran ◽  
Ganesh Kumar Parasuraman
Keyword(s):  
Routing Protocols ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Network Routing ◽  
Secure Routing ◽  
Delivery Ratio ◽  
Security Level ◽  
Mobile Ad Hoc ◽  
Intermittently Connected

The mobile ad hoc network may be partially connected or it may be disconnected in nature and these forms of networks are termed intermittently connected mobile ad hoc network (ICMANET). The routing in such disconnected network is commonly an arduous task. Many routing protocols have been proposed for routing in ICMANET since decades. The routing techniques in existence for ICMANET are, namely, flooding, epidemic, probabilistic, copy case, spray and wait, and so forth. These techniques achieve an effective routing with minimum latency, higher delivery ratio, lesser overhead, and so forth. Though these techniques generate effective results, in this paper, we propose novel routing algorithms grounded on agent and cryptographic techniques, namely, location dissemination service (LoDiS) routing with agent AES, A-LoDiS with agent AES routing, and B-LoDiS with agent AES routing, ensuring optimal results with respect to various network routing parameters. The algorithm along with efficient routing ensures higher degree of security. The security level is cited testing with respect to possibility of malicious nodes into the network. This paper also aids, with the comparative results of proposed algorithms, for secure routing in ICMANET.

scholarly journals Comparative study of energy efficient MAC protocol with channel aware packet Scheduling in MANET

2018 ◽  
Vol 7 (1.9) ◽  
pp. 16
Author(s):  
T Dheepak ◽  
S Neduncheliyan
Keyword(s):  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Packet Scheduling ◽  
Mac Protocol ◽  
Mobile Node ◽  
Delivery Ratio ◽  
Link Failure ◽  
Failure State ◽  
Utility Factor ◽  
Mobile Ad Hoc

Mobile Ad Hoc Network is the centralized communication system which is used for transferring information through a secured mode from one end to another end. However, there is an energy loss that has been noticed in MANET. In this work, an efficient energy based Link Failure State Neighbor Detection Effective Efficient Protocol (LFSNDEEP) is to enhance the energy efficiency of the mobile node, and optimal transmission ratio computes Data, Audio, and Video packets. The proposed research on LFSNDEEP protocol is compared to Effective Efficient Neighbor Detection Protocol (EENDP) and which assigns the channel utilization. In this technique, the hello packet exchanges transmit based height and wavelength of the transmitter with particular distance. The computation of channel utility factor is the best method at link failure without data loss. The vitality utilization mathematical model is illustrated to show the nodes of least consumption by the broad recreation of utilization. The results observed from the proposed scheme shows that the energy level is minimized regarding the packet that loss is improved efficiently. In further, there are two results which can be gained in comparing with EENDP; firstly, packet delivery ratio and throughput get increased. And secondly, the end to end delay is decreased.

Secure Route Discovery in DSR against Black Hole Attacks in Mobile Ad Hoc Networks

2012 ◽  
pp. 125-143
Author(s):  
P. Subathra ◽  
S. Sivagurunathan
Keyword(s):  
Black Hole ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
False Negative ◽  
Delivery Ratio ◽  
Black Hole Attack ◽  
Dynamic Source ◽  
Mobile Ad Hoc ◽  
And Performance ◽  
Hoc Networks

A Mobile Ad hoc Network (MANET) is a collection of wireless nodes communicating over multi-hop paths without any infrastructure. Nodes must cooperate to provide necessary network functionalities. The security in routing protocols like Dynamic Source Routing (DSR) can be compromised by a “Black Hole” attack. Here, a malicious node claims to have the shortest path to the destination and attracts all traffic and drops them, leading to performance degradation. The situation becomes worse when two or more nodes cooperate and perform the “Cooperative black hole” attack. This chapter proposes a solution based on probing to identify and prevent such attacks. The proposed solution discovers a secure route between the source and destination by identifying and isolating the attacking nodes. Simulation results show that the protocol provides better security and performance in terms of detection time, packet delivery ratio, and false negative probability in comparison with trust and probe based schemes.

scholarly journals Efficient Heuristic Based on Clustering Approach for OLSR

2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Ali Choukri ◽  
Ahmed Habbani ◽  
Mohamed El Koutbi
Keyword(s):  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Delivery Ratio ◽  
Dynamic Nature ◽  
End To End Delay ◽  
Delay Control ◽  
Clustering Approach ◽  
Mobile Ad Hoc

Due to the dynamic nature of mobile ad hoc network (MANET), the quality of service (QoS) requires several improvements. The present papercomeswithin the framework of research to optimize QoS in MANET. In this paper, we propose a novel version of OLSR based on the clustering approach which is inspired from Lin and Chu heuristic and adapted to beimplemented inOLSR. We studied its stability and we compared its performances to those of standard OLSR. The metrics we used in evaluating network performances were average end-to-end delay, control routing overhead, and packet delivery ratio. Experimental results show that our alternative significantly reduces the traffic reserved to monitoring the network, which positively influences other performances such as throughput, delay, and loss.

Sign in / Sign up

Export Citation Format

Share Document