{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T00:09:21Z","timestamp":1758845361459},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540751410"},{"type":"electronic","value":"9783540751427"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75142-7_18","type":"book-chapter","created":{"date-parts":[[2007,9,5]],"date-time":"2007-09-05T10:00:46Z","timestamp":1188986446000},"page":"208-222","source":"Crossref","is-referenced-by-count":27,"title":["Gossiping in a Multi-channel Radio Network"],"prefix":"10.1007","author":[{"given":"Shlomi","family":"Dolev","sequence":"first","affiliation":[]},{"given":"Seth","family":"Gilbert","sequence":"additional","affiliation":[]},{"given":"Rachid","family":"Guerraoui","sequence":"additional","affiliation":[]},{"given":"Calvin","family":"Newport","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Koo, C.Y.: Broadcast in radio networks tolerating byzantine adversarial behaviour. In: PODC. Proceedings of the 23rd Symposium on Principles of Distributed Computing, pp. 275\u2013282 (2004)","DOI":"10.1145\/1011767.1011807"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Bhandari, V., Vaidya, N.H.: On reliable broadcast in a radio network. In: PODC. Proceedings of the 24th Symposium on Principles of Distributed Computing, pp. 138\u2013147 (2005)","DOI":"10.1145\/1073814.1073841"},{"key":"18_CR3","unstructured":"Bhandari, V., Vaidya, N.H.: On reliable broadcast in a radio network: A simplified characterization. Technical report, University of Illinois at Urbana-Champaign (May 2005)"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Pelc, A., Peleg, D.: Feasibility and complexity of broadcasting with random transmission failures. In: PODC. Proceedings of the 24th Symposium on Principles of Distributed Computing, pp. 334\u2013341 (2005)","DOI":"10.1145\/1073814.1073879"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Bhandari, V., Vaidya, N.H.: Reliable broadcast in wireless networks with probabilistic failures. In: Infocom. Proceedings of the 26th Conference on Computer Communications, pp. 715\u2013723 (2007)","DOI":"10.1109\/INFCOM.2007.89"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/11945529_16","volume-title":"Principles of Distributed Systems","author":"S. Gilbert","year":"2006","unstructured":"Gilbert, S., Guerraoui, R., Newport, C.: Of malicious motes and suspicious sensors: On the efficiency of malicious interference in wireless networks. In: Shvartsman, A.A. (ed.) OPODIS 2006. LNCS, vol.\u00a04305, pp. 215\u2013229. Springer, Heidelberg (2006)"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Koo, C.Y., Bhandari, V., Katz, J., Vaidya, N.H.: Reliable broadcast in radio networks: The bounded collision case. In: PODC. Proceedings of the 25th Symposium on Principles of Distributed Computing, pp. 258\u2013264 (2006)","DOI":"10.1145\/1146381.1146420"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Kyasanur, P., Vaidya, N.H.: Capacity of multi-channel wireless networks: Impact of number of channels and interfaces. In: Mobicom. Proceedings of the 11th Annual International Conference on Mobile Computing and Networking, pp. 43\u201357 (2005)","DOI":"10.1145\/1080829.1080835"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Bhandari, V., Vaidya, N.H.: Connectivity and capacity of multi-channel wireless networks with channel switching constraints. Technical report, University of Illinois at Urbana-Champaign (January 2007)","DOI":"10.21236\/ADA486514"},{"key":"18_CR10","unstructured":"Mitola, J.: Cognitive Radio: An Integrated Agent Architecture for Software Defined Radio. PhD thesis, Royal Institute of Technology, Sweden (2000)"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/11864219_49","volume-title":"Distributed Computing","author":"S. Krishnamurthy","year":"2006","unstructured":"Krishnamurthy, S., Chandrasekaran, R., Mittal, N., Venkatesan, S.: Brief announcement: Synchronous distributed algorithms for node discovery and configuration in multi-channel cognitive radio networks. In: Dolev, S. (ed.) DISC 2006. LNCS, vol.\u00a04167, pp. 572\u2013574. Springer, Heidelberg (2006)"},{"key":"18_CR12","unstructured":"Krishnamurthy, S., Thoppian, M., Kuppa, S., Chanrasekaran, R., Venkatesan, S., Mittal, N., Prakash, R.: Time-efficient layer-2 auto-configuration for cognitive radios. In: PDCS. Procedings of the International Conference on Parallel and Distributed Systems, pp. 459\u2013464 (2005)"},{"issue":"2","key":"18_CR13","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/0022-0000(91)90015-W","volume":"43","author":"N. Alon","year":"1992","unstructured":"Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: A lower bound for radio broadcast. Journal of Computer and System Sciences\u00a043(2), 290\u2013298 (1992)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"18_CR14","doi-asserted-by":"publisher","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. Journal of Computer and System Sciences\u00a045(1), 104\u2013126 (1992)","journal-title":"Journal of Computer and System Sciences"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. In: FOCS. Proceedings of the 44th Symposium on Foundations of Computer Science, pp. 492\u2013501 (2003)","DOI":"10.1109\/SFCS.2003.1238222"},{"issue":"4","key":"18_CR16","doi-asserted-by":"publisher","first-page":"870","DOI":"10.1137\/S0097539702419339","volume":"33","author":"D.R. Kowalski","year":"2004","unstructured":"Kowalski, D.R., Pelc, A.: Time of deterministic broadcasting in radio networks with local knowledge. SIAM Journal on Computing\u00a033(4), 870\u2013891 (2004)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"18_CR17","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0405025","volume":"5","author":"K. Diks","year":"1992","unstructured":"Diks, K., Pelc, A.: Almost safe gossiping in bounded degree networks. SIAM Journal on Discrete Mathematics\u00a05(3), 338\u2013344 (1992)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1","key":"18_CR18","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1006\/jagm.2000.1147","volume":"39","author":"E. Kranakis","year":"2001","unstructured":"Kranakis, E., Krizanc, D., Pelc, A.: Fault-tolerant broadcasting in radio networks. Journal of Algorithms\u00a039(1), 47\u201367 (2001)","journal-title":"Journal of Algorithms"},{"key":"18_CR19","unstructured":"Tur\u00e1n, P.: On an extremal problem in graph theory. Matematicko Fizicki Lapok\u00a048 (1941)"},{"issue":"2","key":"18_CR20","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1109\/TIT.1985.1057020","volume":"31","author":"J. Komlos","year":"1985","unstructured":"Komlos, J., Greenberg, A.: An asymptotically fast non-adaptive algorithm for conflict resolution in multiple access channels. Transactions on Information Theory\u00a031(2), 302\u2013306 (1985)","journal-title":"Transactions on Information Theory"},{"issue":"5","key":"18_CR21","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/S0097539703428002","volume":"34","author":"A.D. Bonis","year":"2005","unstructured":"Bonis, A.D., Gasieniec, L., Vaccaro, U.: Optimal two-stage algorithms for group testing problems. SIAM Journal on Computing\u00a034(5), 1253\u20131270 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"18_CR22","unstructured":"Indyk, P.: Explicit constructions of selectors and related combinatorial structures, with applications. In: SODA. Proceedings of the 13th Symposium on Discrete Algorithms, pp. 697\u2013704 (2002)"},{"key":"18_CR23","first-page":"5","volume":"16","author":"D. Caen de","year":"1983","unstructured":"de Caen, D.: Extension of a theorem of Moon and Moser on complete subgraphs. Ars Combinatoria\u00a016, 5\u201310 (1983)","journal-title":"Ars Combinatoria"},{"issue":"2","key":"18_CR24","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BF01929486","volume":"11","author":"A.F. Sidorenko","year":"1995","unstructured":"Sidorenko, A.F.: What we know and what we do not know about Tur\u00e1n numbers. Graphs and Combinatorics\u00a011(2), 179\u2013199 (1995)","journal-title":"Graphs and Combinatorics"},{"key":"18_CR25","doi-asserted-by":"crossref","unstructured":"Miller, M.J., Vaidya, N.H.: Leveraging channel diversity for key establishment in wireless sensor networks. Technical report, U. of Illinois at Urbana-Champaign (December 2005)","DOI":"10.1109\/INFOCOM.2006.259"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75142-7_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:52:36Z","timestamp":1619506356000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75142-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540751410","9783540751427"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75142-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}