International Journal of Advanced Networking and Applications

Open Access Open Access  Restricted Access Subscription Access

Maximizing Throughput using Adaptive Routing Based on Reinforcement Learning


Affiliations
1 Sinhgad College of Engineering, Information Tech. Department, Army Institute of Technology, Savitribai Phule Pune University, India
2 E&TC Department, Army Institute of Technology, Savitribai Phule Pune University, India
 

In this paper, prioritized sweeping confidence based dual reinforcement learning based adaptive routing is studied. Routing is an emerging research area in wireless networks and needs more research due to emerging technologies such as wireless sensor network, ad hoc networks and network on chip. In addition, mobile ad hoc network suffers from various network issues such as dynamicity, mobility, data packets delay, high dropping ratio, large routing overhead, less throughput and so on. Conventional routing protocols based on distance vector or link state routing is not much suitable for mobile ad hoc network. All existing conventional routing protocols are based on shortest path routing, where the route having minimum number of hops is selected. Shortest path routing is non-adaptive routing algorithm that does not take care of traffic present on some popular routes of the network. In high traffic networks, route selection decision must be taken in real time and packets must be diverted on some alternate routes. In Prioritized sweeping 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 MANET with random mobility and 50 nodes fixed grid network. Throughput is used to judge the performance of network. Analysis is done by varying the interval between the successive packets.

Keywords

DSDV, AODV, DSR, Q Routing, CBQ Routing, DRQ Routing, CDRQ Routing.
User
Notifications
Font Size

  • M. Imran and M. A. Qadeer, "Evaluation Study of Performance Comparison of Topology Based Routing Protocol, AODV and DSDV in MANET," 2016 International Conference on Micro-Electronics and Telecommunication Engineering, Ghaziabad, 2016, pp. 207-211.

  • C. Cheng, R. Riley and S.P.R. Kumar, “A loop-free extended Bellman–Ford routing protocol without bouncing effect” , Proc. of ACM SIGCOMM Conf. , 1989, pp. 224– 236.

  • M. K. Marina and S. R. Das, “Ad-hoc on-demand multi-path distance vector routing,” Wireless Communication. Mobile Computing, vol. 6, no. 7, 2006, pp. 969–988

  • C. E. Perkins, E. M. Royer, and S. Das, “Ad hoc ondemand distance vector routing,'' document RFC 3561, IETF, Oct. 2003

  • C. Liu, Y. Shu, and Y. Zhou, et al., “A comparison of DSR, MSR and BSR in wireless ad-hoc networks,” SPIE, vol. 6011, 2005, pp. 601–610.

  • Fahimeh Farahnakian. "Q-learning based congestionaware routing algorithm for onchip network", 2011 IEEE 2nd International Conference on Networked Embedded Systems for Enterprise Applications, 12/2011

  • Parag Kulkarni, "Introduction to Reinforcement and Systemic Machine Learning," in Reinforcement and Systemic Machine Learning for Decision Making , 1, Wiley-IEEE Press, 2012, pp.1-21

  • S. Nuuman, D. Grace and T. Clarke, "A quantum inspired reinforcement learning technique for beyond next generation wireless networks," 2015 IEEE Wireless Communications and Networking Conference Workshops (WCNCW), New Orleans, LA, 2015, pp. 271-275.

  • M. N. ul Islam and A. Mitschele-Thiel, "Reinforcement learning strategies for self-organized coverage and capacity optimization," 2012 IEEE Wireless Communications and Networking Conference (WCNC), Shanghai, 2012, pp. 2818-2823.

  • Oussama Souihli, Mounir Frikha, Mahmoud Ben Hamouda, "Load-balancing in MANET shortest-path routing protocols", Ad Hoc Networks, Volume 7, Issue 2, March 2009, Pages 431-442

  • Ouzecki, D.; Jevtic, D., "Reinforcement learning as adaptive network routing of mobile agents," MIPRO, 2010 Proceedings of the 33rd International Convention , pp.479,484, 24-28 May 2010

  • Ramzi A. Haraty and Badieh Traboulsi “MANET with the Q-Routing Protocol” ICN 2012 : The Eleventh International Conference on Networks

  • S Kumar, Confidence based Dual Reinforcement Q Routing : An on line Adaptive Network Routing Algorithm. Technical Report, University of Texas, Austin 1998.

  • Kumar, S., 1998, “Confidence based Dual Reinforcement Q-Routing: An On-line Adaptive Network Routing Algorithm, “Master’s thesis, Department of Computer Sciences, The University of Texas at Austin, TX-78712, USA Tech. Report AI98-267.

  • Kumar, S., Miikkulainen, R., 1997, “Dual Reinforcement Q-Routing: An On-line Adaptive Routing Algorithm,’’ Proc. Proceedings of the Malaysian Journal of Computer, Vol. 17 No. 2, December 2004, pp.21-29

  • Artificial Neural Networks in Engineering Conference.

  • Shalabh Bhatnagar, K. Mohan Babu “ New Algorithms of the Q-learning type” Science Direct Automatica 44 (2008} 1111-1119. Website: www.sciencedirect.com

  • Soon Teck Yap and Mohamed Othman, “An Adaptive Routing Algorithm: Enhanced Confidence Based Q Routing Algorithm in Network Traffic.

  • Rahul Desai, B P Patil, “Analysis of Reinforcement Based Adaptive Routing in MANET”, Indonesian Journal of Electrical Engineering and Computer Science Vol. 2, No.3, June 2016, pp.684-694

  • Moore, A.W., Atkeson, C.G., Prioritized Sweeping: Reinforcement Learning with less data and less time.

  • Machine Learning, Vol. 13, 1993


Abstract Views: 228

PDF Views: 0




  • Maximizing Throughput using Adaptive Routing Based on Reinforcement Learning

Abstract Views: 228  |  PDF Views: 0

Authors

Rahul Desai
Sinhgad College of Engineering, Information Tech. Department, Army Institute of Technology, Savitribai Phule Pune University, India
B. P. Patil
E&TC Department, Army Institute of Technology, Savitribai Phule Pune University, India

Abstract


In this paper, prioritized sweeping confidence based dual reinforcement learning based adaptive routing is studied. Routing is an emerging research area in wireless networks and needs more research due to emerging technologies such as wireless sensor network, ad hoc networks and network on chip. In addition, mobile ad hoc network suffers from various network issues such as dynamicity, mobility, data packets delay, high dropping ratio, large routing overhead, less throughput and so on. Conventional routing protocols based on distance vector or link state routing is not much suitable for mobile ad hoc network. All existing conventional routing protocols are based on shortest path routing, where the route having minimum number of hops is selected. Shortest path routing is non-adaptive routing algorithm that does not take care of traffic present on some popular routes of the network. In high traffic networks, route selection decision must be taken in real time and packets must be diverted on some alternate routes. In Prioritized sweeping 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 MANET with random mobility and 50 nodes fixed grid network. Throughput is used to judge the performance of network. Analysis is done by varying the interval between the successive packets.

Keywords


DSDV, AODV, DSR, Q Routing, CBQ Routing, DRQ Routing, CDRQ Routing.

References