Optimal scheduling in cooperate-to-join Cognitive Radio Networks

Khalil, Karim; Karaca, Mehmet; Erçetin, Özgür; Ekici, Eylem

doi:10.1109/infcom.2011.5935142

Cited by 38 publications

(19 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It deals with a simple scenario that a source communicates with multiple users via a fixed relay, which is different from our model. A cooperative cognitive radio framework is studied in [23] and [24], with the idea that primary users select some of secondary users to be the cooperative relays and in turn lease portion of the channel access time to them for their own data transmission. They focus on the interaction between the secondary and primary users.…”

Section: B Spectrum Efficiencymentioning

confidence: 99%

“…After the above efforts on linearization, we obtain a new formulation, in which both the objective function and the constraints are expressed in linear forms except (24). Fortunately, after relaxing all integer variables to real number variables, the resulting problem, denoted as RRC, can be solved by an LP solvers using the SPCA method [7], in which (24) is replaced by linear constraints.…”

Section: A Solving the Relaxed Problemmentioning

confidence: 99%

See 1 more Smart Citation

On Efficient Resource Allocation for Cognitive and Cooperative Communications

Guo

Zhuang

et al. 2014

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

Abstract-Cooperative communication (CC) can offer high channel capacity and reliability in an efficient and low-cost way by forming a virtual antenna array among single-antenna nodes that cooperatively share their antennas. It has been well recognized that the selection of relay nodes plays a critical role in the performance of multiple source-destination pairs. Unfortunately, all prior work has made an unrealistic assumption that spectrum resources are unlimited and each source-destination pair can communicate over a dedicated channel with no mutual interference. In this paper, we study the problem of maximizing the minimum transmission rate among multiple source-destination pairs using CC in a cognitive radio network (CRN). We jointly consider the relay assignment and channel allocation under a finite set of available channels, where the interference must be considered. In order to improve the spectrum efficiency, we exploit the network coding opportunities existing in CC that can further increase the capacity. Such max-min rate problems for cognitive and cooperative communications are proved to be NPhard and the corresponding MINLP (Mixed-Integer Nonlinear Programming) formulations are developed. Moreover, we apply the reformulation and linearization techniques to the original optimization problems with nonlinear and nonconvex objective functions such that our proposed algorithms can produce high competitive solutions in a timely manner. Extensive simulations are conducted to show that the proposed algorithms can achieve high spectrum efficiency in terms of providing a much improved max-min transmission rate under various network settings.

show abstract

Section: B Spectrum Efficiencymentioning

confidence: 99%

Section: A Solving the Relaxed Problemmentioning

confidence: 99%

On Efficient Resource Allocation for Cognitive and Cooperative Communications

Guo

Zhuang

et al. 2014

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

show abstract

“…In [11], optimal channel assignment and power allocation are considered in a dual-hop relaying network with multiple channels. A cooperative cognitive radio framework is studied in [12] and [13]. With the idea that primary users select some of secondary users to be the cooperative relays and in return lease portion of the channel access time to them for their own data transmission.…”

Section: Related Workmentioning

confidence: 99%

Improving throughput by fine-grained channel allocation in cooperative wireless networks

Guo

Leung

2012

2012 IEEE Global Communications Conference (GLOBECOM)

View full text Add to dashboard Cite

Cooperative communication provides an efficient and low-cost way to achieve spatial diversity without deploying multiple antennas on each node in wireless networks. In a channel-constrained environment, such as cognitive radio networks, the channel allocation as well as relay assignment have been identified as two critical factors in determining the performance of multiple source-destination pairs. However, the advantage of channel diversity has little been exploited in such networks under a simplified model where the transmissions within a cooperative communication pair are on a common channel. In this paper, we consider a fine-grained channel allocation scheme that the source and the relay can work on different channels to complete a signal transmission. We study its performance gain in maximizing the minimum throughput among multiple source-destination pairs in channel-constrained wireless networks with a number of dedicated relay nodes. This problem is proved to be NP-hard and an online algorithm is proposed for a dynamic wireless network where the accessible channels of each node may vary from time to time. Extensive simulations are conducted to show that the proposed finegrained channel allocation scheme can effectively improve the performance under various network settings.

show abstract

“…Numerous efforts have been spent for different issues in CRNs, including spectrum sensing [6], [7], [8], [9], spectrum access, scheduling, and management [10], [11], [12], [13], [14], [15], [16], [17], [18], [19], [20], capacity/throughput/ delay scaling laws [25], [26], [27], [28], [29], [30], [31], [32], [33], [34], [35], network connectivity [40], [41], routing protocols [42], [43], [44], multicast communication [45], [46], and etc. Data collection is a common and important operation in wireless networks, as well as in CRNs, which can be used to gather data from an entire network.…”

mentioning

confidence: 99%

Distributed and Asynchronous Data Collection in Cognitive Radio Networks with Fairness Consideration

Cai

et al. 2014

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

Abstract-As a promising communication paradigm, Cognitive Radio Networks (CRNs) have paved a road for Secondary Users (SUs) to opportunistically exploit unused licensed spectrum without causing unacceptable interference to Primary Users (PUs). In this paper, we study the distributed data collection problem for asynchronous CRNs, which has not been addressed before. We study the Proper Carrier-sensing Range (PCR) for SUs. By working with this PCR, an SU can successfully conduct data transmission without disturbing the activities of PUs and other SUs. Subsequently, based on the PCR, we propose an Asynchronous Distributed Data Collection (ADDC) algorithm with fairness consideration for CRNs. ADDC collects a snapshot of data to the base station in a distributed manner without the time synchronization requirement. The algorithm is scalable and more practical compared with centralized and synchronized algorithms. Through comprehensive theoretical analysis, we show that ADDC is order-optimal in terms of delay and capacity, as long as an SU has a positive probability to access the spectrum. Furthermore, we extend ADDC to deal with the continuous data collection issue, and analyze the delay and capacity performances of ADDC for continuous data collection, which are also proven to be order-optimal. Finally, extensive simulation results indicate that ADDC can effectively accomplish a data collection task and significantly reduce data collection delay.

show abstract

Optimal scheduling in cooperate-to-join Cognitive Radio Networks

Cited by 38 publications

References 10 publications

On Efficient Resource Allocation for Cognitive and Cooperative Communications

On Efficient Resource Allocation for Cognitive and Cooperative Communications

Improving throughput by fine-grained channel allocation in cooperative wireless networks

Distributed and Asynchronous Data Collection in Cognitive Radio Networks with Fairness Consideration

Contact Info

Product

Resources

About