{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T10:04:02Z","timestamp":1760522642317},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[1985]]},"DOI":"10.1109\/tcom.1985.1096261","type":"journal-article","created":{"date-parts":[[2008,6,19]],"date-time":"2008-06-19T15:17:54Z","timestamp":1213888674000},"page":"145-151","source":"Crossref","is-referenced-by-count":91,"title":["A Class of Efficient Contention Resolution Algorithms for Multiple Access Channels"],"prefix":"10.1109","volume":"33","author":[{"given":"J.","family":"Mosely","sequence":"first","affiliation":[]},{"given":"P.","family":"Humblet","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"74","article-title":"Conflict resolution in random access broadcast networks","author":"gallager","year":"1978","journal-title":"Proc AFOSR Workshop Commun Theory AppL"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1978.1094204"},{"key":"ref12","author":"capetanakis","year":"1977","journal-title":"The multiple access broadcast channel Protocol and capacity considerations"},{"key":"ref13","author":"towsley","year":"1981","journal-title":"An application of group testing to the design of multi-user access protocols"},{"key":"ref14","author":"mosely","year":"1982","journal-title":"A class of efficient contention resolution algorithms for multiple access channels"},{"key":"ref15","author":"howard","year":"1960","journal-title":"Dynamic Programming and Markov Processes"},{"key":"ref16","author":"mosely","year":"1979","journal-title":"An efficient contention resolution algorithm for multiple access channels"},{"key":"ref17","author":"hajek","year":"1981","journal-title":"Hitting time and occupation time bounds implied by drift analysis with applications"},{"key":"ref18","author":"cruz","year":"1982","journal-title":"Protocols for multi-access channels with continuous entry and noisy feedback"},{"key":"ref19","author":"ryter","year":"1980","journal-title":"A Conflict Resolution Algorithm for Noisy Multiaccess Channels"},{"key":"ref4","first-page":"7.2.1","article-title":"An optimal adaptive scheme for multiple access broadcast communication","author":"kleinrock","year":"1978","journal-title":"Proc Int Conf Commun"},{"key":"ref27","article-title":"Nonoptimality of the part-and-try algorithm","author":"vvedenskaya","year":"1983","journal-title":"Abstracts of Papers Int Workshop Convolutional Codes and Multi-User Communication"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/360248.360253"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1978.1101729"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1975.1092814"},{"key":"ref26a","article-title":"An upper bound to capacity of random multiple access systems","author":"tsybakov","year":"1981","journal-title":"Symp Inf Theory"},{"key":"ref8","article-title":"A minimum principle for dynamic teams","author":"varaiya","year":"1978","journal-title":"Proc 2nd Kingston Conf Differential Games and Control Theory"},{"key":"ref26b","first-page":"90","volume":"17","year":"1981","journal-title":"Probl Peredach Inform"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1979.1102142"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1975.1092768"},{"key":"ref9","first-page":"65","article-title":"Random multiple packet access: Part-and-try algorithm","volume":"16","author":"tsybakov","year":"1980","journal-title":"Probi Peredach Inform"},{"key":"ref1","author":"roberts","year":"1972","journal-title":"Aloha packet system with and without slots and capture"},{"key":"ref20","first-page":"73","author":"massey","year":"1981","journal-title":"Multi-user Communications (CISM Courses and Lectures No 265)"},{"key":"ref22","doi-asserted-by":"crossref","DOI":"10.21236\/ADA086655","author":"humblet","year":"1980","journal-title":"Bounds on the utilization of ALOHA-like multiple-access broadcast channels"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056332"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056509"},{"key":"ref23","first-page":"20.3.1","article-title":"Data communication and information theory","author":"humblet","year":"1980","journal-title":"Proc Nat Telecommun Conf"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056510"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/26\/23992\/01096261.pdf?arnumber=1096261","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T15:42:02Z","timestamp":1638200522000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1096261\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"references-count":28,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tcom.1985.1096261","relation":{},"ISSN":["0090-6778"],"issn-type":[{"value":"0090-6778","type":"print"}],"subject":[],"published":{"date-parts":[[1985]]}}}