An efficient routing scheme based on social relations in delay-tolerant networks

Abstract

In delay-tolerant network (DTN), the message forwarding and routing are important research issues, since the network topology changes dynamically and there is no guarantee of continuous connectivity between any two nodes. In this paper, we propose an efficient DTN routing scheme by using a node's social relation where each node chooses a proper relay node based on its contact history. In order to enhance the routing efficiency, the expanded egonetwork betweenness centrality is used when a relay node is selected. We have demonstrated that our algorithm performs efficiently compared to the existing epidemic and friendship routing schemes. © Springer-Verlag Berlin Heidelberg 2014.