{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T16:47:17Z","timestamp":1754153237511,"version":"3.41.2"},"reference-count":23,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[1987,5,1]],"date-time":"1987-05-01T00:00:00Z","timestamp":546825600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1987,5,1]],"date-time":"1987-05-01T00:00:00Z","timestamp":546825600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1987,5,1]],"date-time":"1987-05-01T00:00:00Z","timestamp":546825600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[1987,5]]},"DOI":"10.1109\/tc.1987.1676941","type":"journal-article","created":{"date-parts":[[2007,9,4]],"date-time":"2007-09-04T16:35:10Z","timestamp":1188923710000},"page":"562-569","source":"Crossref","is-referenced-by-count":0,"title":["A Scheduling-Function-Based Distributed Access Protocol that Uses CDM to Relay Control Information in a Network with Hidden Nodes"],"prefix":"10.1109","volume":"C-36","author":[{"family":"Gold","sequence":"first","affiliation":[{"name":"Department of Computer Science, Technion, Israel Institute of Technology"}]},{"family":"Franta","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"A correction algorithm for token-passing sequences in mobile communication networks","year":"1986","author":"gold","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1054048"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1978.11151"},{"journal-title":"Queuing Systems Vol 2 Computer Application","year":"1976","author":"kleinrock","key":"ref13"},{"key":"ref14","article-title":"optimal transmission radii for packetradio networks, or why six is a magic number","author":"kleinrock","year":"1978","journal-title":"Proc NTC"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/321832.321845"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1979.tb02239.x"},{"key":"ref17","first-page":"39","article-title":"a decentralized conflict-free protocol, gbram for large scale local networks","author":"liu","year":"1981","journal-title":"Proc Computer Networking Symp"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1977.1093905"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1982.1095533"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0376-5075(83)90061-2"},{"key":"ref3","article-title":"the operational performance of bram in a network with hidden nodes","author":"chlamtac","year":"1981","journal-title":"Proc Intl Conf Commun (ICC)"},{"key":"ref6","first-page":"5c.5.1","article-title":"n efficient scheduling-function for distributed multiplexing of a communication bus shared by a large number of users","author":"gold","year":"1982","journal-title":"Proc Intl Conf Commun (ICC)"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1983.1676198"},{"journal-title":"Collision-free multi-access with channel re-use","year":"0","author":"gold","key":"ref8"},{"journal-title":"An efficient collision-free protocol for prioritized access?control of cable or radio channels with arbitrary spatial node configurations Part III?Protocol for hidden nodes","year":"0","author":"gold","key":"ref7"},{"journal-title":"A description of the supervisory node broadcast recognizing access method (SUPBRAM)","year":"1978","author":"chlamtac","key":"ref2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1979.1094529"},{"journal-title":"Distributed algorithms for computing all internode distances and for constructing a minimum-weight spanning tree in a fully connected broadcast network","year":"1983","author":"gold","key":"ref9"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1980.11697"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1980.1094698"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1975.1092767"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/T-VT.1981.23873"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/12\/35264\/01676941.pdf?arnumber=1676941","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,22]],"date-time":"2025-07-22T18:02:41Z","timestamp":1753207361000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1676941\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,5]]},"references-count":23,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tc.1987.1676941","relation":{},"ISSN":["0018-9340","1557-9956","2326-3814"],"issn-type":[{"type":"print","value":"0018-9340"},{"type":"electronic","value":"1557-9956"},{"type":"electronic","value":"2326-3814"}],"subject":[],"published":{"date-parts":[[1987,5]]}}}