|
Title
|
|
|
|
Q2-routing : a Qos-aware Q-routing algorithm for wireless ad hoc networks
| |
|
Author
|
|
|
|
| |
|
Abstract
|
|
|
|
| In the last decade, several routing algorithms have been proposed in ad hoc wireless networks. However, most of them require either a high bandwidth, to maintain a full routing table, or suffer a high delay with packet flooding over the network, when the routes are discovered on-demand. As a solution, hybrid approaches, i.e. algorithms that combine on-demand route discovery with proactive updates of the available routes, have shown a good trade-off between low communication overhead and quality of the found routes. One of the approaches used in hybrid algorithms is Multi-Agent Reinforcement Learning (MARL), where the routing problem is addressed as a complex distributed control and learning problem. However, state-of-the-art MARL routing algorithms suffer from some limitations such as either lack of exploration or exploration at the cost of a high communication overhead, slow convergence under network dynamics, or no support for Quality of Service (QoS). In order to overcome such limitations, in this paper, we propose the Q(2)-Routing algorithm, which merges existing techniques in wireless routing and enhances them by using techniques from the MARL domain. Simulation results showed that the proposed algorithm is able to outperform well-known ad-hoc routing algorithms in dynamic environments under QoS constraints. |
| |
|
Language
|
|
|
|
English
| |
|
Source (journal)
|
|
|
|
IEEE International Conference on Wireless and Mobile Computing, Networking, and Communications : [proceedings]. - Piscataway, N.J
| |
|
Source (book)
|
|
|
|
14th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob), 14-17 October, 2018, Limassol, Cyprus
| |
|
Publication
|
|
|
|
New york
:
Ieee
,
2018
| |
|
ISSN
|
|
|
|
2160-4886
| |
|
ISBN
|
|
|
|
978-1-5386-6876-4
| |
|
|
|
|
|
978-1-5386-6876-4
| |
|
DOI
|
|
|
|
10.1109/WIMOB.2018.8589161
| |
|
Volume/pages
|
|
|
|
(2018)
, p. 108-115
| |
|
ISI
|
|
|
|
000459858400072
| |
|
Full text (Publisher's DOI)
|
|
|
|
| |
|
Full text (publisher's version - intranet only)
|
|
|
|
| |
|