Welcome to the InfoSci Platform
Adaptive Routing for an Ad Hoc Network Based on Reinforcement Learning

Adaptive Routing for an Ad Hoc Network Based on Reinforcement Learning

Rahul Desai, B.P. Patil
Copyright: © 2015 |Volume: 11 |Issue: 2 |Pages: 13
ISSN: 1548-0631|EISSN: 1548-064X|EISBN13: 9781466676008|DOI: 10.4018/IJBDCN.2015070103
Cite Article Cite Article

MLA

Desai, Rahul, and B.P. Patil. "Adaptive Routing for an Ad Hoc Network Based on Reinforcement Learning." IJBDCN vol.11, no.2 2015: pp.40-52. http://doi.org/10.4018/IJBDCN.2015070103

APA

Desai, R. & Patil, B. (2015). Adaptive Routing for an Ad Hoc Network Based on Reinforcement Learning. International Journal of Business Data Communications and Networking (IJBDCN), 11(2), 40-52. http://doi.org/10.4018/IJBDCN.2015070103

Chicago

Desai, Rahul, and B.P. Patil. "Adaptive Routing for an Ad Hoc Network Based on Reinforcement Learning," International Journal of Business Data Communications and Networking (IJBDCN) 11, no.2: 40-52. http://doi.org/10.4018/IJBDCN.2015070103

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.