In delay tolerant networks (DTNs), the opportunity of communication among isolated networks (clusters) can be provided by a message ferry which moves around the network to proactively collect bundles and deliver them to a sink node. When there are lots of distant static clusters, the message ferry should visit them efficiently to minimize the mean delivery delay of bundles. In this paper, we propose an algorithm for determining the optimal visiting order of isolated static clusters in DTNs. We show that the minimization problem of the overall mean delivery delay in our system is reduced to that of the weighted mean waiting time in the conventional polling model. We then solve the problem with the help of an existing approach to the polling model and obtain a quasi-optimal balanced sequence representing the visiting order. Through numerical examples, we show that the proposed visiting order is effective when arrival rates at clusters and/or distances between clusters and the sink are heterogeneous.
K. Habibul Kabir, Masahiro Sasabe, Tetsuya Takine, Optimal Visiting Order of Isolated Clusters in DTNs to Minimize the Total Mean Delivery Delay of Bundles, Numerical Algebra, Control & Optimization, 1(4), pp.563-576, November 2011.
@article{kabir11OptimalVisitingOrder,
author = "Kabir, K. Habibul and Sasabe, Masahiro and Takine, Tetsuya",
title = "Optimal {{Visiting Order}} of {{Isolated Clusters}} in {{DTNs}} to {{Minimize}} the {{Total Mean Delivery Delay}} of {{Bundles}}",
year = "2011",
month = "November",
journal = "Numerical Algebra, Control \& Optimization",
volume = "1",
number = "4",
pages = "563--576",
doi = "10.3934/naco.2011.1.563"
}