Research Article
An Effective Clustering Routing Algorithm Based on Social-Interest Similarity in Mobile Opportunistic Networks
@INPROCEEDINGS{10.4108/eai.13-7-2017.2270328, author={Feng Zeng and Jie Peng and WenJia Li}, title={An Effective Clustering Routing Algorithm Based on Social-Interest Similarity in 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; routing; clustering; social relationship; interest similarity}, doi={10.4108/eai.13-7-2017.2270328} }- Feng Zeng
Jie Peng
WenJia Li
Year: 2017
An Effective Clustering Routing Algorithm Based on Social-Interest Similarity in Mobile Opportunistic Networks
MOBIMEDIA
EAI
DOI: 10.4108/eai.13-7-2017.2270328
Abstract
In this paper, we consider social attribute and interest jointly to measure the relation between nodes. First, the real-life phenomena are analyzed to show the necessary of the combination of nodes' social attribute and interest, and the definitions of social and interest similarity between nodes are given to show the degree of the relation between nodes. Then, we proposed an effective routing algorithm based on social-interest similarity. In the proposed algorithm, each node maintains a local cluster according to node similarity, keeps updating the local cluster to ensure cluster members having best node similarity with it, and forwards message only to the encounter nodes whose local cluster contains the destination node. At last, simulation is done, the results show that the proposed algorithm has better performance than other three algorithms on the whole.
