Research Article
An Effective Routing Algorithm Based on Social Community for Mobile Opportunistic Networks
@INPROCEEDINGS{10.4108/eai.13-7-2017.2270508, author={Nan Zhao and Feng Zeng and Wenjia Li}, title={An Effective Routing Algorithm Based on Social Community for Mobile Opportunistic Networks}, proceedings={10th EAI International Conference on Mobile Multimedia Communications}, publisher={EAI}, proceedings_a={MOBIMEDIA}, year={2017}, month={12}, keywords={mobile opportunistic network social relations social mobil- ity routing algorithm}, doi={10.4108/eai.13-7-2017.2270508} }- Nan Zhao
Feng Zeng
Wenjia Li
Year: 2017
An Effective Routing Algorithm Based on Social Community for Mobile Opportunistic Networks
MOBIMEDIA
EAI
DOI: 10.4108/eai.13-7-2017.2270508
Abstract
An important application scenario of mobile opportunistic networks is social contact networks, in which nodes are com- posed of mobile devices carried by human beings, and social relations among nodes should be considered when we design routing algorithm for mobile opportunistic networks. In this paper, we focus on social relations among nodes and node movement prediction, and propose a novel social community- based routing algorithm. We introduce the social relation as the key metrics for community dividing, and semi-Markov process is used to model movement of nodes based on the community structure. Based on the result of prediction, the next-hop nodes can be appropriately chose for message forwarding. Simulation is done, and the result shows that the proposed algorithm outperforms the other three classic routing algorithms.