Abstract
In a cognitive radio network, a Primary User (PU) may vacate a channel for intermissions of an unknown length. A substantial amount of research has been devoted to minimizing the disturbance a Secondary User (SU) may cause the PU. We take another step and optimize the throughput of an SU, even when assuming that the disturbance to the PU is indeed avoided using those other methods.
We suggest new optimization parameters the lengths of SU packets. That is, the SU fills up the intermission with consecutive packets. Each packet is associated with some fixed overhead. Hence, using a larger number of smaller packets increases the overhead ratio for each SU packet. On the other hand, it reduces the loss of throughput the SU suffers with the loss of a packet in a collision at the end of the intermission.
As opposed to previous studies, we optimize also the case where the distribution of the channel intermission is unknown. That is, we develop optimal competitive protocols. Those seek to minimize the ratio of the SU’s profit compared to a hypothetical optimal algorithm that knows the intermission length in advance. We show how to compute the optimal present packets’ sizes for the case that the distribution is known (for a general distribution). Finally, we show several interesting properties of the optimal solutions for several popular distributions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahmad, S.H.A., Liu, M., Javidi, T., Zhao, Q., Krishnamachari, B.: Optimality of myopic sensing in multichannel opportunistic access. IEEE Tran. on Information Theory 55(9) (2009)
Akyildiz, I.F., Lee, W., Vuran, M.C., Mohanty, S.: Next generation/dynamic spectrum access/cognitive radio wireless networks: A survey. Computer Networks 50(13) (2006)
Borodin, A., El-Yaniv, R.: Online computation and competitive analysis. Cambridge University Press (1998)
Huang, S., Liu, X., Ding, Z.: Opportunistic spectrum access in cognitive radio networks. In: INFOCOM (2008)
Li, X., Zhao, Q., Guan, X., Tong, L.: Optimal cognitive access of markovian channels under tight collision constraints. IEEE J. on Selected Areas in Comm. 29(4) (2011)
Lotker, Z., Patt-Shamir, B.: Nearly optimal fifo buffer management for two packet classes. Computer Networks 42(4) (2003)
Zhao, Q., Sadler, B.M.: A survey of dynamic spectrum access. IEEE Signal Process. Mag. 24 (2007)
Urgaonkar, R., Neely, M.J.: Opportunistic scheduling with reliability guarantees in cognitive radio networks. IEEE Trans. Mob. Comput. 8(6) (2009)
Vazirani, V.V.: Approximation algorithms. Springer (2001)
Xiao, Q., Li, Y., Zhao, M., Zhou, S., Wang, J.: Opportunistic channel selection approach under collision probability constraint in cognitive radio systems. Computer Comm. 32(18) (2009)
Xiao, Q., Li, Y., Zhao, M., Zhou, S., Wang, J.: An optimal osa approach based on channel-usage estimate under collision probability constraint in cognitive radio systems. Annales des Télécommunications 64(7-8) (2009)
Zhao, Q., Tong, L., Swami, A., Chen, Y.: Decentralized cognitive mac for opportunistic spectrum access in ad hoc networks: A pomdp framework. IEEE J. on Selected Areas in Comm. (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cidon, I., Kantor, E., Kutten, S. (2013). Prudent Opportunistic Cognitive Radio Access Protocols. In: Afek, Y. (eds) Distributed Computing. DISC 2013. Lecture Notes in Computer Science, vol 8205. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41527-2_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-41527-2_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41526-5
Online ISBN: 978-3-642-41527-2
eBook Packages: Computer ScienceComputer Science (R0)