{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:46:27Z","timestamp":1725551187283},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540240761"},{"type":"electronic","value":"9783540305361"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30536-1_50","type":"book-chapter","created":{"date-parts":[[2010,3,31]],"date-time":"2010-03-31T19:31:39Z","timestamp":1270063899000},"page":"459-470","source":"Crossref","is-referenced-by-count":1,"title":["Broadcast and Gossiping Algorithms for Mobile Ad Hoc Networks Based on Breadth-First Traversal"],"prefix":"10.1007","author":[{"given":"Koushik","family":"Sinha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pradip K.","family":"Srimani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"50_CR1","unstructured":"Sinha, K.: Deterministic Broadcast and Gossiping in Ad hoc Networks, MS Thesis, Clemson University, South Carolina, USA (August 2003)"},{"key":"50_CR2","unstructured":"Sinha, K., Srimani, P.K.: Broadcast algorithms for mobile ad hoc networks based on depth-first traversal. In: Proc. Third International Workshop on Wireless Information Systems (WIS), Porto. Portugal, April 13-14, 2004, pp. 170\u2013177 (2004)"},{"key":"50_CR3","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. J. computer and System Sci.\u00a045, 104\u2013126 (1992)","journal-title":"J. computer and System Sci."},{"key":"50_CR4","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1109\/90.811446","volume":"7","author":"S. Basagni","year":"1999","unstructured":"Basagni, S., Bruschi, D., Chlamtac, I.: A mobility transparent deterministic broadcast mechanism for ad hoc networks. IEEE Trans. Networking\u00a07, 799\u2013807 (1999)","journal-title":"IEEE Trans. Networking"},{"key":"50_CR5","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1109\/26.79285","volume":"39","author":"I. Chlamtac","year":"1999","unstructured":"Chlamtac, I., Weinstein, O.: The wave expansion approach to broadcasting in multihop radio networks. IEEE Trans. Communications\u00a039, 426\u2013433 (1999)","journal-title":"IEEE Trans. Communications"},{"key":"50_CR6","unstructured":"Chlebus, B., Gasieniec, L., Gibbons, A., Pelc, A., Rytter, W.: Deterministic broadcasting in unknown radio networks. In: Proc. of SODA 2000, pp. 861\u2013870 (2000)"},{"key":"50_CR7","doi-asserted-by":"crossref","unstructured":"Chlebus, B., Gasieniec, L., Lingas, A., Pagourtzis, A.: Oblivious gossiping in ad hoc radio networks. In: Proc. 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM 2001), pp. 44\u201351 (2001)","DOI":"10.1145\/381448.381454"},{"key":"50_CR8","doi-asserted-by":"crossref","unstructured":"Chrobak, M., Gasieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. In: Proc. 41st IEEE Symp. Found. of Computer Science (FOCS 2000), pp. 575\u2013581 (2000)","DOI":"10.1109\/SFCS.2000.892325"},{"key":"50_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/3-540-44679-6_54","volume-title":"Computing and Combinatorics","author":"M. Chrobak","year":"2001","unstructured":"Chrobak, M., G\u0105sieniec, L., Rytter, W.: A randomized algorithm for gossiping in radio networks. In: Wang, J. (ed.) COCOON 2001. LNCS, vol.\u00a02108, pp. 483\u2013492. Springer, Heidelberg (2001)"},{"key":"50_CR10","doi-asserted-by":"crossref","unstructured":"Clementi, A.E.F., Monti, A., Silvestri, R.: Distributed multi-broadcast in unknown radio networks. In: Proc. 20th ACM Symp. on Principles of Distributed Computing (PODC 2001), pp. 255\u2013263 (2001)","DOI":"10.1145\/383962.384040"},{"key":"50_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1007\/3-540-44676-1_38","volume-title":"Algorithms - ESA 2001","author":"A.E.F. Clementi","year":"2001","unstructured":"Clementi, A.E.F., Monti, A., Silvestri, R.: Round robin is optimal for fault-tolerant broadcasting on wireless networks. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol.\u00a02161, pp. 452\u2013463. Springer, Heidelberg (2001)"},{"key":"50_CR12","doi-asserted-by":"crossref","unstructured":"Clementi, A.E.F., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting in unknown radio networks. In: Proc. 12th ACM-SIAM Symp. on Discrete Algorithms (SODA 2001), pp. 709\u2013718 (2001)","DOI":"10.1145\/383962.384040"},{"key":"50_CR13","unstructured":"Gaber, I., Mansour, Y.: Broadcast in radio networks. In: Proc. 6th Annual ACM-SIAM Symp. Discrete Algorithms, pp. 577\u2013585 (1995)"},{"key":"50_CR14","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S0020-0190(01)00312-X","volume":"83","author":"L. Gasieniec","year":"2002","unstructured":"Gasieniec, L., Lingas, A.: On adaptive deterministic gossiping in ad hoc radio networks. Information Processing Letters\u00a083, 89\u201393 (2002)","journal-title":"Information Processing Letters"},{"key":"50_CR15","unstructured":"Indyk, P.: Explicit constructions of selectors and related combinatorial structures, with applications. In: Proc. 13th ACM-SIAM Symp. on Discrete Algorithms (SODA 2002), pp. 697\u2013704 (2002)"},{"key":"50_CR16","first-page":"707","volume":"27","author":"E. Kushilevitz","year":"1998","unstructured":"Kushilevitz, E., Mansour, Y.: An $\\Omega(D\\log \\ n\/D)$ lower bound for broadcast in radio networks. SIAM J. Computing\u00a027, 707\u2013712 (1998)","journal-title":"SIAM J. Computing"},{"key":"50_CR17","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1109\/71.877833","volume":"11","author":"K. Nakano","year":"2000","unstructured":"Nakano, K., Olariu, S.: Randomized initialization protocols for ad-hoc networks. IEEE Trans. Parallel and Distributed Systems\u00a011, 749\u2013759 (2000)","journal-title":"IEEE Trans. Parallel and Distributed Systems"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing - IWDC 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30536-1_50.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T13:45:30Z","timestamp":1685540730000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30536-1_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540240761","9783540305361"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30536-1_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}