{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:15:38Z","timestamp":1743020138520,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642148484"},{"type":"electronic","value":"9783642148491"}],"license":[{"start":{"date-parts":[[2010,11,8]],"date-time":"2010-11-08T00:00:00Z","timestamp":1289174400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,11,8]],"date-time":"2010-11-08T00:00:00Z","timestamp":1289174400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-14849-1_19","type":"book-chapter","created":{"date-parts":[[2011,4,27]],"date-time":"2011-04-27T15:47:28Z","timestamp":1303919248000},"page":"591-619","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Information Spreading in Dynamic Networks: An Analytical Approach"],"prefix":"10.1007","author":[{"given":"Andrea","family":"Clementi","sequence":"first","affiliation":[]},{"given":"Francesco","family":"Pasquale","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,11,8]]},"reference":[{"key":"19_CR1","unstructured":"D. Aldous and J. Fill. Reversible Markov Chains and Random Walks on Graphs. http:\/\/stat-www.berkeley.edu\/users\/aldous\/RWG\/book.html, 2002."},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"C. Am\u00fchl. An optimal bound for the MST algorithm to compute energy efficient broadcast trees in wireless networks. In: Proceedings of 32th International Colloquium on Automata, Languages and Programming (ICALP), volume 3580 of LNCS, pages 1139\u20131150. Springer, Berlin Heidelberg, 2005.","DOI":"10.1007\/11523468_92"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"C. Avin, M. Koucky, and Z. Lotker. How to explore a fast-changing world. In Proceedings of 35th International Colloquium on Automata, Languages and Programming (ICALP\u201908), volume 5125 of LNCS, pages 121\u2013132. Springer, Berlin Heidelberg, 2008.","DOI":"10.1007\/978-3-540-70575-8_11"},{"issue":"1","key":"19_CR4","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/0022-0000(92)90042-H","volume":"45","author":"R. Bar-Yehuda","year":"1992","unstructured":"R. Bar-Yehuda, O. Goldreich, and A. Itai. On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization. Journal of Computer and System Sciences, 45(1):104\u2013126, 1992.","journal-title":"Journal of Computer and System Sciences"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"H. Baumann, P. Crescenzi, and P. Fraigniaud. Parsimonious flooding in dynamic graphs. In Proceedings of 28th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), pages 260\u2013269. ACM Press, New York, NY, USA, 2009.","DOI":"10.1145\/1582716.1582757"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"S. Bhadra and A. Ferreira. Complexity of connected components in evolving graphs and the computation of multicast trees in dynamic networks. In: Proceedings of the Second International Conference, ADHOC-NOW, volume 2865 of LNCS, pages 259\u2013270. Springer, Berlin Heidelberg, 2003.","DOI":"10.1007\/978-3-540-39611-6_23"},{"key":"19_CR7","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs.","author":"B. Bollob\u00e1s","year":"2001","unstructured":"B. Bollob\u00e1s. Random Graphs. Cambridge University Press, Cambridge, 2001."},{"issue":"2","key":"19_CR8","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1142\/S0129054103001728","volume":"14","author":"B. Bui-Xuan","year":"2003","unstructured":"B. Bui-Xuan, A. Ferreira, and A. Jarry. Computing shortest, fastest, and foremost journeys in dynamic networks. International Journal of Foundations of Computer Science, 14(2):267\u2013285, 2003.","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"5","key":"19_CR9","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1002\/wcm.72","volume":"2","author":"T. Camp","year":"2002","unstructured":"T. Camp, J. Boleng, and V. Davies. A survey of mobility models for ad hoc network research. Wireless Communication and Mobile Computing, 2(5):483\u2013502, 2002.","journal-title":"Wireless Communication and Mobile Computing"},{"issue":"12","key":"19_CR10","doi-asserted-by":"publisher","first-page":"1240","DOI":"10.1109\/TCOM.1985.1096245","volume":"33","author":"I. Chlamtac","year":"1985","unstructured":"I. Chlamtac and S. Kutten. On broadcasting in radio networks - problem analysis and protocol design. IEEE Transactions on Communications, 33(12):1240\u20131246, 1985.","journal-title":"IEEE Transactions on Communications"},{"key":"19_CR11","unstructured":"B. Chlebus, L. Gasieniec, A. Gibbons, A. Pelc, and W. Rytter. Deterministic broadcasting in unknown radio networks. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete algorithms (SODA), pages 861\u2013870. ACM Press, New York, NY, USA, 2000."},{"issue":"2","key":"19_CR12","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0196-6774(02)00004-4","volume":"43","author":"M. Chrobak","year":"2002","unstructured":"M. Chrobak, L. Gasieniec, and W. Rytter. Fast broadcasting and gossiping in radio networks. Journal of Algorithms, 43(2):177\u2013189, 2002.","journal-title":"Journal of Algorithms"},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1006\/aama.2001.0720","volume":"26","author":"F. Chung","year":"2001","unstructured":"F. Chung and L. Lu. The diameter of sparse random graphs. Advances in Applied Mathematics, 26:257\u2013279, 2001.","journal-title":"Advances in Applied Mathematics"},{"key":"19_CR14","unstructured":"A. Clementi, C. Macci, A. Monti, F. Pasquale, and R. Silvestri. Flooding time of edge-markovian evolving graphs. SIAM Journal on Discrete Mathematics (accepted)."},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"A. Clementi, C. Macci, A. Monti, F. Pasquale, and R. Silvestri. Flooding time in edge-markovian dynamic graphs. In: Proceedings of 27th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), pages 213\u2013222. ACM Press, New York, NY, USA, 2008.","DOI":"10.1145\/1400751.1400781"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"A. Clementi, A. Monti, F. Pasquale, and R. Silvestri. Communication in dynamic radio networks. In: Proceedings of 26th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), pages 205\u2013214. ACM Press, New York, NY, USA, 2007.","DOI":"10.1145\/1281100.1281131"},{"issue":"4","key":"19_CR17","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.jcss.2008.10.004","volume":"75","author":"A. Clementi","year":"2009","unstructured":"A. Clementi, A. Monti, F. Pasquale, and R. Silvestri. Broadcasting in dynamic radio networks. Journal of Computer and System Sciences, 75(4):213\u2013230, Academic Press, Inc., Orlando, FL, USA, 2009.","journal-title":"Journal of Computer and System Sciences"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"A. Clementi, A. Monti, F. Pasquale, and R. Silvestri. Information spreading in stationary markovian evolving graphs. In: Proceedings of the 23rd IEEE International Parallel and Distributed Processing Symposium, pages 1\u201312, IEEE Computer Society, 2009.","DOI":"10.1109\/IPDPS.2009.5160986"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"A. Clementi, F. Pasquale, and R. Silvestri. Manets: High mobility can make up for low transmission power. In: Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP\u201909), volume 5556 of LNCS, pages 387\u2013398. Springer, 2009.","DOI":"10.1007\/978-3-642-02930-1_32"},{"issue":"2","key":"19_CR20","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.jalgor.2004.08.001","volume":"60","author":"A. Czumaj","year":"2006","unstructured":"A. Czumaj and W. Rytter. Broadcasting algorithms in radio networks with unknown topology. Journal of Algorithms, 60(2):115\u2013143, 2006.","journal-title":"Journal of Algorithms"},{"key":"19_CR21","unstructured":"J. Diaz, D. Mitsche, and X. Perez-Gimenez. On the connectivity of dynamic random geometric graphs. In: Proceedings of 19th annual ACM-SIAM symposium on Discrete algorithms (SODA), pages 601\u2013610, ACM Press, New York, NY, USA, 2008."},{"issue":"2","key":"19_CR22","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1137\/060659855","volume":"22","author":"J. Diaz","year":"2008","unstructured":"J. Diaz, X. Perez, M.J. Serna, and N.C. Wormald. Walkers on the cycle and the grid. SIAM Journal on Discrete Mathematics, 22(2):747\u2013775, 2008.","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"18","key":"19_CR23","doi-asserted-by":"publisher","first-page":"2577","DOI":"10.1016\/j.dam.2006.04.026","volume":"154","author":"T. Dimitriou","year":"2006","unstructured":"T. Dimitriou, S. Nikoletseas, and P. Spirakis. The infection time of graphs. Discrete Applied Mathematics, 154(18):2577\u20132589, 2006.","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"19_CR24","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1016\/j.jcss.2005.09.003","volume":"72","author":"R. Els\u00e4sser","year":"2006","unstructured":"R. Els\u00e4sser and L. Gasieniec. Radio communication in random graphs. Journal of Computer and System Sciences, 72(3):490\u2013506, 2006.","journal-title":"Journal of Computer and System Sciences"},{"key":"19_CR25","first-page":"17","volume":"5","author":"P. Erd\u00f6s","year":"1960","unstructured":"P. Erd\u00f6s and A. R\u00e9nyi. On the evolution of random graphs. Publications Mathematical Institute Hungarian Academy Science, 5:17\u201361, 1960.","journal-title":"Publications Mathematical Institute Hungarian Academy Science"},{"issue":"5","key":"19_CR26","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/MNET.2004.1337732","volume":"18","author":"A. Ferreira","year":"2004","unstructured":"A. Ferreira. Building a reference combinatorial model for manet. IEEE Network, 18(5):24\u201329, 2004.","journal-title":"IEEE Network"},{"issue":"4","key":"19_CR27","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1109\/TNET.2002.801403","volume":"10","author":"M. Grossglauser","year":"2002","unstructured":"M. Grossglauser and N.C. Tse. Mobility increases the capacity of ad-hoc wireless networks. IEEE\/ACM Transactions on Networking, 10(4):477\u2013486, 2002.","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"3","key":"19_CR28","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1109\/T-VT.1987.24106","volume":"36","author":"R.A. Guerin","year":"1987","unstructured":"R.A. Guerin. Channel occupancy time distribution in a cellular radio system. IEEE Transactions on Vehicular Technology, 36(3):89\u201399, 1987.","journal-title":"IEEE Transactions on Vehicular Technology"},{"key":"19_CR29","doi-asserted-by":"crossref","unstructured":"P. Gupta and P.R. Kumar. Critical power for asymptotic connectivity in wireless networks. Stochastic Analysis, Control, Optimization and Applications, pages 547\u2013566, 1998.","DOI":"10.1007\/978-1-4612-1784-8_33"},{"key":"19_CR30","doi-asserted-by":"crossref","unstructured":"A. Jardosh, E.M. Belding-Royer, K.C. Almeroth, and S. Suri. Towards realistic mobility models for mobile ad hoc networks. In: Proceedings of the 9th annual international conference on Mobile computing and networking (Mobicom), pages 217\u2013229, ACM Press, New York, NY, USA, 2003.","DOI":"10.1145\/938985.939008"},{"key":"19_CR31","doi-asserted-by":"crossref","unstructured":"D. Kempe and J. Kleinberg. Protocols and impossibility results for gossip-based communication mechanisms. In: Proceedings of 43rd Symposium on Foundations of Computer Science (FOCS), pages 471\u2013480, IEEE Computer Society, Washington, DC, USA, 2002.","DOI":"10.1109\/SFCS.2002.1181971"},{"key":"19_CR32","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0304-3975(98)00223-0","volume":"243","author":"L. Kirousis","year":"2000","unstructured":"L. Kirousis, E. Kranakis, D. Krizanc, and A. Pelc. Power consumption in packet radio networks. Theoretical Computer Science, 243:289\u2013305, 2000.","journal-title":"Theoretical Computer Science"},{"key":"19_CR33","doi-asserted-by":"crossref","unstructured":"J.-Y. Le Boudec and M. Vojnovic. Perfect simulation and the stationarity of a class of mobility models. In: Proceedings of 24th IEEE INFOCOM, pages 2743\u20132754, IEEE Computer Society, Washington, DC, USA, 2005.","DOI":"10.1109\/INFCOM.2005.1498557"},{"key":"19_CR34","doi-asserted-by":"crossref","unstructured":"S. Nikoletseas, C. Raptopoulos, and P. Spirakis. The survival of the weakest in networks. Computational and Mathematical Organization Theory, Kluwer Academic Publishers, Hingham, MA, USA, 2008.","DOI":"10.1007\/s10588-008-9050-2"},{"key":"19_CR35","doi-asserted-by":"crossref","unstructured":"R. O\u2019Dell and R. Wattenhofer. Information dissemination in highly dynamic graphs. In: Proceedings of ACM DIALM-POMC, pages 104\u2013110, ACM Press, New York, NY, USA, 2005.","DOI":"10.1145\/1080810.1080828"},{"key":"19_CR36","unstructured":"L. Pelusi, A. Passarella, and M. Conti. Beyond manets: Dissertation on opportunistic networking. IIT-CNR Technical Report, 2006."},{"key":"19_CR37","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001","volume-title":"Random Geometric Graphs.","author":"M. Penrose","year":"2003","unstructured":"M. Penrose. Random Geometric Graphs. Oxford University Press, New York, 2003."},{"issue":"1","key":"19_CR38","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1137\/0147013","volume":"47","author":"B. Pittel","year":"1987","unstructured":"B. Pittel. On spreading a rumor. SIAM Journal on Applied Mathematics, 47(1):213\u2013223, 1987.","journal-title":"SIAM Journal on Applied Mathematics"},{"issue":"2","key":"19_CR39","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1109\/90.222924","volume":"1","author":"S. Ramanathan","year":"1993","unstructured":"S. Ramanathan and E. Lloyd. Scheduling algorithms for multihop radio networks. IEEE\/ACM Transactions on Networking, 1(2):166\u2013177, 1993.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"19_CR40","doi-asserted-by":"crossref","unstructured":"R. Ramaswami and K. Parhi. Distributed scheduling of broadcasts in radio network. In Pro- ceedings of IEEE INFOCOM, IEEE Computer Society, Washington, DC, USA, pages 497\u2013504, 1989.","DOI":"10.1109\/INFCOM.1989.101493"},{"issue":"1","key":"19_CR41","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1109\/TMC.2003.1195149","volume":"2","author":"P. Santi","year":"2003","unstructured":"P. Santi and D. M. Blough. The critical transmitting range for connectivity in sparse wireless ad hoc networks. IEEE Transactions on Mobile Computing, 2(1):25\u201339, 2003.","journal-title":"IEEE Transactions on Mobile Computing"},{"key":"19_CR42","volume-title":"Random Graphs.","author":"J. Svante","year":"2000","unstructured":"J. Svante, T. Luczak, and A. Rucinski. Random Graphs. Wiley-Interscience, New York, 2000."}],"container-title":["Monographs in Theoretical Computer Science. An EATCS Series","Theoretical Aspects of Distributed Computing in Sensor Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14849-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T08:37:24Z","timestamp":1741163844000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-14849-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,8]]},"ISBN":["9783642148484","9783642148491"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14849-1_19","relation":{},"ISSN":["1431-2654"],"issn-type":[{"type":"print","value":"1431-2654"}],"subject":[],"published":{"date-parts":[[2010,11,8]]},"assertion":[{"value":"8 November 2010","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}