Optimisation of reinforcement learning algorithm applied to dynamic network Online publication date: Mon, 20-Oct-2014
by Shrirang Ambaji Kulkarni, G. Raghavendra Rao
International Journal of Information and Communication Technology (IJICT), Vol. 3, No. 2, 2011
Abstract: Mobile ad-hoc network represent a class of dynamic networks where nodes are non-stationary and the topology is changing rapidly. The routing algorithms for these types of networks play an important role. Traditional routing algorithms do not perform optimally under congestion and high-speed situations. Reinforcement learning-based routing algorithm SAMPLE holds a lot of potential to these types of problems but performs worse as compared to AODV and DSR under the Random Waypoint Mobility Model. To overcome the bottleneck of SAMPLE in terms of performance in a pure ad-hoc environment and enable its optimal performance under dynamic scenarios, we propose a mobility model to characterise group mobility under real city like scenario. The proposed model will be tested for its performance using suitable mobility metrics, verified statistically and then applied to a reinforcement learning algorithm SAMPLE to study its impact.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Communication Technology (IJICT):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook