An Efficient Routing Algorithm Based on Social Awareness in DTNs

This paper presents an improved routing algorithm based on the social link awareness. In this algorithm, multiple social features of the nodes´ behaviors are utilized to quantify the nodes pairs´ social links. The social links of the nodes pairs are computed based on their encounter history. These social links can be used to construct the friendship communities of the nodes. The intra-community and inter-community forwarding mechanisms are implemented to raise the successful delivery ratio with low overhead and decrease the transmission delay. Simulation results show that the proposed algorithm shortens the routing delay and the overhead, and increases the successful delivery ratio, thereby improving the routing efficiency.