skip to main content
10.1145/1614235.1614245acmconferencesArticle/Chapter ViewAbstractPublication PagesmobicomConference Proceedingsconference-collections
research-article

Connectivity of cognitive radio networks: proximity vs. opportunity

Authors Info & Claims
Published:21 September 2009Publication History

ABSTRACT

We address the connectivity of large-scale ad hoc cognitive radio networks, where secondary users exploit channels temporarily and locally unused by primary users and the existence of a communication link between two secondary users depends not only on the distance between them but also on the transmitting and receiving activities of nearby primary users. We introduce the concept of connectivity region defined as the set of density pairs -- the density of the secondary users and the density of the primary transmitters -- under which the secondary network is connected. Using theories and techniques from continuum percolation, we analytically characterize the connectivity region of the secondary network by showing its three basic properties and analyzing its two critical parameters. Furthermore, we reveal the tradeoff between proximity (the number of neighbors) and the occurrence of spectrum opportunities by studying the impact of secondary users' transmission power on the connectivity region of the secondary network, and design the transmission power of the secondary users to maximize their tolerance to the primary traffic load.

References

  1. C. Bettstetter. On the minimum node degree and connectivity of a wireless multihop network. In Proc. ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), pages 80--91. ACM Press, June 9--11 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. O. Dousse, F. Baccelli, and P. Thiran. Impact of interference on connectivity in ad hoc networks. IEEE/ACM Transactions on Networking, 13(2):425--436, April 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. O. Dousse, M. Franceschetti, N. Macris, R. Meester, and P. Thiran. Percolation in the signal to interference ratio graph. Journal of Applied Probability, 43(2):552--562, 2006.Google ScholarGoogle ScholarCross RefCross Ref
  4. M. Franceschetti and R. Meester. Random Networks for Communication: from Statistical Physics to Information Systems. Cambridge University Press, New York, 2007.Google ScholarGoogle Scholar
  5. G. R. Grimmett. Percolation (2nd Edition). Springer, 1999.Google ScholarGoogle Scholar
  6. P. Gupta and P. R. Kumar. Critical power for asymptotic connectivity in wireless networks. Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W. H. Fleming. Edited by W. M.McEneany, G. Yin, and Q. Zhang, pages 547--566, 1998.Google ScholarGoogle Scholar
  7. G. Han and A. M. Makowski. A very strong zero-one law for connectivity in one-dimensional geometric random graphs. IEEE Communication Letters, 11(1):55--57, January 2007.Google ScholarGoogle ScholarCross RefCross Ref
  8. J. F. C. Kingman. Poisson Processes. Oxford University Press, New York, 1993.Google ScholarGoogle Scholar
  9. Z. N. Kong and E. M. Yeh. Connectivity, percolation, and information dissemination in large-scale wireless networks with dynamic links. submitted to IEEE Transactions on Information Theory, Feburary 2009.Google ScholarGoogle Scholar
  10. O. L´evÆeque and I. E. Telatar. Information-theoretic upper bounds on the capacity of large extended ad hoc wireless networks. IEEE Transactions on Information Theory, 51(3):858--865, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. R. Meester and R. Roy. Continuum Percolation. Cambridge Univerisity Press, New York, 1996.Google ScholarGoogle ScholarCross RefCross Ref
  12. J. Ni and S. A. G. Chandler. Connectivity properties of a random radio network. IEEE Proc. Communication, 141(4):289--296, August 1994.Google ScholarGoogle ScholarCross RefCross Ref
  13. T. K. Philips, S. S. Panwar, and A. N. Tantawi. Connectivity properties of a packet radio network model. IEEE Transactions on Information Theory, 35(5):1044--1047, September 1989.Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. V. Ramasubramanian, R. Chandra, and D. Mosse. Providing a bidirectional abstraction for unidirectional adhoc networks. In Proc. of IEEE INFOCOM, pages (III)1258--(III)1267, June 23--27 2002.Google ScholarGoogle Scholar
  15. W. Ren, Q. Zhao, and A. Swami. Connectivity of heterogeneous wireless networks. http://arxiv.org/abs/0903.1684.Google ScholarGoogle Scholar
  16. W. Ren, Q. Zhao, and A. Swami. Power control in cognitive radio networks: How to cross a multi-lane highway. to appear in IEEE Journal on Selected Areas in Communications (JSAC): Special Issue on Stochastic Geometry and Random Graphs for Wireless Networks, September 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Q. Zhao. Spectrum opportunity and interference constraint in opportunistic spectrum access. In Proc. of IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP), pages (III)605--(III)608, April 15--20 2007.Google ScholarGoogle Scholar
  18. Q. Zhao and B. M. Sadler. A survey of dynamic spectrum access. IEEE Signal Processing Magazine, 24(3):79--89, May 2007.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Connectivity of cognitive radio networks: proximity vs. opportunity

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          CoRoNet '09: Proceedings of the 2009 ACM workshop on Cognitive radio networks
          September 2009
          100 pages
          ISBN:9781605587387
          DOI:10.1145/1614235

          Copyright © 2009 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 21 September 2009

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader