PeopleRank: Social Opportunistic Forwarding

— In opportunistic networks, end-to-end paths between two communicating nodes are rarely available. In such situations, the nodes might still copy and forward messages to nodes that are more likely to meet the destination. The question is which forwarding algorithm offers the best trade off between cost (number of message replicas) and rate of successful message delivery. We address this challenge by developing the PeopleRank approach in which nodes are ranked using a tunable weighted social information. Similar to the PageRank idea, PeopleRank gives higher weight to nodes if they are socially connected to other important nodes of the network. We develop centralized and distributed variants for the computation of PeopleRank. We present an evaluation using real mobility traces of nodes and their social interactions to show that PeopleRank manages to deliver messages with near optimal success rate (i.e., close to Epidemic Routing) while reducing the number of message retransmissions by...

• Type: Journal
• Year: 2010
• Where: INFOCOM
• Authors: Abderrahmen Mtibaa, Martin May, Christophe Diot, Mostafa H. Ammar
• Keywords: Communications, Important Nodes, INFOCOM 2010, Optimal Success Rate, Real Mobility Traces