{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T18:40:49Z","timestamp":1773081649305,"version":"3.50.1"},"reference-count":11,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[1986,4,1]],"date-time":"1986-04-01T00:00:00Z","timestamp":512697600000},"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":[[1986,4]]},"DOI":"10.1109\/tcom.1986.1096539","type":"journal-article","created":{"date-parts":[[2004,4,29]],"date-time":"2004-04-29T00:29:18Z","timestamp":1083198558000},"page":"345-347","source":"Crossref","is-referenced-by-count":26,"title":["On the Throughput of Channel Access Algorithms with Limited Sensing"],"prefix":"10.1109","volume":"34","author":[{"given":"P.","family":"Humblet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057013"},{"key":"ref3","doi-asserted-by":"crossref","DOI":"10.21236\/ADA153869","author":"georgiadis","year":"1985","journal-title":"A 0 487 throughput limited sensing algorithm"},{"key":"ref10","first-page":"65","article-title":"Random multiple packet access: Part-and-try algorithm","volume":"16","author":"tsybakov","year":"1980","journal-title":"Probl Peredachi Inform"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1985.1096261"},{"key":"ref11","article-title":"Some new random access protocols","author":"tsybakov","year":"1985","journal-title":"IEEE Int Symp Inform Theory"},{"key":"ref5","first-page":"90","article-title":"Upper bound for the capacity of a random multiple access system","volume":"17","author":"mikhailov","year":"1981","journal-title":"Probl Peredachi Inform"},{"key":"ref8","article-title":"Q-ary part-and-try algorithm for packet conflict resolution","author":"studer","year":"1984","journal-title":"Inst Telecommun Swiss Fed Inst Technol"},{"key":"ref7","author":"ryter","year":"1980","journal-title":"A Conflict Resolution Algorithm for Noisy Multiaccess Channels"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057018"},{"key":"ref9","first-page":"80","article-title":"Random multiple-access stack algorithm","volume":"16","author":"tsybakov","year":"1980","journal-title":"Probl Peredachi Inform"},{"key":"ref1","first-page":"74","article-title":"Conflict resolution in random access broadcast networks","author":"gallager","year":"1978","journal-title":"Proc AFOSR Workshop Commun Theory AppL"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/26\/24006\/01096539.pdf?arnumber=1096539","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:42:08Z","timestamp":1638218528000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1096539\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,4]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1986,4]]}},"URL":"https:\/\/doi.org\/10.1109\/tcom.1986.1096539","relation":{},"ISSN":["0096-2244"],"issn-type":[{"value":"0096-2244","type":"print"}],"subject":[],"published":{"date-parts":[[1986,4]]}}}