{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T15:29:48Z","timestamp":1759937388028},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642415265"},{"type":"electronic","value":"9783642415272"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41527-2_25","type":"book-chapter","created":{"date-parts":[[2013,10,3]],"date-time":"2013-10-03T10:55:48Z","timestamp":1380797748000},"page":"358-372","source":"Crossref","is-referenced-by-count":40,"title":["Broadcast in the Ad Hoc SINR Model"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"Daum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seth","family":"Gilbert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabian","family":"Kuhn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Calvin","family":"Newport","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"25_CR1","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/0022-0000(91)90015-W","volume":"43","author":"N. Alon","year":"1991","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 (1991)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"25_CR2","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":"25_CR3","doi-asserted-by":"crossref","unstructured":"Censor-Hillel, K., Gilbert, S., Kuhn, F., Lynch, N., Newport, C.: Structuring Unreliable Radio Networks. In: Proc. ACM Symp. on Principles of Distributed Computing (PODC), pp. 79\u201388 (2011)","DOI":"10.1145\/1993806.1993818"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.jalgor.2004.08.001","volume":"60","author":"A. Czumaj","year":"2006","unstructured":"Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. Journal of Algorithms\u00a060, 115\u2013143 (2006)","journal-title":"Journal of Algorithms"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Daum, S., Gilbert, S., Kuhn, F., Newport, C.: Broadcast in the Ad Hoc SINR Model. Technical Report 274, University of Freiburg, Dept. of Computer Science (2013)","DOI":"10.1007\/978-3-642-41527-2_25"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Goussevskaia, O., Wattenhofer, R., Halldorsson, M.M., Welzl, E.: Capacity of Arbitrary Wireless Networks. In: Proc. IEEE Int. Conf. on Computer Communications (2009)","DOI":"10.1109\/INFCOM.2009.5062108"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Halldorsson, M.M., Mitra, P.: Towards Tight Bounds for Local Broadcasting. In: Proc.Int. Workshop on the Foundations of Mobile Computing. ACM (2012)","DOI":"10.1145\/2335470.2335472"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Halldorsson, M.M., Mitra, P.: Wireless Connectivity and Capacity. In: Proc. ACM-SIAM Symp. on Discrete Algorithms, SODA (2012)","DOI":"10.1137\/1.9781611973099.44"},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/978-3-642-33651-5_8","volume-title":"Distributed Computing","author":"T. Jurdzinski","year":"2012","unstructured":"Jurdzinski, T., Kowalski, D.R.: Distributed Backbone Structure for Algorithms in the SINR Model of Wireless Networks. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol.\u00a07611, pp. 106\u2013120. Springer, Heidelberg (2012)"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-642-40164-0_20","volume-title":"Fundamentals of Computation Theory","author":"T. Jurdzinski","year":"2013","unstructured":"Jurdzinski, T., Kowalski, D.R., Stachowiak, G.: Distributed Deterministic Broadcasting in Uniform-Power Ad Hoc Wireless Networks. In: G\u0105sieniec, L., Wolter, F. (eds.) FCT 2013. LNCS, vol.\u00a08070, pp. 195\u2013209. Springer, Heidelberg (2013)"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Kesselheim, T.: A Constant-Factor Approximation for Wireless Capacity Maximization with Power Control in the SINR Model. In: Proc. ACM-SIAM Symp. on Discrete Algorithms, SODA (2011)","DOI":"10.1137\/1.9781611973082.120"},{"issue":"1","key":"25_CR12","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s00446-005-0126-7","volume":"18","author":"D.R. Kowalski","year":"2005","unstructured":"Kowalski, D.R., Pelc, A.: Broadcasting in Undirected Ad Hoc Radio Networks. Distributed Computing\u00a018(1), 43\u201357 (2005)","journal-title":"Distributed Computing"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Lynch, N., Newport, C., Oshman, R., Richa, A.: Broadcasting in Radio Networks with Unreliable Communication. In: Proc. ACM Symp. on Principles of Distributed Computing, PODC (2010)","DOI":"10.1145\/1835698.1835779"},{"issue":"3","key":"25_CR14","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1137\/S0097539794279109","volume":"27","author":"E. Kushilevitz","year":"1998","unstructured":"Kushilevitz, E., Mansour, Y.: An \u03a9(Dlog(N\/D)) Lower Bound for Broadcast in Radio Networks. SIAM Journal on Computing\u00a027(3), 702\u2013712 (1998)","journal-title":"SIAM Journal on Computing"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Moscibroda, T.: The Worst-Case Capacity of Wireless Sensor Networks. In: Proc. ACM\/IEEE Int. Conf. on Information Processing in Sensor Networks, IPSN (2007)","DOI":"10.1145\/1236360.1236362"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Wattenhofer, R.: Maximal Independent Sets In Radio Networks. In: Proc. ACM Symp. on Principles of Distributed Computing (PODC), pp. 148\u2013157 (2005)","DOI":"10.1145\/1073814.1073842"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Wattenhofer, R.: The Complexity of Connectivity in Wireless Networks. In: Proc. IEEE Int. Conf. on Computer Communications (2006)","DOI":"10.1109\/INFOCOM.2006.23"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Newport, C.: Brief Announcement: A Shorter and Stronger Proof of an \u03a9(Dlog(n\/D)) Lower Bound on Broadcast in Radio Networks. In: Proc. ACM Symp. on Principles of Distributed Computing, PODC (2013)","DOI":"10.1145\/2484239.2484284"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Scheideler, C., Richa, A., Santi, P.: An O(log n) Dominating Set Protocol for Wireless Ad-Hoc Networks under the Physical Interference Model. In: Proc. ACM Int. Symp. on Mobile Ad Hoc Networking and Computing (2008)","DOI":"10.1145\/1374618.1374632"},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Schneider, J., Wattenhofer, R.: A Log-Star Distributed Maximal Independent Set Algorithm for Growth-Bounded Graphs. In: Proc. ACM Symp. on Principles of Distributed Computing (PODC), pp. 35\u201344 (2008)","DOI":"10.1145\/1400751.1400758"},{"key":"25_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-642-31104-8_10","volume-title":"Structural Information and Communication Complexity","author":"D. Yu","year":"2012","unstructured":"Yu, D., Hua, Q.-S., Wang, Y., Tan, H., Lau, F.C.M.: Distributed Multiple-Message Broadcast in Wireless Ad-Hoc Networks Under the SINR Model. In: Even, G., Halld\u00f3rsson, M.M. (eds.) SIROCCO 2012. LNCS, vol.\u00a07355, pp. 111\u2013122. Springer, Heidelberg (2012)"},{"key":"25_CR22","doi-asserted-by":"crossref","unstructured":"Yu, D., Hua, Q.-S., Wang, Y., Lau, F.C.M.: An O(log n) Distributed Approximation Algorithm for Local Broadcasting in Unstructured Wireless Networks. In: Proc. IEEE Int. Conf. on Distributed Computing in Sensor Systems (DCOSS), pp. 132\u2013139 (2012)","DOI":"10.1109\/DCOSS.2012.39"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41527-2_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T14:42:29Z","timestamp":1558104149000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41527-2_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642415265","9783642415272"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41527-2_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}