2015 International Conference on Pervasive Computing (ICPC) 2015
DOI: 10.1109/pervasive.2015.7086962
|View full text |Cite
|
Sign up to set email alerts
|

Cooperative reinforcement learning approach for routing in ad hoc networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 13 publications
(6 citation statements)
references
References 12 publications
0
6
0
Order By: Relevance
“…where α is the step size. To accelerate the algorithm, Q-learning only performs (17) once before the policy improvement in each round of the policy iteration. (One step of the policy evaluation in a policy iteration process is also known as the value iteration process.)…”
Section: Conventional Q-learningmentioning
confidence: 99%
See 1 more Smart Citation
“…where α is the step size. To accelerate the algorithm, Q-learning only performs (17) once before the policy improvement in each round of the policy iteration. (One step of the policy evaluation in a policy iteration process is also known as the value iteration process.)…”
Section: Conventional Q-learningmentioning
confidence: 99%
“…Thus, routing can be modeled as a Markov decision process [7] and naturally fits into the realm of reinforcement learning; see [8] for a comprehensive survey of the applications of reinforcement learning to communications and networking. In this direction, many previous works [9]- [17] have employed the classical Q-learning [18] algorithm to train agents to find the optimal route. In most of these works, a distinct agent is associated with each transmission node.…”
Section: Introductionmentioning
confidence: 99%
“…In the work of [30], the authors proposed a new machine learning approach to choose the optimal route in ad hoc networks, which is based on the cooperative RL in modeling the swarm intelligence from the models of social insect behavior. To prove the effectiveness of their proposed approach, the authors presented the analysis and performance evaluation by comparing with the existing routing protocols, and the results indicate that the packet delivery ratio is significantly improved when RL is utilized.…”
Section: Applications Of Rl In Networkingmentioning
confidence: 99%
“…Thus, routing can be readily modeled as a Markov decision process [7] and naturally fits into the realm of reinforcement learning. In this direction, many previous works [8,9,10,11,12,13,14,15,16] have employed the classical Q-learning [17] algorithm to train agents to find the optimal route. In these works, a distinct agent is associated with each transmission node.…”
Section: Introductionmentioning
confidence: 99%