Samar Sindian, Ayman Khalil, A. Samhat, M. Crussiére, J. Hélard
{"title":"Admission control and resource allocation in IEEE 802.15.5 HDR WPAN","authors":"Samar Sindian, Ayman Khalil, A. Samhat, M. Crussiére, J. Hélard","doi":"10.1109/NOF.2014.7119781","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a novel admission control and centralized channel time allocation algorithm for two-hop communications based on the IEEE 802.15.5 specifications. The first contribution is the introduction of a dynamic superframe size for efficient resource utilization. The second contribution adopts the use of a threshold concept and a flag metric, which jointly provide satisfaction and fairness among the requesting devices. The performance of the proposed algorithm is evaluated and the results show that the proposed approach achieves good performance in terms of satisfaction and fairness.","PeriodicalId":435905,"journal":{"name":"2014 International Conference and Workshop on the Network of the Future (NOF)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference and Workshop on the Network of the Future (NOF)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NOF.2014.7119781","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, we propose a novel admission control and centralized channel time allocation algorithm for two-hop communications based on the IEEE 802.15.5 specifications. The first contribution is the introduction of a dynamic superframe size for efficient resource utilization. The second contribution adopts the use of a threshold concept and a flag metric, which jointly provide satisfaction and fairness among the requesting devices. The performance of the proposed algorithm is evaluated and the results show that the proposed approach achieves good performance in terms of satisfaction and fairness.