{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T16:11:02Z","timestamp":1698336662949},"reference-count":11,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2010,9,7]],"date-time":"2010-09-07T00:00:00Z","timestamp":1283817600000},"content-version":"vor","delay-in-days":6093,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Trans Emerging Tel Tech"],"published-print":{"date-parts":[[1994,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper we study the performance of tree\u2010like splitting collision resolution algorithms in channels with markovian capture. In particular, we assume that in each slot the channel can be in one of two states \u2010<jats:italic>b<\/jats:italic> (for \u201cbad\u201d) and <jats:italic>g<\/jats:italic> (for \u201cgood\u201d). When the channel is in state <jats:italic>b<\/jats:italic>, a capture can never occur. When the channel is in state <jats:italic>g<\/jats:italic> and <jats:italic>n<\/jats:italic> nodes (n \u2265 2) are transmitting, a capture occurs with probability \u03c0<jats:sub>n<\/jats:sub>. The sequence of channel states is assumed to be a homogeneous Markov chain. We derive the throughput of a splitting tree\u2010like multiple access algorithm for this channel. We also provide simulation results for the average delay.<\/jats:p>","DOI":"10.1002\/ett.4460050108","type":"journal-article","created":{"date-parts":[[2010,9,14]],"date-time":"2010-09-14T19:01:19Z","timestamp":1284490879000},"page":"19-26","source":"Crossref","is-referenced-by-count":3,"title":["Splitting algorithms in channels with markovian capture"],"prefix":"10.1002","volume":"5","author":[{"given":"Matan","family":"Seri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moshe","family":"Sidi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2010,9,7]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056093"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1985.1096302"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/26.1452"},{"key":"e_1_2_1_5_2","unstructured":"R. G.Gallager:Conflict resolution in random access broadcast networks.\u201cIn Proc. AFOSR Workshop Commun. Theory Appl. Provincetown\u201d Ma. Sept. 17\u201320 1978 p.74\u201376."},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.42218"},{"key":"e_1_2_1_7_2","unstructured":"Y.Gong M.Paterakis:A robust random multiple\u2010access algorithm for packet transmissions over noisy channels with error memory.Preprint."},{"key":"e_1_2_1_8_2","first-page":"259","article-title":"Free synchronous packet access in a broadcast channel with feedback","volume":"14","author":"Tsybakov B. S.","year":"1978","journal-title":"\u201cProb. Inform. Trans.\u201d"},{"key":"e_1_2_1_9_2","article-title":"Stack algorithms in broadcast channel with capture","volume":"27","author":"Tsybakov B. S.","year":"1991","journal-title":"\u201cProb. Inform. Trans.\u201d"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057019"},{"key":"e_1_2_1_11_2","first-page":"73","volume-title":"Collision resolution algorithms and random access communications.","author":"Massey J. L.","year":"1981"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-3402-9"}],"container-title":["European Transactions on Telecommunications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fett.4460050108","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/ett.4460050108","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T06:00:40Z","timestamp":1698213640000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/ett.4460050108"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["10.1002\/ett.4460050108"],"URL":"https:\/\/doi.org\/10.1002\/ett.4460050108","archive":["Portico"],"relation":{},"ISSN":["1124-318X","1541-8251"],"issn-type":[{"value":"1124-318X","type":"print"},{"value":"1541-8251","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,1]]}}}