{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:11:38Z","timestamp":1743149498652,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319035772"},{"type":"electronic","value":"9783319035789"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03578-9_20","type":"book-chapter","created":{"date-parts":[[2013,11,8]],"date-time":"2013-11-08T08:52:11Z","timestamp":1383900731000},"page":"237-248","source":"Crossref","is-referenced-by-count":2,"title":["Broadcasting in Ad Hoc Multiple Access Channels"],"prefix":"10.1007","author":[{"given":"Lakshmi","family":"Anantharamu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bogdan S.","family":"Chlebus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"20_CR1","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1109\/TIT.1987.1057295","volume":"33","author":"D.J. Aldous","year":"1987","unstructured":"Aldous, D.J.: Ultimate instability of exponential back-off protocol for acknowledgment-based transmission control of random access communication channels. IEEE Transactions on Information Theory\u00a033(2), 219\u2013223 (1987)","journal-title":"IEEE Transactions on Information Theory"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Anantharamu, L., Chlebus, B.S., Kowalski, D.R., Rokicki, M.A.: Deterministic broadcast on multiple access channels. In: Proceedings of the 29th IEEE International Conference on Computer Communications (INFOCOM), pp. 1\u20135 (2010)","DOI":"10.1109\/INFCOM.2010.5462256"},{"key":"20_CR3","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-642-10877-8_15","volume-title":"Principles of Distributed Systems","author":"L. Anantharamu","year":"2009","unstructured":"Anantharamu, L., Chlebus, B.S., Rokicki, M.A.: Adversarial multiple access channel with individual injection rates. In: Abdelzaher, T., Raynal, M., Santoro, N. (eds.) Principles of Distributed Systems. LNCS, vol.\u00a05923, pp. 174\u2013188. Springer, Heidelberg (2009)"},{"key":"20_CR4","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)"},{"issue":"1","key":"20_CR5","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/363647.363677","volume":"48","author":"M. Andrews","year":"2001","unstructured":"Andrews, M., Awerbuch, B., Fern\u00e1ndez, A., Leighton, F.T., Liu, Z., Kleinberg, J.M.: Universal-stability results and performance bounds for greedy contention-resolution protocols. Journal of the ACM\u00a048(1), 39\u201369 (2001)","journal-title":"Journal of the ACM"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Farach-Colton, M., He, S., Kuszmaul, B.C., Leiserson, C.E.: Adversarial contention resolution for simple channels. In: Proceedings of the 17th Annual ACM Symposium on Parallel Algorithms (SPAA), pp. 325\u2013332 (2005)","DOI":"10.1145\/1073970.1074023"},{"key":"20_CR7","unstructured":"Bie\u0144kowski, M., Klonowski, M., Korzeniowski, M., Kowalski, D.R.: Dynamic sharing of a multiple access channel. In: Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS), Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik. Leibniz International Proceedings in Informatics, vol.\u00a05, pp. 83\u201394 (2010)"},{"issue":"1","key":"20_CR8","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/363647.363659","volume":"48","author":"A. Borodin","year":"2001","unstructured":"Borodin, A., Kleinberg, J.M., Raghavan, P., Sudan, M., Williamson, D.P.: Adversarial queuing theory. Journal of the ACM\u00a048(1), 13\u201338 (2001)","journal-title":"Journal of the ACM"},{"issue":"2","key":"20_CR9","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s00446-009-0086-4","volume":"22","author":"B.S. Chlebus","year":"2009","unstructured":"Chlebus, B.S., Kowalski, D.R., Rokicki, M.A.: Maximum throughput of multiple access channels in adversarial environments. Distributed Computing\u00a022(2), 93\u2013116 (2009)","journal-title":"Distributed Computing"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Chlebus, B.S., Kowalski, D.R., Rokicki, M.A.: Adversarial queuing on the multiple access channel. ACM Transactions on Algorithms\u00a08(1), 5:1\u20135:31 (2012)","DOI":"10.1145\/2071379.2071384"},{"issue":"7","key":"20_CR11","doi-asserted-by":"publisher","first-page":"1092","DOI":"10.1109\/TPDS.2010.162","volume":"22","author":"J. Czy\u017aowicz","year":"2011","unstructured":"Czy\u017aowicz, J., G\u0105sieniec, L., Kowalski, D.R., Pelc, A.: Consensus and mutual exclusion in a multiple access channel. EEE Transaction on Parallel and Distributed Systems\u00a022(7), 1092\u20131104 (2011)","journal-title":"EEE Transaction on Parallel and Distributed Systems"},{"issue":"2","key":"20_CR12","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/TIT.1985.1057022","volume":"31","author":"R.G. Gallager","year":"1985","unstructured":"Gallager, R.G.: A perspective on multiaccess channels. IEEE Transactions on Information Theory\u00a031(2), 124\u2013142 (1985)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"20_CR13","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1137\/S0097539700381851","volume":"33","author":"L.A. Goldberg","year":"2004","unstructured":"Goldberg, L.A., Jerrum, M., Kannan, S., Paterson, M.: A bound on the capacity of backoff and acknowledgment-based protocols. SIAM Journal on Computing\u00a033(2), 313\u2013331 (2004)","journal-title":"SIAM Journal on Computing"},{"issue":"6","key":"20_CR14","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.1145\/355541.355567","volume":"47","author":"L.A. Goldberg","year":"2000","unstructured":"Goldberg, L.A., MacKenzie, P.D., Paterson, M., Srinivasan, A.: Contention resolution with constant expected delay. Journal of the ACM\u00a047(6), 1048\u20131096 (2000)","journal-title":"Journal of the ACM"},{"issue":"3","key":"20_CR15","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1145\/3828.214125","volume":"32","author":"A.G. Greenberg","year":"1985","unstructured":"Greenberg, A.G., Winograd, S.: A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels. Journal of the ACM\u00a032(3), 589\u2013596 (1985)","journal-title":"Journal of the ACM"},{"issue":"4","key":"20_CR16","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1137\/S0097539792233828","volume":"25","author":"J. H\u00e5stad","year":"1996","unstructured":"H\u00e5stad, J., Leighton, F.T., Rogoff, B.: Analysis of backoff protocols for multiple access channels. SIAM Journal on Computing\u00a025(4), 740\u2013774 (1996)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"20_CR17","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1109\/TIT.1985.1057020","volume":"31","author":"J. Koml\u00f3s","year":"1985","unstructured":"Koml\u00f3s, J., Greenberg, A.G.: An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels. IEEE Transactions on Information Theory\u00a031(2), 302\u2013306 (1985)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"7","key":"20_CR18","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1145\/360248.360253","volume":"19","author":"R.M. Metcalfe","year":"1976","unstructured":"Metcalfe, R.M., Boggs, D.R.: Ethernet: Distributed packet switching for local computer networks. Communications of the ACM\u00a019(7), 395\u2013404 (1976)","journal-title":"Communications of the ACM"},{"issue":"2","key":"20_CR19","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1137\/S0097539795285333","volume":"28","author":"P. Raghavan","year":"1998","unstructured":"Raghavan, P., Upfal, E.: Stochastic contention resolution with short delays. SIAM Journal on Computing\u00a028(2), 709\u2013719 (1998)","journal-title":"SIAM Journal on Computing"},{"issue":"6","key":"20_CR20","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1007\/s00224-006-1248-4","volume":"39","author":"A. Ros\u00e9n","year":"2006","unstructured":"Ros\u00e9n, A., Tsirkin, M.S.: On delivery times in packet networks under adversarial traffic. Theory of Computing Systems\u00a039(6), 805\u2013827 (2006)","journal-title":"Theory of Computing Systems"},{"issue":"3","key":"20_CR21","first-page":"64","volume":"23","author":"B.S. Tsybakov","year":"1987","unstructured":"Tsybakov, B.S., Likhanov, N.B.: Upper bound on the capacity of a random multiple-access system. Problemy Peredachi Informatsii\u00a023(3), 64\u201378 (1987)","journal-title":"Problemy Peredachi Informatsii"},{"issue":"4","key":"20_CR22","first-page":"301","volume":"15","author":"B.S. Tsybakov","year":"1979","unstructured":"Tsybakov, B.S., Mikhailov, V.A.: Ergodicity of a slotted ALOHA system. Problemy Peredachi Informatsii\u00a015(4), 301\u2013312 (1979)","journal-title":"Problemy Peredachi Informatsii"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03578-9_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T00:16:23Z","timestamp":1558656983000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03578-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319035772","9783319035789"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03578-9_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}