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
DTN(지연 허용 네트워크)의 보관 전송은 홉별 방식으로 특수 노드(관리자) 간에 데이터 전송 책임을 위임하여 안정적인 엔드투엔드 데이터 전달을 제공합니다. 그러나 데이터가 증가하거나 네트워크가 장기간 여러 하위 네트워크로 분할되는 경우 스토리지 혼잡이 발생합니다. 네트워크를 돌아다니며 관리인으로부터 데이터를 사전에 수집하는 메시지 페리를 통해 스토리지 혼잡을 완화할 수 있습니다. 이러한 시나리오에서는 메시지 페리가 데이터를 효과적으로 수집할 수 있도록 데이터를 일부 관리인에게 집계해야 합니다. 본 논문에서는 진화적 게임 이론 접근 방식의 도움을 받아 완전히 분산되고 자율적인 방식으로 수집자(aggregator)라고 불리는 선택된 관리인에게 데이터를 수집하는 방식을 제안합니다. 이론적 분석과 여러 시뮬레이션 실험을 통해 노드의 비협조적인 행동을 고려하여 Aggregator를 자기 조직적으로 선택할 수 있으며 Aggregator의 수를 원하는 값으로 제어할 수 있음을 보여줍니다.
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.
부
K. Habibul KABIR, Masahiro SASABE, Tetsuya TAKINE, "Evolutionary Game Theoretic Approach to Self-Organized Data Aggregation in Delay Tolerant Networks" in IEICE TRANSACTIONS on Communications,
vol. E93-B, no. 3, pp. 490-500, March 2010, doi: 10.1587/transcom.E93.B.490.
Abstract: Custody transfer in delay tolerant networks (DTNs) provides reliable end-to-end data delivery by delegating the responsibility of data transfer among special nodes (custodians) in a hop-by-hop manner. However, storage congestion occurs when data increases and/or the network is partitioned into multiple sub-networks for a long time. The storage congestion can be alleviated by message ferries which move around the network and proactively collect data from the custodians. In such a scenario, data should be aggregated to some custodians so that message ferries can collect them effectively. In this paper, we propose a scheme to aggregate data into selected custodians, called aggregators, in a fully distributed and autonomous manner with the help of evolutionary game theoretic approach. Through theoretical analysis and several simulation experiments, taking account of the uncooperative behavior of nodes, we show that aggregators can be selected in a self-organized manner and the number of aggregators can be controlled to a desired value.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E93.B.490/_p
부
@ARTICLE{e93-b_3_490,
author={K. Habibul KABIR, Masahiro SASABE, Tetsuya TAKINE, },
journal={IEICE TRANSACTIONS on Communications},
title={Evolutionary Game Theoretic Approach to Self-Organized Data Aggregation in Delay Tolerant Networks},
year={2010},
volume={E93-B},
number={3},
pages={490-500},
abstract={Custody transfer in delay tolerant networks (DTNs) provides reliable end-to-end data delivery by delegating the responsibility of data transfer among special nodes (custodians) in a hop-by-hop manner. However, storage congestion occurs when data increases and/or the network is partitioned into multiple sub-networks for a long time. The storage congestion can be alleviated by message ferries which move around the network and proactively collect data from the custodians. In such a scenario, data should be aggregated to some custodians so that message ferries can collect them effectively. In this paper, we propose a scheme to aggregate data into selected custodians, called aggregators, in a fully distributed and autonomous manner with the help of evolutionary game theoretic approach. Through theoretical analysis and several simulation experiments, taking account of the uncooperative behavior of nodes, we show that aggregators can be selected in a self-organized manner and the number of aggregators can be controlled to a desired value.},
keywords={},
doi={10.1587/transcom.E93.B.490},
ISSN={1745-1345},
month={March},}
부
TY - JOUR
TI - Evolutionary Game Theoretic Approach to Self-Organized Data Aggregation in Delay Tolerant Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 490
EP - 500
AU - K. Habibul KABIR
AU - Masahiro SASABE
AU - Tetsuya TAKINE
PY - 2010
DO - 10.1587/transcom.E93.B.490
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E93-B
IS - 3
JA - IEICE TRANSACTIONS on Communications
Y1 - March 2010
AB - Custody transfer in delay tolerant networks (DTNs) provides reliable end-to-end data delivery by delegating the responsibility of data transfer among special nodes (custodians) in a hop-by-hop manner. However, storage congestion occurs when data increases and/or the network is partitioned into multiple sub-networks for a long time. The storage congestion can be alleviated by message ferries which move around the network and proactively collect data from the custodians. In such a scenario, data should be aggregated to some custodians so that message ferries can collect them effectively. In this paper, we propose a scheme to aggregate data into selected custodians, called aggregators, in a fully distributed and autonomous manner with the help of evolutionary game theoretic approach. Through theoretical analysis and several simulation experiments, taking account of the uncooperative behavior of nodes, we show that aggregators can be selected in a self-organized manner and the number of aggregators can be controlled to a desired value.
ER -