Next Article in Journal
A Three-Dimensional Constrained Ordered Weighted Averaging Aggregation Problem with Lower Bounded Variables
Previous Article in Journal
A Dynamic Adjusting Novel Global Harmony Search for Continuous Optimization Problems
Article Menu
Issue 8 (August) cover image

Export Article

Open AccessArticle
Symmetry 2018, 10(8), 338; https://doi.org/10.3390/sym10080338

FCNS: A Fuzzy Routing-Forwarding Algorithm Exploiting Comprehensive Node Similarity in Opportunistic 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 410083, China
*
Authors to whom correspondence should be addressed.
Received: 20 July 2018 / Revised: 3 August 2018 / Accepted: 10 August 2018 / Published: 13 August 2018
Full-Text   |   PDF [2048 KB, uploaded 13 August 2018]   |  

Abstract

At the dawn of big data and 5G networks, end-to-end communication with large amounts of data between mobile devices is difficult to be implemented through the traditional face-to-face transmission mechanism in social networks. Consequently, opportunistic social networks proposed that message applications should choose proper relay nodes to perform effective data transmission processes. At present, several routing algorithms, based on node similarity, attempt to use the contextual information related to nodes and the special relationships between them to select a suitable relay node among neighbors. However, when evaluating the similarity degree between a pair of nodes, most existing algorithms in opportunistic social networks pay attention to only a few similar factors, and even ignore the importance of mobile similarity in the data transmission process. To improve the transmission environment, this study establishes a fuzzy routing-forwarding algorithm (FCNS) exploiting comprehensive node similarity (the mobile and social similarities) in opportunistic social networks. In our proposed scheme, the transmission preference of the node is determined through the fuzzy evaluation of mobile and social similarities. The suitable message delivery decision is made by collecting and comparing the transmission preference of nodes, and the sustainable and stable data transmission process is performed through the feedback mechanism. Through simulations and the comparison of social network algorithms, the delivery ratio in the proposed algorithm is 0.85 on average, and the routing delay and network overhead of this algorithm are always the lowest. View Full-Text
Keywords: opportunistic social networks; routing algorithm; node similarity; fuzzy inference system; data transmission opportunistic social networks; routing algorithm; node similarity; fuzzy inference system; data transmission
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

Liu, K.; Chen, Z.; Wu, J.; Wang, L. FCNS: A Fuzzy Routing-Forwarding Algorithm Exploiting Comprehensive Node Similarity in Opportunistic Social Networks. Symmetry 2018, 10, 338.

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]
Symmetry EISSN 2073-8994 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top