Cooperative Access in Wireless Networks: Stable Throughput and Delay

Rong, Beiyu; Ephremides, Anthony

doi:10.1109/tit.2012.2204491

Cited by 45 publications

(76 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This explains why the optimal value is always obtained at p a = 1. The resulting delay-throughput curves for the proposed policy as well as for [22] are shown in Fig. 10 for two different values of f sd , namely, 0.7 and 0.8.…”

Section: Fundamental Tradeoffsmentioning

confidence: 99%

“…This idea was further investigated in [21]. Protocol-level cooperation is implemented in [22] among N nodes in a wireless network, whereby each node is a source and a prospective relay at the same time. Performance gains in terms of stable throughput region and average delay are demonstrated.…”

Section: Introductionmentioning

confidence: 99%

“…Unlike conventional relaying which assigns full priority to the relay queue [13], [22], our prime objective is to develop a mathematical framework for the class of randomized cooperative policies which open room for accommodating cognitive radio systems supporting real-time, e.g., multimedia, and traffic with stringent QoS requirements, a.k.a. opportunistic realtime (ORT) [25].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Cognitive Radio Networks With Probabilistic Relaying: Stable Throughput and Delay Tradeoffs

Ashour

El-Sherif

ElBatt

et al. 2015

IEEE Trans. Commun.

View full text Add to dashboard Cite

This paper studies fundamental throughput and delay tradeoffs in cognitive radio systems with cooperative secondary users. We focus on randomized cooperative policies, whereby the secondary user (SU) serves either its own queue or the primary users (PU) relayed packets queue with certain service probability. The proposed policy opens room for trading the PU delay for enhanced SU delay, and vice versa, depending on the application QoS requirements. Towards this objective, the systems stable throughput region is characterized. Furthermore, the moment generating function approach is employed and generalized for our system to derive closed-form expressions for the average packet delay for both users. The accuracy of these expressions is validated through simulations. Analytical and simulation results reveal that the service probability can steer the system into prioritizing PUs traffic at the expense of SUs QoS, or vice versa, independently from the admission probability. Alternatively, the ability of the admission probability to control the throughput and delay at the PU or the SU depends on the selected value for the service probability as well as the channel conditions. Finally, it is shown how the service and admission probabilities could be used to achieve the desired QoS level to both PU and SU.Index Terms-Cognitive relaying, moment generating function, stable throughput region, average delay simulations. 0090-6778 (c)

show abstract

Section: Fundamental Tradeoffsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Cognitive Radio Networks With Probabilistic Relaying: Stable Throughput and Delay Tradeoffs

Ashour

El-Sherif

ElBatt

et al. 2015

IEEE Trans. Commun.

View full text Add to dashboard Cite

show abstract

“…The schedule for the next superframe is calculated based on the updated channel estimations from the previous superframe. A similar schedule, but assuming perfect channel information available in all nodes, was used in [21] and showed good performance in terms of stable throughput regions and average delay.…”

Section: ) Evaluated Transmission Schedulesmentioning

confidence: 99%

Scheduling for Source Relaying With Packet Aggregation in Industrial Wireless Networks

Girs

Willig

Uhlemann

et al. 2016

IEEE Trans. Ind. Inf.

View full text Add to dashboard Cite

-The interest in wireless communication systems for industrial applications has grown significantly over the last years. More flexible, easier to install and maintain wireless networks present a promising alternative to the currently used wired systems. However, reliability and timeliness requirements at present met by wired networks need also be fulfilled by wireless solutions. Packet errors introduced when packets travel through wireless channels imply a significant challenge to fulfill these requirements. Relaying has been recognised to improve reliability in industrial wireless networks without causing additional delay. Further, recent results have shown that relaying combined with packet aggregation significantly outperforms simple relaying. However, it is not always costefficient to introduce additional relay nodes into an industrial network and hence, in this paper, we propose to use a combination of relaying and packet aggregation at the source nodes. The results show that when relaying and aggregation are used at the source nodes, the transmission schedule plays a crucial role. A schedule adapting to the varying channel conditions improves the performance substantially. By carefully choosing which packet to aggregate, even further improvements can be achieved.

show abstract

“…The literature on cooperative spectrum sharing networks addresses the optimal relay selection and resource allocation [12][13] [14], and presents scaling laws [18][19] [20], assuming that users are always willing to cooperate and always have packets to transmit. Non-backlogged traffic is considered for various cooperative spectrum sharing schemes in [21] [22][23] [24]. These works characterize the stable-throughput region under stochastic packet arrival and transmission processes, however, still assuming that the SUs always cooperate.…”

Section: Introductionmentioning

confidence: 99%

Dynamic Cooperative Secondary Access in Hierarchical Spectrum Sharing Networks

Wang

Fodor²

2014

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

Abstract-We consider a hierarchical spectrum sharing network consisting of a primary and a cognitive secondary transmitter-receiver pair, with non-backlogged traffic. The secondary transmitter may utilize cooperative transmission techniques to relay primary traffic while superimposing its own information, or transmit opportunistically when the primary user is idle. The secondary user meets a dilemma in this scenario. Choosing cooperation it can transmit a packet immediately even if the primary queue is not empty, but it has to bear the additional cost of relaying, since the primary performance needs to be guaranteed. To solve this dilemma we propose dynamic cooperative secondary access control that takes the state of the spectrum sharing network into account. We formulate the problem as a Markov Decision Process (MDP) and prove the existence of a stationary policy that is average cost optimal. Then we consider the scenario when the traffic and link statistics are not known at the secondary user, and propose to find the optimal transmission strategy using reinforcement learning. With extensive numerical evaluation, we demonstrate that dynamic cooperation with state aware sequential decision is very efficient in spectrum sharing systems with stochastic traffic, and show that dynamic cooperation is necessary for the secondary system to be able to adapt to changing load conditions or to changing available energy resource. Our results show, that learning based access control, with or without known primary buffer state, has close to optimal performance. Index Terms-Hierarchical spectrum sharing, cooperative transmission, queuing systems, Markov decision process, reinforcement learning.

show abstract

Cooperative Access in Wireless Networks: Stable Throughput and Delay

Cited by 45 publications

References 32 publications

Cognitive Radio Networks With Probabilistic Relaying: Stable Throughput and Delay Tradeoffs

Cognitive Radio Networks With Probabilistic Relaying: Stable Throughput and Delay Tradeoffs

Scheduling for Source Relaying With Packet Aggregation in Industrial Wireless Networks

Dynamic Cooperative Secondary Access in Hierarchical Spectrum Sharing Networks

Contact Info

Product

Resources

About