{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:24:04Z","timestamp":1742966644622,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642029295"},{"type":"electronic","value":"9783642029301"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02930-1_32","type":"book-chapter","created":{"date-parts":[[2009,7,2]],"date-time":"2009-07-02T11:05:04Z","timestamp":1246532704000},"page":"387-398","source":"Crossref","is-referenced-by-count":22,"title":["MANETS: High Mobility Can Make Up for Low Transmission Power"],"prefix":"10.1007","author":[{"given":"Andrea E. F.","family":"Clementi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Pasquale","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riccardo","family":"Silvestri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","unstructured":"Aldous, D., Fill, J.: Reversible Markov Chains and Random Walks on Graphs (2002), http:\/\/stat-www.berkeley.edu\/users\/aldous\/RWG\/book.html"},{"key":"32_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1139","DOI":"10.1007\/11523468_92","volume-title":"Automata, Languages and Programming","author":"C. Amb\u00fchl","year":"2005","unstructured":"Amb\u00fchl, C.: An optimal bound for the MST algorithm to compute energy efficient broadcast trees in wireless networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 1139\u20131150. Springer, Heidelberg (2005)"},{"key":"32_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-540-70575-8_11","volume-title":"Automata, Languages and Programming","author":"C. Avin","year":"2008","unstructured":"Avin, C., Kouck\u00fd, M., Lotker, Z.: How to explore a fast-changing world. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 121\u2013132. Springer, Heidelberg (2008)"},{"issue":"1","key":"32_CR4","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1137\/S0097539795288490","volume":"29","author":"Y. Azar","year":"1999","unstructured":"Azar, Y., Broder, A.Z., Karlin, A.R., Upfal, E.: Balanced allocations. SIAM Journal on Computing\u00a029(1), 180\u2013200 (1999)","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"32_CR5","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1002\/wcm.72","volume":"2","author":"T. Camp","year":"2002","unstructured":"Camp, T., Boleng, J., Davies, V.: A survey of mobility models for ad hoc network research. Wireless Communication and Mobile Computing\u00a02(5), 483\u2013502 (2002)","journal-title":"Wireless Communication and Mobile Computing"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Chatzigiannakis, I., Kinalis, A., Nikoletseas, S.E., Rolim, J.D.P.: Fast and energy efficient sensor data collection by multiple mobile sinks. In: Proc. of MOBIWAC 2007, pp. 25\u201332 (2007)","DOI":"10.1145\/1298091.1298097"},{"key":"32_CR7","first-page":"213","volume-title":"Proc. of 27th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2008)","author":"A. Clementi","year":"2008","unstructured":"Clementi, A., Macci, C., Monti, A., Pasquale, F., Silvestri, R.: Flooding time in edge-markovian dynamic graphs. In: Proc. of 27th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2008), pp. 213\u2013222. ACM Press, New York (2008)"},{"key":"32_CR8","volume-title":"Proc. of the 23rd IEEE International Parallel and Distributed Processing Symposium","author":"A. Clementi","year":"2009","unstructured":"Clementi, A., Monti, A., Pasquale, F., Silvestri, R.: Information spreading in stationary markovian evolving graphs. In: Proc. of the 23rd IEEE International Parallel and Distributed Processing Symposium. IEEE Computer Society Press, Los Alamitos (2009)"},{"key":"32_CR9","unstructured":"Diaz, J., Mitsche, D., Perez-Gimenez, X.: On the connectivity of dynamic random geometric graphs. In: Proc. of 19th annual ACM-SIAM symposium on Discrete algorithms (SODA 2008), pp. 601\u2013610 (2008)"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Jain, S., et al.: Exploiting mobility for energy efficient data collection in wireless sensor networks. ACM\/Kluwer Mobile Networks and Applications (MONET)\u00a011(3) (2006)","DOI":"10.1007\/s11036-006-5186-9"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Grossglauser, M., Tse, N.C.: Mobility increases the capacity of ad-hoc wireless networks. IEEE\/ACM Trans. on Networking\u00a010(4) (2002)","DOI":"10.1109\/TNET.2002.801403"},{"issue":"3","key":"32_CR12","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1109\/T-VT.1987.24106","volume":"36","author":"R.A. Guerin","year":"1987","unstructured":"Guerin, R.A.: Channel occupancy time distribution in a cellular radio system. IEEE Trans. on Veichular Technology\u00a036(3), 89\u201399 (1987)","journal-title":"IEEE Trans. on Veichular Technology"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"Gupta, P., Kumar, P.R.: Critical power for asymptotic connectivity in wireless networks. In: Stochastic Analysis, Control, Optimization and Applications, pp. 547\u2013566 (1998)","DOI":"10.1007\/978-1-4612-1784-8_33"},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"Kinalis, A., Nikoletseas, S.E.: Adaptive redundancy for data propagation exploiting dynamic sensory mobility. In: Proc. of ACM MSWIM 2008, pp. 149\u2013156 (2008)","DOI":"10.1145\/1454503.1454532"},{"key":"32_CR15","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0304-3975(98)00223-0","volume":"243","author":"L.M. Kirousis","year":"2000","unstructured":"Kirousis, L.M., Kranakis, E., Krizanc, D., Pelc, A.: Power consumption in packet radio networks. Theoretical Computer Science\u00a0243, 289\u2013305 (2000)","journal-title":"Theoretical Computer Science"},{"key":"32_CR16","first-page":"148","volume-title":"London Mathematical Society Lecture Note","author":"C. McDiarmid","year":"1989","unstructured":"McDiarmid, C.: On the method of bounded differences. In: Siemons, J. (ed.) London Mathematical Society Lecture Note, vol.\u00a0141, pp. 148\u2013188. Cambridge University Press, Cambridge (1989)"},{"key":"32_CR17","doi-asserted-by":"crossref","unstructured":"Mei, A., Stefa, J.: Swim: a simple model to generate small mobile worlds. In: Proc. of IEEE INFOCOM 2009 (2009)","DOI":"10.1109\/INFCOM.2009.5062134"},{"key":"32_CR18","unstructured":"Pelusi, L., Passarella, A., Conti, M.: Beyond manets: Dissertation on opportunistic networking. IIT-CNR Tech. Rep. (2006)"},{"key":"32_CR19","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001","volume-title":"Random Geometric Graphs","author":"M. Penrose","year":"2003","unstructured":"Penrose, M.: Random Geometric Graphs. Oxford University Press, Oxford (2003)"},{"issue":"1","key":"32_CR20","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1109\/TMC.2003.1195149","volume":"2","author":"P. Santi","year":"2003","unstructured":"Santi, P., Blough, D.M.: The critical transmitting range for connectivity in sparse wireless ad hoc networks. IEEE Transactions on Mobile Computing\u00a02(1), 25\u201339 (2003)","journal-title":"IEEE Transactions on Mobile Computing"},{"key":"32_CR21","doi-asserted-by":"crossref","unstructured":"Zhang, Z.: Routing in intermittently connected mobile ad-hoc networks and delay tolerant networks: overview and challenges. IEEE Communication Surveys\u00a08(1) (2006)","DOI":"10.1109\/COMST.2006.323440"},{"key":"32_CR22","doi-asserted-by":"crossref","unstructured":"Zhao, W., Ammar, M., Zegura, E.: A message ferrying approach for data delivery in sparse mobile ad-hoc networks. In: Proc. of 5th ACM MobiHoc 2004 (2004)","DOI":"10.1145\/989459.989483"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02930-1_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T01:49:35Z","timestamp":1558403375000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02930-1_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642029295","9783642029301"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02930-1_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}