Research Article
Modeling and Performance Analysis of Channel Assembling Based on Ps-rc Strategy with Priority Queues in CRNs
Algorithm 1
Polling scheduling strategy with reserved channels.
(A) Priority support stage | 1: Start | 2: Determine the number of idle channels | 3: If | 4: Give service to the ongoing until all reach the upper bound | 5: Then give service to the ongoing until all reach the upper bound | 6: Else give service to the in | 7: End if | (B) Polling stage | 8: Start | 9: Determine the number of idle channels | 10: If is not empty | 11: Divide the free channels into and & channels go back to (A). | 12: If & channels go back to (A). | 13: Then channels give service to in | 14: Else waiting in the queue & channels give service to | 15: End if | 16: Else channels go back to (A). | 17: End if (polling stage is over. The marked release the channel after completing the service.) |
|