Browse > Article
http://dx.doi.org/10.7858/eamj.2011.27.1.023

PERFORMANCE OF MYOPIC POLICY FOR OPPORTUNISTIC SPECTRUM SHARING  

Lee, Yu-Tae (Department of Information and Communication Engineering Dongeui University)
Publication Information
East Asian mathematical journal / v.27, no.1, 2011 , pp. 23-33 More about this Journal
Abstract
Due to underutilization of spectrum under current inefficient and static spectrum management policy, various kinds of opportunistic spectrum access (OSA) strategies have appeared. Myopic policy is a simple and robust OSA strategy with reduced complexity that maximizes immediate throughput. In this paper, we propose mathematical models to evaluate the throughput and the MAC delay of a myopic policy under saturation tra c conditions. Using the MAC delay distribution, we evaluate the packet delay of secondary users under nonsaturation conditions. Numerical results are given to show the performance of the myopic policy in cognitive radio networks.
Keywords
Queueing theory; opportunistic spectrum access; myopic policy;
Citations & Related Records
연도 인용수 순위
  • Reference
1 M. M. Rashid, Md. J. Hossain, E. Hossain, and V. K. Bhargava, Opportunistic spectrum access in cognitive radio networks: a queueing analytic model and admission controller design, Proc. IEEE GLOBECOM 2007 (2007), 4647-4652.
2 A. Sabharwal, A. Khoshnevis, and E. Knightly, Opportunistic spectral usage: bounds and a multi-band CSMA/CA protocol, IEEE/ACM Transactions on Networking (2007), 533-545.
3 Shared Spectrum Company, Reports on spectrum occupancy measurements, http://www.sharedspectrum.com/measurements/recent.html.
4 M. Vilimpoc and M. McHenry, Dupont circle spectrum utilization during peak hours, http://www.newamerica.net/files/archive/Doc_File_183_1.pdf, 2006.
5 Q. Zhao, B. Krishnamachari, and K. Liu, On myopic sensing for multi-channel opportunistic access: structure, optimality, and performance, IEEE Trans. Wireless Communications 7 (2008), no. 12.
6 M. Zorzi, R. Rao, and L. Milstein, Error statistics in data transmission over fading channels, IEEE Trans. Commun. 46 (1998), 1468-1477.   DOI   ScienceOn
7 Y. Lee, Discrete-time $Geo^X/G/1$ queue with preemptive resume priority, Mathematical and Computer Modelling 34 (2001), 243-250.   DOI   ScienceOn
8 Y. Lee, Performance of secondary users in opportunistic spectrum access, Electronics Letters 44 (2008), no. 16, 981-983.   DOI   ScienceOn
9 Y. Lee and K.-S. Lee, Discrete-time $Geo^X/G/1$ queue with preemptive repeat different priority, Queueing Systems 44 (2003), no. 4, 399-411.   DOI   ScienceOn
10 J. Mitola, The software radio architecture, IEEE Commun. Mag. 33 (1995), 26-38.
11 J. Mitola, Cognitive radio for flexible mobile multimedia communications, Proc. IEEE International Workshop on Mobile Multimedia Communications (1999), 3-10.
12 K. Murphy, A survey of POMDP solution techniques, Technical Report, UC Berkeley, http://www.cs.ubc.ca/murphyk/papers.html, 2000.
13 M. F. Neuts, Matrix Geometric Solutions in Stochastic Models - an Algorithmic Approach, Baltimore: John Hopkins Univ. Press, 1981.
14 E. N. Gilbert, Capacity of burst-noise channels, Bell Syst. Tech. J. 39 (1960), 1253-1265.   DOI
15 H. Bruneel and B. Kim, Discrete-Time Models for Communication Systems Including ATM, Boston: Kluwar Academic, 1993.
16 E. Cinlar, Introduction to Stochastic Processes, Englewood Cliffs: Prentice-Hall, 1975.
17 S. Geirhofer, L. Tong, and B. M. Sadler, Dynamic spectrum access in the time domain: modeling and exploiting white space, IEEE Commun. Mag. 45 (2007), no. 5, 66-72.
18 S. Huang, X. Liu, and Z. Ding, Opportunistic spectrum access in cognitive radio networks, Proc. IEEE INFOCOM 2008, 2008.
19 L. A. Johnston and V. Krishnamurthy, Opportunistic file transfer over a fading channel: a POMDP search theory formulation with optimal threshold policies, IEEE Trans. Wireless Communications 5 (2006), no. 2.
20 Y. Lee, Opportunistic spectrum access in cognitive networks, Electronics Letters 44 (2008), no. 17, 1022-1024.   DOI   ScienceOn