Social Contact Probability Assisted Routing Protocol for Mobile Social Networks

This paper concerns the problem of dynamic routing in mobile social networks (MSNs). By exploiting the social characteristics of mobile nodes (MNs) in MSNs, a routing protocol is proposed, which is referred to as the Social Contact Probability assisted Routing (SCPR) protocol. This protocol can efficiently integrate the merits of high delivery ratio, low delivery latency and low resource consumption of the existing Epidemic, Prophet and SimBet protocols for MSNs, while circumventing their shortcomings. The performance of our SCPR protocol and of the above-mentioned other three routing protocols are evaluated in the context of our proposed mobility model, which jointly takes into account of MNs´ social characteristics, including randomness, waypoint and community behaviors.