A Greedy Stable Time via LEACH-Based 2-Hop Trees in Wireless Sensor Networks
Yoshihiro Kaneko, Shuuji Oohira · 2023
A wireless sensor network WSN is composed of one base station BS and many sensor node SNs that can sense and transmit data toward the BS. After data transmission many rounds, some SN dries out its energy, whose time is termed a stable time or an FDN. Among WSN routing protocols, LEACH is representative for a longer FDN. During data transmission, various 2-hop spanning trees are collected at the BS. With those trees, we propose a greedy heuristic method to obtain an FDN in a central way. There selecting a dissimilar tree set is a key. Simulation experiments show that our proposal valid.