The Life Cycle of the Rendezvous Problem of Cognitive Radio Ad Hoc Networks: A Survey

نویسندگان

  • Zaw Htike
  • Choong Seon Hong
  • Sungwon Lee
چکیده

In cognitive radio or dynamic spectrum access networks, a rendezvous represents meeting two or more users on a common channel, and negotiating to establish data communication. The rendezvous problem is one of the most challenging tasks in cognitive radio ad hoc networks. Generally, this problem is simplified by using two well-known mechanisms: the first uses a predefined common control channel, while the second employs a channel hopping procedure. Yet, these two mechanisms form a life cycle, when they simplify the rendezvous problem in cognitive radio networks. The main purpose of this paper is to point out how and why this cycle forms. Category: Ubiquitous computing

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Broadcast Routing in Wireless Ad-Hoc Networks: A Particle Swarm optimization Approach

While routing in multi-hop packet radio networks (static Ad-hoc wireless networks), it is crucial to minimize power consumption since nodes are powered by batteries of limited capacity and it is expensive to recharge the device. This paper studies the problem of broadcast routing in radio networks. Given a network with an identified source node, any broadcast routing is considered as a directed...

متن کامل

Ring-Walk Rendezvous Algorithms for Cognitive Radio Networks

Rendezvous in cognitive radio networks is the process that cognitive users meet and establish a communication link on a commonly available channel, so that consequent information exchange and data communications can be accomplished on the channel. In this study, we propose two ring-walk (RW) rendezvous algorithms to solve the problem of blind rendezvous, i.e., rendezvous without the help of any...

متن کامل

Energy Efficient Routing in Mobile Ad Hoc Networks by Using Honey Bee Mating Optimization

Mobile Ad hoc networks (MANETs) are composed of mobile stations communicating through wireless links, without any fixed backbone support. In these networks, limited power energy supply, and frequent topology changes caused by node mobility, makes their routing a challenging problem. TORA is one of the routing protocols that successfully copes with the nodes’ mobility side effects, but it do...

متن کامل

Quorum system and random based asynchronous rendezvous protocol for cognitive radio ad hoc networks

This paper proposes a rendezvous protocol for cognitive radio ad hoc networks, RAC2E-gQS, which utilizes (1) the asynchronous and randomness properties of the RAC2E protocol, and (2) channel mapping protocol, based on a grid Quorum System (gQS), and taking into account channel heterogeneity and asymmetric channel views. We show that the combination of the RAC2E protocol with the grid-quorum bas...

متن کامل

Energy Efficient Routing in Mobile Ad Hoc Networks by Using Honey Bee Mating Optimization

Mobile Ad hoc networks (MANETs) are composed of mobile stations communicating through wireless links, without any fixed backbone support. In these networks, limited power energy supply, and frequent topology changes caused by node mobility, makes their routing a challenging problem. TORA is one of the routing protocols that successfully copes with the nodes’ mobility side effects, but it do...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JCSE

دوره 7  شماره 

صفحات  -

تاریخ انتشار 2013