Community Roamer: A Social-Based Routing Algorithm in Opportunistic Mobile Networks

摘要

Opportunistic mobile networks enable mobile devices to exchange data by opportunistic contacts between devices. Since communication is highly impacted by human mobility, the social properties of human beings are exploited to improve the performance of data forwarding. In this paper, we first analyze the threshold configuration of community merging during the process of distributed community discovery. We then introduce a new social-based routing algorithm, called Community Roamer, which identifies those active nodes moving between different clustered communities to create an efficient inter-community forwarding path. Simulations on four real data sets show that the new algorithm has a much lower overhead than the existing algorithms and comparable message delivery ratio.