Journal of Educational Technology
Journal on School Educational Technology
Journal on Educational Psychology
Journal on English Language Teaching
Journal on Future Engineering and Technology
Journal on Electrical Engineering
Journal on Software Engineering
Journal on Civil Engineering
Journal on Mechanical Engineering
Journal on Electronics Engineering
Journal on Structural Engineering
Journal on Mathematics
Journal on Information Technology
Journal on Communication Engineering and Systems
Journal on Embedded Systems
Journal on Wireless Communication Networks
Journal on Instrumentation and Control Engineering
Journal on Circuits and Systems
Journal on Digital Signal Processing
Journal on Power Systems Engineering
Journal on Computer Science
Journal on Material Science
Journal on Cloud Computing
Journal on Image Processing
Journal on Mobile Applications and Technologies
Journal on Pattern Recognition
Journal on Management
Journal on Nursing
Overcoming the Limitations of Classical Routing Algorithms by d-adaptOR Algorithm
B. Rakesh, Allu Jhansi
B. Rakesh and Allu Jhansi (2016). Overcoming the Limitations of Classical Routing Algorithms by d-adaptOR Algorithm. i-manager's Journal on Wireless Communication Networks, 5(3), Oct-Dec 2016, Print ISSN: 2319-4839, E-ISSN: 2320-2351, pp.15-20.
Many routing algorithms were proposed in wireless ad hoc networks. The main disadvantage of those algorithms is, we need to have reliable knowledge about the network, and also expected average per packet reward criterion is also high. In this paper, the authors have discussed about d-AdaptOR algorithm which doesn't need reliable knowledge about the network structure and channel statistics. This scheme reduces the average per packet reward criterion. This scheme is also advantageous than the classical routing algorithms when we want to broadcast a packet. In this scheme, the next relay node depending upon Estimated Best Score (EBS) has been selected. This algorithm explores and exploits the opportunities in the network. This scheme jointly tackles the problem of learning and routing in an opportunistic context, where the network model is characterized by the transmission success probabilities.
Routing, Adaptive, EBS, Reinforcement Learning, Opportunistic
Purchase Instant Access
If you have access to this article please login to view the article or kindly login to purchase the article
Username / Email
Don't have an account?
Options for accessing this content:
If you would like institutional access to this content, please recommend the title to your librarian.
If you already have i-manager's user account: Login above and proceed to purchase the article.
New Users: Please register, then proceed to purchase the article.