Design of Probabilistic Random Access in Cognitive Radio Networks

  • Rana Abbas
  • Mahyar Shirvanimoghaddam
  • Yonghui Li
  • Branka Vucetic
Conference paper
Part of the Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering book series (LNICST, volume 156)


In this paper, we focus on the design of probabilistic random access (PRA) for a cognitive radio network (CRN). The cognitive base station (CBS) allows the secondary users (SUs) to reuse the sub-channels of the primary users (PUs) provided that the interference of the SUs to the PUs is below a predetermined threshold. PUs transmit over a fixed set of channels with fixed transmission powers that are scheduled by the CBS. With this prior information, CBS optimizes the probabilistic random transmissions of the SUs. In each time slot, SUs transmit over a random number of channels d, chosen uniformly at random, according to a certain degree distribution function, optimized by the CBS. Once the signals of the SUs and PUs are received, CBS then implements successive interference cancellation (SIC) to recover both the SUs’ and PUs’ signals. In the signal recovery, we assume that the PUs’ signals can be recovered if the interference power (IP) of the SUs to the PUs is below a predetermined threshold. On the other hand, we assume the SUs’ signals can be recovered if its received SINR is above a predetermined threshold. We formulate a new optimization problem to find the optimal degree distribution function that maximizes the probability of successfully recovering the signals of an SU in the SIC process under the SINR constraints of the SUs while satisfying the IP constraints of the PUs. Simulation results show that our proposed design can achieve higher success probabilities and a lower number of transmissions in comparison with conventional schemes, thus, significantly improving signal recovery performance and reducing energy consumption.


Probabilistic random access Cognitive radio SIC IP SINR Degree distribution 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Liang, Y.C., Chen, K.C., Li, Y., Mahonen, P.: Cognitive Radio Networking and Communications: An Overview. IEEE Transactions on Vehicular Technology 60(7), 3386–3407 (2011)CrossRefGoogle Scholar
  2. 2.
    Domenico, A.D., Strinati, E., Benedetto, M.D.: A Survey on MAC Strategies for Cognitive Radio Networks. IEEE Commununications Surveys & Tutorials 14(1), 21–44 (2012)CrossRefGoogle Scholar
  3. 3.
    Yang, L., Kim, H., Zhang, J., Chiang, M., Tan, C.W.: Pricing-based spectrum access control in cognitive radio networks with random access. In: Proceedings of IEEE INFOCOM, pp. 2228–2236 (2011)Google Scholar
  4. 4.
    Wang, S., Zhang, J., Tong, L.: Delay analysis for cognitive radio networks with random access: a fluid queue view. In: Proceedings of IEEE INFOCOM, pp. 1–9 (2010)Google Scholar
  5. 5.
    Chen, T., Zhang, H., Maggio, G.M., Chlamtac, I.: Cogmesh: a cluster-based cognitive radio network. In: Proceedings of IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks, pp. 168–178 (April 2007)Google Scholar
  6. 6.
    Barman, S.R., Merchant, S.N., Madhukumar, A.: Random transmission in cognitive uplink network. In: International Conference on Mobile Services, Resources, and Users (MOBILITY), pp. 94–98 (2013)Google Scholar
  7. 7.
    Liva, G.: Graph-based Analysis and Optimization of Contention Resolution Diversity Slotted ALOHA. IEEE Transactions on Communications 59(2), 477–487 (2011)CrossRefGoogle Scholar
  8. 8.
    Paolini, E., Liva, G., Chiani, M.: High throughput random access via codes on graphs: coded slotted ALOHA. In: Proceedings of IEEE International Conference on Communications (ICC), pp. 1–6 (April 2011)Google Scholar
  9. 9.
    Liva, G., Paolini, E., Lentmaier, M., Chiani, M.: Spatially-coupled random access on graphs. In: IEEE International Symposium on Information Theory (ISIT), pp. 478–482 (July 2012)Google Scholar
  10. 10.
    Luby, M., Mitzenmacher, M., Shokrollahi, M.A.: Analysis of Random Processes via AND-OR Tree Evaluation. SODA 98, 364–373 (1998)MathSciNetMATHGoogle Scholar
  11. 11.
    Hansen, N., Ostermeier, A.: Adapting arbitrary normal mutation distributions in evolution strategies: the covariance matrix adaptation. In: Proceedings of IEEE International Conference on Evolutionary Computation, pp. 312–317 (1996)Google Scholar
  12. 12.
    Xu, H., Li, B.: Efficient resource allocation with flexible channel cooperation in OFDMA cognitive radio networks. In: Proceedings of IEEE INFOCOM, pp. 1–9 (2010)Google Scholar
  13. 13.
    Zhang, R.: On Peak versus Average Interference Power Constraints for Protecting Primary Users in Cognitive Radio Networks. IEEE Transactions on Wireless Communications 8(4), 2112–2120 (2009)CrossRefGoogle Scholar
  14. 14.
    Shokrollahi, M.A.: Raptor codes. IEEE Transactions on Information Theory 52(6), 2551–2567 (2006)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Institute for Computer Science, Social Informatics and Telecommunications Engineering 2015

Authors and Affiliations

  • Rana Abbas
    • 1
  • Mahyar Shirvanimoghaddam
    • 1
  • Yonghui Li
    • 1
  • Branka Vucetic
    • 1
  1. 1.The University of SydneySydneyAustralia

Personalised recommendations