Next Article in Journal
Robust Visual Tracking via Patch Descriptor and Structural Local Sparse Representation
Previous Article in Journal
A Simhash-Based Integrative Features Extraction Algorithm for Malware Detection
Article Menu

Export Article

Open AccessArticle
Algorithms 2018, 11(8), 125; https://doi.org/10.3390/a11080125

An Effective Data Transmission Algorithm Based on Social Relationships in Opportunistic Mobile Social Networks

1,2,†,‡
,
1,2,†,‡,* , 1,2,†,‡
and
1,2,†,‡
1
School of Software, Central South University, Changsha 410075, China
2
“Mobile Health” Ministry of Education-China Mobile Joint Laboratory, Changsha 410075, China
Current address: Central South University, Changsha 410075, China.
These authors contributed equally to this work.
*
Author to whom correspondence should be addressed.
Received: 24 June 2018 / Revised: 9 August 2018 / Accepted: 13 August 2018 / Published: 14 August 2018
Full-Text   |   PDF [738 KB, uploaded 14 August 2018]   |  

Abstract

With the popularization of mobile communication equipment, human activities have an increasing impact on the structure of networks, and so the social characteristics of opportunistic networks become increasingly obvious. Opportunistic networks are increasingly used in social situations. However, existing routing algorithms are not suitable for opportunistic social networks, because traditional opportunistic network routing does not consider participation in human activities, which usually causes a high ratio of transmission delay and routing overhead. Therefore, this research proposes an effective data transmission algorithm based on social relationships (ESR), which considers the community characteristics of opportunistic mobile social networks. This work uses the idea of the faction to divide the nodes in the network into communities, reduces the number of inefficient nodes in the community, and performs another contraction of the structure. Simulation results show that the ESR algorithm, through community transmission, is not only faster and safer, but also has lower transmission delay and routing overhead compared with the spray and wait algorithm, SCR algorithm and the EMIST algorithm. View Full-Text
Keywords: opportunistic networks; opportunistic mobile social networks; community division; community structure contraction opportunistic networks; opportunistic mobile social networks; community division; community structure contraction
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Yan, Y.; Chen, Z.; Wu, J.; Wang, L. An Effective Data Transmission Algorithm Based on Social Relationships in Opportunistic Mobile Social Networks. Algorithms 2018, 11, 125.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top