Dynamic spectrum access with preemption in open spectrum wireless networks

Analytical formulations of dynamic spectrum access (DSA) with and without preemption for two radio systems are presented. The DSA without preemption model is solved explicitly using a two-dimensional Markov chain while the DSA with preemption models are 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 number of frequency channels are evaluated. Numerical results illustrate that higher gain in airtime and zero blocking probability for the prioritized radio system are achieved through preemption of the non-prioritized radio system¿s frequency channels.

[1]  Ying-Chang Liang,et al.  Dynamic Spectrum Access with Imperfect Sensing in Open Spectrum Wireless Networks , 2008, 2008 IEEE Wireless Communications and Networking Conference.

[2]  William H. Press,et al.  Numerical recipes in C , 2002 .

[3]  Ying-Chang Liang,et al.  Dynamic Spectrum Access with Virtual Partitioning in Open Spectrum Wireless Networks , 2008, VTC Spring 2008 - IEEE Vehicular Technology Conference.

[4]  Ying-Chang Liang,et al.  Complete sharing dynamic spectrum allocation for two cellular radio systems , 2008, 2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications.

[5]  Sem C. Borst,et al.  Virtual partitioning for robust resource sharing: computational techniques for heterogeneous traffic , 1998, IEEE J. Sel. Areas Commun..

[6]  Rajarathnam Chandramouli,et al.  Dynamic spectrum access in open spectrum wireless networks , 2006, IEEE Journal on Selected Areas in Communications.

[7]  Keith W. Ross,et al.  Multiservice Loss Models for Broadband Telecommunication Networks , 1997 .