4,746 research outputs found
The NxD-BMAP/G/1 queueing model : queue contents and delay analysis
We consider a single-server discrete-time queueing system with N sources, where each source is modelled as a correlated Markovian customer arrival process, and the customer service times are generally distributed. We focus on the analysis of the number of customers in the queue, the amount of work in the queue, and the customer delay. For each of these quantities, we will derive an expression for their steady-state probability generating function, and from these results, we derive closed-form expressions for key performance measures such as their mean value, variance, and tail distribution. A lot of emphasis is put on finding closed-form expressions for these quantities that reduce all numerical calculations to an absolute minimum
Power-Optimal Feedback-Based Random Spectrum Access for an Energy Harvesting Cognitive User
In this paper, we study and analyze cognitive radio networks in which
secondary users (SUs) are equipped with Energy Harvesting (EH) capability. We
design a random spectrum sensing and access protocol for the SU that exploits
the primary link's feedback and requires less average sensing time. Unlike
previous works proposed earlier in literature, we do not assume perfect
feedback. Instead, we take into account the more practical possibilities of
overhearing unreliable feedback signals and accommodate spectrum sensing
errors. Moreover, we assume an interference-based channel model where the
receivers are equipped with multi-packet reception (MPR) capability.
Furthermore, we perform power allocation at the SU with the objective of
maximizing the secondary throughput under constraints that maintain certain
quality-of-service (QoS) measures for the primary user (PU)
Energy-Efficient Cooperative Cognitive Relaying Schemes for Cognitive Radio Networks
We investigate a cognitive radio network in which a primary user (PU) may
cooperate with a cognitive radio user (i.e., a secondary user (SU)) for
transmissions of its data packets. The PU is assumed to be a buffered node
operating in a time-slotted fashion where the time is partitioned into
equal-length slots. We develop two schemes which involve cooperation between
primary and secondary users. To satisfy certain quality of service (QoS)
requirements, users share time slot duration and channel frequency bandwidth.
Moreover, the SU may leverage the primary feedback message to further increase
both its data rate and satisfy the PU QoS requirements. The proposed
cooperative schemes are designed such that the SU data rate is maximized under
the constraint that the PU average queueing delay is maintained less than the
average queueing delay in case of non-cooperative PU. In addition, the proposed
schemes guarantee the stability of the PU queue and maintain the average energy
emitted by the SU below a certain value. The proposed schemes also provide more
robust and potentially continuous service for SUs compared to the conventional
practice in cognitive networks where SUs transmit in the spectrum holes and
silence sessions of the PUs. We include primary source burstiness, sensing
errors, and feedback decoding errors to the analysis of our proposed
cooperative schemes. The optimization problems are solved offline and require a
simple 2-dimensional grid-based search over the optimization variables.
Numerical results show the beneficial gains of the cooperative schemes in terms
of SU data rate and PU throughput, average PU queueing delay, and average PU
energy savings
- …