Stable Throughput and Delay Analysis of a Random Access Network With Queue-Aware Transmission

In this work we consider a two-user and a three-user slotted ALOHA network with multi-packet reception (MPR) capabilities. The nodes can adapt their transmission probabilities and their transmission parameters based on the status of the other nodes. Each user has external bursty arrivals that are stored in their infinite capacity queues. For the two- and the three-user cases we obtain the stability region of the system. For the two-user case we provide the conditions where the stability region is a convex set. We perform a detailed mathematical analysis in order to study the queueing delay by formulating two boundary value problems (a Dirichlet and a Riemann-Hilbert boundary value problem), the solution of which provides the generating function of the joint stationary probability distribution of the queue size at user nodes. Furthermore, for the two-user symmetric case with MPR we obtain a lower and an upper bound for the average delay without explicitly computing the generating function for the stationary joint queue length distribution. The bounds as it is seen in the numerical results appear to be tight. Explicit expressions for the average delay are obtained for the symmetrical model with capture effect which is a subclass of MPR models. We also provide the optimal transmission probability in closed form expression that minimizes the average delay in the symmetric capture case. Finally, we evaluate numerically the presented theoretical results.Comment: Submitted for journal publicatio

Optimal Random Access and Random Spectrum Sensing for an Energy Harvesting Cognitive Radio with and without Primary Feedback Leveraging

We consider a secondary user (SU) with energy harvesting capability. We design access schemes for the SU which incorporate random spectrum sensing and random access, and which make use of the primary automatic repeat request (ARQ) feedback. We study two problem-formulations. In the first problem-formulation, we characterize the stability region of the proposed schemes. The sensing and access probabilities are obtained such that the secondary throughput is maximized under the constraints that both the primary and secondary queues are stable. Whereas in the second problem-formulation, the sensing and access probabilities are obtained such that the secondary throughput is maximized under the stability of the primary queue and that the primary queueing delay is kept lower than a specified value needed to guarantee a certain quality of service (QoS) for the primary user (PU). We consider spectrum sensing errors and assume multipacket reception (MPR) capabilities. Numerical results show the enhanced performance of our proposed systems.Comment: ACCEPTED in EAI Endorsed Transactions on Cognitive Communications. arXiv admin note: substantial text overlap with arXiv:1208.565

Energy-aware cooperative wireless networks with multiple cognitive users

In this paper, we study and analyze cooperative cognitive radio networks with arbitrary number of secondary users (SUs). Each SU is considered a prospective relay for the primary user (PU) besides having its own data transmission demand. We consider a multi-packet transmission framework that allows multiple SUs to transmit simultaneously because of dirty-paper coding. We propose power allocation and scheduling policies that optimize the throughput for both PU and SU with minimum energy expenditure. The performance of the system is evaluated in terms of throughput and delay under different opportunistic relay selection policies. Toward this objective, we present a mathematical framework for deriving stability conditions for all queues in the system. Consequently, the throughput of both primary and secondary links is quantified. Furthermore, a moment generating function approach is employed to derive a closed-form expression for the average delay encountered by the PU packets. Results reveal that we achieve better performance in terms of throughput and delay at lower energy cost as compared with equal power allocation schemes proposed earlier in the literature. Extensive simulations are conducted to validate our theoretical findings

Optimal Spectrum Access for Cognitive Radios

In this paper, we investigate a time-slotted cognitive setting with buffered primary and secondary users. In order to alleviate the negative effects of misdetection and false alarm probabilities, a novel design of spectrum access mechanism is proposed. We propose two schemes. First, the SU senses primary channel to exploit the periods of silence, if the PU is declared to be idle, the SU randomly accesses the channel with some access probability $a_s$. Second, in addition to accessing the channel if the PU is idle, the SU possibly accesses the channel if it is declared to be busy with some access probability $b_s$. The access probabilities as function of the misdetection, false alarm and average primary arrival rate are obtained via solving an optimization problem designed to maximize the secondary service rate given a constraint on primary queue stability. In addition, we propose a variable sensing duration schemes where the SU optimizes over the optimal sensing time to achieve the maximum stable throughput of the network. The results reveal the performance gains of the proposed schemes over the conventional sensing scheme. We propose a method to estimate the mean arrival rate and the outage probability of the PU based on the primary feedback channel, i.e., acknowledgments (ACKs) and negative-acknowledgments (NACKs) messages.Comment: arXiv admin note: substantial text overlap with arXiv:1206.615