Grouping Clusters to Minimize the Total Mean Delivery Delay of Bundles in Ferry-assisted DTNs

K. Habibul Kabir Masahiro Sasabe Tetsuya Takine

In 電子情報通信学会技術研究報告（ネットワークシステム研究会）, 2012

Abstract

Communication among isolated networks (clusters) in delay tolerant networks (DTNs) can be supported by a message ferry, which collects bundles from clusters and delivers them to a sink node. When there are lots of distant static clusters, multiple message ferries and sink nodes will be required. In this paper, we aim to make groups each of which consists of physically close clusters, a sink node, and a message ferry. Our main objective is minimizing the overall mean delivery delay of bundles in consideration of both offered load of clusters and distance between clusters and their sink nodes. We first model this problem as a nonlinear integer programming, based on the knowledge obtained in our previous work. Because it might be hard to solve this problem directly, we take two-step optimization approach based on linear integer programming, which yields an approximate solution of the problem. Through numerical results, we show the two-step optimization approach works well.

Downloads

    Text Reference

    K. Habibul Kabir, Masahiro Sasabe, Tetsuya Takine, Grouping Clusters to Minimize the Total Mean Delivery Delay of Bundles in Ferry-assisted DTNs, 電子情報通信学会技術研究報告（ネットワークシステム研究会）, 111(408), pp.87-92, January 2012.

    BibTex Reference

    @article{kabir12GroupingClustersMinimize,
    author = "Kabir, K. Habibul and Sasabe, Masahiro and Takine, Tetsuya",
    title = "Grouping {{Clusters}} to {{Minimize}} the {{Total Mean Delivery Delay}} of {{Bundles}} in {{Ferry-assisted DTNs}}",
    year = "2012",
    month = "January",
    journal = "電子情報通信学会技術研究報告（ネットワークシステム研究会）",
    volume = "111",
    number = "408",
    pages = "87--92"
}