Adaptive Q-Routing with random echo and route memory
| Autor: | Yuliya Likhacheva, Yuliya Shilova, Maksim Kavalerov |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
050101 languages & linguistics
Dynamic Source Routing Computer science Real-time computing Network topology lcsh:Telecommunication lcsh:TK5101-6720 Hardware_INTEGRATEDCIRCUITS 0501 psychology and cognitive sciences Destination-Sequenced Distance Vector routing Static routing algorithm learning ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS 05 social sciences Echo (computing) 050301 education delivery time 06 humanities and the arts Mobile ad hoc network routing packets network Benchmark (computing) nodes Routing (electronic design automation) 0503 education |
| Zdroj: | FRUCT Proceedings of the XXth Conference of Open Innovations Association FRUCT, Vol 776, Iss 20, Pp 138-145 (2017) |
| Popis: | Mobile ad hoc networks require routing algorithms that provide high performance in terms of delivery times of packets for dynamically changing topologies under various load conditions. A routing algorithm is proposed which is based on adaptive Q-routing technique with Full Echo extension. The proposed algorithm, called Adaptive Q-routing with Random Echo and Route Memory (AQRERM), has the improved performance in terms of overshoot and settling time of the learning. It also greatly improves stability of routing under conditions of high load for the benchmark example. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|