{"title":"GPRS无线网络中的资源分配","authors":"A. Tripathi, K. Sivarajan","doi":"10.1109/ICPWC.2000.905843","DOIUrl":null,"url":null,"abstract":"We have proposed two algorithms for the fixed and the dynamic channel allocation schemes in GPRS. We started with a simple channel allocation problem in GPRS and showed that it is closely related to the one-dimensional standard bin packing problem. We used two online bin packing algorithms, namely the first fit (FF) and the best fit (BF) algorithms, for channel allocation and obtained their performance for single slot operation, multislot operation and also for a realistic case with multislot class 21 MS. We have also analysed the fixed channel allocation, single slot operation case and analytical results are found to compare favourably with the results from simulations.","PeriodicalId":260472,"journal":{"name":"2000 IEEE International Conference on Personal Wireless Communications. Conference Proceedings (Cat. No.00TH8488)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Resource allocation in GPRS wireless networks\",\"authors\":\"A. Tripathi, K. Sivarajan\",\"doi\":\"10.1109/ICPWC.2000.905843\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We have proposed two algorithms for the fixed and the dynamic channel allocation schemes in GPRS. We started with a simple channel allocation problem in GPRS and showed that it is closely related to the one-dimensional standard bin packing problem. We used two online bin packing algorithms, namely the first fit (FF) and the best fit (BF) algorithms, for channel allocation and obtained their performance for single slot operation, multislot operation and also for a realistic case with multislot class 21 MS. We have also analysed the fixed channel allocation, single slot operation case and analytical results are found to compare favourably with the results from simulations.\",\"PeriodicalId\":260472,\"journal\":{\"name\":\"2000 IEEE International Conference on Personal Wireless Communications. Conference Proceedings (Cat. No.00TH8488)\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-12-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2000 IEEE International Conference on Personal Wireless Communications. Conference Proceedings (Cat. No.00TH8488)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPWC.2000.905843\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2000 IEEE International Conference on Personal Wireless Communications. Conference Proceedings (Cat. No.00TH8488)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPWC.2000.905843","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We have proposed two algorithms for the fixed and the dynamic channel allocation schemes in GPRS. We started with a simple channel allocation problem in GPRS and showed that it is closely related to the one-dimensional standard bin packing problem. We used two online bin packing algorithms, namely the first fit (FF) and the best fit (BF) algorithms, for channel allocation and obtained their performance for single slot operation, multislot operation and also for a realistic case with multislot class 21 MS. We have also analysed the fixed channel allocation, single slot operation case and analytical results are found to compare favourably with the results from simulations.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
