IEICE TRANSACTIONS on Communications
Evolutionary Game Theoretic Approach to Self-Organized Data Aggregation in Delay Tolerant Networks
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E93-B No.3 pp.490-500
- Publication Date
- 2010/03/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E93.B.490
- Type of Manuscript
- Special Section PAPER (Special Section on New Generation Network towards Innovative Future Society)
- Category
Authors
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
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
Copy
@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},}
Copy
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 -
English
