B P Patil
Army Institute of Technology

Published : 3 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 3 Documents
Search

Routing Protocols for Mobile Ad Hoc Network - A Survey and Analysis Rahul M Desai; B P Patil; Davinder Pal Sharma
Indonesian Journal of Electrical Engineering and Computer Science Vol 7, No 3: September 2017
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v7.i3.pp795-801

Abstract

Ad hoc networks are mobile wireless networks where each node is acting as a router. The existing routing protocols such as Destination sequences distance vector, Optimized list state routing protocols, Ad hoc on demand routing protocol, Ad hoc on demand multipath routing protocol, Dynamic source routing are optimized versions of distance vector or link state routing protocols.  In this paper, existing protocols such as DSDV, AODV, AOMDV, OLSR and DSR are analyzed on 50 nodes Mobile Ad Hoc network with random mobility. Packet delivery ratio, delay, control overhead and throughput parameters are used for performance analysis.
Analysis of Reinforcement Based Adaptive Routing in MANET Rahul Desai; B P Patil
Indonesian Journal of Electrical Engineering and Computer Science Vol 2, No 3: June 2016
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v2.i3.pp648-694

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. 
Prioritized Sweeping Reinforcement Learning Based Routing for MANETs Rahul M Desai; B P Patil
Indonesian Journal of Electrical Engineering and Computer Science Vol 5, No 2: February 2017
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/ijeecs.v5.i2.pp383-390

Abstract

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.