An interest-driven routing algorithm in disruption-tolerant networking based social networks

With wide applications of intelligent handset devices, social networks have received more and more attentions. Currently, Disruption-Tolerant Networking provides a feasible content-distribution solution for a mobile device-dependent social network through its store-and-forward mechanism. This article puts forward an interest-driven routing algorithm for a Disruption-Tolerant Networking social networks, in which those nodes with similar interests are grouped into a same community to achieve reliable and resource-efficient forwarding of messages. In particular, each local node carrying a message will forward it by selecting the next-hop nodes with stronger Community Social Strength in the candidate node set with partial overlapped interests. On the other side, if the local node does not find a next-hop node with partially equivalent interests, the message will be forwarded to a next-hop node with a stronger Perceived Social Strength. Through the simulation experiments, the proposed routing algorithm could effectively improve the message delivery rate, average hop-count and load, compared with Epidemic and Prophet routing algorithms.