Maximum Throughput of a Secondary User Cooperating with an Energy-Aware Primary User

This paper proposes a cooperation protocol between a secondary user (SU) and a primary user (PU) which dedicates a free frequency subband for the SU if cooperation results in energy saving. Time is slotted and users are equipped with buffers. Under the proposed protocol, the PU releases portion of its bandwidth for secondary transmission. Moreover, it assigns a portion of the time slot duration for the SU to relay primary packets and achieve a higher successful packet reception probability at the primary receiver. We assume that the PU has three states: idle, forward, and retransmission states. At each of these states, the SU accesses the channel with adaptive transmission parameters. The PU cooperates with the SU if and only if the achievable average number of transmitted primary packets per joule is higher than the number of transmitted packets per joule when it operates alone. The numerical results show the beneficial gains of the proposed cooperative cognitive protocol.Comment: Accepted WiOpt 201

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

Cooperative sensing of spectrum opportunities

Reliability and availability of sensing information gathered from local spectrum sensing (LSS) by a single Cognitive Radio is strongly affected by the propagation conditions, period of sensing, and geographical position of the device. For this reason, cooperative spectrum sensing (CSS) was largely proposed in order to improve LSS performance by using cooperation between Secondary Users (SUs). The goal of this chapter is to provide a general analysis on CSS for cognitive radio networks (CRNs). Firstly, the theoretical system model for centralized CSS is introduced, together with a preliminary discussion on several fusion rules and operative modes. Moreover, three main aspects of CSS that substantially differentiate the theoretical model from realistic application scenarios are analyzed: (i) the presence of spatiotemporal correlation between decisions by different SUs; (ii) the possible mobility of SUs; and (iii) the nonideality of the control channel between the SUs and the Fusion Center (FC). For each aspect, a possible practical solution for network organization is presented, showing that, in particular for the first two aspects, cluster-based CSS, in which sensing SUs are properly chosen, could mitigate the impact of such realistic assumptions

Applications of Repeated Games in Wireless Networks: A Survey

A repeated game is an effective tool to model interactions and conflicts for players aiming to achieve their objectives in a long-term basis. Contrary to static noncooperative games that model an interaction among players in only one period, in repeated games, interactions of players repeat for multiple periods; and thus the players become aware of other players' past behaviors and their future benefits, and will adapt their behavior accordingly. In wireless networks, conflicts among wireless nodes can lead to selfish behaviors, resulting in poor network performances and detrimental individual payoffs. In this paper, we survey the applications of repeated games in different wireless networks. The main goal is to demonstrate the use of repeated games to encourage wireless nodes to cooperate, thereby improving network performances and avoiding network disruption due to selfish behaviors. Furthermore, various problems in wireless networks and variations of repeated game models together with the corresponding solutions are discussed in this survey. Finally, we outline some open issues and future research directions.Comment: 32 pages, 15 figures, 5 tables, 168 reference

Dynamic Geospatial Spectrum Modelling: Taxonomy, Options and Consequences

Much of the research in Dynamic Spectrum Access (DSA) has focused on opportunistic access in the temporal domain. While this has been quite useful in establishing the technical feasibility of DSA systems, it has missed large sections of the overall DSA problem space. In this paper, we argue that the spatio-temporal operating context of specific environments matters to the selection of the appropriate technology for learning context information. We identify twelve potential operating environments and compare four context awareness approaches (on-board sensing, databases, sensor networks, and cooperative sharing) for these environments. Since our point of view is overall system cost and efficiency, this analysis has utility for those regulators whose objectives are reducing system costs and enhancing system efficiency. We conclude that regulators should pay attention to the operating environment of DSA systems when determining which approaches to context learning to encourage

Separation Framework: An Enabler for Cooperative and D2D Communication for Future 5G Networks

Soaring capacity and coverage demands dictate that future cellular networks need to soon migrate towards ultra-dense networks. However, network densification comes with a host of challenges that include compromised energy efficiency, complex interference management, cumbersome mobility management, burdensome signaling overheads and higher backhaul costs. Interestingly, most of the problems, that beleaguer network densification, stem from legacy networks' one common feature i.e., tight coupling between the control and data planes regardless of their degree of heterogeneity and cell density. Consequently, in wake of 5G, control and data planes separation architecture (SARC) has recently been conceived as a promising paradigm that has potential to address most of aforementioned challenges. In this article, we review various proposals that have been presented in literature so far to enable SARC. More specifically, we analyze how and to what degree various SARC proposals address the four main challenges in network densification namely: energy efficiency, system level capacity maximization, interference management and mobility management. We then focus on two salient features of future cellular networks that have not yet been adapted in legacy networks at wide scale and thus remain a hallmark of 5G, i.e., coordinated multipoint (CoMP), and device-to-device (D2D) communications. After providing necessary background on CoMP and D2D, we analyze how SARC can particularly act as a major enabler for CoMP and D2D in context of 5G. This article thus serves as both a tutorial as well as an up to date survey on SARC, CoMP and D2D. Most importantly, the article provides an extensive outlook of challenges and opportunities that lie at the crossroads of these three mutually entangled emerging technologies.Comment: 28 pages, 11 figures, IEEE Communications Surveys & Tutorials 201

Vehicular Dynamic Spectrum Access: Using Cognitive Radio for Automobile Networks

Vehicular Dynamic Spectrum Access (VDSA) combines the advantages of dynamic spectrum access to achieve higher spectrum efficiency and the special mobility pattern of vehicle fleets. This dissertation presents several noval contributions with respect to vehicular communications, especially vehicle-to-vehicle communications. Starting from a system engineering aspect, this dissertation will present several promising future directions for vehicle communications, taking into consideration both the theoretical and practical aspects of wireless communication deployment. This dissertation starts with presenting a feasibility analysis using queueing theory to model and estimate the performance of VDSA within a TV whitespace environment. The analytical tool uses spectrum measurement data and vehicle density to find upper bounds of several performance metrics for a VDSA scenario in TVWS. Then, a framework for optimizing VDSA via artificial intelligence and learning, as well as simulation testbeds that reflect realistic spectrum sharing scenarios between vehicle networks and heterogeneous wireless networks including wireless local area networks and wireless regional area networks. Detailed experimental results justify the testbed for emulating a mobile dynamic spectrum access environment composed of heterogeneous networks with four dimensional mutual interference. Vehicular cooperative communication is the other proposed technique that combines the cooperative communication technology and vehicle platooning, an emerging concept that is expected to both increase highway utilization and enhance both driver experience and safety. This dissertation will focus on the coexistence of multiple vehicle groups in shared spectrum, where intra-group cooperation and inter-group competition are investigated in the aspect of channel access. Finally, a testbed implementation VDSA is presented and a few applications are developed within a VDSA environment, demonstrating the feasibility and benefits of some features in a future transportation system