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

Cognitive radio networks (CRNs) have emerged as a promising paradigm that can solve the shortage of spectrum resources, providing the ability to adapt and opportunistically exploit the spectrum holes. The rendezvous process allows cognitive users to find a common channel and establish a communication link. In this paper, we focus on the design of fast blind rendezvous algorithms to guarantee that every node should be able to rendezvous in all common available channels. We follow a systematic approach by first proposing a role-based algorithm that ensures maximum rendezvous diversity and then extending it to a common strategy through the use of multiples radios. Both proposals guarantee rendezvous under symmetric and asymmetric models. Simulation results show that our proposals outperform other recently developed rendezvous protocols with similar approaches in terms of expected time to rendezvous and maximum time to rendezvous.

Section: Multi-user Rendezvous Algorithmmentioning

confidence: 99%

Section: Acknowledgementsmentioning

confidence: 99%

See 1 more Smart Citation

Systematic construction of common channel hopping rendezvous strategies in cognitive radio networks

Guerra

Reguera

Souza

et al. 2015

“…Furthermore, applications become more and more complex, quality of service (QoS) sensitive and computation intensive to perform on mobile system. Therefore, new solution concepts need to be developed that manage the computation and communication systems in a dynamically adaptive manner while continuously ensuring different application services [1,2].…”

Section: Introductionmentioning

confidence: 99%

News-vendor game-based resource allocation scheme for next-generation C-RAN systems

Kim

2016

Recently, Cloud Radio Access Network (C-RAN) has been emerging as a cost-effective solution supporting huge volumes of mobile traffic in the big data era. C-RAN provides infrastructure layer services to mobile users by managing virtualized infrastructure resources. To exploit next-generation C-RAN operations, a main challenging issue is how to properly control system resources. In this study, we propose a novel resource management scheme for C-RAN systems. By employing the news-vendor game model, we investigate a resource allocation problem with bargaining solutions. In dynamic C-RAN environments, our game-based resource management approach can practically adapt current system conditions while maximizing the expected payoff. The main contribution of our study lies in the fact that we shed a new light on adaptive resource allocation policies for virtualized cloud environments. Simulation results demonstrate that our proposed scheme can obtain a considerably better system performance than other existing schemes.

“…Second, a BS equipment serves only radio frequency channels in each physical cell, where BS's resources cannot be shared with other BSs in different cells. Finally, BSs built on proprietary hardware cannot have a flexibility to upgrade radio networks [1,2].…”

Section: Introductionmentioning

confidence: 99%

Dynamic C-RAN resource sharing scheme based on a hierarchical game approach

Kim

2016

Over the past decade, wireless applications have experienced tremendous growth, and this growth is likely to multiply in the near future. To cope with expected drastic data traffic growth, a new cloud computing-based radio access network (C-RAN) has been proposed for next-generation cellular networks. It is considered as a cost-efficient way of meeting high resource demand of future wireless access networks. In this paper, we propose a novel resource sharing scheme for future C-RAN systems. Based on the Indian buffet game, we formulate the C-RAN resource allocation problem as a two-level game model and find an effective solution according to the coopetition approach. Our proposed scheme constantly monitors the current C-RAN system conditions and adaptively responds in a distributed manner. The experimental results validate the effectiveness and efficiency of our proposed scheme under dynamic C-RAN situations.