skip to main content
10.1145/3127540.3127552acmconferencesArticle/Chapter ViewAbstractPublication PagesmswimConference Proceedingsconference-collections
research-article

Multi-Channel Continuous Rendezvous in Cognitive Networks

Published:21 November 2017Publication History

ABSTRACT

The rapid growth of wireless networking technologies, the emergence of several new devices that offer or need Internet interconnection, and a pent-up demand for wide band access, especially away from the big cities, are hampered by the problem of the frequency spectrum exhaustion for telecommunications services. A more efficient use of the spectrum passes through solutions, such as the improvement and deployment of radios with cognitive ability. In this context, the problem of neighbor discovery extends not only for the initial blind rendezvous, but also for the maintenance of periodical encounters of neighbors after such initial encounter. At this stage, it will be necessary for a node that has already found a peer to interrupt its data communication, so that nodes can become aware of changes in their surroundings and the network can support the addition of new nodes. The contribution of this paper is the creation of asynchronous, distributed and robust schedules to guarantee multiple continuous rendezvous and communication opportunities between two or more cognitive radios using control channels, employing frequency hopping with new sequences and mappings based on combinatorial design theory.

References

  1. Ian F. Akyildiz, Won-Yeol Lee, Mehmet C. Vuran, and Shantidev Mohanty. 2006. NeXt generation/dynamic spectrum access/cognitive radio wireless networks: A survey. Computer Networks 50, 13 (sep 2006), 2127--2159. https://doi.org/10. 1016/j.comnet.2006.05.001Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Majid Altamimi, Kshirasagar Naik, and Xuemin Shen. 2010. Parallel link rendezvous in ad hoc cognitive radio networks. GLOBECOM - IEEE Global Telecommunications Conference (2010). https://doi.org/10.1109/GLOCOM.2010.5683741Google ScholarGoogle ScholarCross RefCross Ref
  3. Kaigui Bian, Jung-Min Park, and Ruiliang Chen. 2009. A quorum-based framework for establishing control channels in dynamic spectrum access networks. In Proceedings of the 15th annual international conference on Mobile computing and networking. ACM, 25--36. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Ricardo C. Carrano, Diego Passos, Luiz C. S. Magalhães, and Célio VN Albuquerque. 2013. Nested block designs: Flexible and efficient schedule-based asynchronous duty cycling. Computer Networks 57, 17 (2013), 3316--3326. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Chih-Min Chao and Hsiang-Yuan Fu. Providing complete rendezvous guarantee for cognitive radio networks by quorum systems and latin squares. In Wireless Communications and Networking Conference (WCNC), 2013 IEEE. IEEE, 95--100. Google ScholarGoogle ScholarCross RefCross Ref
  6. Yen-Wen Chen, Po-Yin Liao, and Ying-Cheng Wang. 2016. A channel-hopping scheme for continuous rendezvous and data delivery in cognitive radio network. Peer-to-Peer Networking and Applications 9, 1 (2016), 16--27. Google ScholarGoogle ScholarCross RefCross Ref
  7. Sangil Choi, Wooksik Lee, Teukseob Song, and Jong-Hoon Youn. 2015. Block Design-Based Asynchronous Neighbor Discovery Protocol for Wireless Sensor Networks. Journal of Sensors (2015), 1--12. https://doi.org/10.1155/2015/951652 Google ScholarGoogle ScholarCross RefCross Ref
  8. Charles J. Colbourn and Jeffrey H. Dinitz. 2006. Handbook of combinatorial designs. CRC press. Google ScholarGoogle ScholarCross RefCross Ref
  9. Luiz A. DaSilva and Igor Guerreiro. 2008. Sequence-based rendezvous for dynamic spectrum access. In 3rd IEEE DySPAN. 1--7.Google ScholarGoogle Scholar
  10. Luiz A. DaSilva and Thomas Ryan. 2009. Rendezvous in Cognitive Radio Network. In Cognitive Radio Technology (2 ed.), Bruce Fette (Ed.). Elsevier, 635--644. Google ScholarGoogle ScholarCross RefCross Ref
  11. Jeffrey H. Dinitz and Douglas R. Stinson. 1992. Contemporary design theory: A collection of Surveys. Vol. 26. John Wiley & Sons.Google ScholarGoogle Scholar
  12. Zhaoquan Gu, Qiang-Sheng Hua, Yuexuan Wang, and Francis C. M. Lau. 2013. Nearly optimal asynchronous blind rendezvous algorithm for cognitive radio networks. In (SECON), IEEE Communications Society Conference. 371--379.Google ScholarGoogle Scholar
  13. Zaw Htike, Choong Seon Hong, and Sungwon Lee. 2013. The life cycle of the rendezvous problem of cognitive radio ad hoc networks: a survey. Journal of computing science and engineering 7, 2 (2013), 81--88. Google ScholarGoogle ScholarCross RefCross Ref
  14. Jehn-Ruey Jiang, Yu-Chee Tseng, Chih-Shun Hsu, and Ten-Hwang Lai. 2005. Quorum-based asynchronous power-saving protocols for IEEE 802.11 ad hoc networks. Mobile Networks and Applications 10, 1--2 (2005), 169--181.Google ScholarGoogle ScholarCross RefCross Ref
  15. Brandon F. Lo. 2011. A survey of common control channel design in cognitive radio networks. Physical Communication 4, 1 (2011), 26--39. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Michael J. Marcus, Paul Kolodzy, and Andrew Lippman. 2006. Why Unlicensed Use of Vacant TV Spectrum Will Not Interfere with Television Reception. New America Foundation Issue Brief, July (2006), 22--31.Google ScholarGoogle Scholar
  17. Sylwia Romaszko and Petri Mahonen. 2011. Quorum-based channel allocation with asymmetric channel view in cognitive radio networks. In Proceedings of the 6th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks. ACM, 67--74. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Jongmin Shin, Dongmin Yang, and Cheeha Kim. 2010. A channel rendezvous scheme for cognitive radio networks. IEEE Communications Letters (2010), 954. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Douglas R. Stinson. 2007. Combinatorial designs: constructions and analysis. Springer Science & Business Media.Google ScholarGoogle Scholar
  20. Nick C. Theis, Ryan W. Thomas, Luiz DaSilva, et al. 2011. Rendezvous for cognitive radios. IEEE Transactions on Mobile Computing 10, 2 (2011), 216--227. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Frank Yates. 1936. Incomplete randomized blocks. Annals of Eugenics 7, 2 (1936), 121--140. Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Multi-Channel Continuous Rendezvous in Cognitive Networks

        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
          MSWiM '17: Proceedings of the 20th ACM International Conference on Modelling, Analysis and Simulation of Wireless and Mobile Systems
          November 2017
          340 pages
          ISBN:9781450351621
          DOI:10.1145/3127540

          Copyright © 2017 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 November 2017

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

          Acceptance Rates

          MSWiM '17 Paper Acceptance Rate29of142submissions,20%Overall Acceptance Rate398of1,577submissions,25%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader