J. Garcia-Luna-Aceves, Dylan Cirimelli-Low, N. Mashhadi
{"title":"ALOHA与队列共享","authors":"J. Garcia-Luna-Aceves, Dylan Cirimelli-Low, N. Mashhadi","doi":"10.1109/MASS50613.2020.00031","DOIUrl":null,"url":null,"abstract":"ALOHA with Queue Sharing (ALOHA-QS) maintains most of the simplicity of ALOHA with priority acknowledgments (ACK) and attains the high throughput of transmission scheduling methods that require clock synchronization. Channel access with ALOHA-QS consists of a sequence of queue cycles, with each cycle having one or multiple collision-free transmissions by nodes that have joined the transmission queue and a single request turn to join the queue. The signaling of ALOHA-QS entails adding to packet headers the size of the shared queue, the position of the sending node in the queue, a bit indicating the end of transmissions by the transmitting node, and a bit stating whether or not a new node joined the queue successfully. The throughput of ALOHA-QS is compared with the throughput of TDMA with a fixed transmission schedule, ALOHA with priority ACK’s, and CSMA with priority ACK’s analytically and by simulation.","PeriodicalId":105795,"journal":{"name":"2020 IEEE 17th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"ALOHA with Queue Sharing\",\"authors\":\"J. Garcia-Luna-Aceves, Dylan Cirimelli-Low, N. Mashhadi\",\"doi\":\"10.1109/MASS50613.2020.00031\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"ALOHA with Queue Sharing (ALOHA-QS) maintains most of the simplicity of ALOHA with priority acknowledgments (ACK) and attains the high throughput of transmission scheduling methods that require clock synchronization. Channel access with ALOHA-QS consists of a sequence of queue cycles, with each cycle having one or multiple collision-free transmissions by nodes that have joined the transmission queue and a single request turn to join the queue. The signaling of ALOHA-QS entails adding to packet headers the size of the shared queue, the position of the sending node in the queue, a bit indicating the end of transmissions by the transmitting node, and a bit stating whether or not a new node joined the queue successfully. The throughput of ALOHA-QS is compared with the throughput of TDMA with a fixed transmission schedule, ALOHA with priority ACK’s, and CSMA with priority ACK’s analytically and by simulation.\",\"PeriodicalId\":105795,\"journal\":{\"name\":\"2020 IEEE 17th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE 17th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MASS50613.2020.00031\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 17th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MASS50613.2020.00031","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
ALOHA with Queue Sharing (ALOHA-QS) maintains most of the simplicity of ALOHA with priority acknowledgments (ACK) and attains the high throughput of transmission scheduling methods that require clock synchronization. Channel access with ALOHA-QS consists of a sequence of queue cycles, with each cycle having one or multiple collision-free transmissions by nodes that have joined the transmission queue and a single request turn to join the queue. The signaling of ALOHA-QS entails adding to packet headers the size of the shared queue, the position of the sending node in the queue, a bit indicating the end of transmissions by the transmitting node, and a bit stating whether or not a new node joined the queue successfully. The throughput of ALOHA-QS is compared with the throughput of TDMA with a fixed transmission schedule, ALOHA with priority ACK’s, and CSMA with priority ACK’s analytically and by simulation.