{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T13:36:53Z","timestamp":1761917813827,"version":"3.37.3"},"reference-count":24,"publisher":"SAGE Publications","issue":"10","license":[{"start":{"date-parts":[[2014,10,1]],"date-time":"2014-10-01T00:00:00Z","timestamp":1412121600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"funder":[{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"crossref","award":["ZR2013FQ022","J14LN85","12-1-4-2-(14)-jch"],"award-info":[{"award-number":["ZR2013FQ022","J14LN85","12-1-4-2-(14)-jch"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Science and Technology Plan Project for Colleges and Universities of Shandong Province","award":["ZR2013FQ022","J14LN85","12-1-4-2-(14)-jch"],"award-info":[{"award-number":["ZR2013FQ022","J14LN85","12-1-4-2-(14)-jch"]}]},{"name":"oundation Research Project of Qingdao Science and Technology","award":["ZR2013FQ022","J14LN85","12-1-4-2-(14)-jch"],"award-info":[{"award-number":["ZR2013FQ022","J14LN85","12-1-4-2-(14)-jch"]}]}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Distributed Sensor Networks"],"published-print":{"date-parts":[[2014,10,1]]},"abstract":"<jats:p> The nonexistence of end-to-end path between the sender and the receiver poses great challenges to the successful message transmission in delay tolerant networks. Probabilistic routing provides an efficient scheme to route messages, but most existing probabilistic routing protocols do not consider whether a message has enough time-to-live to reach its destination. In this paper, we propose an improved probabilistic routing algorithm that fully takes into account message's time-to-live when predicting the delivery probability. Based on statistical analysis, we compute and update the expected intermeeting times between nodes. And then the probability for a message to be delivered within its time-to-live is computed based on the assumed exponential distribution. We further propose an optimal message schedule policy, by modeling the buffer management problem as 0-1 knapsack, of which the maximum delivery probability sum can be achieved by resorting to the back track technique. Extensive simulations are conducted and the results show that the proposed algorithm can greatly enhance routing performance in terms of message delivery probability, overhead ratio, and average hop count. <\/jats:p>","DOI":"10.1155\/2014\/623193","type":"journal-article","created":{"date-parts":[[2014,10,15]],"date-time":"2014-10-15T21:09:36Z","timestamp":1413407376000},"page":"623193","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":2,"title":["A Statistical Analysis Based Probabilistic Routing for Resource-Constrained Delay Tolerant Networks"],"prefix":"10.1177","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6821-6858","authenticated-orcid":false,"given":"Jixing","family":"Xu","sequence":"first","affiliation":[{"name":"Information Engineering College of Qingdao University, Ningxia Road 308, Qingdao, Shandong 266071, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8773-0123","authenticated-orcid":false,"given":"Jianbo","family":"Li","sequence":"additional","affiliation":[{"name":"Information Engineering College of Qingdao University, Ningxia Road 308, Qingdao, Shandong 266071, China"}]},{"given":"Shan","family":"Jiang","sequence":"additional","affiliation":[{"name":"Information Engineering College of Qingdao University, Ningxia Road 308, Qingdao, Shandong 266071, China"}]},{"given":"Chenqu","family":"Dai","sequence":"additional","affiliation":[{"name":"Information Engineering College of Qingdao University, Ningxia Road 308, Qingdao, Shandong 266071, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4741-0715","authenticated-orcid":false,"given":"Lei","family":"You","sequence":"additional","affiliation":[{"name":"Information Engineering College of Qingdao University, Ningxia Road 308, Qingdao, Shandong 266071, China"}]}],"member":"179","published-online":{"date-parts":[[2014,10,15]]},"reference":[{"key":"B1-2014-623193","doi-asserted-by":"publisher","DOI":"10.1145\/1347364.1347372"},{"key":"B2-2014-623193","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2012.11.012"},{"key":"B3-2014-623193","doi-asserted-by":"publisher","DOI":"10.1016\/j.inffus.2011.11.003"},{"key":"B4-2014-623193","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298330"},{"key":"B5-2014-623193","doi-asserted-by":"publisher","DOI":"10.1145\/1080139.1080142"},{"key":"B6-2014-623193","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2011.2169033"},{"key":"B7-2014-623193","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2012.060912.00108"},{"key":"B8-2014-623193","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2005.1577751"},{"key":"B9-2014-623193","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2008.080609"},{"issue":"1","key":"B10-2014-623193","first-page":"161","volume":"36","author":"Fan X.-M.","year":"2008","journal-title":"Acta Electronica Sinica"},{"key":"B11-2014-623193","doi-asserted-by":"publisher","DOI":"10.1145\/961268.961272"},{"key":"B12-2014-623193","doi-asserted-by":"publisher","DOI":"10.1145\/1064212.1064280"},{"volume-title":"Proceedings of the 7th ACM\/IEEE International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc \u201906)","author":"Spyropoulos T.","key":"B13-2014-623193"},{"volume-title":"Reversible Markov Chains and Random Walks on Graphs","year":"2002","author":"Aldous D.","key":"B14-2014-623193"},{"key":"B15-2014-623193","doi-asserted-by":"publisher","DOI":"10.1145\/1080139.1080144"},{"key":"B16-2014-623193","doi-asserted-by":"publisher","DOI":"10.1145\/1287853.1287875"},{"first-page":"1","volume-title":"Proceeding of the 2nd International Conference on Simulation Tools and Techniques","author":"Keranen A.","key":"B17-2014-623193"},{"key":"B18-2014-623193","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2006.11.028"},{"volume-title":"Proceedings of the International Conference on Future Internet Technologies (CFI \u201908)","author":"Dohyung K.","key":"B19-2014-623193"},{"key":"B20-2014-623193","doi-asserted-by":"publisher","DOI":"10.1109\/JCSSE.2013.6567330"},{"key":"B21-2014-623193","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2012.2237046"},{"key":"B22-2014-623193","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2012.12.001"},{"key":"B23-2014-623193","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.55"},{"key":"B24-2014-623193","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2010.5683082"}],"container-title":["International Journal of Distributed Sensor Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/journals.sagepub.com\/doi\/pdf\/10.1155\/2014\/623193","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/journals.sagepub.com\/doi\/full-xml\/10.1155\/2014\/623193","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/journals.sagepub.com\/doi\/pdf\/10.1155\/2014\/623193","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,6]],"date-time":"2021-05-06T09:40:36Z","timestamp":1620294036000},"score":1,"resource":{"primary":{"URL":"http:\/\/journals.sagepub.com\/doi\/10.1155\/2014\/623193"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,1]]},"references-count":24,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2014,10,1]]}},"alternative-id":["10.1155\/2014\/623193"],"URL":"https:\/\/doi.org\/10.1155\/2014\/623193","relation":{},"ISSN":["1550-1477","1550-1477"],"issn-type":[{"type":"print","value":"1550-1477"},{"type":"electronic","value":"1550-1477"}],"subject":[],"published":{"date-parts":[[2014,10,1]]}}}