乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:44:49Z","timestamp":1720201489685},"reference-count":29,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2013,10,1]],"date-time":"2013-10-01T00:00:00Z","timestamp":1380585600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2017,12,21]],"date-time":"2017-12-21T00:00:00Z","timestamp":1513814400000},"content-version":"vor","delay-in-days":1542,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1016\/j.tcs.2013.01.025","type":"journal-article","created":{"date-parts":[[2013,2,8]],"date-time":"2013-02-08T21:05:19Z","timestamp":1360357519000},"page":"113-121","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["Efficient routing in carrier-based mobile networks"],"prefix":"10.1016","volume":"509","author":[{"given":"Bro\u0148a","family":"Brejov\u00e1","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Dobrev","sequence":"additional","affiliation":[]},{"given":"Rastislav","family":"Kr\u00e1lovi\u010d","sequence":"additional","affiliation":[]},{"given":"Tom\u00e1\u0161","family":"Vina\u0159","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2013.01.025_br000005","series-title":"ICALP (1)","first-page":"121","article-title":"How to explore a fast-changing world (cover time of a simple random walk on evolving graphs)","volume":"vol. 5125","author":"Avin","year":"2008"},{"issue":"1","key":"10.1016\/j.tcs.2013.01.025_br000010","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1145\/972374.972387","article-title":"Opportunistic routing in multi-hop wireless networks","volume":"34","author":"Biswas","year":"2004","journal-title":"Comput. Commun. Rev."},{"issue":"11","key":"10.1016\/j.tcs.2013.01.025_br000015","doi-asserted-by":"crossref","first-page":"1882","DOI":"10.1175\/1520-0426(2001)018<1882:APESUI>2.0.CO;2","article-title":"Autonomous pinniped environmental samplers: Using instrumented animals as oceanographic data collectors","volume":"18","author":"Boehlert","year":"2001","journal-title":"J. Atmos. Ocean. Technol."},{"key":"10.1016\/j.tcs.2013.01.025_br000020","series-title":"INFOCOM","article-title":"Maxprop: Routing for vehicle-based disruption-tolerant networks","author":"Burgess","year":"2006"},{"key":"10.1016\/j.tcs.2013.01.025_br000025","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1109\/MCOM.2003.1204759","article-title":"Delay-tolerant networking: an approach to interplanetary internet","volume":"41","author":"Burleigh","year":"2003","journal-title":"IEEE Commun. Mag."},{"key":"10.1016\/j.tcs.2013.01.025_br000030","article-title":"Time-varying graphs and dynamic networks","author":"Casteigts","year":"2010","journal-title":"CoRR"},{"key":"10.1016\/j.tcs.2013.01.025_br000035","series-title":"Ad-hoc, Mobile, and Wireless Networks (ADHOC-NOW)","first-page":"346","article-title":"Time-varying graphs and dynamic networks","volume":"vol. 6811","author":"Casteigts","year":"2011"},{"issue":"6","key":"10.1016\/j.tcs.2013.01.025_br000040","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1109\/TMC.2007.1060","article-title":"Impact of human mobility on opportunistic forwarding algorithms","volume":"6","author":"Chaintreau","year":"2007","journal-title":"IEEE Trans. Mob. Comput."},{"key":"10.1016\/j.tcs.2013.01.025_br000045","series-title":"Mobile Ad Hoc Networking & Computing (MobiHoc)","first-page":"247","article-title":"Ad hoc relay wireless networks over moving vehicles on highways","author":"Chen","year":"2001"},{"key":"10.1016\/j.tcs.2013.01.025_br000050","series-title":"ICALP (2)","first-page":"490","article-title":"Modelling mobility: A discrete revolution","volume":"vol. 6199","author":"Clementi","year":"2010"},{"key":"10.1016\/j.tcs.2013.01.025_br000055","series-title":"Open Collaborative Design for Sustainable Innovation","article-title":"Providing connectivity to the Saami nomadic community","author":"Doria","year":"2002"},{"issue":"5","key":"10.1016\/j.tcs.2013.01.025_br000060","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.tcs.2013.01.025_br000065","series-title":"ISAAC","first-page":"534","article-title":"Exploration of periodically varying graphs","volume":"vol. 5878","author":"Flocchini","year":"2009"},{"key":"10.1016\/j.tcs.2013.01.025_br000070","series-title":"SIGCOMM","first-page":"145","article-title":"Routing in a delay tolerant network","author":"Jain","year":"2004"},{"key":"10.1016\/j.tcs.2013.01.025_br000075","series-title":"ASPLOS","first-page":"96","article-title":"Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with zebranet","author":"Juang","year":"2002"},{"key":"10.1016\/j.tcs.2013.01.025_br000080","series-title":"Symposium on Theory of Computing (STOC)","first-page":"504","article-title":"Connectivity and inference problems for temporal networks","author":"Kempe","year":"2000"},{"key":"10.1016\/j.tcs.2013.01.025_br000085","series-title":"ACM Symposium on Theory of Computing (STOC)","first-page":"513","article-title":"Distributed computation in dynamic networks","author":"Kuhn","year":"2010"},{"key":"10.1016\/j.tcs.2013.01.025_br000090","series-title":"ACM SIGCOMM Workshop on Delay-Tolerant Networking (WDTN)","first-page":"276","article-title":"DTN routing in a mobility pattern space","author":"Leguay","year":"2005"},{"issue":"1","key":"10.1016\/j.tcs.2013.01.025_br000095","doi-asserted-by":"crossref","DOI":"10.1145\/1217299.1217301","article-title":"Graph evolution: Densification and shrinking diameters","volume":"1","author":"Leskovec","year":"2007","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"10.1016\/j.tcs.2013.01.025_br000100","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/961268.961272","article-title":"Probabilistic routing in intermittently connected networks","volume":"7","author":"Lindgren","year":"2003","journal-title":"SIGMOBILE Mob. Comput. Commun. Rev."},{"key":"10.1016\/j.tcs.2013.01.025_br000105","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1109\/MC.2004.1260729","article-title":"Daknet: Rethinking connectivity in developing nations","volume":"37","author":"Pentland","year":"2004","journal-title":"Computer"},{"issue":"2\u20133","key":"10.1016\/j.tcs.2013.01.025_br000110","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S1570-8705(03)00003-9","article-title":"Data mules: modeling and analysis of a three-tier architecture for sparse sensor networks","volume":"1","author":"Shah","year":"2003","journal-title":"Ad Hoc Netw."},{"key":"10.1016\/j.tcs.2013.01.025_br000115","series-title":"IEEE Globecom 2002","first-page":"17","article-title":"Interrogation-based relay routing for ad hoc satellite networks","author":"Shen","year":"2002"},{"key":"10.1016\/j.tcs.2013.01.025_br000120","series-title":"ACM SIGCOMM Workshop on Delay-Tolerant Networking (WDTN)","first-page":"252","article-title":"Spray and wait: an efficient routing scheme for intermittently connected mobile networks","author":"Spyropoulos","year":"2005"},{"issue":"1","key":"10.1016\/j.tcs.2013.01.025_br000125","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1109\/TNET.2007.897962","article-title":"Efficient routing in intermittently connected mobile networks: the single-copy case","volume":"16","author":"Spyropoulos","year":"2008","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.tcs.2013.01.025_br000130","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1145\/1672308.1672329","article-title":"Characterising temporal distance and reachability in mobile and online social networks","volume":"40","author":"Tang","year":"2010","journal-title":"SIGCOMM Comput. Commun. Rev."},{"key":"10.1016\/j.tcs.2013.01.025_br000135","unstructured":"A. Vahdat, D. Becker, Epidemic routing for partially connected ad hoc networks, Technical Report CS-200006, Duke University, April 2000."},{"key":"10.1016\/j.tcs.2013.01.025_br000140","series-title":"Vehicular Ad Hoc Netw.","first-page":"47","article-title":"Mddv: a mobility-centric data dissemination algorithm for vehicular networks","author":"Wu","year":"2004"},{"issue":"1\u20134","key":"10.1016\/j.tcs.2013.01.025_br000145","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/COMST.2006.323440","article-title":"Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: Overview and challenges","volume":"8","author":"Zhang","year":"2006","journal-title":"IEEE Commun. Surv. Tutorials"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439751300087X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439751300087X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,18]],"date-time":"2018-10-18T17:55:09Z","timestamp":1539885309000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439751300087X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10]]},"references-count":29,"alternative-id":["S030439751300087X"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2013.01.025","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2013,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Efficient routing in carrier-based mobile networks","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2013.01.025","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2013 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}