COFFEE-CUP: A cost-efficient routing strategy for delay tolerant networks using time-varying community partitioning
Guoping Lin, Qing Min Liao, Can Deng, Tianyi Wang, Jingling Zhao · 2016
Delay Tolerant Networks are a special kind of ad hoc networks that consist of a number of mobile devices. In DTNs, network topology frequently changes and source-to-destination communication paths can hardly be sustained. However, some social features have been observed in DTNs by analyzing the real mobile trajectories of DTNs. To utilize these social features to facilitate data routing, we present a community-based routing protocol that efficiently detects the community structure by using proposed time-varying community partitioning algorithm. For intracommunity routing, according to the remaining time-to-live of the message, the minimum number of message copies necessary to achieve a given delivery probability is calculated, which is the number of message copies utilized to spray in the current community. To facilitate intercommunity routing, we choose the gateway node that connects the next community frequently as relay. The evaluation of our strategy is conducted by extensive traced-driven simulations. The results of simulations confirm the effectiveness of our routing strategy.