Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Wireless integrated network sensors
Communications of the ACM
Introduction to Reinforcement Learning
Introduction to Reinforcement Learning
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A swarm intelligent multi-path routing for multimedia traffic over mobile ad hoc networks
Proceedings of the 1st ACM international workshop on Quality of service & security in wireless and mobile networks
K-Shortest paths q-routing: a new QoS routing algorithm in telecommunication networks
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II
| Hi-index | 0.01 |
The quality-of-service (QoS) routing in a wireless sensor network is difficult because the network topology may change constantly, and the available state information for routing is inherently imprecise.In this paper, after presenting a state of the art of this problem, we propose a distributed QoS routing that selects a network path with sufficient resources to satisfy a certain delay requirement in a dynamic environment. Multiple paths are searched in parallel to find the most qualified one. Fault tolerance techniques are brought in for the maintenance of the routing. Our algorithms consider not only the QoS requirement, but also the cost optimality of the routing path to improve the overall network performance based on reinforcement learning techniques. In this paper we are to interest particularly in some metric of QoS in particular: the delay, packets losses and also the overhead