Tree Node Switching Algorithm for Minimum Energy Cost Aggregation Tree Problem in Wireless Sensor Networks
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Information 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
Authors
Hiroshi MATSUURA
NTT
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Hiroshi MATSUURA, "Tree Node Switching Algorithm for Minimum Energy Cost Aggregation Tree Problem in Wireless Sensor Networks" in IEICE TRANSACTIONS on Information,
vol. E103-D, no. 11, pp. 2250-2261, November 2020, doi: 10.1587/transinf.2020EDP7010.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2020EDP7010/_p
Copy
@ARTICLE{e103-d_11_2250,
author={Hiroshi MATSUURA, },
journal={IEICE TRANSACTIONS on Information},
title={Tree Node Switching Algorithm for Minimum Energy Cost Aggregation Tree Problem in Wireless Sensor Networks},
year={2020},
volume={E103-D},
number={11},
pages={2250-2261},
abstract={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.},
keywords={},
doi={10.1587/transinf.2020EDP7010},
ISSN={1745-1361},
month={November},}
Copy
TY - JOUR
TI - Tree Node Switching Algorithm for Minimum Energy Cost Aggregation Tree Problem in Wireless Sensor Networks
T2 - IEICE TRANSACTIONS on Information
SP - 2250
EP - 2261
AU - Hiroshi MATSUURA
PY - 2020
DO - 10.1587/transinf.2020EDP7010
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E103-D
IS - 11
JA - IEICE TRANSACTIONS on Information
Y1 - November 2020
AB - 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.
ER -
English
