Dynamic Spectrum Access with Virtual Partitioning in Open Spectrum Wireless Networks

Analytical formulations of dynamic spectrum access (DSA) with complete partitioning (CP), complete sharing (CS) and virtual partitioning (VP) for two radio systems are presented. The DSA with CP and CS models are solved explicitly using two one-dimensional Markov chains and a two-dimensional Markov chain, respectively, while the DSA with virtual partitioning model is solved numerically using a two-dimensional Markov chain. Grades of service (GoSs) like system airtime, blocking probabilities and preemption probabilities are considered. The performance of these GoS measures and the effect of the size of the nominal number of frequency channels for DSA with VP are evaluated. Numerical results illustrate that the advantages of DSA with VP as compared with DSA with CP and DSA with CS.