Citation Context

...been used to study this problem (see [1] for a survey). In this paper, we focus on algorithms that are built upon quadratic Lyapunov functions (called QLA in the following), e.g., [2], [3], [4], [5], =-=[6]-=-, [7]. These QLA algorithms are easy to implement, greedy in nature, and are parameterized by a scalar control variable V . It has been shown that when the network state is i.i.d., QLA algorithms can ...

Citation Context

...ing time setting was investigated in singlechannel and multichannel cases, respectively. In the literature, some research works have been done for the QoS provisioning in cognitive radio networks. In =-=[15]-=-, an opportunistic scheduling policy was proposed to maximize the throughput utility, which reflects the QoS of the secondary users subject to maximum collision constraints with the primary users. In ...

Citation Context

...vide a practical framework to implement cooperative cognitive radio networks. Resource allocation in cognitive radio and cooperative networks have been extensively studied. For the former, most works =-=[20]-=-, [21] consider maximizing SUs’ throughput with constrained interference to PUs. For the latter, [9] and our previous work [10] address the problem with different primary user cooperation schemes. In ...

Citation Context

...s assumed for the physical layer in which if a secondary user transmits on a busy primary channel, then there is a collision and both packets are lost. We considered a similar model in our prior work =-=[3]-=- where the objective was to design an opportunistic scheduling policy for the secondary users that maximizes their throughput utility while providing tight reliability guarantees on the maximum Rahul ...

Citation Context

...k be kept finite. This general setting models a large class of networking problems ranging from traffic routing [1], flow utility maximization [2], network pricing [3] to cognitive radio applications =-=[4]-=-. Also, many techniques have also been applied to this problem (see [5] for a survey). Among the approaches that have been adopted, the family of Backpressure algorithms [6] are recently receiving muc...

Citation Context

...he constraint that the time average total backlog in the network is finite. Many of the utility maximization problems in data networks fall into this general framework. For instance, [11], [12], [13] =-=[14]-=-, [15], can be viewed as special cases of the above framework which allow scheduling actions to be independent of the content level in the queues (see [16] for a survey of problems in data networks). ...

Citation Context

...that some studies have been done for queuing analysis in cognitive radio systems [1] [18] [19] [21]. Other studies involve the scheduling in cognitive radio networks similarly to queuing control [23] =-=[25]-=-. The TCP subject to service interruption is discussed in [10]. The QoS-aware sensing algorithm is designed for the service interruption is provided in [3]. Moreover, the packet loss in cognitive radi...

Citation Context

... V is a control parameter that can be made arbitrarily large), with a corresponding tradeoff in average network congestion and delay that is O(V ). This can be applied to treat metrics of reliability =-=[20]-=-, distortion [2], revenue [21] [22], and to treat networks with non-ergodic, non-repeatable mobility [23]. This stochastic network optimization technique is related to classical duality theory and sta...

Citation Context

...opt similar methodology in this paper, but address the more challenging problem of streaming real-time videos. The problem of QoS provisioning in CR networks has been considered in a few papers [10], =-=[20]-=-, [25], where the focus is still on the so-called “network-centric” metrics such as maximum throughput and delay [10], [20]. In a recent work [20], Urgaonkar and Neely derive an interesting delay thro...