In this thesis we present a delay-tolerant network routing algorithm designed to transport messages in intermittently-connected mobile sensor networks. Betweenness centrality and social similarity metrics taking into account the strength and dynamics in the relations of socially organized networks are utilized to find efficient paths.
Since we designed this algorithm for recource constrained devices it is based on an ego-centric network view. The algorithm is able to discover short routes in mobile and intermittently connected networks and deliver messages without sending multiple message copies over the network. In order to achieve this goal, node communication and node state size is managed in an efficient way.