An Effective Clustering Routing Algorithm Based on Social-Interest Similarity in Mobile Opportunistic Networks

Zeng, Feng and Peng, Jie and Li, WenJia (2017) An Effective Clustering Routing Algorithm Based on Social-Interest Similarity in Mobile Opportunistic Networks. In: 10th EAI International Conference on Mobile Multimedia Communications.

[thumbnail of 27226.pdf] PDF
27226.pdf

Download (310kB)

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 ar

Item Type: Conference or Workshop Item (UNSPECIFIED)
Date Deposited: 04 Mar 2026 11:22
Last Modified: 17 Apr 2026 16:40
URI: http://eprints.eai.eu/id/eprint/18486

Actions (login required)

View Item
View Item