{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T23:09:46Z","timestamp":1725750586138},"publisher-location":"Berlin, Heidelberg","reference-count":33,"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_23","type":"book-chapter","created":{"date-parts":[[2013,10,3]],"date-time":"2013-10-03T14:55:48Z","timestamp":1380812148000},"page":"329-343","source":"Crossref","is-referenced-by-count":5,"title":["Frequency Hopping against a Powerful Adversary"],"prefix":"10.1007","author":[{"given":"Yuval","family":"Emek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roger","family":"Wattenhofer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1109\/18.119713","volume":"38","author":"N. Alon","year":"1992","unstructured":"Alon, N., Bruck, J., Naor, J., Naor, M., Roth, R.M.: Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. IEEE Transactions on Information Theory\u00a038, 509\u2013516 (1992)","journal-title":"IEEE Transactions on Information Theory"},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-642-22212-2_9","volume-title":"Structural Information and Communication Complexity","author":"L. Anantharamu","year":"2011","unstructured":"Anantharamu, L., Chlebus, B.S., Kowalski, D.R., Rokicki, M.A.: Medium access control for adversarial channels with jamming. In: Kosowski, A., Yamashita, M. (eds.) SIROCCO 2011. LNCS, vol.\u00a06796, pp. 89\u2013100. Springer, Heidelberg (2011)"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Richa, A., Scheideler, C.: A Jamming-Resistant MAC Protocol for Single-Hop Wireless Networks. In: Proc. 27th Symposium on Principles of Distributed Computing, PODC (2008)","DOI":"10.1145\/1400751.1400759"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1007\/978-3-642-23719-5_60","volume-title":"Algorithms \u2013 ESA 2011","author":"Y. Azar","year":"2011","unstructured":"Azar, Y., Gurel-Gurevich, O., Lubetzky, E., Moscibroda, T.: Optimal discovery strategies in white space networks. In: Demetrescu, C., Halld\u00f3rsson, M.M. (eds.) ESA 2011. LNCS, vol.\u00a06942, pp. 713\u2013722. Springer, Heidelberg (2011)"},{"issue":"3","key":"23_CR5","doi-asserted-by":"publisher","first-page":"1139","DOI":"10.1109\/TIT.2004.842708","volume":"51","author":"W. Chu","year":"2005","unstructured":"Chu, W., Colbourn, C.: Optimal frequency-hopping sequences via cyclotomy. IEEE Transactions on Information Theory\u00a051(3), 1139\u20131141 (2005)","journal-title":"IEEE Transactions on Information Theory"},{"key":"23_CR6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971446","volume-title":"Applied numerical linear algebra","author":"J.W. Demmel","year":"1997","unstructured":"Demmel, J.W.: Applied numerical linear algebra. Society for Industrial and Applied Mathematics, Philadelphia (1997)"},{"issue":"1","key":"23_CR7","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1214\/aoap\/1177005980","volume":"1","author":"P. Diaconis","year":"1991","unstructured":"Diaconis, P., Stroock, D.: Geometric Bounds for Eigenvalues of Markov Chains. The Annals of Applied Probability\u00a01(1), 36\u201361 (1991)","journal-title":"The Annals of Applied Probability"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Dolev, S., Gilbert, S., Guerraoui, R., Kuhn, F., Newport, C.: The wireless synchronization problem. In: Proceedings of the 28th ACM Symposium on Principles of Distributed Computing, PODC, New York, NY, USA, pp. 190\u2013199 (2009)","DOI":"10.1145\/1582716.1582749"},{"key":"23_CR9","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 (An Oblivious Approach to Coping With Malicious Interference). In: Pelc, A. (ed.) DISC 2007. LNCS, vol.\u00a04731, pp. 208\u2013222. Springer, Heidelberg (2007)"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Dolev, S., Gilbert, S., Guerraoui, R., Newport, C.: Secure Communication over Radio Channels. In: Proc. 27th ACM Symposium on Principles of Distributed Computing (PODC), pp. 105\u2013114 (2008)","DOI":"10.1145\/1400751.1400767"},{"key":"23_CR11","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.) DISC 2011. LNCS, vol.\u00a06950, pp. 252\u2013267. Springer, Heidelberg (2011)"},{"key":"23_CR12","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory, vol.\u00a07. Springer (2006)"},{"key":"23_CR13","unstructured":"Gilbert, S., Guerraoui, R., Newport, C.: Of Malicious Motes and Suspicious Sensors. In: Proc. 10th Conference on Principles of Distributed Systems, OPODIS (2006)"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Zuckerman, D.: How to recycle random bits. In: Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Washington, DC, USA, pp. 248\u2013253 (1989)","DOI":"10.1109\/SFCS.1989.63486"},{"issue":"1","key":"23_CR15","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1109\/18.817517","volume":"46","author":"R. Knopp","year":"2000","unstructured":"Knopp, R., Humblet, P.: On coding for block fading channels. IEEE Transactions on Information Theory\u00a046(1), 189\u2013205 (2000)","journal-title":"IEEE Transactions on Information Theory"},{"key":"23_CR16","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: Proc. 25th ACM Symposium on Principles of Distributed Computing, PODC (2006)","DOI":"10.1145\/1146381.1146420"},{"key":"23_CR17","unstructured":"K\u00f6ppel, S.: Bluetooth jamming. Bachelor\u2019s Thesis supervised by Michael K\u00f6nig and Roger Wattenhofer, ETH Zurich (2013)"},{"key":"23_CR18","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"A. Lubotzky","year":"1988","unstructured":"Lubotzky, A., Phillips, R., Sarnak, P.: Ramanujan graphs. Combinatorica\u00a08, 261\u2013277 (1988)","journal-title":"Combinatorica"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Mansour, I., Chalhoub, G., Quilliot, A.: Security architecture for wireless sensor networks using frequency hopping and public key management. In: ICNSC, pp. 526\u2013531. IEEE (2011)","DOI":"10.1109\/ICNSC.2011.5874890"},{"issue":"1","key":"23_CR20","first-page":"51","volume":"24","author":"G.A. Margulis","year":"1988","unstructured":"Margulis, G.A.: Explicit group-theoretic constructions of combinatorial schemes and their applications in the construction of expanders and concentrators. Problemy Peredachi Informatsii\u00a024(1), 51\u201360 (1988)","journal-title":"Problemy Peredachi Informatsii"},{"key":"23_CR21","unstructured":"Markey, H.K., Antheil, G.: Secret communication system, U.S. Patent 2292387 (1942)"},{"issue":"4","key":"23_CR22","doi-asserted-by":"publisher","first-page":"840","DOI":"10.1109\/18.992769","volume":"48","author":"M. Medard","year":"2002","unstructured":"Medard, M., Gallager, R.: Bandwidth scaling for fading multipath channels. IEEE Transactions on Information Theory\u00a048(4), 840\u2013852 (2002)","journal-title":"IEEE Transactions on Information Theory"},{"key":"23_CR23","doi-asserted-by":"crossref","unstructured":"Meier, D., Pignolet, Y.A., Schmid, S., Wattenhofer, R.: Speed Dating despite Jammers. In: 5th IEEE International Conference on Distributed Computing in Sensor Systems (DCOSS), Marina del Rey, California, USA (June 2009)","DOI":"10.1007\/978-3-642-02085-8_1"},{"issue":"4","key":"23_CR24","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1109\/98.788210","volume":"6","author":"J. Mitola","year":"1999","unstructured":"Mitola, J., Maguire, G.Q.: Cognitive radio: making software radios more personal. IEEE Personal Communications\u00a06(4), 13\u201318 (1999)","journal-title":"IEEE Personal Communications"},{"issue":"1","key":"23_CR25","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1006\/jctb.1994.1054","volume":"62","author":"M. Morgenstern","year":"1994","unstructured":"Morgenstern, M.: Existence and Explicit Constructions of q + 1 Regular Ramanujan Graphs for Every Prime Power q. Journal of Combinatorial Theory, Series B\u00a062(1), 44\u201362 (1994)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"23_CR26","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0012-365X(91)90112-F","volume":"91","author":"A. Nilli","year":"1991","unstructured":"Nilli, A.: On the second eigenvalue of a graph. Discrete Math.\u00a091, 207\u2013210 (1991)","journal-title":"Discrete Math."},{"key":"23_CR27","unstructured":"Project Ubertooth, \n                    \n                      http:\/\/ubertooth.sourceforge.net\/"},{"key":"23_CR28","doi-asserted-by":"crossref","unstructured":"Richa, A., Scheideler, C., Schmid, S., Zhang, J.: Competitive and fair medium access despite reactive jamming. In: 2011 31st International Conference on Distributed Computing Systems (ICDCS), pp. 507\u2013516 (June 2011)","DOI":"10.1109\/ICDCS.2011.8"},{"key":"23_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-642-15763-9_17","volume-title":"Distributed Computing","author":"A. Richa","year":"2010","unstructured":"Richa, A., Scheideler, C., Schmid, S., Zhang, J.: A jamming-resistant MAC protocol for multi-hop wireless networks. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol.\u00a06343, pp. 179\u2013193. Springer, Heidelberg (2010)"},{"key":"23_CR30","doi-asserted-by":"crossref","unstructured":"Richa, A., Scheideler, C., Schmid, S., Zhang, J.: Self-stabilizing leader election for single-hop wireless networks despite jamming. In: Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing. MobiHoc, New York, NY, USA (2011)","DOI":"10.1145\/2107502.2107522"},{"key":"23_CR31","unstructured":"Tesla, N.: Method of signaling, U.S. Patent 723188 (1903)"},{"key":"23_CR32","unstructured":"Tesla, N.: System of signaling, U.S. Patent 725605 (1903)"},{"key":"23_CR33","unstructured":"Zenneck, J.: Leitfaden der drahtlosen Telegraphie. Enke, Stuttgart, Germany (1909)"}],"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_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T18:33:34Z","timestamp":1558118014000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41527-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642415265","9783642415272"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41527-2_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}