Efficient scheduling request algorithm for opportunistic wireless access
Type
Conference PaperKAUST Department
Communication Theory LabComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Electrical Engineering Program
Physical Science and Engineering (PSE) Division
Date
2011-08Permanent link to this record
http://hdl.handle.net/10754/564407
Metadata
Show full item recordAbstract
An efficient scheduling request algorithm for opportunistic wireless access based on user grouping is proposed in this paper. Similar to the well-known opportunistic splitting algorithm, the proposed algorithm initially adjusts (or lowers) the threshold during a guard period if no user sends a scheduling request. However, if multiple users make requests simultaneously and therefore a collision occurs, the proposed algorithm no longer updates the threshold but narrows down the user search space by splitting the users into multiple groups iteratively, whereas the opportunistic splitting algorithm keeps adjusting the threshold until a single user is found. Since the threshold is only updated when no user sends a request, it is shown that the proposed algorithm significantly alleviates the burden of the signaling for the threshold distribution to the users by the scheduler. More importantly, the proposed algorithm requires a less number of mini-slots to make a user selection given a certain scheduling outage probability. © 2011 IEEE.Citation
Nam, H., & Alouini, M.-S. (2011). Efficient scheduling request algorithm for opportunistic wireless access. 2011 IEEE MTT-S International Microwave Workshop Series on Intelligent Radio for Future Personal Terminals. doi:10.1109/imws2.2011.6027178Conference/Event name
2011 IEEE MTT-S International Microwave Workshop Series on Intelligent Radio for Future Personal Terminals, IMWS-IRFPT 2011ISBN
9781457709630ae974a485f413a2113503eed53cd6c53
10.1109/IMWS2.2011.6027178