{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T20:16:21Z","timestamp":1773087381333,"version":"3.50.1"},"reference-count":22,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,5,1]],"date-time":"2017-05-01T00:00:00Z","timestamp":1493596800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Ad Hoc Networks"],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1016\/j.adhoc.2017.01.006","type":"journal-article","created":{"date-parts":[[2017,1,31]],"date-time":"2017-01-31T19:04:07Z","timestamp":1485889447000},"page":"63-70","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":45,"special_numbering":"C","title":["A maximum flow algorithm based on storage time aggregated graph for delay-tolerant networks"],"prefix":"10.1016","volume":"59","author":[{"given":"Hongyan","family":"Li","sequence":"first","affiliation":[]},{"given":"Tao","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Yangkun","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Kan","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Jiandong","family":"Li","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.adhoc.2017.01.006_bib0001","series-title":"Advances in Delay-Tolerant Networks (DTNs)","first-page":"1","article-title":"An introduction to delay and disruption-tolerant networks","author":"Rodrigues","year":"2015"},{"key":"10.1016\/j.adhoc.2017.01.006_bib0002","series-title":"Proc. ACM SIGCOM, Karlsruhe, Germany","first-page":"27","article-title":"A delay-tolerant network architecture for challenged internets","author":"Fall","year":"2003"},{"key":"10.1016\/j.adhoc.2017.01.006_bib0003","doi-asserted-by":"crossref","first-page":"1980","DOI":"10.1109\/JPROC.2011.2158378","article-title":"Delay and disruption tolerant networking: an alternative solution for future satellite networking applications","volume":"99","author":"Caini","year":"2011","journal-title":"Proc. IEEE"},{"key":"10.1016\/j.adhoc.2017.01.006_bib0004","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/j.adhoc.2014.07.006","article-title":"Routing-aware fair contact plan design for predictable delay tolerant networks","volume":"25, Part B","author":"Fraire","year":"2015","journal-title":"Ad Hoc Netw."},{"key":"10.1016\/j.adhoc.2017.01.006_bib0005","series-title":"Computer Communications Workshops (INFOCOM WKSHPS), Toronto, Canada","first-page":"428","article-title":"Information-centric delay-tolerant mobile ad-hoc networks","author":"Lu","year":"2014"},{"key":"10.1016\/j.adhoc.2017.01.006_bib0006","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.pmcj.2014.01.006","article-title":"On protecting end-to-end location privacy against local eavesdropper in wireless sensor networks","volume":"16, Part A","author":"Chen","year":"2015","journal-title":"Pervasive Mob. Comput."},{"key":"10.1016\/j.adhoc.2017.01.006_bib0007","series-title":"Future Internet of Things and Cloud (FiCloud), Rome, Italy","first-page":"118","article-title":"Coap over bp for a delay-tolerant internet of things","author":"Auzias","year":"2015"},{"key":"10.1016\/j.adhoc.2017.01.006_bib0008","series-title":"Telecommunication Systems, Services, and Applications (TSSA)","first-page":"55","article-title":"Delay tolerant social networking (dtsn): dual architecture for dtn based social networking","author":"Vijayanathan","year":"2011"},{"issue":"3","key":"10.1016\/j.adhoc.2017.01.006_bib0009","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1109\/TMC.2014.2322373","article-title":"Friendbook: a semantic-based friend recommendation system for social networks","volume":"14","author":"Wang","year":"2015","journal-title":"IEEE Trans. Mob. Comput."},{"key":"10.1016\/j.adhoc.2017.01.006_bib0010","series-title":"Flows in Networks","author":"Ford","year":"1962"},{"issue":"8","key":"10.1016\/j.adhoc.2017.01.006_bib0011","doi-asserted-by":"crossref","first-page":"1636","DOI":"10.1109\/49.634801","article-title":"A dynamic routing concept for atm-based satellite personal communication networks","volume":"15","author":"Werner","year":"1997","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"10.1016\/j.adhoc.2017.01.006_bib0012","series-title":"Proc. 10th Annu. Eur. Symp. Algorithms","first-page":"49","article-title":"Time-expanded graphs for flow-dependent transit times","author":"K\u00f6hler","year":"2002"},{"issue":"5","key":"10.1016\/j.adhoc.2017.01.006_bib0013","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/MNET.2004.1337732","article-title":"Building a reference combinatorial model for manets","volume":"18","author":"Ferreira","year":"2004","journal-title":"IEEE Netw."},{"key":"10.1016\/j.adhoc.2017.01.006_bib0014","series-title":"Advances in Spatial and Temporal Databases, Boston","first-page":"460","article-title":"Spatio-temporal network databases and routing algorithms: a summary of results","author":"George","year":"2007"},{"key":"10.1016\/j.adhoc.2017.01.006_bib0015","series-title":"Journal on Data Semantics XI","first-page":"191","article-title":"Time-aggregated graphs for modeling spatio-temporal networks","author":"George","year":"2008"},{"key":"10.1016\/j.adhoc.2017.01.006_bib0016","series-title":"Wireless On-Demand Network Systems and Services","first-page":"27","article-title":"Optimal routing and scheduling for deterministic delay tolerant networks","author":"Hay","year":"2009"},{"key":"10.1016\/j.adhoc.2017.01.006_bib0017","series-title":"INFOCOM, 2011 Proceedings IEEE","first-page":"1494","article-title":"The impact of storage capacity on end-to-end delay in time varying networks","author":"Iosifidis","year":"2011"},{"key":"10.1016\/j.adhoc.2017.01.006_bib0018","series-title":"Global Communications Conference (GLOBECOM)","first-page":"84","article-title":"Primal decomposition and online algorithms for flow optimization in wireless dtns","author":"Konidaris","year":"2013"},{"issue":"4","key":"10.1016\/j.adhoc.2017.01.006_bib0019","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1145\/1030194.1015484","article-title":"Routing in a delay tolerant network","volume":"34","author":"Jain","year":"2004","journal-title":"SIGCOMM Comput. Commun. Rev."},{"key":"10.1016\/j.adhoc.2017.01.006_bib0020","series-title":"Wireless Communications Signal Processing (WCSP)","first-page":"1","article-title":"Agent-based dynamic routing in the packet-switched leo satellite networks","author":"Wu","year":"2015"},{"key":"10.1016\/j.adhoc.2017.01.006_bib0021","series-title":"Vehicular Networking Conference (VNC), 2015 IEEE","first-page":"52","article-title":"Temporal connectivity of vehicular networks: The power of store-carry-and-forward","author":"Glacet","year":"2015"},{"key":"10.1016\/j.adhoc.2017.01.006_bib0022","series-title":"Network Flows: Theory, Algorithms and Application","author":"Ravindra","year":"1993"}],"container-title":["Ad Hoc Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1570870517300240?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1570870517300240?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,9,4]],"date-time":"2018-09-04T18:51:47Z","timestamp":1536087107000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1570870517300240"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5]]},"references-count":22,"alternative-id":["S1570870517300240"],"URL":"https:\/\/doi.org\/10.1016\/j.adhoc.2017.01.006","relation":{},"ISSN":["1570-8705"],"issn-type":[{"value":"1570-8705","type":"print"}],"subject":[],"published":{"date-parts":[[2017,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A maximum flow algorithm based on storage time aggregated graph for delay-tolerant networks","name":"articletitle","label":"Article Title"},{"value":"Ad Hoc Networks","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.adhoc.2017.01.006","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}