Spectrum sharing via HARQ feedback and adaptive power allocation

Recently, substantial attention has been paid to improve the spectral efficiency of communication setups using different spectrum sharing techniques. This paper studies the throughput of spectrum sharing channels utilizing hybrid automatic repeat request (HARQ) protocols. Considering different HARQ schemes, the unlicensed user throughput is obtained under an outage probability constraint for the licensed user. The outage-limited throughput is obtained for both independent and spatially-correlated fading conditions, where there is spatial dependency between the fading coefficients. The results show that, using HARQ and adaptive power allocation, the maximum throughput is achieved by combination of simultaneous transmission and interference-avoiding spectrum sharing paradigms. The performance of the spectrum sharing networks is not sensitive to spatial correlation, within the practical range, and the throughput changes are negligible at low/moderate correlations. Finally, there is considerable potential for data transmission of the unlicensed user with limited performance degradation of the licensed user

Cooperative retransmission protocols in fading channels : issues, solutions and applications

Future wireless systems are expected to extensively rely on cooperation between terminals, mimicking MIMO scenarios when terminal dimensions limit implementation of multiple antenna technology. On this line, cooperative retransmission protocols are considered as particularly promising technology due to their opportunistic and flexible exploitation of both spatial and time diversity. In this dissertation, some of the major issues that hinder the practical implementation of this technology are identified and pertaining solutions are proposed and analyzed. Potentials of cooperative and cooperative retransmission protocols for a practical implementation of dynamic spectrum access paradigm are also recognized and investigated. Detailed contributions follow. While conventionally regarded as energy efficient communications paradigms, both cooperative and retransmission concepts increase circuitry energy and may lead to energy overconsumption as in, e.g., sensor networks. In this context, advantages of cooperative retransmission protocols are reexamined in this dissertation and their limitation for short transmission ranges observed. An optimization effort is provided for extending an energy- efficient applicability of these protocols. Underlying assumption of altruistic relaying has always been a major stumbling block for implementation of cooperative technologies. In this dissertation, provision is made to alleviate this assumption and opportunistic mechanisms are designed that incentivize relaying via a spectrum leasing approach. Mechanisms are provided for both cooperative and cooperative retransmission protocols, obtaining a meaningful upsurge of spectral efficiency for all involved nodes (source-destination link and the relays). It is further recognized in this dissertation that the proposed relaying-incentivizing schemes have an additional and certainly not less important application, that is in dynamic spectrum access for property-rights cognitive-radio implementation. Provided solutions avoid commons-model cognitive-radio strict sensing requirements and regulatory and taxonomy issues of a property-rights model

Distributed spectrum leasing via cooperation

“Cognitive radio” networks enable the coexistence of primary (licensed) and secondary (unlicensed) terminals. Conventional frameworks, namely commons and property-rights models, while being promising in certain aspects, appear to have significant drawbacks for implementation of large-scale distributed cognitive radio networks, due to the technological and theoretical limits on the ability of secondary activity to perform effective spectrum sensing and on the stringent constraints on protocols and architectures. To address the problems highlighted above, the framework of distributed spectrum leasing via cross-layer cooperation (DiSC) has been recently proposed as a basic mechanism to guide the design of decentralized cognitive radio networks. According to this framework, each primary terminal can ”lease” a transmission opportunity to a local secondary terminal in exchange for cooperation (relaying) as long as secondary quality-of-service (QoS) requirements are satisfied. The dissertation starts by investigating the performance bounds from an information-theoretical standpoint by focusing on the scenario of a single primary user and multiple secondary users with private messages. Achievable rate regions are derived for discrete memoryless and Gaussian models by considering Decode-and-Forward (DF), with both standard and parity-forwarding techniques, and Compress-and-Forward (CF), along with superposition coding at the secondary nodes. Then a framework is proposed that extends the analysis to multiple primary users and multiple secondary users by leveraging the concept of Generalized Nash Equilibrium. Accordingly, multiple primary users, each owning its own spectral resource, compete for the cooperation of the available secondary users under a shared constraint on all spectrum leasing decisions set by the secondary QoS requirements. A general formulation of the problem is given and solutions are proposed with different signaling requirements among the primary users. The novel idea of interference forwarding as a mechanism to enable DiSC is proposed, whereby primary users lease part of their spectrum to the secondary users if the latter assist by forwarding information about the interference to enable interference mitigation at the primary receivers. Finally, an application of DiSC in multi-tier wireless networks such as femtocells overlaid by macrocells whereby the femtocell base station acts as a relay for the macrocell users is presented. The performance advantages of the proposed application are evaluated by studying the transmission reliability of macro and femto users for a quasi-static fading channel in terms of outage probability and diversity-multiplexing trade-off for uplink and, more briefly, for downlink

Enabling Technologies for Ultra-Reliable and Low Latency Communications: From PHY and MAC Layer Perspectives

© 1998-2012 IEEE. Future 5th generation networks are expected to enable three key services-enhanced mobile broadband, massive machine type communications and ultra-reliable and low latency communications (URLLC). As per the 3rd generation partnership project URLLC requirements, it is expected that the reliability of one transmission of a 32 byte packet will be at least 99.999% and the latency will be at most 1 ms. This unprecedented level of reliability and latency will yield various new applications, such as smart grids, industrial automation and intelligent transport systems. In this survey we present potential future URLLC applications, and summarize the corresponding reliability and latency requirements. We provide a comprehensive discussion on physical (PHY) and medium access control (MAC) layer techniques that enable URLLC, addressing both licensed and unlicensed bands. This paper evaluates the relevant PHY and MAC techniques for their ability to improve the reliability and reduce the latency. We identify that enabling long-term evolution to coexist in the unlicensed spectrum is also a potential enabler of URLLC in the unlicensed band, and provide numerical evaluations. Lastly, this paper discusses the potential future research directions and challenges in achieving the URLLC requirements

Performance of cognitive stop-and-wait hybrid automatic repeat request in the face of imperfect sensing

The cognitive radio (CR) paradigm has the potential of improving the exploitation of the electromagnetic spectrum by detecting instantaneously unoccupied spectrum slots allocated to primary users (PUs). In order to support the process of spectrum reuse, we consider a CR scheme, which senses and opportunistically accesses a PU's spectrum for communication between a pair of nodes relying on the stop-and-wait hybrid automatic repeat request (SW-HARQ) protocol. This arrangement is represented by the cognitive SW-HARQ (CSW-HARQ), where the availability/unavailability of the PU's channel is modeled as a two-state Markov chain having OFF and ON states, respectively. Once the cognitive user (CU) finds that the PU's channel is available (i.e., in the OFF state), the CU transmits data over the PU channel's spectrum, while relying on the principles of SW-HARQ. We investigate both the throughput and the delay of CSW-HARQ, with a special emphasis on the impact of the various system parameters involved in the scenarios of both perfect and imperfect spectrum sensing. Furthermore, we analyze both the throughput as well as the average packet delay and end-to-end packet delay of the CSW-HARQ system. We propose a pair of analytical approaches: 1) the probability-based and 2) the discrete time Markov chain-based. Closed-form expressions are derived for both the throughput and the delay under the perfect and imperfect sensing environments that are validated by simulation. We demonstrate that the activity of PUs, the transmission reliability of the CU, and the sensing environment have a significant impact on both the throughput and the delay of the CR system