{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T13:53:20Z","timestamp":1772546000176,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2022,7,12]],"date-time":"2022-07-12T00:00:00Z","timestamp":1657584000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,7,12]],"date-time":"2022-07-12T00:00:00Z","timestamp":1657584000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61972136"],"award-info":[{"award-number":["61972136"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sign Process Syst"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s11265-022-01790-3","type":"journal-article","created":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T15:04:09Z","timestamp":1657724649000},"page":"1253-1267","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":53,"title":["Social Similarity Routing Algorithm based on Socially Aware Networks in the Big Data Environment"],"prefix":"10.1007","volume":"94","author":[{"given":"Xiong","family":"Zenggang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zeng","family":"Mingyang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhang","family":"Xuemin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5801-4160","authenticated-orcid":false,"given":"Zhu","family":"Sanyuan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xu","family":"Fang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhao","family":"Xiaochao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wu","family":"Yunyun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Xiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,12]]},"reference":[{"issue":"8","key":"1790_CR1","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1007\/s12045-016-0376-7","volume":"21","author":"V Rajaraman","year":"2016","unstructured":"Rajaraman, V. (2016). Big data analytics. Resonance, 21(8), 695\u2013716.","journal-title":"Resonance"},{"issue":"1","key":"1790_CR2","first-page":"141","volume":"47","author":"V Petrivskyi","year":"2020","unstructured":"Petrivskyi, V., Dimitrov, G., Shevchenkoa, V., Bychkova, O., Garvanova, M., Panayotova, G., & Petrov, P. (2020). Information technology for big data sensor networks stability estimation. Information & Security, 47(1), 141\u2013154.","journal-title":"Information & Security"},{"issue":"2","key":"1790_CR3","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/MC.2004.1266292","volume":"37","author":"W Jie","year":"2004","unstructured":"Jie, W., & Stojmenovic, I. (2004). Ad hoc networks. Computer, 37(2), 29\u201331.","journal-title":"Computer"},{"key":"1790_CR4","unstructured":"Hamdi, M. M., Audah, L., Rashid, S. A., Mohammed, A. H., Alani, S., & Mustafa, A. S. (2020) A review of applications, characteristics and challenges in vehicular ad hoc networks (vanets). In 2020 international congress on human-computer interaction, optimization and robotic applications (HORA), pages 1\u20137. IEEE, 2020."},{"key":"1790_CR5","doi-asserted-by":"crossref","unstructured":"Gazis, A., & Katsiri, E. (2020). A wireless sensor network for underground passages: Remote sensing and wildlife monitoring. Engineering Reports, 2(6), e12170.","DOI":"10.1002\/eng2.12170"},{"key":"1790_CR6","doi-asserted-by":"crossref","unstructured":"Jain, S., Fall, K., & Patra, R. (2004). Routing in a delay tolerant network. In Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications, pages 145\u2013158.","DOI":"10.1145\/1015467.1015484"},{"key":"1790_CR7","doi-asserted-by":"crossref","unstructured":"Huang, C. M., Lan, KC., & Tsai C. Z. (2008). A survey of opportunistic networks. In 22nd International conference on advanced information networking and applications-workshops (aina workshops 2008), pages 1672\u20131677. IEEE, 2008.","DOI":"10.1109\/WAINA.2008.292"},{"key":"1790_CR8","doi-asserted-by":"crossref","unstructured":"Xia, F., Liu, L., Li, J., Ma, J., & Vasilakos, A.\u00a0V. (2013). Socially aware networking: A survey. IEEE Systems Journal, 9(3):904\u2013921.","DOI":"10.1109\/JSYST.2013.2281262"},{"issue":"12","key":"1790_CR9","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan, M., & Newman, M. E. J. (2002). Community structure in social and biological networks. Proceedings of the national academy of sciences, 99(12), 7821\u20137826.","journal-title":"Proceedings of the national academy of sciences"},{"key":"1790_CR10","doi-asserted-by":"crossref","unstructured":"Hui, P., & Crowcroft, J. (2007). How small labels create big improvements. In Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW\u201907), pages 65\u201370. IEEE, 2007.","DOI":"10.1109\/PERCOMW.2007.55"},{"key":"1790_CR11","doi-asserted-by":"crossref","unstructured":"Bulut, E., & Szymanski, B. K. (2012). Exploiting friendship relations for efficient routing in mobile social networks. IEEE Transactions on Parallel and Distributed Systems, 23(12):2254\u20132265.","DOI":"10.1109\/TPDS.2012.83"},{"key":"1790_CR12","doi-asserted-by":"crossref","unstructured":"Abdelmoumen, M., Dhib, E., Frikha, M., & Chahed, T. (2010). How to improve the performance in delay tolerant networks under manhattan mobility model. In 21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, pages 2008\u20132013. IEEE, 2010.","DOI":"10.1109\/PIMRC.2010.5671593"},{"key":"1790_CR13","unstructured":"Vahdat, A., Becker, D., et\u00a0al. (2000) Epidemic routing for partially connected ad hoc networks."},{"key":"1790_CR14","doi-asserted-by":"crossref","unstructured":"Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2005). Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking, pages 252\u2013259.","DOI":"10.1145\/1080139.1080143"},{"issue":"3","key":"1790_CR15","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/961268.961272","volume":"7","author":"A Lindgren","year":"2003","unstructured":"Lindgren, A., Doria, A., & Schel\u00e9n, O. (2003). Probabilistic routing in intermittently connected networks. ACM SIGMOBILE mobile computing and communications review, 7(3), 19\u201320.","journal-title":"ACM SIGMOBILE mobile computing and communications review"},{"key":"1790_CR16","doi-asserted-by":"crossref","unstructured":"Daly, E.\u00a0M., & Haahr, M. (2007). Social network analysis for routing in disconnected delay-tolerant manets. In Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing, pages 32\u201340.","DOI":"10.1145\/1288107.1288113"},{"key":"1790_CR17","doi-asserted-by":"crossref","unstructured":"Daly, E.\u00a0M., & Haahr, M. (2008). Social network analysis for information flow in disconnected delay-tolerant manets. IEEE Transactions on Mobile Computing, 8(5):606\u2013621.","DOI":"10.1109\/TMC.2008.161"},{"issue":"11","key":"1790_CR18","doi-asserted-by":"publisher","first-page":"1576","DOI":"10.1109\/TMC.2010.246","volume":"10","author":"P Hui","year":"2010","unstructured":"Hui, P., Crowcroft, J., & Yoneki, E. (2010). Bubble rap: Social-based forwarding in delay-tolerant networks. IEEE transactions on mobile computing, 10(11), 1576\u20131589.","journal-title":"IEEE transactions on mobile computing"},{"issue":"1","key":"1790_CR19","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1109\/TPDS.2014.2308200","volume":"26","author":"Z Li","year":"2014","unstructured":"Li, Z., Wang, C., Yang, S., Jiang, C., & Li, X. (2014). Lass: Local-activity and social-similarity based data forwarding in mobile social networks. IEEE Transactions on Parallel and Distributed Systems, 26(1), 174\u2013184.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"1790_CR20","doi-asserted-by":"crossref","unstructured":"Rahim, A., Kong, X., Xia, F., Ning, Z., Ullah, N., Wang, J., & Das, S. K. (2018) Vehicular social networks: A survey. Pervasive and Mobile Computing, 43:96\u2013113.","DOI":"10.1016\/j.pmcj.2017.12.004"},{"key":"1790_CR21","unstructured":"Deng, M., Fang, X.\u00a0U., Xiong, Z.\u00a0G., Cong-Huan, Y.\u00a0E., & Xia, H.\u00a0X. (2018). Social-aware data forwarding algorithm in mobile social networks. Computer Engineering and Design, 2018."},{"key":"1790_CR22","doi-asserted-by":"publisher","first-page":"59002","DOI":"10.1109\/ACCESS.2019.2915359","volume":"7","author":"W Jia","year":"2019","unstructured":"Jia, W., Genghua, Y., & Guan, P. (2019). Interest characteristic probability predicted method in social opportunistic networks. IEEE Access, 7, 59002\u201359012.","journal-title":"IEEE Access"},{"key":"1790_CR23","unstructured":"Fang, X., Xiao, N., Deng, M., Xie, Y., Xiong, Z., & Qiong, X. (2022). Efficient opportunistic routing with social context awareness for distributed mobile social networks. Concurrency and Computation: Practice and Experience, 34(7), e5524."},{"key":"1790_CR24","unstructured":"Shi, J., Wang, X., & Huang, M. (2020). Community aware msn routing scheme based on icn architecture. Journal of Software, 31(6):1786-1801 (in Chinese), 2020."},{"issue":"2","key":"1790_CR25","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s11265-020-01610-6","volume":"93","author":"Z Xiong","year":"2021","unstructured":"Xiong, Z., Xiao, N., Fang, X., Zhang, X., Qiong, X., Zhang, K., & Ye, C. (2021). An equivalent exchange based data forwarding incentive scheme for socially aware networks. Journal of Signal Processing Systems, 93(2), 249\u2013263.","journal-title":"Journal of Signal Processing Systems"},{"issue":"7","key":"1790_CR26","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1007\/s11265-021-01666-y","volume":"93","author":"N Xiao","year":"2021","unstructured":"Xiao, N., Xinyi, R., Xiong, Z., Fang, X., Zhang, X., Qiong, Xu., et al. (2021). A diversity-based selfish node detection algorithm for socially aware networking. Journal of signal processing systems, 93(7), 811\u2013825.","journal-title":"Journal of signal processing systems"},{"issue":"22","key":"1790_CR27","doi-asserted-by":"publisher","first-page":"31035","DOI":"10.1007\/s11042-018-7081-3","volume":"78","author":"Z Xiong","year":"2019","unstructured":"Xiong, Z., Yuan, W., Ye, C., Zhang, X., & Fang, X. (2019). Color image chaos encryption algorithm combining crc and nine palace map. Multimedia Tools and Applications, 78(22), 31035\u201331055.","journal-title":"Multimedia Tools and Applications"}],"container-title":["Journal of Signal Processing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-022-01790-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11265-022-01790-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-022-01790-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,16]],"date-time":"2022-11-16T01:18:48Z","timestamp":1668561528000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11265-022-01790-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,12]]},"references-count":27,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["1790"],"URL":"https:\/\/doi.org\/10.1007\/s11265-022-01790-3","relation":{},"ISSN":["1939-8018","1939-8115"],"issn-type":[{"value":"1939-8018","type":"print"},{"value":"1939-8115","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,12]]},"assertion":[{"value":"15 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 June 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 June 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 July 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"For this type of study formal consent was not required. This manuscript does not contain any studies with human participants or animals performed by any of the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}},{"value":"The authors declare that they have no competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interest"}}]}}