{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:01:13Z","timestamp":1760241673519,"version":"build-2065373602"},"reference-count":27,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2018,8,6]],"date-time":"2018-08-06T00:00:00Z","timestamp":1533513600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100002822","name":"Central South University","doi-asserted-by":"publisher","award":["2018zzts606"],"award-info":[{"award-number":["2018zzts606"]}],"id":[{"id":"10.13039\/501100002822","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71633006","616725407"],"award-info":[{"award-number":["71633006","616725407"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2017M612586"],"award-info":[{"award-number":["2017M612586"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010021","name":"Postdoctoral Science Foundation of Central South University","doi-asserted-by":"publisher","award":["185684"],"award-info":[{"award-number":["185684"]}],"id":[{"id":"10.13039\/501100010021","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>The mobility of nodes leads to dynamic changes in topology structure, which makes the traditional routing algorithms of a wireless network difficult to apply to the opportunistic network. In view of the problems existing in the process of information forwarding, this paper proposed a routing algorithm based on the cosine similarity of data packets between nodes (cosSim). The cosine distance, an algorithm for calculating the similarity between text data, is used to calculate the cosine similarity of data packets between nodes. The data packet set of nodes are expressed in the form of vectors, thereby facilitating the calculation of the similarity between the nodes. Through the definition of the upper and lower thresholds, the similarity between the nodes is filtered according to certain rules, and finally obtains a plurality of relatively reliable transmission paths. Simulation experiments show that compared with the traditional opportunistic network routing algorithm, such as the Spray and Wait (S&amp;W) algorithm and Epidemic algorithm, the cosSim algorithm has a better transmission effect, which can not only improve the delivery ratio, but also reduce the network transmission delay and decline the routing overhead.<\/jats:p>","DOI":"10.3390\/a11080119","type":"journal-article","created":{"date-parts":[[2018,8,7]],"date-time":"2018-08-07T03:44:18Z","timestamp":1533613458000},"page":"119","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["An Opportunistic Network Routing Algorithm Based on Cosine Similarity of Data Packets between Nodes"],"prefix":"10.3390","volume":"11","author":[{"given":"Yucheng","family":"Lin","sequence":"first","affiliation":[{"name":"School of Software, Central South University, Changsha 410075, China"},{"name":"\u201cMobile Health\u201d Ministry of Education-China Mobile Joint Laboratory, Changsha 410083, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhigang","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Software, Central South University, Changsha 410075, China"},{"name":"\u201cMobile Health\u201d Ministry of Education-China Mobile Joint Laboratory, Changsha 410083, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9013-0818","authenticated-orcid":false,"given":"Jia","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Software, Central South University, Changsha 410075, China"},{"name":"\u201cMobile Health\u201d Ministry of Education-China Mobile Joint Laboratory, Changsha 410083, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3559-043X","authenticated-orcid":false,"given":"Leilei","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Software, Central South University, Changsha 410075, China"},{"name":"\u201cMobile Health\u201d Ministry of Education-China Mobile Joint Laboratory, Changsha 410083, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2018,8,6]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Poonguzharselvi, B., and Vetriselvi, V. (2013, January 4\u20136). Survey on routing algorithms in opportunistic networks. Proceedings of the 2013 International Conference on Computer Communication and Informatics, Coimbatore, India.","key":"ref_1","DOI":"10.1109\/ICCCI.2013.6466129"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11277-017-4506-7","article-title":"An Opportunistic Routing Protocol for Mobile Ad Hoc Networks Based on Stable Ideology","volume":"97","author":"Ding","year":"2017","journal-title":"Wirel. Pers. Commun."},{"doi-asserted-by":"crossref","unstructured":"Chhabra, A., Vashishth, V., and Sharma, D.K.A. (2017, January 22\u201324). game theory based secure model against Black hole attacks in Opportunistic Networks. Proceedings of the 2017 51st Annual Conference on Information Sciences and Systems, Baltimore, MD, USA.","key":"ref_3","DOI":"10.1109\/CISS.2017.7926114"},{"doi-asserted-by":"crossref","unstructured":"Alajeely, M., Doss, R., and Ahmad, A. (2017). Routing Protocols in Opportunistic Networks\u2014A Survey. IETE Tech. Rev., 1\u201319.","key":"ref_4","DOI":"10.1080\/02564602.2017.1304834"},{"key":"ref_5","first-page":"1581","article-title":"Dynamic Ant Colony Based Routing Algorithm for Mobile Ad-hoc Networks","volume":"27","author":"Noorhosseini","year":"2011","journal-title":"J. Inf. Sci. Eng."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"5424","DOI":"10.1109\/TVT.2015.2457680","article-title":"Toward a Comprehensive Model for Performance Analysis of Opportunistic Routing in Wireless Mesh Networks","volume":"65","author":"Darehshoorzadeh","year":"2016","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_7","first-page":"62","article-title":"A socially aware Routing protocol in mobile opportunistic networks","volume":"12","author":"Liu","year":"2017","journal-title":"J. Commun."},{"doi-asserted-by":"crossref","unstructured":"Menon, V.G., and Prathap, P.M.J. (2016, January 21\u201322). Comparative analysis of opportunistic routing protocols for underwater acoustic sensor networks. Proceedings of the 2016 International Conference on Emerging Technological Trends, Kollam, India.","key":"ref_8","DOI":"10.1109\/ICETT.2016.7873733"},{"doi-asserted-by":"crossref","unstructured":"Eary, C., Kumar, M., and Zaruba, G. (2017). DiTON: Distributed Transactions in Opportunistic Networks. Comput. Commun., 109.","key":"ref_9","DOI":"10.1016\/j.comcom.2017.06.005"},{"key":"ref_10","first-page":"1","article-title":"Energy-Efficient Opportunistic Transmission Scheduling for Sparse Sensor Networks with Mobile Relays","volume":"2016","author":"Liu","year":"2016","journal-title":"Math. Probl. Eng."},{"doi-asserted-by":"crossref","unstructured":"Ppisch, A., and Graffi, K. (2017, January 27\u201329). Infrastructure Mode Based Opportunistic Networks on Android Devices. Proceedings of the 31st IEEE International Conference on Advanced Information Networking and Applications, Taipei, Taiwan.","key":"ref_11","DOI":"10.1109\/AINA.2017.32"},{"doi-asserted-by":"crossref","unstructured":"Wang, L., Chen, Z., and Wu, J. (2017). An Opportunistic Routing for Data Forwarding Based on Vehicle Mobility Association in Vehicular Ad Hoc Networks. Information, 8.","key":"ref_12","DOI":"10.3390\/info8040140"},{"doi-asserted-by":"crossref","unstructured":"Sati, S. (2016, January 1\u20134). The State of Simulation Tools for P2P Networks on Mobile Ad-Hoc and Opportunistic Networks. Proceedings of the 25th International Conference on Computer Communication and Networks, Waikoloa, HI, USA.","key":"ref_13","DOI":"10.1109\/ICCCN.2016.7568584"},{"doi-asserted-by":"crossref","unstructured":"Bai, Y., Mai, Y., and Wang, N. (2017, January 26\u201328). Performance comparison and evaluation of the proactive and reactive routing protocols for MANETs. Proceedings of the 2017 Wireless Telecommunications Symposium, Chicago, IL, USA.","key":"ref_14","DOI":"10.1109\/WTS.2017.7943538"},{"doi-asserted-by":"crossref","unstructured":"Ali, A.K.S., and Kulkarni, U.V. (2017, January 5\u20137). Comparing and Analyzing Reactive Routing Protocols (AODV, DSR and TORA) in QoS of MANET. Proceedings of the International Advance Computing Conference, Hyderabad, India.","key":"ref_15","DOI":"10.1109\/IACC.2017.0081"},{"doi-asserted-by":"crossref","unstructured":"Zeng, F., Zhao, N., and Li, W. (2017). Effective Social Relationship Measurement and Cluster Based Routing in Mobile Opportunistic Networks. Sensors, 17.","key":"ref_16","DOI":"10.3390\/s17051109"},{"doi-asserted-by":"crossref","unstructured":"Yang, Y., Zhao, H., Ma, J., and Han, X. (2017). Social-aware data dissemination in opportunistic mobile social networks. Int. J. Mod. Phys. C, 28.","key":"ref_17","DOI":"10.1142\/S0129183117501157"},{"doi-asserted-by":"crossref","unstructured":"Chen, W., Chen, Z., Li, W., and Zeng, F. (2016, January 20\u201321). An Enhanced Community-Based Routing with Ferry in Opportunistic Networks. Proceedings of the International Conference on Identification, Information and Knowledge in the Internet of Things, Beijing, China.","key":"ref_18","DOI":"10.1109\/IIKI.2016.8"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/s10586-015-0506-0","article-title":"Efficient top- k, similarity document search utilizing distributed file systems and cosine similarity","volume":"19","author":"Alewiwi","year":"2016","journal-title":"Cluster Comput."},{"doi-asserted-by":"crossref","unstructured":"Wu, J., Chen, Z., and Zhao, M. (2018). Information Transmission Probability and Cache Management Method in Opportunistic Networks. Wirel. Commun. Mob. Comput., 1\u20139.","key":"ref_20","DOI":"10.1155\/2018\/1571974"},{"doi-asserted-by":"crossref","unstructured":"Ramanathan, R., Hansen, R., Basu, P., Rosales-Hain, R., and Krishnan, R. (2007, January 11). Prioritized epidemic routing for opportunistic networks. Proceedings of the 1st International MobiSys Workshop on Mobile Opportunistic Networking, San Juan, Puerto Rico.","key":"ref_21","DOI":"10.1145\/1247694.1247707"},{"unstructured":"Zhang, F., Wang, X.M., Lin, Y.G., and Zhu, T.J. (2015, January 18\u201320). Adaptive adjustments of n-Epidemic routing protocol for opportunistic networks. Proceedings of the IEEE International Conference on Progress in Informatics and Computing, Nanjing, China.","key":"ref_22"},{"key":"ref_23","first-page":"1","article-title":"Sharing spray and wait routing algorithm in opportunistic networks","volume":"22","author":"Nahideh","year":"2015","journal-title":"Wirel. Netw."},{"doi-asserted-by":"crossref","unstructured":"Bamrah, A., Woungang, I., Barolli, L., Dhurandher, S.K., Carvalho, G.H.S., and Takizawa, M. (2016, January 6\u20138). A Centrality-Based History Prediction Routing Protocol for Opportunistic Networks. Proceedings of the International Conference on Complex, Intelligent, and Software Intensive Systems, Fukuoka, Japan.","key":"ref_24","DOI":"10.1109\/CISIS.2016.143"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"2040","DOI":"10.1587\/transcom.E98.B.2040","article-title":"Exploiting Social Relationship for Opportunistic Routing in Mobile Social Networks","volume":"98","author":"Gao","year":"2015","journal-title":"Ieice Trans. Commun."},{"doi-asserted-by":"crossref","unstructured":"Mei, A., Morabito, G., Santi, P., and Stefa, J. (2011, January 10\u201315). Social-aware stateless forwarding in pocket switched networks. Proceedings of the 2011 Proceedings IEEE INFOCOM, Shanghai, China.","key":"ref_26","DOI":"10.1109\/INFCOM.2011.5935076"},{"doi-asserted-by":"crossref","unstructured":"Fabbri, F., and Verdone, R. (2011). A sociability-based routing scheme for delay-tolerant networks. Eurasip J. Wirel. Commun. Netw., 251408.","key":"ref_27","DOI":"10.1155\/2011\/251408"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/11\/8\/119\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:16:46Z","timestamp":1760195806000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/11\/8\/119"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,6]]},"references-count":27,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2018,8]]}},"alternative-id":["a11080119"],"URL":"https:\/\/doi.org\/10.3390\/a11080119","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2018,8,6]]}}}