{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T04:02:56Z","timestamp":1746158576960,"version":"3.40.4"},"reference-count":37,"publisher":"Wiley","issue":"13","license":[{"start":{"date-parts":[[2013,12,9]],"date-time":"2013-12-09T00:00:00Z","timestamp":1386547200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"funder":[{"DOI":"10.13039\/100008963","name":"Guangdong University of Petrochemical Technology","doi-asserted-by":"crossref","award":["No.2012RC0106"],"award-info":[{"award-number":["No.2012RC0106"]}],"id":[{"id":"10.13039\/100008963","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Wireless Communications"],"published-print":{"date-parts":[[2015,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>With their proliferation and increasing capabilities, mobile devices with local wireless interfaces can be organized into delay\u2010tolerant networks (DTNs) that exploit communication opportunities arising out of the movement of their users. As the mobile devices are usually carried by people, these DTNs can also be viewed as social networks. Unfortunately, most existing routing algorithms for DTNs rely on relatively simple mobility models that rarely consider these social network characteristics, and therefore, the mobility models in these algorithms cannot accurately describe users\u2019 real mobility traces. In this paper, we propose two predict and spread (PreS) message routing algorithms for DTNs. We employ an adapted Markov chain to model a node's mobility pattern and capture its social characteristics. A comparison with state\u2010of\u2010the\u2010art algorithms demonstrates that PreS can yield better performance in terms of delivery ratio and delivery latency, and it can provide a comparable performance with the epidemic routing algorithm with lower resource consumption. Copyright \u00a9 2013 John Wiley &amp; Sons, Ltd.<\/jats:p>","DOI":"10.1002\/wcm.2454","type":"journal-article","created":{"date-parts":[[2013,12,10]],"date-time":"2013-12-10T03:08:40Z","timestamp":1386644920000},"page":"1695-1710","source":"Crossref","is-referenced-by-count":2,"title":["A venues\u2010aware message routing scheme for delay\u2010tolerant networks"],"prefix":"10.1002","volume":"15","author":[{"given":"Jianwei","family":"Niu","sequence":"first","affiliation":[{"name":"State Key Laboratory of Software Development Environment Beihang University Beijing 100191 China"}]},{"given":"Mingzhu","family":"Liu","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Software Development Environment Beihang University Beijing 100191 China"}]},{"given":"Yazhi","family":"Liu","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 China"}]},{"given":"Lei","family":"Shu","sequence":"additional","affiliation":[{"name":"Guangdong Petrochemical Equipment Fault Diagnosis Key Laboratory Guangdong University of Petrochemical Technology Maoming 525000 China"}]},{"given":"Dapeng","family":"Wu","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering University of Florida Gainesville FL U.S.A."}]}],"member":"311","published-online":{"date-parts":[[2013,12,9]]},"reference":[{"key":"e_1_2_8_2_1","doi-asserted-by":"publisher","DOI":"10.3724\/SP.J.1001.2009.00124"},{"key":"e_1_2_8_3_1","unstructured":"FallK.A delay\u2010tolerant network architecture for challenged internets InProceedings of the Annual Conference of the Special Interest Group on Data Communication (Sigcomm): Karlsruhe Germany ACM 2003;27\u201334."},{"key":"e_1_2_8_4_1","doi-asserted-by":"crossref","unstructured":"JuangP OkiH WangY MartonosiM PehLS RubensteinD.Energy\u2010efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet InProceedings of the 10th Architectural Support for Programming Languages and Operating Systems (ASPLOS): San Jose CA ACM 2002;96\u2013107.","DOI":"10.1145\/605397.605408"},{"key":"e_1_2_8_5_1","doi-asserted-by":"crossref","unstructured":"PanH ChaintreauA ScottJ.Pocket switched networks and human mobility in conference environments InProceedings of the 2005 ACM SIGCOMM Workshop on Delay Tolerant Networking: Philadelphia 2005;244\u2013251.","DOI":"10.1145\/1080139.1080142"},{"key":"e_1_2_8_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(03)00345-1"},{"key":"e_1_2_8_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2006.323440"},{"key":"e_1_2_8_8_1","unstructured":"VahdatA BeckerD.Epidemic routing for partially connected ad hoc networks. Technical Report CS\u2010200006 Duke University 2000.http:\/\/www.cs.ucsd.edu\/\u223cvahdat\/papers\/epidemic.pdf."},{"key":"e_1_2_8_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/961268.961272"},{"key":"e_1_2_8_10_1","unstructured":"SpyropoulosT PsounisK RaghavendraCS.Spray and focus: efficient mobility\u2010assisted routing for heterogeneous and correlated mobility InProceedings of the 5th International Conference on Pervasive Computing and Communications Workshops IEEE: New York 2009;79\u201385."},{"key":"e_1_2_8_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2009.2036365"},{"key":"e_1_2_8_12_1","doi-asserted-by":"crossref","unstructured":"LiuC WuJ.Routing in a cyclic mobispace InProceedings of the 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) ACM: Hong Kong China 2008;351\u2013360.","DOI":"10.1145\/1374618.1374665"},{"key":"e_1_2_8_13_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1177170"},{"key":"e_1_2_8_14_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature06958"},{"key":"e_1_2_8_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2011.140"},{"key":"e_1_2_8_16_1","doi-asserted-by":"crossref","unstructured":"SpyropoulosT PsounisK RaghavendraCS.Spray and wait: an efficient routing scheme for intermittently connected mobile networks InProceedings of the 2005 ACM SIGCOMM Workshop on Delay Tolerant Networking ACM: Philadelphia 2005;252\u2013259.","DOI":"10.1145\/1080139.1080143"},{"key":"e_1_2_8_17_1","doi-asserted-by":"crossref","unstructured":"VojnovicM ProutiereA.Hop limited flooding over dynamic networks InINFOCOM 2011 Proceedings IEEE Shanghai China 2011;685\u2013693.","DOI":"10.1109\/INFCOM.2011.5935249"},{"key":"e_1_2_8_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.897964"},{"key":"e_1_2_8_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2008.172"},{"key":"e_1_2_8_20_1","first-page":"1","article-title":"Improving the dominating\u2010set routing over delay\u2010tolerant mobile ad\u2010hoc networks via estimating node intermeeting times","volume":"402989","author":"Samuel H","year":"2011","journal-title":"EURASIP Journal on Wireless Communications and Networking"},{"key":"e_1_2_8_21_1","doi-asserted-by":"crossref","unstructured":"NelsonSC BakhtM KravetsR.Encounter based routing in DTNs InProceedings of the INFOCOM Rio de Janeiro Brazil 2009;846\u2013854.","DOI":"10.1109\/INFCOM.2009.5061994"},{"key":"e_1_2_8_22_1","doi-asserted-by":"publisher","DOI":"10.1186\/1687-1499-2011-195"},{"issue":"2","key":"e_1_2_8_23_1","first-page":"66","article-title":"A novel delay\u2010and reliability\u2010aware inter\u2010vehicle routing protocol","volume":"2","author":"Bakar KA","year":"2010","journal-title":"Network Protocols and Algorithms"},{"key":"e_1_2_8_24_1","doi-asserted-by":"crossref","unstructured":"BurgessJ GallagherB JensenD LevineB.Maxprop: routing for vehicle\u2010based disruption\u2010tolerant networks Proceedings IEEE Infocom Barcelona Spain 2006;1\u201311.","DOI":"10.1109\/INFOCOM.2006.228"},{"key":"e_1_2_8_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2005.10.003"},{"key":"e_1_2_8_26_1","doi-asserted-by":"crossref","unstructured":"YoonJ NobleBD LiuM KimM.Building realistic mobility models from coarse\u2010grained traces InProceedings of the 4th International Conference on Mobile Systems Applications and Services (MOBISYS) ACM: Uppsala Sweden 2006;177\u2013193.","DOI":"10.1145\/1134680.1134699"},{"key":"e_1_2_8_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2010.246"},{"key":"e_1_2_8_28_1","article-title":"Evaluating mobility pattern space routing for DTNs","volume":"0511102","author":"Leguay J","year":"2005","journal-title":"CoRR"},{"key":"e_1_2_8_29_1","doi-asserted-by":"crossref","unstructured":"MtibaaA MayM DiotC AmmarM.Peoplerank: social opportunistic forwarding INFOCOM 2010 Proceedings IEEE IEEE 2010;1\u20135.","DOI":"10.1109\/INFCOM.2010.5462261"},{"key":"e_1_2_8_30_1","doi-asserted-by":"publisher","DOI":"10.1155\/2011\/251408"},{"key":"e_1_2_8_31_1","doi-asserted-by":"crossref","unstructured":"HuiP CrowcroftJ.How small labels create big improvements InProceedings of the 5th Annual International Conference on Pervasive Computing and Communications Workshops IEEE 2007March;65\u201370.","DOI":"10.1109\/PERCOMW.2007.55"},{"key":"e_1_2_8_32_1","doi-asserted-by":"publisher","DOI":"10.1002\/wcm.72"},{"key":"e_1_2_8_33_1","doi-asserted-by":"crossref","unstructured":"BrochJ MaltzDA JohnsonDB HuYC JetchevaJ.A performance comparison of multi\u2010hop wireless ad hoc network routing protocols InProceedings the 4th Annual ACM\/IEEE International Conference on Mobile Computing and Networking(MobiCom) ACM 1998Oct;85\u201397.","DOI":"10.1145\/288235.288256"},{"key":"e_1_2_8_34_1","doi-asserted-by":"crossref","unstructured":"Ker\u00e4nenA OttJ K\u00e4rkk\u00e4inenT.The ONE simulator for DTN protocol evaluation InProceedings of the 2nd International Conference on Simulation Tools and Techniques (simutools) ICST (Institute for Computer Sciences Social\u2010Informatics and Telecommunications Engineering): Rome Italy 2009;55\u201364.","DOI":"10.4108\/ICST.SIMUTOOLS2009.5674"},{"key":"e_1_2_8_35_1","unstructured":"HendersonT KotzD AbyzovI YeoJ.CRAWDAD trace set dartmouth\/campus\/movement (v. 2005\u201003\u201008)."},{"key":"e_1_2_8_36_1","unstructured":"HsuW HelmyA.CRAWDAD trace usc\/mobilib\/association\/summer_duration_log (v. 2007\u201001\u201008)."},{"key":"e_1_2_8_37_1","unstructured":"HossmannT SpyropoulosT LegendreF.Social network analysis of human mobility and implications for DTN performance analysis and mobility modeling.Technical Report Computer Engineering and Networks Laboratory ETH Zurich 2010; 323 http:\/\/people.ee.ethz.ch\/~hossmath\/papers\/tikreport.pdf."},{"key":"e_1_2_8_38_1","doi-asserted-by":"crossref","unstructured":"HossmannT SpyropoulosT LegendreF.A complex network analysis of human mobility InComputer communications workshops (INFOCOM WKSHPS) 2011 IEEE conference on Shanghai China 2011;876\u2013881.","DOI":"10.1109\/INFCOMW.2011.5928936"}],"container-title":["Wireless Communications and Mobile Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fwcm.2454","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/wcm.2454","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T03:51:07Z","timestamp":1746071467000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/wcm.2454"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,9]]},"references-count":37,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["10.1002\/wcm.2454"],"URL":"https:\/\/doi.org\/10.1002\/wcm.2454","archive":["Portico"],"relation":{},"ISSN":["1530-8669","1530-8677"],"issn-type":[{"type":"print","value":"1530-8669"},{"type":"electronic","value":"1530-8677"}],"subject":[],"published":{"date-parts":[[2013,12,9]]}}}