%0 Conference Proceedings
%T An Efficient Data Transmission Strategy for Edge-Computing-Based Opportunistic Social Networks
%+ School of Computer [Chine]
%A Luo, Jingwen
%A Wu, Jia
%A Wu, Yuzhou
%Z Part 6: Edge Computing
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 17th IFIP International Conference on Network and Parallel Computing (NPC)
%C Zhengzhou, China
%Y Xin He
%Y En Shao
%Y Guangming Tan
%I Springer International Publishing
%3 Network and Parallel Computing
%V LNCS-12639
%P 323-335
%8 2020-09-28
%D 2020
%R 10.1007/978-3-030-79478-1_28
%K Edge computing
%K Opportunistic social networks
%K OSNs
%K Data transmission
%K Data management
%Z Computer Science [cs]Conference papers
%X As wireless network has developed rapidly in recent years, especially with the maturity and wide application of 5G wireless system, millions of mobile users have been able to quickly exchange large amounts of data in social networks. Despite the positive impact of the recent advances in edge computing on opportunistic social networks (OSNs), classical OSN algorithms rely on only a few source nodes to forward data, which often results in data transmission delay, excessive resource consumption and even loss of source nodes. Therefore, we propose an efficient edge-computing-based data transmission strategy in OSNs. It classifies nodes into new communities according to their degree of association. Source nodes forward data through relay nodes in community, which effectively reduces the resource consumption of a single node. The experiment results of comparison with the three algorithms show that the proposed method can effectively reduce the resource consumption during data transmission as well as enhance the information transmission efficiency.
%G English
%Z TC 10
%Z WG 10.3
%2 https://inria.hal.science/hal-03768754/document
%2 https://inria.hal.science/hal-03768754/file/511910_1_En_28_Chapter.pdf
%L hal-03768754
%U https://inria.hal.science/hal-03768754
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC10
%~ IFIP-NPC
%~ IFIP-WG10-3
%~ IFIP-LNCS-12639