A DTN routing algorithm adopting the “Community” and “Centrality” parameters used in social networks

A delay tolerant network (DTN) realizes a message exchange among mobile terminals without static communication network structures. However, current probability-based DTN routing algorithms do not accurately take into account the selection of messages that should be forwarded to other terminals. This often produces many redundant messages in the field, and causes an overflow in message buffer at each terminal. In this paper, we propose a DTN routing algorithm that controls message forwarding in each terminal using parameters named “Community” and “Centrality.” According to the evaluation considering real situations, our routing algorithm reduces 86% of redundant messages, compared to the epidemic routing algorithm, without compromising on the quality of the message delivery among the mobile terminals.