Design and cof self-organized data aggregation using evolutionary game theory in delay tolerant networks

In delay tolerant networks (DTNs), custody transfer mechanism provides reliable end-to-end data transfer in which special nodes (custodians) transfer data with custody in a hop-by-hop manner. As a result, storage congestion occurs when data with custody increases and/or the network is partitioned into multiple sub-networks for a long time. The storage congestion can be alleviated with the help of message ferries. In such a scenario, data should be aggregated to some custodians so that message ferries can effectively collect them. In this paper, we propose a scheme to aggregate data into selected custodians, called aggregators, in a fully distributed and autonomous manner by using evolutionary game theoretical approach where we can also control the number of aggregators to a desired value.