{"title":"捕获环境的随机访问算法","authors":"D. Lyons, P. Papantoni-Kazakos","doi":"10.1109/ICC.1988.13556","DOIUrl":null,"url":null,"abstract":"The authors consider packet radio environments with capture, such that, given simultaneous transmission of k packets, a single packet is captured with probability pq/sup k-1/, where 1/3<p<or=1 and O<or=p<1. They assume ternary feedback broadcast per slot, and in the presence of capture, identification of the captured packet by all the users in the system. They also assume that a successfully received single transmission can not be distinguished from a capture in the presence of multiple transmissions. For the above environment, in conjunction with errorless feedback channel and absence of propagation delays in the feedback, the authors propose and analyze a simple full-feedback-sensing-window random-access algorithm. They compare the performance of their algorithm with an appropriate modification of the Capetanakis dynamic algorithm. The proposed algorithm demonstrates superior delay and throughput performance.<<ETX>>","PeriodicalId":191242,"journal":{"name":"IEEE International Conference on Communications, - Spanning the Universe.","volume":"88 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A random access algorithm for capture environments\",\"authors\":\"D. Lyons, P. Papantoni-Kazakos\",\"doi\":\"10.1109/ICC.1988.13556\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors consider packet radio environments with capture, such that, given simultaneous transmission of k packets, a single packet is captured with probability pq/sup k-1/, where 1/3<p<or=1 and O<or=p<1. They assume ternary feedback broadcast per slot, and in the presence of capture, identification of the captured packet by all the users in the system. They also assume that a successfully received single transmission can not be distinguished from a capture in the presence of multiple transmissions. For the above environment, in conjunction with errorless feedback channel and absence of propagation delays in the feedback, the authors propose and analyze a simple full-feedback-sensing-window random-access algorithm. They compare the performance of their algorithm with an appropriate modification of the Capetanakis dynamic algorithm. The proposed algorithm demonstrates superior delay and throughput performance.<<ETX>>\",\"PeriodicalId\":191242,\"journal\":{\"name\":\"IEEE International Conference on Communications, - Spanning the Universe.\",\"volume\":\"88 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-06-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE International Conference on Communications, - Spanning the Universe.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICC.1988.13556\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE International Conference on Communications, - Spanning the Universe.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC.1988.13556","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A random access algorithm for capture environments
The authors consider packet radio environments with capture, such that, given simultaneous transmission of k packets, a single packet is captured with probability pq/sup k-1/, where 1/3>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
