{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T03:44:45Z","timestamp":1761709485151,"version":"build-2065373602"},"reference-count":30,"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\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["NO. 71633006"],"award-info":[{"award-number":["NO. 71633006"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"The National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["NO. 616725407"],"award-info":[{"award-number":["NO. 616725407"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"China Postdoctoral Science Foundation funded project","award":["2017M612586"],"award-info":[{"award-number":["2017M612586"]}]},{"name":"The Postdoctoral Science Foundation of Central South University","award":["185684"],"award-info":[{"award-number":["185684"]}]},{"name":"The Fundamental Research Funds for the Central Universities of Central South University","award":["No. 2018zzts615"],"award-info":[{"award-number":["No. 2018zzts615"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Future Internet"],"abstract":"<jats:p>In the social scene of opportunistic networks, message applications find suitable relay nodes or certain transmission destinations from the surrounding neighbors through specific network addresses of users. However, at the dawn of big data and 5G networks, the variational location information of nodes is difficult to be available to mobile devices all the time, and a long wait for the destination may cause severe end-to-end delay. To improve the transmission environment, this study constructs an efficient routing-delivery scheme (Predict and Forward) based on node profile for the opportunistic networks. The node profile effectively characterizes nodes by analyzing and comparing their attributes instead of network addresses, such as physical characteristics, places of residence, workplaces, occupations or hobbies. According to the optimal stopping theory, this algorithm implements the optimal transmission for Prelearn messages by dividing the complex data transmission process into two different phases (Predict and Forward). Through simulations and the comparison of routing algorithms in opportunistic networks, the proposed strategy increases the delivery ratio by 80% with the traditional methods on average, and the average end-to-end delay in this algorithm is the lowest.<\/jats:p>","DOI":"10.3390\/fi10080074","type":"journal-article","created":{"date-parts":[[2018,8,7]],"date-time":"2018-08-07T03:44:18Z","timestamp":1533613458000},"page":"74","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Predict and Forward: An Efficient Routing-Delivery Scheme Based on Node Profile in Opportunistic Networks"],"prefix":"10.3390","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6943-3398","authenticated-orcid":false,"given":"Kanghuai","family":"Liu","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"}]},{"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"}]},{"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"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0818-8776","authenticated-orcid":false,"given":"Yutong","family":"Xiao","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"}]},{"given":"Heng","family":"Zhang","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"}]}],"member":"1968","published-online":{"date-parts":[[2018,8,6]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1547","DOI":"10.1109\/COMST.2017.2782182","article-title":"Simulating Opportunistic Networks: Survey and Future Directions","volume":"20","author":"Dede","year":"2018","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1109\/MCOM.2017.1500527CM","article-title":"A Decade of Research in Opportunistic Networks: Challenges, Relevance, and Future Directions","volume":"55","author":"Trifunovic","year":"2017","journal-title":"IEEE Commun. Mag."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Yao, X., Chen, Y., Zhang, R., Zhang, Y., and Lin, Y. (2018). Beware of What You Share: Inferring User Locations in Venmo. IEEE Internet Things J.","DOI":"10.1109\/JIOT.2018.2844218"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Yao, X., Zhang, R., Zhang, Y., and Lin, Y. (2017, January 1\u20134). Verifiable Social Data Outsourcing. Proceedings of the IEEE INFOCOM 2017 Conference on Computer Communications, Atlanta, GA, USA.","DOI":"10.1109\/INFOCOM.2017.8057005"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"155014771875923","DOI":"10.1177\/1550147718759235","article-title":"Energy and channel transmission management algorithm for resource harvesting body area networks","volume":"14","author":"Chen","year":"2018","journal-title":"Int. J. Distrib. Sens. Netw."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/s12083-016-0526-4","article-title":"Sensor communication area and node extend routing algorithm in opportunistic network","volume":"11","author":"Wu","year":"2018","journal-title":"Peer-to-Peer Netw. Appl."},{"key":"ref_7","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.","DOI":"10.3390\/info8040140"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1016\/j.pmcj.2012.01.002","article-title":"Human-mobility enabled wireless networks for emergency communications during special events","volume":"9","author":"Cacciapuoti","year":"2013","journal-title":"Pervasive Mob. Comput."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1520","DOI":"10.1016\/j.adhoc.2011.07.006","article-title":"Human-mobility enabled networks in urban environments: Is there any (mobile wireless) small world out there?","volume":"10","author":"Cacciapuoti","year":"2012","journal-title":"Ad Hoc Netw."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1109\/TWC.2015.2476466","article-title":"Secure Routing Based on Social Similarity in Opportunistic Networks","volume":"15","author":"Yao","year":"2016","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Baudic, G., Auger, A., Ramiro, V., and Lochin, E. (arXiv, 2016). Using emulation to validate applications on opportunistic networks, arXiv.","DOI":"10.1145\/2979683.2979694"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/j.comnet.2017.10.005","article-title":"Effective information transmission based on socialization nodes in opportunistic networks","volume":"129","author":"Jia","year":"2017","journal-title":"Comput. Netw."},{"key":"ref_13","first-page":"6462826","article-title":"EpSoc: Social-Based Epidemic-Based Routing Protocol in Opportunistic Mobile Social Network","volume":"2018","author":"Lenando","year":"2018","journal-title":"Mob. Infor. Syst."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"10372","DOI":"10.1109\/TVT.2017.2740218","article-title":"Predicting Temporal Social Contact Patterns for Data Forwarding in Opportunistic Mobile Networks","volume":"66","author":"Zhou","year":"2017","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Egami, M., and Kevkhishvili, R. (2018, January 25\u201327). On the Optimal Stopping Problem of Linear Diffusions in Regime-Switching Models. Proceedings of the 30th Asian Finance Association Annual Meeting. Hitotsubashi Hall, Tokyo, Japan.","DOI":"10.2139\/ssrn.3100673"},{"key":"ref_16","first-page":"777","article-title":"Cooperative Store-Carry-Forward Scheme for Intermittently Connected Vehicular Networks","volume":"66","author":"Wang","year":"2017","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.cor.2017.12.004","article-title":"Robust routing in deterministic delay-tolerant networks","volume":"92","author":"Bocquillon","year":"2018","journal-title":"Comput. Oper. Res."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/j.comnet.2017.05.007","article-title":"Explore and wait: A composite routing-delivery scheme for relative profile-casting in opportunistic networks","volume":"123","author":"Borrego","year":"2017","journal-title":"Comput. Netw."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Borah, S.J., Dhurandher, S.K., Tibarewala, S., Woungang, I., and Obaidat, M.S. (2017, January 4\u20138). Energy-Efficient Prophet-PRoWait-EDR Protocols for Opportunistic Networks. Proceedings of the GLOBECOM 2017\u20142017 IEEE Global Communications Conference, Singapore.","DOI":"10.1109\/GLOCOM.2017.8254434"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Spyropoulos, T., Psounis, K., and Raghavendra, C.S. (2005, January 26). Spray and wait: An efficient routing scheme for intermittently connected mobile networks. Proceedings of the ACM Workshop on Delaytolerant Networking, Philadelphia, PA, USA.","DOI":"10.1145\/1080139.1080143"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Yuan, Q., Cardei, I., and Wu, J. (2009, January 18\u201321). Predict and relay: An efficient routing in disruption-tolerant networks. Proceedings of the ACM Interational Symposium on Mobile Ad Hoc NETWORKING and Computing, MOBIHOC 2009, New Orleans, LA, USA.","DOI":"10.1145\/1530748.1530762"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Burgess, J., Gallagher, B., Jensen, D., and Levine, B.N. (2006, January 23\u201329). MaxProp: Routing for vehicle-based disruption-tolerant networks. Proceedings of the 25th IEEE International Conference on Computer Communications (INFOCOM \u201906), Barcelona, Spain.","DOI":"10.1109\/INFOCOM.2006.228"},{"key":"ref_23","unstructured":"Wu, J., Chen, Z., and Zhao, M. (2018). Information cache management and data transmission algorithm in opportunistic social networks. Wirel. Netw., 1\u201312."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Leguay, J., Lopez-Ramos, M., Jean-Marie, K., and Conan, V. (2008, January 14\u201317). An efficient service oriented architecture for heterogeneous and dynamic wireless sensor networks. Proceedings of the 33rd IEEE Conference on Local Computer Networks (LCN), Montreal, QC, Canada.","DOI":"10.1109\/LCN.2008.4664275"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Leguay, J., Friedman, T., and Conan, V. (2005, January 26). DTN routing in a mobility pattern space. Proceedings of the ACM SIGCOMM Workshop on Delay-Tolerant Networking (WDTN\u201905), Philadelphia, PA, USA.","DOI":"10.1145\/1080139.1080146"},{"key":"ref_26","first-page":"1459","article-title":"Opportunistic Networks Routing Algorithm with Contact Probability and Data Packet Freshness Perception","volume":"38","author":"Peng","year":"2017","journal-title":"J. Chin. Comput. Syst."},{"key":"ref_27","first-page":"1","article-title":"Improved epidemic algorithm based on trust mechanism in opportunistic networks. In Chinese","volume":"3","author":"Zhang","year":"2017","journal-title":"J. Netw. Inf. Secur."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"1557","DOI":"10.1016\/j.adhoc.2011.05.007","article-title":"Context information prediction for social-based routing in opportunistic networks","volume":"10","author":"Nguyen","year":"2012","journal-title":"Ad Hoc Netw."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Wang, X., Wang, X., Zhang, L., Lin, Y., and Zhao, R. (2017). A Routing Algorithm Based on the Prediction of Node Meeting Location in Opportunistic Networks, Springer.","DOI":"10.1007\/978-981-10-8123-1_25"},{"key":"ref_30","unstructured":"Jinie, P., and Song, Y.T. (2016, January 11\u201314). Health Capability Maturity Model: Person-centered approach in Personal Health Record System. Proceedings of the Americas Conference on Information Systems, San Diego, CA, USA."}],"container-title":["Future Internet"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-5903\/10\/8\/74\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:16:53Z","timestamp":1760195813000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-5903\/10\/8\/74"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,6]]},"references-count":30,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2018,8]]}},"alternative-id":["fi10080074"],"URL":"https:\/\/doi.org\/10.3390\/fi10080074","relation":{},"ISSN":["1999-5903"],"issn-type":[{"type":"electronic","value":"1999-5903"}],"subject":[],"published":{"date-parts":[[2018,8,6]]}}}