Skip to main content
SpringerLink
Log in

Percolation theory based connectivity and latency analysis of cognitive radio ad hoc networks

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

This paper investigates the dynamic connectivity and transmission latency of cognitive radio ad-hoc networks (secondary networks) coexisting with licensed networks (primary networks) that experience time-varying on-off links. It is shown that there exists a critical density λ * s such that if the density of secondary networks is larger than λ * s , the secondary network percolates at all time t > 0, i.e., there exists always an infinite connected component in the secondary network under the time-varying spectrum availability. Furthermore, the upper and lower bounds of λ * s are derived and it is shown that they do not depend on the random locations of primary and secondary users, but only on the network parameters, such as active/inactive probability of primary users, transmission range, and the user density. Moreover, due to the dynamic behavior of the unoccupied spectrum, the secondary network can be disconnected at all times. It is proven that it is still possible for a SU to transfer its message to any destination with a certain delay with probability one. This delay is shown to be asymptotically linear in the Euclidean distance between the transmitter and receiver.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  1. Akyildiz, I. F., Lee, W. Y., & Chowdhury, K. (2009). CRAHNs: Cognitive radio ad hoc networks. Ad Hoc Networks (Elsevier) Journal, 7(2), 810–836.

    Article  Google Scholar 

  2. Cheng, Y.-C., & Robertazzi, T. G. (1989). Critical connectivity phenomena in multihop radio models. IEEE Transaction on Communication, 37, 770–777.

    Article  Google Scholar 

  3. Dousse, O., Baccelli, F., & Thiran, P. (2004). Latency of wireless sensor networks with uncoordinated power saving mechanisms. In In Proceedings of ACM MOBIHOC’04 (pp. 109–120).

  4. Dousse, O., Baccelli, F., & Thiran, P. (2005). Impact of interferences on connectivity of ad hoc networks. IEEE/ACM Transactions on Networking, 13(2), 425–436.

    Article  Google Scholar 

  5. Grimmett, G. (1999). Percolation (2nd ed.). New York: Springer.

    MATH  Google Scholar 

  6. Gupta, P., & Kumar, P. R. (1998). Critical power for asymptotic connectivity in wireless networks. Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W.H. Fleming, 7(5), 547–566.

    Google Scholar 

  7. Haenggi, M., Andrews, J. G., Baccelli, F., Dousse, O., & Franceschetti, M. (2009). Stochastic geometry and random graphs for the analysis and design of wireless networks. IEEE Journal on Selected Areas in Communications, 27, 1029–1046.

    Article  Google Scholar 

  8. Häggström, O., Peres, Y., & Steif, J. E. (1997). Dynamic percolation. Annales de l’IHP Probabilités et Statistiques, 33, 497–528.

    Article  MATH  Google Scholar 

  9. Kong, Z., & Yeh, E. M. (2007). A distributed energy management algorithm for large-scale wireless sensor networks. In Proceedings of ACM MOBIHOC’07 (pp. 209–218).

  10. Liggett, T. (1985). An improved subadditive ergodic theorem. Annals of Probability, 13, 1279–1285.

    Article  MATH  MathSciNet  Google Scholar 

  11. Meester, R., & Roy, R. (1996). Continuum percolation (1st ed.). New York, NY, USA: Cambridge University Press.

    MATH  Google Scholar 

  12. Quintanilla, J., Torquato, S., & Ziff, R. M. (2000) Efficient measurement of the percoaltion threshold for fully penetrable discs. Physics A, 86, 399–407.

    MathSciNet  Google Scholar 

  13. Ren, W., Zhao, Q., & Swami, A. (2009). Connectivity of cognitive radio networks: Proximity vs. opportunity. In Proceedings of ACM MobiCom workshop on cognitive radio networks (pp. 37–42).

  14. Ren, W., Zhao, Q., & Swami, A. (2010). On the connectivity and multihop delay of ad hoc cognitive radio networks. In Proceedings of ICC’2010 (pp. 1–6).

  15. Santi, P., & Blough, D. M. (2002). An evaluation of connectivity in mobile wireless ad hoc networks. In Proceedings of IEEE DSN (pp. 89–102).

  16. Wang, P., Akyildiz, I. F., & Al-Dhelaan, A. M. (2010). Dynamic connectivity of cognitive radio ad-hoc networks with time-varying spectral activity. In Proceedings of Globecom 2010.

Download references

Acknowledgments

This work is supported by the US National Science Foundation under contract ECCS-0900930.

Author information

Authors and Affiliations

  1. Broadband Wireless Networking Laboratory, School of Electrical and Computer Engineering, Georgia Institute of Technology, 30332, Atlanta, Georgia

    Pu Wang & Ian F. Akyildiz

  2. College of Computer & Information Sciences, King Saud University, Riyadh, Saudi Arabia

    Ian F. Akyildiz & Abdullah M. Al-Dhelaan

Authors
  1. Pu Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ian F. Akyildiz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Abdullah M. Al-Dhelaan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Pu Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, P., Akyildiz, I.F. & Al-Dhelaan, A.M. Percolation theory based connectivity and latency analysis of cognitive radio ad hoc networks. Wireless Netw 17, 659–669 (2011). https://doi.org/10.1007/s11276-010-0304-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-010-0304-9

Keywords

Search

Navigation