A Lifetime-Aware Centralized Routing Protocol for Wireless Sensor Networks using Reinforcement Learning

被引:3
作者
Obi, Elvis [1 ]
Mammeri, Zoubir [1 ]
Ochia, Okechukwu E. [2 ]
机构
[1] Paul Sabatier Univ, Comp Sci Res Inst, Toulouse, France
[2] Univ Calgary, Dept Elect Engn, Calgary, AB, Canada
来源
2021 17TH INTERNATIONAL CONFERENCE ON WIRELESS AND MOBILE COMPUTING, NETWORKING AND COMMUNICATIONS (WIMOB 2021) | 2021年
关键词
reinforcement learning; routing; wireless sensor network; software-defined wireless sensor network; network lifetime; path optimization;
D O I
10.1109/WiMob52687.2021.9606390
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This paper presents the design of a Lifetime-Aware Centralized Q-routing Protocol (LACQRP) for Wireless Sensor Network (WSN) to maximize the network lifetime. This is achieved by implementing Q-learning on the sink of the WSN, which also acts as a controller that has global knowledge of the network topology as enabled by Software-Defined WSN (SDWSN). The controller generates all possible distance-based minimum spanning trees (MSTs), which form the set of routing tables (RTs). The maximization of the network lifetime is achieved by the controller learning the routing table that minimizes the maximum of the sensor nodes' consumption energies using Reinforcement Learning (RL). The simulation results show that the LACQRP learns the best RT that maximizes the network lifetime and has a better network lifetime performance when compared with recent distributed RL routing protocols for lifetime optimization, which are Reinforcement Learning-Based Routing (RLBR) and Reinforcement Learning for Lifetime Optimization (R2LTO).
引用
收藏
页码:363 / 368
页数:6
相关论文
共 21 条
[1]  
[Anonymous], 1997, State-of-the-Art Algorithms for Minimum Spanning Trees-A Tutorial Discussion
[2]   Efficient Routing Protocol for Wireless Sensor Network based on Reinforcement Learning [J].
Bouzid, S. E. ;
Serrestou, Y. ;
Raoof, K. ;
Omri, M. N. .
2020 5TH INTERNATIONAL CONFERENCE ON ADVANCED TECHNOLOGIES FOR SIGNAL AND IMAGE PROCESSING (ATSIP'2020), 2020,
[3]  
Boyan J. A., 1994, P ADV NEUR INF PROC, P671
[4]   Optimizations for Energy Efficiency in Software-Defined Wireless Sensor Networks [J].
Buzura, Sorin ;
Iancu, Bogdan ;
Dadarlat, Vasile ;
Peculea, Adrian ;
Cebuc, Emil .
SENSORS, 2020, 20 (17) :1-23
[5]  
Dong SQ, 2007, GLOB TELECOMM CONF, P652
[6]  
Egidius PM, 2019, PROC IEEE INT SYMP, P1551, DOI 10.1109/ISIE.2019.8781537
[7]   A SHORT NOTE ON THE APPROXIMABILITY OF THE MAXIMUM LEAVES SPANNING TREE PROBLEM [J].
GALBIATI, G ;
MAFFIOLI, F ;
MORZENTI, A .
INFORMATION PROCESSING LETTERS, 1994, 52 (01) :45-49
[8]   Collection Tree Protocol [J].
Gnawali, Omprakash ;
Fonseca, Rodrigo ;
Jamieson, Kyle ;
Moss, David ;
Levis, Philip .
SENSYS 09: PROCEEDINGS OF THE 7TH ACM CONFERENCE ON EMBEDDED NETWORKED SENSOR SYSTEMS, 2009, :1-14
[9]  
Guo W., 2019, Int. J. Distrib. Sens. Netw., V15, P1
[10]   Reinforcement Learning for Autonomous Defence in Software-Defined Networking [J].
Han, Yi ;
Rubinstein, Benjamin I. P. ;
Abraham, Tamas ;
Alpcan, Tansu ;
De Vel, Olivier ;
Erfani, Sarah ;
Hubczenko, David ;
Leckie, Christopher ;
Montague, Paul .
DECISION AND GAME THEORY FOR SECURITY, GAMESEC 2018, 2018, 11199 :145-165