Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Social and Information Networks

arXiv:2008.10449 (cs)
[Submitted on 9 Aug 2020]

Title:Data Dissemination Using Interest Tree in Socially Aware Networking

Authors:Feng Xia, Qiuyuan Yang, Jie Li, Jiannong Cao, Li Liu, Ahmedin Mohammed Ahmed
View PDF
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 combines two social features, i.e. density of a community and social tie, to support data dissemination. The simulation results show that Int-Tree achieves higher delivery ratio, lower overhead, in comparison to two benchmark protocols, PROPHET and Epidemic routing. In addition, Int-Tree can perform with 1.36 hop counts in average, and tolerable latency in terms of buffer size, time to live (TTL) and simulation duration. Finally, Int-Tree keeps stable performance with various parameters.
Comments: 13 pages, 9 figures
Subjects: Social and Information Networks (cs.SI); Networking and Internet Architecture (cs.NI)
Cite as: arXiv:2008.10449 [cs.SI]
  (or arXiv:2008.10449v1 [cs.SI] for this version)
  https://doi.org/10.48550/arXiv.2008.10449
Journal reference: Computer Networks, Vol. 91, November 2015, pp: 495-507
Related DOI: https://doi.org/10.1016/j.comnet.2015.08.047

Submission history

From: Feng Xia [view email]
[v1] Sun, 9 Aug 2020 03:45:52 UTC (3,086 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.SI
< prev   |   next >
new | recent | 2020-08
Change to browse by:
cs
cs.NI

References & Citations

DBLP - CS Bibliography

listing | bibtex
Feng Xia
Jie Li
Jiannong Cao
Li Liu
Ahmedin Mohammed Ahmed
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)