Significance of channel failures on network performance in CRNs with reserved spectrum
It is well understood that in wireless networks, channel failures, which are typically caused by equipment or power failures as well as intrinsic features in radio transmissions, such as fading and shadowing, can easily result in network performance degradation. Therefore, fast recovery from channel failures is an important measure that should be incorporated with those networks. Consequently, in a cognitive radio network (CRN), channel failures can cause significant performance degradation in both primary and secondary networks. Instead, retainability, i.e., the capability of providing continuous connection for users must be guaranteed even if a significant network element is disrupted. In…
Dynamic Channel Aggregation Strategies in Cognitive Radio Networks with Spectrum Adaptation
In cognitive radio networks, channel aggregation techniques which combine several channels together as one channel have been proposed in many MAC protocols. In this paper, spectrum adaptation is proposed in channel aggregation and two strategies which dynamically adjust channel occupancy of ongoing traffic flows are further developed. The performance of these strategies is evaluated using continuous time Markov chain models. Moreover, models in the quasi-stationary regime are analyzed and the closed-form capacity expression is derived in this regime. Numerical results demonstrate that the capacity of the secondary network can be improved by using channel aggregation with spectrum adaptation.
MAC Protocols for Wake-up Radio: Principles, Modeling and Performance Analysis
[EN] In wake-up radio (WuR) enabled wireless sensor networks (WSNs), a node triggers a data communication at any time instant by sending a wake-up call (WuC) in an on-demand manner. Such wake-up operations eliminate idle listening and overhearing burden for energy consumption in duty-cycled WSNs. Although WuR exhibits its superiority for light traffic, it is inefficient to handle high traffic load in a network. This paper makes an effort towards improving the performance of WuR under diverse load conditions with a twofold contribution. We first propose three protocols that support variable traffic loads by enabling respectively clear channel assessment (CCA), backoff plus CCA, and adaptive …
Dynamic Spectrum Reservation for CR Networks in the Presence of Channel Failures: Channel Allocation and Reliability Analysis
[EN] Providing channel access opportunities for new service requests and guaranteeing continuous connections for ongoing flows until service completion are two challenges for service provisioning in wireless networks. Channel failures, which are typically caused by hardware and software failures or/and by intrinsic instability in radio transmissions, can easily result in network performance degradation. In cognitive radio networks (CRNs), secondary transmissions are inherently vulnerable to connection breaks due to licensed users' arrivals as well as channel failures. To explore the advantages of channel reservation on performance improvement in error-prone channels, we propose and analyze …
Modeling and Performance Analysis of Channel Assembling in Multichannel Cognitive Radio Networks With Spectrum Adaptation
[EN] To accommodate spectrum access in multichannel cognitive radio networks (CRNs), the channel-assembling technique, which combines several channels together as one channel, has been proposed in many medium access control (MAC) protocols. However, analytical models for CRNs enabled with this technique have not been thoroughly investigated. In this paper, two representative channel-assembling strategies that consider spectrum adaptation and heterogeneous traffic are proposed, and the performance of these strategies is evaluated based on the proposed continuous-time Markov chain (CTMC) models. Moreover, approximations of these models in the quasistationary regime are analyzed, and closed-fo…
Lightweight Relay Selection in Multi-Hop Wake-Up Radio Enabled IoT Networks
Wake-up Radios (WuRs) are becoming more popular in Internet of Things (IoT) networks owing to their overwhelming advantages such as low latency, high energy saving, and on-demand communication. In a multi-hop WuR-IoT network, route establishment between source and destination prior to actual data communications consumes a significant portion of energy. To reduce energy consumption and protocol overhead for route establishment, we propose a lightweight relay (LR) selection scheme, referred to as LR-WuR, where a lookup table and acknowledgment are used for next hop relay selection. We develop an analytical model to evaluate the performance of LR-WuR. Extensive simulations are performed to val…
A dynamic channel access strategy for underlay cognitive radio networks: Markov modelling and performance evaluation
Unlike in overlay cognitive radio networks, secondary users in underlay cognitive radio networks can access licensed spectrum even at the presence of a primary user, given that the interference caused by the secondary transmission is lower than a pre-specified threshold. Based on this underlay access principle, we propose in this paper a dynamic channel access strategy for multi-channel cognitive radio networks. Different from existing underlay access techniques, channel assembling, spectrum adaptation and restricted channel occupancy are also considered in the proposed strategy in order to achieve better performance in the secondary network. Accordingly, a partial channel occupancy mode, w…
System Times and Channel Availability for Secondary Transmissions in CRNs: A Dependability Theory based Analysis
[EN] Reliability is of fundamental importance for the performance of secondary networks in cognitive radio networks (CRNs). To date, most studies have focused on predicting reliability parameters based on prior statistics of traffic patterns from user behavior. In this paper, we define a few reliability metrics for channel access in multichannel CRNs that are analogous to the concepts of reliability and availability in classical dependability theory. Continuous-time Markov chains are employed to model channel available and unavailable time intervals based on channel occupancy status. The impact on user access opportunities based on channel availability is investigated by analyzing the stead…
On the Performance of Channel Assembling and Fragmentation in Cognitive Radio Networks
[EN] Flexible channel allocation may be applied to multi-channel cognitive radio networks (CRNs) through either channel assembling (CA) or channel fragmentation (CF). While CA allows one secondary user (SU) occupy multiple channels when primary users (PUs) are absent, CF provides finer granularity for channel occupancy by allocating a portion of one channel to an SU flow. In this paper, we investigate the impact of CF together with CA for SU flows by proposing a channel access strategy which activates both CF and CA and correspondingly evaluating its performance. In addition, we also consider a novel scenario where CA is enabled for PU flows. The performance evaluation is conducted based on…
Greedy versus Dynamic Channel Aggregation Strategy in CRNs: Markov Models and Performance Evaluation
Part 1: - PE-CRN 2011 Workshop; International audience; In cognitive radio networks, channel aggregation techniques which aggregate several channels together as one channel have been proposed in many MAC protocols. In this paper, we consider elastic data traffic and spectrum adaptation for channel aggregation, and propose two new strategies named as Greedy and Dynamic respectively. The performance of channel aggregation represented by these strategies is evaluated using continuous time Markov chain models. Moreover, simulation results based on various traffic distributions are utilized in order to evaluate the validity and preciseness of the mathematical models.
Analysis on channel bonding/aggregation for multi-channel cognitive radio networks
Channel bonding/aggregation techniques, which assemble several channels together as one channel, could be used in cognitive radio networks for the purpose of achieving better bandwidth utilization. In existing work on this topic, channel bonding/aggregation is focused on the cases when primary channels are time slotted or stationary as compared with secondary users' activities. In this paper, we analyze the performance of channel bonding/aggregation strategies when primary channels are not time slotted and the time scale of primary activities is at the same level as the secondary users', given that spectrum handover is not allowed. Continuous time Markov chain models are built in order to a…
Channel Assembling with Priority-Based Queues in Cognitive Radio Networks: Strategies and Performance Evaluation
[EN] With the implementation of channel assembling (CA) techniques, higher data rate can be achieved for secondary users in multi-channel cognitive radio networks. Recent studies which are based on loss systems show that maximal capacity can be achieved using dynamic CA strategies. However the channel allocation schemes suffer from high blocking and forced termination when primary users become active. In this paper, we propose to introduce queues for secondary users so that those flows that would otherwise be blocked or forcibly terminated could be buffered and possibly served later. More specifically, in a multi-channel network with heterogeneous traffic, two queues are separately allocate…
Capacity Upper Bound of Channel Assembling in Cognitive Radio Networks with Quasistationary Primary User Activities
In cognitive radio networks (CRNs) with multiple channels, various channel-assembling (ChA) strategies may be applied to secondary users (SUs), resulting in different achieved capacity. However, there is no previous work on determining the capacity upper bound (UB) of ChA for SUs under given system configurations. In this paper, we derive the maximum capacity for CRNs with ChA through Markov chain modeling, considering that primary user (PU) activities are relatively static, compared with SU services. We first deduce a closed-form expression for the maximum capacity in a dynamic ChA strategy and then demonstrate that no other ChA strategy can provide higher capacity than that achieved by th…