{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T20:32:30Z","timestamp":1769977950922,"version":"3.49.0"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,2,22]],"date-time":"2012-02-22T00:00:00Z","timestamp":1329868800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2012,8]]},"DOI":"10.1007\/s00446-012-0165-9","type":"journal-article","created":{"date-parts":[[2012,2,21]],"date-time":"2012-02-21T06:46:13Z","timestamp":1329806773000},"page":"279-296","source":"Crossref","is-referenced-by-count":14,"title":["Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony"],"prefix":"10.1007","volume":"25","author":[{"given":"Antonio","family":"Fern\u00e1ndez Anta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessia","family":"Milani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miguel A.","family":"Mosteiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shmuel","family":"Zaks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,2,22]]},"reference":[{"key":"165_CR1","first-page":"98","volume":"93","author":"J. Aspnes","year":"2007","unstructured":"Aspnes J., Ruppert E.: An introduction to population protocols. Bull. Eur. Assoc. Theor. Comput. Sci. 93, 98\u2013117 (2007)","journal-title":"Bull. Eur. Assoc. Theor. Comput. Sci."},{"key":"165_CR2","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Even, S.: Efficient and reliable broadcast is achievable in an eventually connected network (extended abstract). In: Proceedins of 3rd Annual ACM Symposium on Principles of Distributed Computing, pp. 278\u2013281 (1984)","DOI":"10.1145\/800222.806754"},{"key":"165_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Patt-Shamir, B., Peleg, D., Saks, M.: Adapting to asynchronous dynamic networks (extended abstract). In: Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pp. 557\u2013570 (1992)","DOI":"10.1145\/129712.129767"},{"key":"165_CR4","doi-asserted-by":"crossref","unstructured":"Baldoni, R., Ioannidou, K., Milani, A.: Mobility versus the cost of geocasting in mobile ad-hoc networks. In: Proceedings of the 21st Annual EATCS International Symposium on Distributed Computing, Lecture Notes in Computer Science, vol. 4731, pp. 48\u201362. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-75142-7_7"},{"key":"165_CR5","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/0022-0000(92)90042-H","volume":"45","author":"R. Bar-Yehuda","year":"1992","unstructured":"Bar-Yehuda R., Goldreich O., Itai A.: On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization. J. Comput. Syst. Sci. 45, 104\u2013126 (1992)","journal-title":"J. Comput. Syst. Sci."},{"key":"165_CR6","doi-asserted-by":"crossref","unstructured":"Baumann, H., Crescenzi, P., Fraigniaud, P.: Parsimonious flooding in dynamic graphs. In: Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, pp. 260\u2013269 (2009)","DOI":"10.1145\/1582716.1582757"},{"key":"165_CR7","doi-asserted-by":"crossref","unstructured":"Boldrini, C., Conti, M., Passarella, A.: Modelling data dissemination in opportunistic networks. In: CHANTS \u201908: Proceedings of the third ACM workshop on Challenged networks, pp. 89\u201396 (2008)","DOI":"10.1145\/1409985.1410002"},{"issue":"3","key":"165_CR8","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s004460050030","volume":"10","author":"D. Bruschi","year":"1997","unstructured":"Bruschi D., Pinto M.D.: Lower bounds for the broadcast problem in mobile radio networks. Distrib. Comput. 10(3), 129\u2013135 (1997)","journal-title":"Distrib. Comput."},{"key":"165_CR9","doi-asserted-by":"crossref","unstructured":"Chlebus, B., Ga\u0327sieniec, L., Lingas, A., Pagourtzis, A.: Oblivious gossiping in ad-hoc radio networks. In: Proceedings of 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 44\u201351 (2001)","DOI":"10.1145\/381448.381454"},{"key":"165_CR10","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s446-002-8028-1","volume":"15","author":"B.S. Chlebus","year":"2002","unstructured":"Chlebus B.S., Ga\u0327sieniec L., Gibbons A., Pelc A., Rytter W.: Deterministic broadcasting in unknown radio networks. Distrib. Comput. 15, 27\u201338 (2002)","journal-title":"Distrib. Comput."},{"key":"165_CR11","doi-asserted-by":"crossref","unstructured":"Chlebus, B.S., Kowalski, D.R., Radzik, T.: On many-to-many communication in packet radio networks. In: Proceedings of the 10th International Conference on Principles of Distributed Systems, pp. 258\u2013272 (2006)","DOI":"10.1007\/11945529_19"},{"key":"165_CR12","doi-asserted-by":"crossref","unstructured":"Clementi, A., Macci, C., Pasquale, F., Monti, A., Silvestri, R.: Flooding time in edge-markovian dynamic graphs. In: Proceedings of the 27th Annual ACM Symposium on Principles of Distributed Computing, pp. 213\u2013222 (2008)","DOI":"10.1145\/1400751.1400781"},{"key":"165_CR13","doi-asserted-by":"crossref","unstructured":"Clementi, A., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks. In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (2001)","DOI":"10.1145\/383962.384040"},{"issue":"1","key":"165_CR14","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.jpdc.2003.09.002","volume":"64","author":"A. Clementi","year":"2004","unstructured":"Clementi A., Monti A., Silvestri R.: Round robin is optimal for fault-tolerant broadcasting on wireless networks. J. Parallel Distrib. Comput. 64(1), 89\u201396 (2004)","journal-title":"J. Parallel Distrib. Comput."},{"key":"165_CR15","doi-asserted-by":"crossref","unstructured":"Clementi, A., Pasquale, F., Monti, A., Silvestri, R.: Communication in dynamic radio networks. In: Proceedings of 26th Annual ACM Symposium on Principles of Distributed Computing, pp. 205\u2013214 (2007)","DOI":"10.1145\/1281100.1281131"},{"key":"165_CR16","doi-asserted-by":"crossref","unstructured":"Clementi, A., Pasquale, F., Monti, A., Silvestri, R.: Information spreading in stationary markovian evolving graphs. In: Proceedings of 23rd IEEE International Parallel and Distributed Processing Symposium (2009)","DOI":"10.1109\/IPDPS.2009.5160986"},{"key":"165_CR17","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/j.jda.2006.07.001","volume":"5","author":"A. Dessmark","year":"2007","unstructured":"Dessmark A., Pelc A.: Broadcasting in geometric radio networks. J. Discret. Algorithms 5, 187\u2013201 (2007)","journal-title":"J. Discret. Algorithms"},{"key":"165_CR18","doi-asserted-by":"crossref","unstructured":"Fall, K.: A delay-tolerant network architecture for challenged internets. In: Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), pp. 27\u201334 (2003)","DOI":"10.1145\/863955.863960"},{"key":"165_CR19","doi-asserted-by":"crossref","unstructured":"Farach-Colton, M., Mosteiro, M.A.: Sensor network gossiping or how to break the broadcast lower bound. In: Proceedings of the 18th International Symposium on Algorithms and Computation. Lecture Notes in Computer Science, vol. 4835, pp. 232\u2013243. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-77120-3_22"},{"key":"165_CR20","doi-asserted-by":"crossref","unstructured":"Fern\u00e1ndez Anta, A., Milani, A.: Bounds for deterministic reliable geocast in mobile ad-hoc networks. In: Proceedings of the 12th International Conference on Principles of Distributed Systems, pp. 164\u2013183 (2008)","DOI":"10.1007\/978-3-540-92221-6_12"},{"key":"165_CR21","doi-asserted-by":"crossref","unstructured":"Fern\u00e1ndez Anta, A., Milani, A., Mosteiro, M.A., Zaks, S.: Opportunistic information dissemination in mobile ad-hoc networks: the prot of global synchrony. In: Proceedings of the 24th International Symposium on Distributed Computing. Lecture Notes in Computer Science, vol. 6343, pp. 374\u2013388. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-15763-9_34"},{"key":"165_CR22","doi-asserted-by":"crossref","unstructured":"Fern\u00e1ndez Anta, A., Mosteiro, M.A., Thraves, C.: Deterministic communication in the weak sensor model. In: Proceedings of the 11th International Conference on Principles of Distributed Systems, pp. 119\u2013131 (2007)","DOI":"10.1007\/978-3-540-77096-1_9"},{"issue":"2","key":"165_CR23","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M.J. Fischer","year":"1985","unstructured":"Fischer M.J., Lynch N.A., Paterson M.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"issue":"1","key":"165_CR24","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/357195.357200","volume":"5","author":"R.G. Gallager","year":"1983","unstructured":"Gallager R.G., Humblet P.A., Spira P.M.: A distributed algorithm for minimum-weight spanning trees. ACM Trans. Program. Lang. Syst. 5(1), 66\u201377 (1983)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"165_CR25","doi-asserted-by":"crossref","unstructured":"Gasieniec, L., Kranakis, E., Pelc, A., Xin, Q.: Deterministic m2m multicast in radio networks. In: Proceedings of 31st International Colloquium on Automata Languages and Programming, pp. 670\u2013682 (2004)","DOI":"10.1007\/978-3-540-27836-8_57"},{"key":"165_CR26","unstructured":"Ga\u0327sieniec, L., Pelc, A., Peleg, D., Emek, Y., Kantor, E., Su, C.: Broadcasting in udg radio networks with unknown topology. In: Proceedings of 26th Annual ACM Symposium on Principles of Distributed Computing (2007)"},{"key":"165_CR27","doi-asserted-by":"crossref","unstructured":"Guan, X.: Better face routing protocols. In: Dolev, S. (ed.) Algosensors. Lecture Notes in Computer Science, vol. 5804, pp. 167\u2013178. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-05434-1_18"},{"key":"165_CR28","doi-asserted-by":"crossref","unstructured":"Gupta, S., Srimani, P.: An adaptive protocol for reliable multicast in mobile multi-hop radio networks. In: Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications (1999)","DOI":"10.1109\/MCSA.1999.749283"},{"key":"165_CR29","doi-asserted-by":"crossref","unstructured":"Humblet, P.: Selecting a leader in a clique in o(n log n) messages. In: Proceedings of 23rd Conference on Decision and Control, p. 11391140 (1984)","DOI":"10.1109\/CDC.1984.272191"},{"key":"165_CR30","unstructured":"Jinag, X., Camp, T.: A review of geocasting protocols for a mobile ad hoc network. In: Proceedings of Grace Hopper Celebration (2002)"},{"issue":"1","key":"165_CR31","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0304-3975(89)90103-5","volume":"64","author":"E. Korach","year":"1989","unstructured":"Korach E., Moran S., Zaks S.: Optimal lower bounds for some distributed algorithms for a complete network of processors. Theor. Comput. Sci. 64(1), 125\u2013132 (1989)","journal-title":"Theor. Comput. Sci."},{"key":"165_CR32","doi-asserted-by":"crossref","unstructured":"Kowalski, D.R.: On selection problem in radio networks. In: Proceedings of 24th Annual ACM Symposium on Principles of Distributed Computing, pp. 158\u2013166 (2005)","DOI":"10.1145\/1073814.1073843"},{"key":"165_CR33","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/j.tcs.2004.04.017","volume":"333","author":"D.R. Kowalski","year":"2005","unstructured":"Kowalski D.R., Pelc A.: Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism. Theor. Comput. Sci. 333, 355\u2013371 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"165_CR34","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Locher, T., Oshman, R.: Gradient clock synchronization in dynamic networks. In: SPAA \u201909: Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures, pp. 270\u2013279 (2009)","DOI":"10.1145\/1583991.1584059"},{"key":"165_CR35","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Lynch, N., Oshman, R.: Distributed computation in dynamic networks. In: Proceedings of the 42th Annual ACM Symposium on Theory of Computing, pp. 513\u2013522 (2010)","DOI":"10.1145\/1806689.1806760"},{"issue":"3","key":"165_CR36","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1137\/S0097539794279109","volume":"27","author":"E. Kushilevitz","year":"1998","unstructured":"Kushilevitz E., Mansour Y.: An \u03a9(D log(N\/D)) lower bound for broadcast in radio networks. SIAM J. Comput. 27(3), 702\u2013712 (1998)","journal-title":"SIAM J. Comput."},{"key":"165_CR37","volume-title":"Elementary Inequalities","author":"D.S. Mitrinovi\u0107","year":"1964","unstructured":"Mitrinovi\u0107 D.S.: Elementary Inequalities. P. Noordhoff Ltd, Groningen (1964)"},{"key":"165_CR38","doi-asserted-by":"crossref","unstructured":"Mohsin, M., Cavin, D., Sasson, Y., Prakash, R., Schiper, A.: Reliable broadcast in wireless mobile ad hoc networks. In: Proceedings of the 39th Hawaii International Conference on System Sciences, p. 233 (2006)","DOI":"10.1109\/HICSS.2006.413"},{"key":"165_CR39","doi-asserted-by":"crossref","unstructured":"O\u2019Dell, R., Wattenhofer, R.: Information dissemination in highly dynamic graphs. In: Proceedings of the Workshop on Foundations of Mobile Computing, pp. 104\u2013110 (2005)","DOI":"10.1145\/1080810.1080828"},{"key":"165_CR40","doi-asserted-by":"crossref","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, NY, USA (2005)","DOI":"10.1145\/1080810.1080828"},{"key":"165_CR41","doi-asserted-by":"crossref","unstructured":"Pagani, E., Rossi, G.: Reliable broadcast in mobile multihop packet networks. In: Proceedings of the 3rd ACM Annual International Conference on Mobile Computing and Networking, pp. 34\u201342 (1997)","DOI":"10.1145\/262116.262125"},{"key":"165_CR42","doi-asserted-by":"crossref","unstructured":"Peleg, D., Radzik, T.: Time-efficient broadcast in radio networks. In: Koster, A.M.C.A., Mu\u00f1oz, X. (eds.) Graphs and Algorithms in Communication Networks, chapt. 12, pp. 315\u2013339. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-02250-0_12"},{"issue":"11","key":"165_CR43","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1109\/MCOM.2006.248176","volume":"44","author":"L. Pelusi","year":"2006","unstructured":"Pelusi L., Passarella A., Conti M.: Opportunistic networking: data forwarding in disconnected mobile ad hoc networks. Commun. Mag. IEEE 44(11), 134\u2013141 (2006)","journal-title":"Commun. Mag. IEEE"},{"key":"165_CR44","unstructured":"Prakash, R., Schiper, A., Mohsin, M., Cavin, D., Sasson, Y.: A lower bound for broadcasting in mobile ad hoc networks. Technical Report, Ecole Polytechnique Federale de Lausanne (2004)"},{"issue":"2","key":"165_CR45","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1145\/1024916.1024920","volume":"5","author":"L.G. Roberts","year":"1975","unstructured":"Roberts L.G.: Aloha packet system with and without slots and capture. Comput. Commun. Rev. 5(2), 28\u201342 (1975)","journal-title":"Comput. Commun. Rev."},{"issue":"1","key":"165_CR46","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1215\/ijm\/1255631807","volume":"6","author":"J.B. Rosser","year":"1962","unstructured":"Rosser J.B., Schoenfeld L.: Approximate formulas for some functions of prime numbers. Ill. J. Math. 6(1), 64\u201394 (1962)","journal-title":"Ill. J. Math."}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-012-0165-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-012-0165-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-012-0165-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,24]],"date-time":"2019-06-24T01:27:09Z","timestamp":1561339629000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-012-0165-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,22]]},"references-count":46,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,8]]}},"alternative-id":["165"],"URL":"https:\/\/doi.org\/10.1007\/s00446-012-0165-9","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,22]]}}}