{"title":"在有槽的Aloha中快速解决冲突，没有重传延迟","authors":"G. Thomas","doi":"10.1109/SARNOF.2007.4567376","DOIUrl":null,"url":null,"abstract":"A simple collision resolution algorithm is presented wherein a set of contending packets transmit randomly into a frame of n slots. Those packets involved in collisions retransmit in another n-slot frame, and so on till all originally contending packets achieve successful transmission. It is shown via a state space model that the algorithm attains a maximal throughput of 0.304 for the optimal frame length n=6. Delay analysis indicates reduction of average delays by a factor of seven or more relative to comparable Aloha systems.","PeriodicalId":293243,"journal":{"name":"2007 IEEE Sarnoff Symposium","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Rapid collision resolution in slotted Aloha without retransmission delays\",\"authors\":\"G. Thomas\",\"doi\":\"10.1109/SARNOF.2007.4567376\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A simple collision resolution algorithm is presented wherein a set of contending packets transmit randomly into a frame of n slots. Those packets involved in collisions retransmit in another n-slot frame, and so on till all originally contending packets achieve successful transmission. It is shown via a state space model that the algorithm attains a maximal throughput of 0.304 for the optimal frame length n=6. Delay analysis indicates reduction of average delays by a factor of seven or more relative to comparable Aloha systems.\",\"PeriodicalId\":293243,\"journal\":{\"name\":\"2007 IEEE Sarnoff Symposium\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE Sarnoff Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SARNOF.2007.4567376\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE Sarnoff Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SARNOF.2007.4567376","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Rapid collision resolution in slotted Aloha without retransmission delays
A simple collision resolution algorithm is presented wherein a set of contending packets transmit randomly into a frame of n slots. Those packets involved in collisions retransmit in another n-slot frame, and so on till all originally contending packets achieve successful transmission. It is shown via a state space model that the algorithm attains a maximal throughput of 0.304 for the optimal frame length n=6. Delay analysis indicates reduction of average delays by a factor of seven or more relative to comparable Aloha systems.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
