Tree Node Switching Algorithm for Minimum Energy Cost Aggregation Tree Problem in Wireless Sensor Networks

Hiroshi MATSUURA  

IEICE TRANSACTIONS on Information and Systems   Vol.E103-D   No.11   pp.2250-2261
Publication Date: 2020/11/01
Publicized: 2020/08/03
Online ISSN: 1745-1361
DOI: 10.1587/transinf.2020EDP7010
Type of Manuscript: PAPER
Category: Fundamentals of Information Systems
data gathering tree,  data aggregation,  MECAT,  MECAT_RN,  

Full Text: PDF>>
Buy this Article

Data aggregation trees in wireless sensor networks (WSNs) are being used for gathering data for various purposes. Especially for the trees within buildings or civil structures, the total amount of energy consumption in a tree must be reduced to save energy. Therefore, the minimum energy-cost aggregation tree (MECAT) and MECAT with relay nodes (MECAT_RN) problems are being discussed to reduce energy consumption in data aggregation trees in WSNs. This paper proposes the tree node switching algorithm (TNSA) that improves on the previous algorithms for the MECAT and MECAT_RN problems in terms of energy efficiency. TNSA repeatedly switches nodes in a tree to reduce the number of packets sent in the tree. Packets are reduced by improving the accommodation efficiency of each packet, in which multiple sensor reports are accommodated. As a result of applying TNSA to MECATs and MECAT-RNs, energy consumption can be reduced significantly with a small burden.