An effective data transmission algorithm based on social relationships in opportunistic mobile social networks

DOI10.3390/A11080125MaRDI QIDQ2331652zbMATH OpenOpenAlexWikidataFDO

Authors Yeqing Yan, Jia Wu, Leilei Wang, Zhi-Gang Chen

Publication date 30 October 2019

Published in Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3390/a11080125

zbMATH Keywords

community divisioncommunity structure contractionopportunistic mobile social networksopportunistic networks

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30)

Review text

This paper studies an effective data transmission algorithm in opportunistic mobile social networks. This algorithm divides the social network into different communities, which make information transfer faster as well as safer. To maintain the cohesion of the community structure, an approach is proposed to reduce the community using the information of the features of nodes. By using the information needing to be transmitted multiple times and distributing the numbers of copies to multiple communities, the routing overhead is reduced. The performance of the opportunistic social network algorithm is evaluated via numerical simulations.

Recommendations

• Routing algorithm in opportunistic networks based on node mobility
• Effective data transmission and control based on social communication in social opportunistic complex networks
• scientific article; zbMATH DE number 6263742
• Social relation-aware multicast routing mechanism for opportunistic networks
• A transmission prediction neighbor mechanism based on a mixed probability model in an opportunistic complex social network

Cites work

• Label propagation algorithm for community detection based on node importance and label influence

Cited in

(13)

• Effective data transmission and control based on social communication in social opportunistic complex networks
• On exploiting priority relation graph for reliable multi-path communication in mobile social networks
• An opportunistic network routing algorithm based on cosine similarity of data packets between nodes
• A transmission prediction neighbor mechanism based on a mixed probability model in an opportunistic complex social network
• Social forwarding in mobile opportunistic networks: a case of peoplerank
• Optimized path transmission selection routing algorithm for reducing energy consumption in opportunity networks
• Social relation-aware multicast routing mechanism for opportunistic networks
• The method of forwarding node selection based on Bayesian probability tree social network
• Routing algorithm in opportunistic networks based on node mobility
• scientific article; zbMATH DE number 6263742 (Why is no real title available?)
• Human mobility models and opportunistic communications system design
• Modeling and analysis of dynamic social ties in D2D collaborative video transmission
• Design and performance evaluation of contentplace, a social-aware data dissemination system for opportunistic networks

Describes a project that uses

Uses Software

• SCR

This page was built for publication: An effective data transmission algorithm based on social relationships in opportunistic mobile social networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2331652)