{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:24:06Z","timestamp":1742977446960,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":18,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_210","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:35:05Z","timestamp":1214505305000},"page":"466-468","source":"Crossref","is-referenced-by-count":0,"title":["Local Computation in Unstructured Radio Networks"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Moscibroda","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"210_CR1_210","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\u00a0Lower Bound for Radio Broadcast. J.\u00a0Comput. Syst. Sci. 43, 290\u2013298 (1991)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"210_CR2_210","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 radio networks: an exponential gap between determinism randomization. In: Proc. 6th Symposium on Principles of Distributed Computing (PODC), pp.\u00a098\u2013108 (1987)","journal-title":"J. Comput. Syst. Sci."},{"key":"210_CR3_210","doi-asserted-by":"crossref","unstructured":"Busch, R., Magdon-Ismail, M., Sivrikaya, F., Yener, B.: Contention\u2010Free MAC Protocols for Wireless Sensor Networks. In: Proc. 18th Annual Conference on Distributed Computing (DISC) (2004)","DOI":"10.1007\/978-3-540-30186-8_18"},{"key":"210_CR4_210","unstructured":"Chrobak, M., Ga\u0327sieniec, L., Kowalski, D.: The Wake-Up Problem in Multi-Hop Radio Networks. In: Proc. of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.\u00a0992\u20131000 (2004)"},{"key":"210_CR5_210","doi-asserted-by":"crossref","unstructured":"Farach-Colton, M., Fernandes, R.J., Mosteiro, M.A.: Bootstrapping a\u00a0Hop-Optimal Network in the Weak Sensor Model. In: Proc. of the 13th European Symposium on Algorithms (ESA), pp.\u00a0827\u2013838 (2005)","DOI":"10.1007\/11561071_73"},{"key":"210_CR6_210","doi-asserted-by":"crossref","unstructured":"Farach-Colton, M., Fernandes, R.J., Mosteiro, M.A.: Lower Bounds for Clear Transmissions in Radio Networks. In: Proc. of the 7th Latin American Symposium on Theoretical Informatics (LATIN), pp.\u00a0447\u2013454 (2006)","DOI":"10.1007\/11682462_42"},{"key":"210_CR7_210","doi-asserted-by":"crossref","unstructured":"Gandhi, R., Parthasarathy, S.: Distributed Algorithms for Coloring and Connected Domination in Wireless Ad Hoc Networks. In: Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pp.\u00a0447\u2013459 (2004)","DOI":"10.1007\/978-3-540-30538-5_37"},{"key":"210_CR8_210","doi-asserted-by":"crossref","unstructured":"Ga\u0327sieniec, L., Pelc, A., Peleg, D.: The Wakeup Problem in Synchronous Broadcast Systems (Extended Abstract). In: Proc. of the 19th ACM Symposium on Principles of Distributed Computing (PODC), pp.\u00a0113\u2013121 (2000)","DOI":"10.1145\/343477.343529"},{"key":"210_CR9_210","doi-asserted-by":"crossref","unstructured":"Jurdzi\u0144ski, T., Stachowiak, G.: Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks. In: Proc. of the 13th Annual International Symposium on Algorithms and Computation (ISAAC), pp.\u00a0535\u2013549 (2002)","DOI":"10.1007\/3-540-36136-7_47"},{"key":"210_CR10_210","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: Initializing Newly Deployed Ad Hoc and Sensor Networks. In: Proc. of the 10th Annual International Conference on Mobile Computing and Networking (MOBICOM), pp.\u00a0260\u2013274 (2004)","DOI":"10.1145\/1023720.1023746"},{"key":"210_CR11_210","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: What Cannot Be Computed Locally! In: Proceedings of 23rd Annual Symposium on Principles of Distributed Computing (PODC), pp.\u00a0300\u2013309 (2004)","DOI":"10.1145\/1011767.1011811"},{"issue":"1","key":"210_CR12_210","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0221015","volume":"21","author":"N. Linial","year":"1992","unstructured":"Linial, N.: Locality in Distributed Graph Algorithms. SIAM J. Comput. 21(1), 193\u2013201 (1992)","journal-title":"SIAM J. Comput."},{"key":"210_CR13_210","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1137\/0215074","volume":"15","author":"M. Luby","year":"1986","unstructured":"Luby, M.: A\u00a0Simple Parallel Algorithm for the Maximal Independent Set Problem. SIAM J. Comput. 15, 1036\u20131053 (1986)","journal-title":"SIAM J. Comput."},{"key":"210_CR14_210","doi-asserted-by":"crossref","unstructured":"McGlynn, M.J., Borbash, S.A.: Birthday Protocols for Low Energy Deployment and Flexible Neighborhood Discovery in Ad Hoc Wireless Networks. In: Proc. of the 2nd ACM Int. Symposium on Mobile Ad Hoc Networking & Computing (MOBIHOC), (2001)","DOI":"10.1145\/501416.501435"},{"key":"210_CR15_210","unstructured":"Moscibroda, T.: Locality, Scheduling, and Selfishness: Algorithmic Foundations of Highly Decentralized Networks. Doctoral Thesis Nr. 16740, ETH Zurich (2006)"},{"key":"210_CR16_210","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., von Rickenbach, P., Wattenhofer, R.: Analyzing the Energy-Latency Trade-off during the Deployment of Sensor Networks. In: Proc. of the 25th Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), (2006)","DOI":"10.1109\/INFOCOM.2006.295"},{"key":"210_CR17_210","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Wattenhofer, R.: Coloring Unstructured Radio Networks. In: Proc. of the 17th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp.\u00a039\u201348 (2005)","DOI":"10.1145\/1073970.1073977"},{"key":"210_CR18_210","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Wattenhofer, R.: Maximal Independent Sets in Radio Networks. In: Proc. of the 23rd ACM Symposium on Principles of Distributed Computing (PODC), pp.\u00a0148\u2013157 (2005)","DOI":"10.1145\/1073814.1073842"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_210","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T03:13:39Z","timestamp":1662174819000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_210"}},"subtitle":["2005; Moscibroda, Wattenhofer"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_210","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}