QoS dynamic routing for wireless sensor networks

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

[1]  Baltasar Beferull-Lozano,et al.  Multiple Description Source Coding and Diversity Routing: A Joint Source Channel Coding Approach to Real-Time Services over Dense Networks , 2003 .

[2]  Sergio D. Servetto,et al.  Constrained random walks on random graphs: routing algorithms for large scale wireless sensor networks , 2002, WSNA '02.

[3]  Shailesh Kumar and Risto Miikkulainen.  Dual Reinforcement Q-Routing: An On-Line Adaptive Routing Algorithm , 1997 .

[4]  K. Mnif,et al.  Adaptative algorithm for supporting multi-constrained QoS for real-time and multimedia applications , 2004, First International Symposium on Control, Communications and Signal Processing, 2004..

[5]  Gregory J. Pottie,et al.  Wireless integrated network sensors , 2000, Commun. ACM.

[6]  Ralph Duncan.  A survey of parallel computer architectures , 1990, Computer.

[7]  Said Hoceini,et al.  K-Shortest Paths Q-Routing: A New QoS Routing Algorithm in Telecommunication Networks , 2005, ICN.

[8]  Michael L. Littman,et al.  Packet Routing in Dynamically Changing Networks: A Reinforcement Learning Approach , 1993, NIPS.

[9]  Abdelhamid Mellouk,et al.  A swarm intelligent multi-path routing for multimedia traffic over mobile ad hoc networks , 2005, Q2SWinet '05.

[10]  Andrew G. Barto,et al.  Reinforcement learning , 1998 .

[11]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[12]  Richard S. Sutton,et al.  Introduction to Reinforcement Learning , 1998 .

[13]  Charles E. Perkins,et al.  Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers , 1994, SIGCOMM.

[14]  Thomas G. Dietterich.  What is machine learning? , 2020, Archives of Disease in Childhood.

[15]  Naren Ramakrishnan,et al.  Reinforcing Reachable Routes , 2002, ArXiv.

[16]  Flaminio Borgonovo,et al.  Locally-optimal deflection routing in the Bidirectional Manhattan Network , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[17]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[18]  Samuel T. Chanson,et al.  Process groups and group communications: classifications and requirements , 1990, Computer.

[19]  M. Vetterli,et al.  Lattice sensor networks: capacity limits, optimal routing and robustness to failures , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.