{"title":"IEEE 802.11n网络中的联合紧急延迟调度和自适应聚合技术","authors":"Emna Charfi, L. Chaari, L. Kamoun","doi":"10.1109/COMNET.2015.7566637","DOIUrl":null,"url":null,"abstract":"The aggregation technique was defined by IEEE 802.11n, and used later by IEEE 802.11ac. This technique combines numerous packets into a single transmission. Hence, the throughput is improved since the overhead associated with each transmission is reduced. However, the delay is increased in the case of low rate application and large size of aggregated frame. In this paper, we propose new scheduling algorithm based on urgency delay and an adaptive frame aggregation technique to obtain an optimal trade-off between maximizing throughput and minimizing delay. Packets are scheduled based on Urgency Delay (UD) as well as Waiting Delay (WD). Packets having the lowest UD are firstly served to be included in the aggregated frame. Then, the payload size of aggregated frame will be adjusted based on the same metric of the first sub-frame. Simulation results prove that the serving delay and packet loss are widely reduced, and the average throughput is improved.","PeriodicalId":314139,"journal":{"name":"2015 5th International Conference on Communications and Networking (COMNET)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Joint Urgency Delay scheduler and adaptive aggregation technique in IEEE 802.11n networks\",\"authors\":\"Emna Charfi, L. Chaari, L. Kamoun\",\"doi\":\"10.1109/COMNET.2015.7566637\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The aggregation technique was defined by IEEE 802.11n, and used later by IEEE 802.11ac. This technique combines numerous packets into a single transmission. Hence, the throughput is improved since the overhead associated with each transmission is reduced. However, the delay is increased in the case of low rate application and large size of aggregated frame. In this paper, we propose new scheduling algorithm based on urgency delay and an adaptive frame aggregation technique to obtain an optimal trade-off between maximizing throughput and minimizing delay. Packets are scheduled based on Urgency Delay (UD) as well as Waiting Delay (WD). Packets having the lowest UD are firstly served to be included in the aggregated frame. Then, the payload size of aggregated frame will be adjusted based on the same metric of the first sub-frame. Simulation results prove that the serving delay and packet loss are widely reduced, and the average throughput is improved.\",\"PeriodicalId\":314139,\"journal\":{\"name\":\"2015 5th International Conference on Communications and Networking (COMNET)\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 5th International Conference on Communications and Networking (COMNET)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/COMNET.2015.7566637\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 5th International Conference on Communications and Networking (COMNET)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMNET.2015.7566637","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Joint Urgency Delay scheduler and adaptive aggregation technique in IEEE 802.11n networks
The aggregation technique was defined by IEEE 802.11n, and used later by IEEE 802.11ac. This technique combines numerous packets into a single transmission. Hence, the throughput is improved since the overhead associated with each transmission is reduced. However, the delay is increased in the case of low rate application and large size of aggregated frame. In this paper, we propose new scheduling algorithm based on urgency delay and an adaptive frame aggregation technique to obtain an optimal trade-off between maximizing throughput and minimizing delay. Packets are scheduled based on Urgency Delay (UD) as well as Waiting Delay (WD). Packets having the lowest UD are firstly served to be included in the aggregated frame. Then, the payload size of aggregated frame will be adjusted based on the same metric of the first sub-frame. Simulation results prove that the serving delay and packet loss are widely reduced, and the average throughput is improved.