Resource allocation in GPRS wireless networks

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.