{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,26]],"date-time":"2026-06-26T22:40:49Z","timestamp":1782513649464,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642152399","type":"print"},{"value":"9783642152405","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15240-5_9","type":"book-chapter","created":{"date-parts":[[2010,8,4]],"date-time":"2010-08-04T15:30:15Z","timestamp":1280935815000},"page":"111-124","source":"Crossref","is-referenced-by-count":18,"title":["Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility"],"prefix":"10.1007","author":[{"given":"Arnaud","family":"Casteigts","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paola","family":"Flocchini","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bernard","family":"Mans","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicola","family":"Santoro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"3","key":"9_CR1","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/TMC.2003.1233531","volume":"2","author":"C. Bettstetter","year":"2003","unstructured":"Bettstetter, C., Resta, G., Santi, P.: The node distribution of the random waypoint mobility model for wireless ad hoc networks. IEEE Trans. on Mobile Comp.\u00a02(3), 257\u2013269 (2003)","journal-title":"IEEE Trans. on Mobile Comp."},{"issue":"2","key":"9_CR2","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1142\/S0129054103001728","volume":"14","author":"B. Bui-Xuan","year":"2003","unstructured":"Bui-Xuan, B., Ferreira, A., Jarry, A.: Computing shortest, fastest, and foremost journeys in dynamic networks. Intl. J. of Foundations of Comp. Science\u00a014(2), 267\u2013285 (2003)","journal-title":"Intl. J. of Foundations of Comp. Science"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Burgess, J., Gallagher, B., Jensen, D., Levine, B.N.: Maxprop: Routing for vehicle-based disruption-tolerant networks. In: Proc. of the 25th Conference on Computer Communications (INFOCOM\u201906), pp. 1\u201311 (2006)","DOI":"10.1109\/INFOCOM.2006.228"},{"key":"9_CR4","unstructured":"Cardei, I., Liu, C., Wu, J.: Routing in Wireless Networks with Intermittent Connectivity. In: Encyclopedia of Wireless and Mobile Communications. CRC Press, Taylor & Francis (2007)"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-642-11476-2_11","volume-title":"Structural Information and Communication Complexity","author":"A. Casteigts","year":"2010","unstructured":"Casteigts, A., Chaumette, S., Ferreira, A.: Characterizing topological assumptions of distributed algorithms in dynamic networks. In: Kutten, S., \u017derovnik, J. (eds.) SIROCCO 2009. LNCS, vol.\u00a05869, pp. 126\u2013140. Springer, Heidelberg (2010)"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Casteigts, A., Flocchini, P., Mans, B., Santoro, N.: Deterministic computations in time-varying graphs: Broadcasting under unstructured mobility. Technical report, University of Ottawa (May 2010)","DOI":"10.1007\/978-3-642-15240-5_9"},{"key":"9_CR7","first-page":"213","volume-title":"Proc. of the 27th Annual ACM Symposium on Principles of Distributed Computing (PODC)","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 the 27th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 213\u2013222. ACM, New York (2008)"},{"key":"9_CR8","first-page":"1","volume-title":"Proc. of the 23rd IEEE International Parallel and Distributed Processing Symposium (IPDPS)","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 (IPDPS), pp. 1\u201312. IEEE Computer Society, Los Alamitos (2009)"},{"issue":"18","key":"9_CR9","doi-asserted-by":"publisher","first-page":"2577","DOI":"10.1016\/j.dam.2006.04.026","volume":"154","author":"T. Dimitriou","year":"2006","unstructured":"Dimitriou, T., Nikoletseas, S., Spirakis, P.: The infection time of graphs. Discrete Applied Mathematics\u00a0154(18), 2577\u20132589 (2006)","journal-title":"Discrete Applied Mathematics"},{"issue":"5","key":"9_CR10","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/MNET.2004.1337732","volume":"18","author":"A. Ferreira","year":"2004","unstructured":"Ferreira, A.: Building a reference combinatorial model for MANETs. IEEE Network\u00a018(5), 24\u201329 (2004)","journal-title":"IEEE Network"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1145\/1374618.1374654","volume-title":"Proc. of the 9th ACM intl. symposium on Mobile ad hoc networking and computing","author":"M. Fiore","year":"2008","unstructured":"Fiore, M., H\u00e4rri, J.: The networking shape of vehicular mobility. In: Proc. of the 9th ACM intl. symposium on Mobile ad hoc networking and computing, pp. 261\u2013272. ACM, New York (2008)"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Flocchini, P., Kellett, M., Mason, P., Santoro, N.: Mapping an unfriendly subway system. In: Proc. 5th International Conference on Fun with Algorithms (to appear, 2010)","DOI":"10.1007\/978-3-642-13122-6_20"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10631-6_55","volume-title":"Algorithms and Computation","author":"P. Flocchini","year":"2009","unstructured":"Flocchini, P., Mans, B., Santoro, N.: Exploration of periodically varying graphs. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878. Springer, Heidelberg (2009)"},{"key":"9_CR14","volume-title":"Proceedings of the 2007 ACM CoNEXT conference","author":"S. Guo","year":"2007","unstructured":"Guo, S., Keshav, S.: Fair and efficient scheduling in data ferrying networks. In: Proceedings of the 2007 ACM CoNEXT conference. ACM, New York (2007)"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Jacquet, P., Mans, B., Rodolakis, G.: Information propagation speed in mobile and delay tolerant networks. In: Proc. of the 28th Conference on Computer Communications (INFOCOM\u201909), Rio de Janeiro, Brazil (2009)","DOI":"10.1109\/INFCOM.2009.5061927"},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1145\/1015467.1015484","volume-title":"Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications","author":"S. Jain","year":"2004","unstructured":"Jain, S., Fall, K., Patra, R.: Routing in a delay tolerant network. In: Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications, pp. 145\u2013158. ACM, New York (2004)"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J.: Protocols and impossibility results for gossip-based communication mechanisms. In: 43rd Symp. on Found. of Comp. Sci (FOCS), pp. 471\u2013480 (2002)","DOI":"10.1109\/SFCS.2002.1181971"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Kim, M., Kotz, D., Kim, S.: Extracting a mobility model from real user traces. In: Proceedings of IEEE Infocom, vol.\u00a06, pp. 1\u201313 (2006) (Citeseer)","DOI":"10.1109\/INFOCOM.2006.173"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Leguay, J., Friedman, T., Conan, V.: Evaluating mobility pattern space routing for DTNs. In: 25th IEEE Int. Conf. on Computer Communications (INFOCOM\u201906), p. 18 (2006)","DOI":"10.1109\/INFOCOM.2006.299"},{"issue":"9","key":"9_CR20","doi-asserted-by":"publisher","first-page":"1325","DOI":"10.1109\/TPDS.2008.218","volume":"20","author":"C. Liu","year":"2009","unstructured":"Liu, C., Wu, J.: Scalable routing in cyclic mobile networks. IEEE Trans. Parallel Distrib. Syst.\u00a020(9), 1325\u20131338 (2009)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"9_CR21","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1145\/1080810.1080828","volume-title":"DIALM-POMC \u201905: Proceedings of the 2005 joint workshop on Foundations of mobile computing","author":"R. O\u2019Dell","year":"2005","unstructured":"O\u2019Dell, R., Wattenhofer, R.: Information dissemination in highly dynamic graphs. In: DIALM-POMC \u201905: Proceedings of the 2005 joint workshop on Foundations of mobile computing, pp. 104\u2013110. ACM, New York (2005)"},{"key":"9_CR22","first-page":"259","volume-title":"Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking","author":"T. Spyropoulos","year":"2005","unstructured":"Spyropoulos, T., Psounis, K., Raghavendra, C.S.: Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In: Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking, p. 259. ACM, New York (2005)"},{"key":"9_CR23","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1145\/1287853.1287876","volume-title":"Proc. of 13th ACM intl. conf. on Mobile computing and networking","author":"X. Zhang","year":"2007","unstructured":"Zhang, X., Kurose, J., Levine, B.N., Towsley, D., Zhang, H.: Study of a bus-based disruption-tolerant network: mobility modeling and impact on routing. In: Proc. of 13th ACM intl. conf. on Mobile computing and networking, pp. 195\u2013206. ACM, New York (2007)"},{"issue":"1","key":"9_CR24","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/COMST.2006.323440","volume":"8","author":"Z. Zhang","year":"2006","unstructured":"Zhang, Z.: Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: Overview and challenges. IEEE Comm. Surveys & Tutorials\u00a08(1), 24\u201337 (2006)","journal-title":"IEEE Comm. Surveys & Tutorials"},{"key":"9_CR25","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1145\/989459.989483","volume-title":"MobiHoc \u201904: Proc. of the 5th ACM intl. symposium on Mobile ad hoc networking and computing","author":"W. Zhao","year":"2004","unstructured":"Zhao, W., Ammar, M., Zegura, E.: A message ferrying approach for data delivery in sparse mobile ad hoc networks. In: MobiHoc \u201904: Proc. of the 5th ACM intl. symposium on Mobile ad hoc networking and computing, pp. 187\u2013198. ACM, New York (2004)"}],"container-title":["IFIP Advances in Information and Communication Technology","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15240-5_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:03:22Z","timestamp":1606187002000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15240-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642152399","9783642152405"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15240-5_9","relation":{},"ISSN":["1868-4238","1861-2288"],"issn-type":[{"value":"1868-4238","type":"print"},{"value":"1861-2288","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}