{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T21:34:35Z","timestamp":1725831275503},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662486528"},{"type":"electronic","value":"9783662486535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48653-5_38","type":"book-chapter","created":{"date-parts":[[2015,10,2]],"date-time":"2015-10-02T18:46:01Z","timestamp":1443811561000},"page":"573-587","source":"Crossref","is-referenced-by-count":1,"title":["Tight Bounds for MIS in Multichannel Radio Networks"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"Daum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabian","family":"Kuhn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,5]]},"reference":[{"key":"38_CR1","unstructured":"802.11, I.: Wireless LAN MAC and Physical Layer Specifications, March 2012"},{"key":"38_CR2","unstructured":"Alliance, Z.: Zigbee specification. ZigBee Document 053474r06 1 (2005)"},{"key":"38_CR3","doi-asserted-by":"crossref","unstructured":"Alon, N., Babai, L., Itai, A.: A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem. Journal of Algorithms (1986)","DOI":"10.1016\/0196-6774(86)90019-2"},{"issue":"1","key":"38_CR4","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 45(1), 104\u2013126 (1992)","journal-title":"Journal of Computer and System Sciences"},{"key":"38_CR5","unstructured":"Bluetooth Consortium: Bluetooth Specification Version 4.2, December 2014"},{"key":"38_CR6","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 Distr. Comp. (PODC), pp. 79\u201388 (2011)","DOI":"10.1145\/1993806.1993818"},{"issue":"12","key":"38_CR7","doi-asserted-by":"publisher","first-page":"1240","DOI":"10.1109\/TCOM.1985.1096245","volume":"33","author":"I Chlamtac","year":"1985","unstructured":"Chlamtac, I., Kutten, S.: On Broadcasting in Radio Networks-Problem Analysis and Protocol Design. IEEE Transactions on Communications 33(12), 1240\u20131246 (1985)","journal-title":"IEEE Transactions on Communications"},{"key":"38_CR8","doi-asserted-by":"crossref","unstructured":"Daum, S., Ghaffari, M., Gilbert, S., Kuhn, F., Newport, C.: Maximal independent sets in multichannel radio networks. In: Proc. ACM Symp. on Principles of Distr. Comp. (PODC) (2013)","DOI":"10.1145\/2484239.2484257"},{"key":"38_CR9","doi-asserted-by":"crossref","unstructured":"Daum, S., Ghaffari, M., Gilbert, S., Kuhn, F., Newport, C.: Maximal Independent Sets in Multichannel Radio Networks. Tech. Rep. 275, U. of Freiburg, Dept. of Computer Sc. (2013)","DOI":"10.1145\/2484239.2484257"},{"key":"38_CR10","doi-asserted-by":"crossref","unstructured":"Daum, S., Gilbert, S., Kuhn, F., Newport, C.: Leader election in shared spectrum networks. In: Proc. ACM Symp. on Principles of Distr. Comp. (PODC) (2012)","DOI":"10.1145\/2332432.2332470"},{"key":"38_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-642-33651-5_17","volume-title":"Distributed Computing","author":"S Daum","year":"2012","unstructured":"Daum, S., Kuhn, F., Newport, C.: Efficient symmetry breaking in multi-channel radio networks. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol. 7611, pp. 238\u2013252. Springer, Heidelberg (2012)"},{"key":"38_CR12","doi-asserted-by":"crossref","unstructured":"Daum, S., Kuhn, F., Newport, C.: Efficient Symmetry Breaking in Multi-Channel Radio Networks. Tech. Rep. 271, U. of Freiburg, Dept. of Computer Science (2012)","DOI":"10.1007\/978-3-642-33651-5_17"},{"key":"38_CR13","unstructured":"Daum, S., Kuhn, F.: Tight Bounds for MIS in Multichannel Radio Networks (2015). CoRR abs\/1508.04390. \n                    http:\/\/arxiv.org\/abs\/1508.04390"},{"key":"38_CR14","doi-asserted-by":"crossref","unstructured":"Dolev, S., Gilbert, S., Guerraoui, R., Kuhn, F., Newport, C.: The wireless synchronization problem. In: Proc. ACM Symp. on Principles of Distr. Comp. (PODC), pp. 190\u2013199 (2009)","DOI":"10.1145\/1582716.1582749"},{"key":"38_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-642-24100-0_25","volume-title":"Distributed Computing","author":"S Dolev","year":"2011","unstructured":"Dolev, S., Gilbert, S., Khabbazian, M., Newport, C.: Leveraging channel diversity to gain efficiency and robustness for wireless broadcast. In: Peleg, D. (ed.) Distributed Computing. LNCS, vol. 6950, pp. 252\u2013267. Springer, Heidelberg (2011)"},{"key":"38_CR16","doi-asserted-by":"crossref","unstructured":"Dolev, S., Gilbert, S., Guerraoui, R., Kowalski, D.R., Newport, C., Kuhn, F., Lynch, N.: Reliable distributed computations on unreliable radio channels. In: Proc. MobiHoc \n                    \n                      \n                    \n                    $$S^3$$\n                   Workshop (2009)","DOI":"10.1145\/1540358.1540360"},{"key":"38_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-540-75142-7_18","volume-title":"Distributed Computing","author":"S Dolev","year":"2007","unstructured":"Dolev, S., Gilbert, S., Guerraoui, R., Newport, C.: Gossiping in a multi-channel radio network. In: Pelc, A. (ed.) DISC 2007. LNCS, vol. 4731, pp. 208\u2013222. Springer, Heidelberg (2007)"},{"key":"38_CR18","doi-asserted-by":"crossref","unstructured":"Dolev, S., Gilbert, S., Guerraoui, R., Newport, C.: Secure communication over radio channels. In: Proc. ACM Symp. on Principles of Distr. Comp. (PODC) (2008)","DOI":"10.1145\/1400751.1400767"},{"key":"38_CR19","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1109\/PROC.1987.13705","volume":"75","author":"A Ephremides","year":"1987","unstructured":"Ephremides, A., Wieselthier, J.E., Baker, D.J.: A Design Concept for Reliable Mobile Radio Networks with Frequency Hopping Signaling. Proc. of the IEEE 75, 56\u201373 (1987)","journal-title":"Proc. of the IEEE"},{"key":"38_CR20","doi-asserted-by":"crossref","unstructured":"Gilbert, S., Guerraoui, R., Kowalski, D., Newport, C.: Interference-resilient information exchange. In: Proc. IEEE Conf. on Computer Communications (INFOCOM) (2009)","DOI":"10.1109\/INFCOM.2009.5062150"},{"key":"38_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/11561927_21","volume-title":"Distributed Computing","author":"F Kuhn","year":"2005","unstructured":"Kuhn, F., Moscibroda, T., Nieberg, T., Wattenhofer, R.: Fast deterministic distributed maximal independent set computation on growth-bounded graphs. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 273\u2013287. Springer, Heidelberg (2005)"},{"issue":"4","key":"38_CR22","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1137\/0215074","volume":"15","author":"M Luby","year":"1986","unstructured":"Luby, M.: A Simple Parallel Algorithm for the Maximal Independent Set Problem. SIAM Journal on Computing 15(4), 1036\u20131053 (1986)","journal-title":"SIAM Journal on Computing"},{"key":"38_CR23","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Wattenhofer, R.: Maximal independent sets in radio networks. In: Proc. ACM Symp. on Principles of Distr. Comp. (PODC), pp. 148\u2013157 (2005)","DOI":"10.1145\/1073814.1073842"},{"key":"38_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1007\/978-3-662-45174-8_18","volume-title":"Distributed Computing","author":"C Newport","year":"2014","unstructured":"Newport, C.: Radio network lower bounds made easy. In: Kuhn, F. (ed.) DISC 2014. LNCS, vol. 8784, pp. 258\u2013272. Springer, Heidelberg (2014)"},{"key":"38_CR25","doi-asserted-by":"crossref","unstructured":"Schmid, S., Wattenhofer, R.: Algorithmic models for sensor networks. In: Proc. Workshop on Parallel and Distributed Real-Time Systmes (WPDRTS), pp. 1\u201311 (2006)","DOI":"10.1109\/IPDPS.2006.1639417"},{"key":"38_CR26","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 Distr. Comp. (PODC), pp. 35\u201344 (2008)","DOI":"10.1145\/1400751.1400758"},{"issue":"7","key":"38_CR27","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1109\/MCOM.2008.4557045","volume":"46","author":"M Sherman","year":"2008","unstructured":"Sherman, M., Mody, A., Martinez, R., Rodriguez, C., Reddy, R.: IEEE Standards Supporting Cognitive Radio and Networks, Dynamic Spectrum Access, and Coexistence. IEEE Communications Magazine 46(7), 72\u201379 (2008)","journal-title":"IEEE Communications Magazine"},{"key":"38_CR28","doi-asserted-by":"crossref","unstructured":"Strasser, M., P\u00f6pper, C., Capkun, S.: Efficient uncoordinated FHSS anti-jamming communication. In: Proc. ACM Symp. on Mobile Ad Hoc Netw. and Comp. (MOBIHOC) (2009)","DOI":"10.1145\/1530748.1530778"},{"key":"38_CR29","doi-asserted-by":"crossref","unstructured":"Strasser, M., P\u00f6pper, C., Capkun, S., Cagalj, M.: Jamming-resistant key establishment using uncoordinated frequency hopping. In: Proc. IEEE Symp. on Sec. and Privacy (S&P) (2008)","DOI":"10.1109\/SP.2008.9"},{"key":"38_CR30","doi-asserted-by":"crossref","unstructured":"Wan, P.J., Alzoubi, K.M., Frieder, O.: Distributed construction of connected dominating set in wireless Ad Hoc networks. In: Proc. IEEE Conf. on Computer Communications (INFOCOM) (2002)","DOI":"10.1109\/JCN.2002.6596929"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48653-5_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T23:28:03Z","timestamp":1559258883000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48653-5_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662486528","9783662486535"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48653-5_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}