{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T12:06:13Z","timestamp":1757592373667,"version":"3.41.2"},"reference-count":39,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2021,3,3]],"date-time":"2021-03-03T00:00:00Z","timestamp":1614729600000},"content-version":"vor","delay-in-days":61,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004763","name":"Natural Science Foundation of Inner Mongolia Autonomous Region","doi-asserted-by":"publisher","award":["2019MS06031"],"award-info":[{"award-number":["2019MS06031"]}],"id":[{"id":"10.13039\/501100004763","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61662054","61841109","62061036"],"award-info":[{"award-number":["61662054","61841109","62061036"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Wireless Communications and Mobile Computing"],"published-print":{"date-parts":[[2021,1]]},"abstract":"<jats:p>Opportunistic networks are becoming more and more important in the Internet of Things. The opportunistic network routing algorithm is a very important algorithm, especially based on the historical encounters of the nodes. Such an algorithm can improve message delivery quality in scenarios where nodes meet regularly. At present, many kinds of opportunistic network routing algorithms based on historical message have been provided. According to the encounter information of the nodes in the last time slice, the routing algorithms predict probability that nodes will meet in the subsequent time slice. However, if opportunistic network is constructed in remote rural and pastoral areas with few nodes, there are few encounters in the network. Then, due to the inability to obtain sufficient encounter information, the existing routing algorithms cannot accurately predict whether there are encounters between nodes in subsequent time slices. For the purpose of improving the accuracy in the environment of sparse opportunistic networks, a prediction model based on nodes intimacy is proposed. And opportunistic network routing algorithm is designed. The experimental results show that the ONBTM model effectively improves the delivery quality of messages in sparse opportunistic networks and reduces network resources consumed during message delivery.<\/jats:p>","DOI":"10.1155\/2021\/6666211","type":"journal-article","created":{"date-parts":[[2021,3,3]],"date-time":"2021-03-03T20:20:25Z","timestamp":1614802825000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Routing Algorithm for the Sparse Opportunistic Networks Based on Node Intimacy"],"prefix":"10.1155","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1071-6577","authenticated-orcid":false,"given":"Gang","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinyue","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1498-2191","authenticated-orcid":false,"given":"Na","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2529-7712","authenticated-orcid":false,"given":"Zhifei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lin","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liqiang","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2021,3,3]]},"reference":[{"key":"e_1_2_10_1_2","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2006.248176"},{"key":"e_1_2_10_2_2","doi-asserted-by":"crossref","unstructured":"Ker\u00e4nenA. OttJ. andK\u00e4rkk\u00e4inenT. The ONE simulator for DTN protocol evaluation International Conference on Simulation Tools & Techniques 2009 Rome Italy 2\u20136.","DOI":"10.4108\/ICST.SIMUTOOLS2009.5674"},{"key":"e_1_2_10_3_2","doi-asserted-by":"crossref","unstructured":"JuangP. OkiH. WangY. andMartonosiM. Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet 37 ACM SIGPLAN Notices 2002 San Jose California 96\u2013107 https:\/\/doi.org\/10.1145\/605432.605408.","DOI":"10.1145\/605432.605408"},{"key":"e_1_2_10_4_2","doi-asserted-by":"crossref","unstructured":"HullB. BychkovskyV. ZhangY. andChenK. CarTel: a distributed mobile sensor computing system Proceedings of the 4th international conference on Embedded networked sensor systems 2006 Boulder Colorado USA 125\u2013138.","DOI":"10.1145\/1182807.1182821"},{"key":"e_1_2_10_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/2333112.2333118"},{"key":"e_1_2_10_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2010.246"},{"key":"e_1_2_10_7_2","first-page":"600","article-title":"Research progress on routing problem in mobile opportunistic networks","volume":"26","author":"Ma H. D.","year":"2015","journal-title":"Journal of Software"},{"key":"e_1_2_10_8_2","doi-asserted-by":"crossref","unstructured":"VahdatA.andBeckerD. Epidemic Routing for Partially Connected Ad Hoc Networks Handbook of Systemic Autoimmune Diseases 2000 Elsevier https:\/\/doi.org\/10.1145\/1341771.1341791 2-s2.0-77953067706.","DOI":"10.1145\/1341771.1341791"},{"key":"e_1_2_10_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/S1570-8705ss3)00003-9"},{"key":"e_1_2_10_10_2","doi-asserted-by":"crossref","unstructured":"ZhaoW. AmmarM. andZeguraE. A message ferrying approach for data delivery in sparse mobile ad hoc networks Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing 2004 Roppongi Hills Tokyo Japan 187\u2013198.","DOI":"10.1145\/989459.989483"},{"key":"e_1_2_10_11_2","doi-asserted-by":"crossref","unstructured":"YuanP.andMaH. Hug: Human gathering point based routing for opportunistic networks IEEE Wireless Communications and Networking Conference (WCNC) 2012 Roppongi Hills Tokyo Japan 3024\u20133029.","DOI":"10.1109\/WCNC.2012.6214323"},{"key":"e_1_2_10_12_2","doi-asserted-by":"crossref","unstructured":"WuJ. XiaoM. andHuangL. Homing spread: community home-based multi-copy routing in mobile social networks Proceedings IEEE Infocom 2013 Turin Italy 2319\u20132327.","DOI":"10.1109\/INFCOM.2013.6567036"},{"key":"e_1_2_10_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2011.05.005"},{"key":"e_1_2_10_14_2","doi-asserted-by":"crossref","unstructured":"XiaoM. WuJ. LiuC. andHuangL. TOUR: time-sensitive opportunistic utility-based routing in delay tolerant networks 2013 Proceedings IEEE Infocom 2013 Las Vegas Nevada USA 2085\u20132091.","DOI":"10.1109\/INFCOM.2013.6567010"},{"key":"e_1_2_10_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2012.08.019"},{"key":"e_1_2_10_16_2","doi-asserted-by":"crossref","unstructured":"ZhaoD. MaH. YuanP. andLiuL. Differentiated probabilistic forwarding for extending the lifetime of opportunistic networks Wireless Communications and Networking Conference (WCNC) 2012 Paris France 3002\u20133007.","DOI":"10.1109\/WCNC.2012.6214318"},{"key":"e_1_2_10_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2012.83"},{"key":"e_1_2_10_18_2","doi-asserted-by":"crossref","unstructured":"GaoW.andCaoG. On exploiting transient contact patterns for data forwarding in delay tolerant networks The 18th IEEE International Conference on Network Protocols 2010 Kyoto Japan 193\u2013202.","DOI":"10.1109\/ICNP.2010.5762768"},{"key":"e_1_2_10_19_2","doi-asserted-by":"crossref","unstructured":"TieX. VenkataramaniA. andBalasubramanianA. R3: robust replication routing in wireless networks with diverse connectivity characteristics Proceedings of the 17th annual international conference on Mobile computing and networking 2011 Las Vegas Nevada USA 181\u2013192.","DOI":"10.1145\/2030613.2030634"},{"key":"e_1_2_10_20_2","doi-asserted-by":"crossref","unstructured":"GunawardenaD. KaragiannisT. ProutiereA. NetoE. S. andVojnovicM. Scoop: decentralized and opportunistic multicasting of information streams Proceedings of the 17th Annual International Conference on Mobile Computing and Networking 2011 Las Vegas Nevada USA 169\u2013180.","DOI":"10.1145\/2030613.2030633"},{"key":"e_1_2_10_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2011.2179072"},{"key":"e_1_2_10_22_2","doi-asserted-by":"publisher","DOI":"10.32604\/cmc.2020.07723"},{"key":"e_1_2_10_23_2","doi-asserted-by":"publisher","DOI":"10.32604\/cmc.2020.06258"},{"key":"e_1_2_10_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/3383582"},{"key":"e_1_2_10_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2018.08.031"},{"key":"e_1_2_10_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/3041025"},{"key":"e_1_2_10_27_2","doi-asserted-by":"crossref","unstructured":"SaidiH. GreteteD. andAdnaneA. Opportunistic routing in wireless sensors networks ICCWCS\u201917 Proceedings of the 2nd International Conference on Computing and Wireless Communication Systems 2018 Larache Morocco 1\u20135.","DOI":"10.1145\/3167486.3167558"},{"key":"e_1_2_10_28_2","doi-asserted-by":"crossref","unstructured":"KosmidesP.andLambrinosL. Intelligent routing in mobile opportunistic networks 2018 Global Information Infrastructure and Networking Symposium (GIIS) 2018 Greece Thessaloniki 1\u20134.","DOI":"10.1109\/GIIS.2018.8635592"},{"key":"e_1_2_10_29_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2018.12.001"},{"key":"e_1_2_10_30_2","doi-asserted-by":"publisher","DOI":"10.1007\/s12652-018-0697-3"},{"key":"e_1_2_10_31_2","doi-asserted-by":"crossref","unstructured":"GuptaA. BansalA. NaryaniD. andSharmaD. K. CRPO: cognitive routing protocol for opportunistic networks Proceedings of the International Conference on High Performance Compilation Computing and Communications 2017 Kuala Lumpur Malaysia 121\u2013125.","DOI":"10.1145\/3069593.3069610"},{"key":"e_1_2_10_32_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2019.02.003"},{"key":"e_1_2_10_33_2","doi-asserted-by":"crossref","unstructured":"AschenbruckN. D\u00f6ringH. HeidenC. andSchwambornM. Stationarity for the small world in motion mobility model Proceedings of the 22nd International ACM Conference on Modeling Analysis and Simulation of Wireless and Mobile Systems 2019 Miami Beach FL USA 13\u201317.","DOI":"10.1145\/3345768.3355935"},{"key":"e_1_2_10_34_2","doi-asserted-by":"crossref","unstructured":"DuP. YooS. ZhaoQ. ChenM. andGerlaM. Towards opportunistic resource sharing in mobile social networks: an evolutionary game theoretic approach Eighteenth ACM International Symposium 2018 Los Angeles CA USA 308\u2013309.","DOI":"10.1145\/3209582.3225201"},{"key":"e_1_2_10_35_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-019-02241-x"},{"key":"e_1_2_10_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCCN.2020.3002253"},{"key":"e_1_2_10_37_2","doi-asserted-by":"publisher","DOI":"10.1007\/s12652-018-0819-y"},{"key":"e_1_2_10_38_2","doi-asserted-by":"publisher","DOI":"10.32604\/cmc.2020.010793"},{"key":"e_1_2_10_39_2","doi-asserted-by":"publisher","DOI":"10.32604\/cmc.2019.03760"}],"container-title":["Wireless Communications and Mobile Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2021\/6666211.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2021\/6666211.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2021\/6666211","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T12:12:52Z","timestamp":1723032772000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2021\/6666211"}},"subtitle":[],"editor":[{"given":"Zhili","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["10.1155\/2021\/6666211"],"URL":"https:\/\/doi.org\/10.1155\/2021\/6666211","archive":["Portico"],"relation":{},"ISSN":["1530-8669","1530-8677"],"issn-type":[{"type":"print","value":"1530-8669"},{"type":"electronic","value":"1530-8677"}],"subject":[],"published":{"date-parts":[[2021,1]]},"assertion":[{"value":"2020-12-24","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-02-12","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-03-03","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"6666211"}}