Skip to Content
You are currently on the new version of our website. Access the old version .
SensorsSensors
  • Article
  • Open Access

26 December 2022

14 Pages

An Enhanced Tree Routing Based on Reinforcement Learning in Wireless Sensor Networks †

,
,
,
,
and
1
Department of Computer Science and Engineering, Chungnam National University, Daejeon 34134, Republic of Korea
2
Smart Power Distribution Lab, Korea Electric Power Research Institute, Daejeon 34056, Republic of Korea
*
Author to whom correspondence should be addressed.
†
This paper is an extended version of our paper published in Beom-Su Kim, Beomkyu Suh, Ki-Il Kim, In Jin Seo, Han Byul Lee, Ji Seon Gong, An Enhanced Tree Routing through Multi-criteria Decision Making over Wireless Sensor Networks. The 19th IEEE International Conference on Mobile Ad-Hoc and Smart Systems (MASS).

Abstract

In wireless sensor networks, tree-based routing can achieve a low control overhead and high responsiveness by eliminating the path search and avoiding the use of extensive broadcast messages. However, existing approaches face difficulty in finding an optimal parent node, owing to conflicting performance metrics such as reliability, latency, and energy efficiency. To strike a balance between these multiple objectives, in this paper, we revisit a classic problem of finding an optimal parent node in a tree topology. Our key idea is to find the best parent node by utilizing empirical data about the network obtained through Q-learning. Specifically, we define a state space, action set, and reward function using multiple cognitive metrics, and then find the best parent node through trial and error. Simulation results demonstrate that the proposed solution can achieve better performance regarding end-to-end delay, packet delivery ratio, and energy consumption compared with existing approaches.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.