Data Dissemination Using Interest Tree in Socially Aware Networking
Feng Xia, Qiuyuan Yang, Jie Li, Jiannong Cao, Li Liu, Ahmedin Mohammed, Ahmed

TL;DR
This paper introduces Int-Tree, a novel interest-based community structure for socially aware networking that enhances data dissemination efficiency by leveraging user interest relationships, outperforming existing protocols in delivery ratio and overhead.
Contribution
The paper models user interest relationships using a layer-based structure and proposes Int-Tree, a new interest-tree scheme that improves data dissemination in SAN environments.
Findings
Higher delivery ratio compared to PROPHET and Epidemic routing
Lower overhead in data dissemination
Stable performance across various parameters
Abstract
Socially aware networking (SAN) exploits social characteristics of mobile users to streamline data dissemination protocols in opportunistic environments. Existing protocols in this area utilized various social features such as user interests, social similarity, and community structure to improve the performance of data dissemination. However, the interrelationship between user interests and its impact on the efficiency of data dissemination has not been explored sufficiently. In this paper, we analyze various kinds of relationships between user interests and model them using a layer-based structure in order to form social communities in SAN paradigm. We propose Int-Tree, an Interest-Tree based scheme which uses the relationship between user interests to improve the performance of data dissemination. The core of Int-Tree is the interest-tree, a tree-based community structure that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
