Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Ye, M., Yin, P., Lee, W.C.: Location recommendation for location-based social networks. In: Proceedings of the 18th SIGSPATIAL international conference on advances in geographic information systems, pp. 458–461 (2010)
Su, Z., Xu, Q.: Content distribution over content centric mobile social networks in 5g. IEEE Commun. Mag. 53(6), 66–72 (2015)
Wu, J., Yu, G., Guan, P.: Interest characteristic probability predicted method in social opportunistic networks. IEEE Access 7, 59002–59012 (2019)
He, Y., Yu, F.R., Zhao, N., Yin, H.: Secure social networks in 5g systems with mobile edge computing, caching, and device-to-device communications. IEEE Wirel. Commun. 25(3), 103–109 (2018)
Vahdat, A., Becker, D., et al.: Epidemic routing for partially connected ad hoc networks (2000)
Lu, X., Hui, P.: An energy-efficient n-epidemic routing protocol for delay tolerant networks. In: 2010 IEEE Fifth International Conference on Networking, Architecture, and Storage, pp. 341–347. IEEE (2010)
Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In: Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking, pp. 252–259. ACM (2005)
Wang, G., Wang, B., Gao, Y.: Dynamic spray and wait routing algorithm with quality of node in delay tolerant network. In: 2010 International Conference on Communications and Mobile Computing, vol. 3, pp. 452–456. IEEE (2010)
Shi, W., Cao, J., Zhang, Q., Li, Y., Xu, L.: Edge computing: vision and challenges. IEEE Internet Things J. 3(5), 637–646 (2016)
Shi, W., Dustdar, S.: The promise of edge computing. Computer 49(5), 78–81 (2016)
Wu, J., Chen, Z., Zhao, M.: Community recombination and duplication node traverse algorithm in opportunistic social networks. Peer-to-Peer Netw. Appl. 13(3), 940–947 (2020)
Liu, H., Kou, H., Yan, C., Qi, L.: Link prediction in paper citation network to construct paper correlation graph. EURASIP J. Wirel. Commun. Netw. 2019(1), 1–12 (2019)
Yuan, Y., Ong, Y.S., Gupta, A., Xu, H.: Objective reduction in many-objective optimization: evolutionary multiobjective approaches and comprehensive analysis. IEEE Trans. Evol. Comput. 22(2), 189–210 (2017)
Newman, M.E.: Analysis of weighted networks. Phys. Rev. E 70(5), 056131 (2004)
Keranen, A.: Opportunistic network environment simulator. Special Assignment report, Helsinki University of Technology, Department of Communications and Networking (2008)
Wu, J., Chen, Z., Zhao, M.: Information cache management and data transmission algorithm in opportunistic social networks. Wirel. Netw. 25(6), 2977–2988 (2019)
Wu, J., Chen, Z., Zhao, M.: Secm: status estimation and cache management algorithm in opportunistic networks. J. Supercomput. 75(5), 2629–2647 (2019)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 IFIP International Federation for Information Processing
About this paper
Cite this paper
Luo, J., Wu, J., Wu, Y. (2021). An Efficient Data Transmission Strategy for Edge-Computing-Based Opportunistic Social Networks. In: He, X., Shao, E., Tan, G. (eds) Network and Parallel Computing. NPC 2020. Lecture Notes in Computer Science(), vol 12639. Springer, Cham. https://doi.org/10.1007/978-3-030-79478-1_28
Download citation
DOI: https://doi.org/10.1007/978-3-030-79478-1_28
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-79477-4
Online ISBN: 978-3-030-79478-1
eBook Packages: Computer ScienceComputer Science (R0)