Akhilesh A. Waoo

Work place: Bansal Group of Institutions, Bhopal, 462022, India

E-mail: akhilesh_waoo@rediffmail.com

Website:

Research Interests: Computer Networks, Network Architecture

Biography

Akhilesh A. Waoo, born in 1978. Ph. D. in the department of computer application, in Maulana Azad National Institute of Technology (MANIT), Bhopal, India.  He did his M.Tech (CSE) from Rajiv Gandhi Technical University, Bhopal (MP). He scored first university rank in Amravati University, Maharastra in Master of Computer Application.

In recent years, wireless networking has been actively researched. His main research interests include MANET (Mobile Ad hoc Network) and WSN (Wireless Sensor Network).

Author Articles
Optimal Route Based Advanced Algorithm using Hot Link Split Multi-Path Routing Algorithm

By Akhilesh A. Waoo Sanjay Sharma Manjhari Jain

DOI: https://doi.org/10.5815/ijcnis.2014.08.07, Pub. Date: 8 Jul. 2014

Present research work describes advancement in standard routing protocol AODV for mobile ad-hoc networks. Our mechanism sets up multiple optimal paths with the criteria of bandwidth and delay to store multiple optimal paths in the network. At time of link failure, it will switch to next available path. We have used the information that we get in the RREQ packet and also send RREP packet to more than one path, to set up multiple paths, It reduces overhead of local route discovery at the time of link failure and because of this End to End Delay and Drop Ratio decreases. The main feature of our mechanism is its simplicity and improved efficiency. This evaluates through simulations the performance of the AODV routing protocol including our scheme and we compare it with HLSMPRA (Hot Link Split Multi-Path Routing Algorithm) Algorithm. Indeed, our scheme reduces routing load of network, end to end delay, packet drop ratio, and route error sent. The simulations have been performed using network simulator OPNET. The network simulator OPNET is discrete event simulation software for network simulations which means it simulates events not only sending and receiving packets but also forwarding and dropping packets. This modified algorithm has improved efficiency, with more reliability than Previous Algorithm.

[...] Read more.
Other Articles