The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
무선 센서 네트워크(WSN)의 데이터 집계 트리는 다양한 목적으로 데이터를 수집하는 데 사용됩니다. 특히 건축물이나 토목구조물 내의 나무의 경우, 에너지 절약을 위해서는 나무의 총 에너지 소비량을 줄여야 합니다. 따라서 WSN의 데이터 집계 트리에서 에너지 소비를 줄이기 위해 최소 에너지 비용 집계 트리(MECAT) 및 릴레이 노드가 있는 MECAT(MECAT_RN) 문제가 논의되고 있습니다. 본 논문에서는 MECAT 및 MECAT_RN 문제에 대한 기존 알고리즘을 에너지 효율성 측면에서 개선한 트리 노드 스위칭 알고리즘(TNSA)을 제안한다. TNSA는 트리에서 전송되는 패킷 수를 줄이기 위해 트리의 노드를 반복적으로 전환합니다. 다수의 센서 리포트를 수용하는 각 패킷의 수용 효율을 향상시켜 패킷을 줄입니다. MECAT 및 MECAT-RN에 TNSA를 적용한 결과, 적은 부담으로 에너지 소비를 크게 줄일 수 있습니다.
Hiroshi MATSUURA
NTT
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.
부
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
부
@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},}
부
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 -