In this paper, we consider a cooperative device-todevice (D2D) communication system, where the D2D transmitters (DTs) act as relays to assist the densified cellular network users (CUs) for transmission quality of service (QoS) improvement. The proposed system achieves a win-win situation, i.e. improving the spectrum efficiency of the CUs that cannot meet their rate requirement while providing spectrum access for D2D pairs. Unlike previous works, to reduce the overhead, we design a novel two-timescale resource allocation scheme, in which the pairing between CUs and D2D pairs is decided at a long timescale and transmission time for CU and D2D pair is determined at a short timescale. Specifically, to characterize the long-term payoff of each potential CU-D2D pair, we investigate the optimal cooperation policy to decide the transmission time based on the instantaneous channel state information (CSI). We prove that the optimal policy is a threshold policy which can be achieved via binary search. Since CUs and D2D pairs are self-interested, they are paired only when they agree to cooperate mutually. Therefore, to study the cooperation behaviors of CUs and D2D pairs, we formulate the pairing problem as a matching game, based on the long-term payoff achieved by the optimal cooperation policy of each possible pairing. Furthermore, unlike most previous matching models in D2D networks, we allow transfer between CUs and D2D pairs to improve the performance. To solve the pairing problem, a distributed algorithm is proposed, which converges to an ε-stable matching. We show that there is a tradeoff between the optimality and the computational complexity of the algorithm. We also analyze the algorithm in terms of the robustness to the unilateral deviation of D2D pairs. Finally, the simulation results verify the efficiency of the proposed matching algorithm.
In this letter, we propose two power allocation schemes based on the statistical channel state information (CSI) and instantaneous s->r CSI at transmitters respectively for a 2-N-2 cooperative multicast system with non-regenerative network coding.Then the isolated precoder and the distributed precoder are respectively applied to the schemes to further improve the system performance by achieving the full diversity gain. Finally, we demonstrate that joint instantaneous s->r CSI based power allocation and distributed precoder design achieve the best performance.
We analyze the performance of amplify-and-forward (AF) automatic repeat request (ARQ) for a two-hop cooperative system with reliability constrains. For this setup, we first derive the closed-form outage probability expression. Next, we present a power allocation scheme that allows us to achieve a target outage probability, while minimizing the outage-weighted average power expenditure for asymmetric power allocation between the source and relay. This is cast as an optimization problem, and the optimal power allocation (OPA) is obtained in closed form by invoking the Karush-Kuhn-Tucker (KKT) co…
In this paper, we study the resource allocation problem for a cooperative device-to-device (D2D)-enabled wireless caching network, where each user randomly caches popular contents to its memory and shares the contents with nearby users through D2D links. To enhance the throughput of spectrum sharing D2D links, which may be severely limited by the interference among D2D links, we enable the cooperation among some of the D2D links to eliminate the interference among them. We formulate a joint link scheduling and power allocation problem to maximize the overall throughput of cooperative D2D links…
In this paper, we propose a power allocation strategy for the adaptive orthogonal frequency-division multiplexing (OFDM) index modulation (IM) in cooperative networks. The allocation strategy is based on the Karush-Kuhn-Tucker (KKT) conditions, and aims at maximizing the average network capacity according to the instantaneous channel state information (CSI). As the transmit power at source and relay is constrained separately, we can thus formulate an optimization problem by allocating power to active subcarriers. Compared to the conventional uniform power allocation strategy, the proposed dyna…
This paper considers wireless-powered cooperative jamming (CJ) to secure communication between a transmitter (Tx) and an information receiver (IR), in the presence of an energy receiver (ER) which is termed as a potential eavesdropper. The full-duplex jammer harvests energy from the Tx's information signal and transmits jamming signal at the same time, where the jamming signal not only confounds the ER (potential eavesdropper) but also charges the ER. Our goal is to maximize the secrecy information rate by jointly optimizing the power allocation at the Tx and jammer while maintaining the harve…
This paper is on relay selection in uplink of an in-band full-duplex (IBFD) cooperative cellular network. Assuming an orthogonal frequency division multiple access (OFDMA) cellular network, we develop a relay selection and resource allocation algorithm for this network. The relay selection algorithms select the best relay based on distance between users and signal to interference plus noise ratio (SINR) that operate in amplify and forward (AF) mode. The optimization problem allocates the optimum subcarriers and powers to all users to maximize the average sum-rate of the network. In addition, t…
This paper studies the secrecy rate maximization problem of a secure wireless communication system, in the presence of multiple eavesdroppers. The security of the communication link is enhanced through cooperative jamming, with the help of multiple jammers. First, a feasibility condition is derived to achieve a positive secrecy rate at the destination. Then, we solve the original secrecy rate maximization problem, which is not convex in terms of power allocation at the jammers. To circumvent this non-convexity, the achievable secrecy rate is approximated for a given power allocation at the jam…
We consider a cooperative device-to-device (D2D) communication system, where the D2D transmitters (DTs) act as relays to assist cellular users (CUs) in exchange for the opportunities to use the licensed spectrum. To reduce the overhead, we propose a novel two-timescale resource allocation scheme, in which the pairing between CUs and D2D pairs is decided at a long timescale and time allocation factor for CU and D2D pair is determined at a short timescale. Specifically, to characterize the long-term payoff of each potential CU-D2D pair, we investigate the optimal cooperation policy to decide the…
In a heterogeneous cellular network (HetNet), consider that a base station in the HetNet is able to simultaneously schedule and serve K users in the downlink by performing the power-domain non-orthogonal multiple access (NOMA) scheme. This paper aims at the preliminary study on the downlink coverage and throughput performances of the HetNet with the non-cooperative and the (proposed) cooperative NOMA schemes. First, the coverage probability and link throughput of K users in each cell are studied and their accurate expressions are derived for the non-cooperative NOMA scheme in which no BSs are …
This paper investigates the relay assignment and power allocation problem for two different network power management policies: group lifetime maximization (GLM) and minimum weighted total power (MWTP), with the aim of lifetime maximization in symbol error rate (SER) constrained multipleuser cooperative network. With optimal power allocation solution obtained for each policy, we show that the optimal relay assignment can be obtained using bottleneck matching (BM) algorithm and minimum weighted matching (MWM) algorithm for GLM and MWTP policies, respectively. Since relay assignment with BM algor…
In this paper, we investigate for the first time the dynamic power allocation and decoding order at the base station (BS) of two-user uplink (UL) cooperative non-orthogonal multiple access (C-NOMA)-based cellular networks. In doing so, we formulate a joint optimization problem aiming at maximizing the minimum user achievable rate, which is a non-convex optimization problem and hard to be directly solved. To tackle this issue, an iterative algorithm based on successive convex approximation (SCA) is proposed. The numerical results reveal that the proposed scheme provides superior performance in …
This paper investigates the cooperative full-duplex device-to-device (D2D) communication underlaying cellular network, where the cellular user (CU) acts as a full-duplex relay to assist the D2D communication. To simultaneously support D2D relaying and uplink transmission, superposition coding and successive interference cancellation are adopted at the CU and the D2D receiver, respectively. The achievable rate region and joint outage probability are derived to characterize the performance of the considered system. An optimal power allocation scheme is proposed to maximize the minimum achievable…
We consider an energy minimization problem for cooperative LTE networks. To reduce energy consumption, we investigate how to jointly optimize the transmit power and the association between cells and user equipments (UEs), by taking into consideration joint transmission (JT), one of the coordinated multipoint (CoMP) techniques. We formulate the optimization problem mathematically. For solving the problem, a dynamic power allocation algorithm that adjusts the transmit power of all cells, and an algorithm for optimizing the cell-UE association, are proposed. The two algorithms are iteratively use…
In the paper "Finite-SNR Diversity-Multiplexing Tradeoff for Network Coded Cooperative OFDMA Systems', the authors adopt a recently proposed subcarrier allocation algorithm aiming at providing optimal frequency diversity to an OFDMA-based network with network-coded cooperation (NCC), where $P$ source nodes transmit independent information to a common destination with the help of $M$ relay nodes, in a frequency-selective channel with $L$ coherence blocks. However, the analysis of the so-called NCC-OFDMA scheme proposed in the aforementioned paper assumes that the subcarrier allocation algorithm…
We integrate a wireless powered communication network with a cooperative cognitive radio network, where multiple secondary users (SUs) powered wirelessly by a hybrid access point (HAP) help a primary user relay the data. As a reward for the cooperation, the secondary network gains the spectrum access where SUs transmit to HAP using time division multiple access. To maximize the sum-throughput of SUs, we present a secondary sum-throughput optimal resource allocation (STORA) scheme. Under the constraint of meeting target primary rate, the STORA scheme chooses the optimal set of relaying SUs and …
Perfect channel state information (CSI) is usually required when considering relay selection and power allocation in cooperative communication. However, it is difficult to get an accurate CSI in practical situations. In this letter, we study the outage probability minimizing problem based on optimizing relay selection and transmission power. We propose a prioritized experience replay aided deep deterministic policy gradient learning framework, which can find an optimal solution by dealing with continuous action space, without any prior knowledge of CSI. Simulation results reveal that our appro…
Cooperative and cognitive non-orthogonal multiple access (CCR-NOMA) has been recognized as a promising technique to overcome issues of spectrum scarcity and support massive connectivity envisioned in next-generation wireless networks. In this paper, we investigate the deployment of an unmanned aerial vehicle (UAV) as a relay that fairly serves a large number of secondary users in a hot-spot region. The UAV deployment algorithm must jointly account for user clustering, channel assignment, and resource allocation sub-problems. We propose a solution methodology that obtains user clustering and ch…
Recently, physical layer (PHY) caching has been proposed to exploit the dynamic side information induced by caches at base stations (BSs) to support Coordinated Multi-Point (CoMP) and achieve huge degrees of freedom (DoF) gains. Due to the limited cache storage capacity, the performance of PHY caching depends heavily on the cache content placement algorithm. In existing algorithms, the cache content placement is adaptive to the long-term popularity distribution in an offline manner. We propose an online PHY caching framework which adapts the cache content placement to microscopic spatial and t…
This work presents a new resource allocation optimization framework for cellular networks using neighborhood-based optimization. Under this optimization framework resources are allocated within virtual cells encompassing several base-stations and the users within their coverage area. Incorporating the virtual cell concept enables the utilization of more sophisticated cooperative communication schemes such as coordinated multi-point decoding. We form the virtual cells using hierarchical clustering given a particular number of such cells. Once the virtual cells are formed, we consider a cooperat…
In this paper power allocation in a cellular network, which transmitter uses massive multiple inputs multiple outputs (MIMO) system was studied. As circuit power consumption is increased by the number of antenna in transmitter and users, thus, to analyze the performance of the network, energy efficiency objective function with considering circuit power consumption was selected. An energy efficiency optimization problem under both maximum transmit power and quality of service (QoS) constraints was considered. To solve this problem under cooperation between users and their base station (BS), ene…
Cooperative rate splitting (CRS), built upon rate splitting multiple access (RSMA) and opportunistic user relaying, has been recognized as a promising transmission strategy to enhance the user fairness and spectral efficiency in multiantenna broadcast channels. To further boost its performance, the interplay of CRS and reconfigurable intelligent surface (RIS) is investigated in this work. Specifically, a novel RIS-aided CRS transmission framework is proposed and the corresponding resource allocation problem to maximize the minimum rate among users is investigated. An alternative optimization a…
This paper studies a multi-user cooperative mobile-edge computing (MEC) system, in which a local mobile user can offload intensive computation tasks to multiple nearby edge devices serving as helpers for remote execution. We focus on the scenario where the local user has a number of independent tasks that can be executed in parallel but cannot be further partitioned. We consider a time division multiple access (TDMA) communication protocol, in which the local user can offload computation tasks to the helpers and download results from them over pre-scheduled time slots. Under this setup, we min…
To achieve the potential in providing high throughput for cellular networks by device-to-device (D2D) communications, the interference among D2D links should be carefully managed. In this paper, we propose an opportunistic cooperation strategy for D2D transmission by exploiting the caching capability at the users to control the interference among D2D links. We consider overlay inband D2D, divide the D2D users into clusters, and assign different frequency bands to cooperative and non-cooperative D2D links. To provide high opportunity for cooperative transmission, we introduce a caching policy. …
The energy efficiency (EE) of a multi-user multi-relay system with the maximum diversity network coding (MDNC) is studied. We explicitly find the connection among the outage probability, energy consumption and EE and formulate the maximizing EE problem under the outage probability constraints. Relay scheduling (RS) and power allocation (PA) are applied to schedule the relay states (transmitting, sleeping, \emph{etc}) and optimize the transmitting power under the practical channel and power consumption models. Since the optimization problem is NP-hard, to reduce computational complexity, the ou…
To efficiently support safety-related vehicular applications, the ultra-reliable and low-latency communication (URLLC) concept has become an indispensable component of vehicular networks (VNETs). Due to the high mobility of VNETs, exchanging near-instantaneous channel state information (CSI) and making reliable resource allocation decisions based on such short-term CSI evaluations are not practical. In this paper, we consider the downlink of a vehicle-to-infrastructure (V2I) system conceived for URLLC based on idealized perfect and realistic imperfect CSI. By exploiting the benefits of the mas…
Distributed Uplink Resource Allocation in Cognitive Radio Networks -- Part II: Equilibria and Algorithms for Joint Access Point Selection and Power Allocation
This paper proposes and optimizes a cooperative non-orthogonal multiple-access (Co-NOMA) scheme in the context of multicell visible light communications (VLC) networks, as a means to mitigate inter-cell interference in Co-NOMA-enabled systems. Consider a network with multiple VLC access points (APs), where each AP serves two users using light intensity. In each cell, the weak user (the cell edge user) can be served either directly by the VLC AP, or through the strong user that can decode the weak user's message and forward it through the radio-frequency (RF) link. The paper then considers the …
Visible light communications (VLC) have emerged as strong candidates for meeting the escalating demand for high data rates. Consider a VLC network, where multiple access-points (APs) serve both energy-harvesting users (EHUs), i.e., users which harvest energy from light intensity, and information-users (IUs), i.e., users which gather data information. In order to jointly balance the achievable sum-rate at the IUs and the energy harvested by the EHUs, the paper considers maximizing a network-wide utility, which consists of a weighted-sum of the IUs sum-rate and the EHUs harvested energy, subject…
