Research Article
An efficient Multi-Clusters based Routing algorithm in Mobile Opportunistic Networks
@INPROCEEDINGS{10.4108/eai.21-6-2018.2276572, author={Jie Peng and Feng Zeng and WenJia Li}, title={An efficient Multi-Clusters based Routing algorithm in Mobile Opportunistic Networks}, proceedings={11th EAI International Conference on Mobile Multimedia Communications}, publisher={EAI}, proceedings_a={MOBIMEDIA}, year={2018}, month={9}, keywords={mobile opportunistic networks; multi-clusters; routing algorithm}, doi={10.4108/eai.21-6-2018.2276572} }- Jie Peng
Feng Zeng
WenJia Li
Year: 2018
An efficient Multi-Clusters based Routing algorithm in Mobile Opportunistic Networks
MOBIMEDIA
EAI
DOI: 10.4108/eai.21-6-2018.2276572
Abstract
Mobile Opportunistic Networks (MONs) are formed by random moving nodes. In MONs, there is no fixed link between any two nodes, the node can only transfer the message based on "storage-carry-and-forwar" data transmission mode. Therefore, a key challenge is to find a routing that can provide a good message delivery performance in MONs. In this paper, we use a phenomenon in real life to design an efficient Multi-Clusters based routing algorithm MCR. At first, we described a phenomenon that most of us have circle of friends, but also exists in multiple friends circles. Then, we used the encounter history to set up building and updating mechanism for the circles. After that, the multi-clusters had been formed with these friends circles. And we used the multi-clusters to design MCR and make some experiments on real mobility traces. Finally our experiments results had shown that MCR outperforms the other three routing algorithms.