相关论文: Asymptotically Optimal Scheduling for Compute-and-…

This paper proposes a new cooperative protocol which involves cooperation between primary and secondary users. We consider a cognitive setting with one primary user and multiple secondary users. The time resource is partitioned into…

This paper studies the throughput maximization problem for a three-node relay channel with non-ideal circuit power. In particular, the relay operates in a half-duplex manner, and the decode-and-forward (DF) relaying scheme is adopted.…

In this work, we propose phase precoding for the compute-and-forward (CoF) protocol. We derive the phase precoded computation rate and show that it is greater than the original computation rate of CoF protocol without precoder. To maximize…

This paper studies a cooperative cognitive radio network where two primary users (PUs) exchange information with the help of a secondary user (SU) that is equipped with multiple antennas and in return, the SU superimposes its own messages…

We investigate cooperative wireless relay networks in which the nodes can help each other in data transmission. We study different coding strategies in the single-source single-destination network with many relay nodes. Given the myriad of…

In this paper, we investigate fundamental performance limits of cumulative distribution function (CDF)-based scheduling (CS) in downlink cellular networks. CS is known as an efficient scheduling method that can assign different time…

We study the broadcast transmission of a single file to an arbitrary number of receivers using Random Linear Network Coding (RLNC) in a network with unreliable channels. Due to the increased computational complexity of the decoding process…

We consider a three-node decode-and-forward (DF) half-duplex relaying system, where the source first harvests RF energy from the relay, and then uses this energy to transmit information to the destination via the relay. We assume that the…

In this paper, a new user-scheduling-and-beamforming method is proposed for multi-user massive multiple-input multiple-output (massive MIMO) broadcast channels in the context of two-stage beamforming. The key ideas of the proposed…

In this paper, a symbol-level selective transmission for full-duplex (FD) relaying networks is proposed to mitigate error propagation effects and improve system spectral efficiency. The idea is to allow the FD relay node to predict the…

The design of a scheduling scheme is crucial for the efficiency and user-fairness of wireless networks. Assuming that the quality of all user channels is available to a central controller, a simple scheme which maximizes the utility…

A new, fair relay selection scheme is proposed for a dual-hop decode-and-forward network with randomly-distributed relays. Most of the reported works in the literature achieve fairness at the expense of degrading the outage probability…

In this paper, we consider the coded-caching broadcast network with user cooperation, where a server connects with multiple users and the users can cooperate with each other through a cooperation network. We propose a centralized coded…

Integrating time-frequency resource conversion (TFRC), a new network resource allocation strategy, with call admission control can not only increase the cell capacity but also reduce network congestion effectively. However, the optimal…

We investigate techniques for designing modulation/coding schemes for the wireless two-way relaying channel. The relay is assumed to have perfect channel state information, but the transmitters are assumed to have no channel state…

The average coflow completion time (CCT) is the standard performance metric in coflow scheduling. However, standard CCT minimization may introduce unfairness between the data transfer phase of different computing jobs. Thus, while progress…

In this paper, a compress-and-forward scheme with backward decoding is presented for the unicast wireless relay network. The encoding at the source and relay is a generalization of the noisy network coding scheme (NNC). While it achieves…

In this paper, we devise a scheduling algorithm for ordering transmission of synchrophasor data from the substation to the control center in as short a time frame as possible, within the realtime hierarchical communications infrastructure…

This paper addresses the scheduling problem for unrelated crowd workers in mobile social networks, where the required service time for each task varies among the assigned crowd workers. The goal is to minimize the total weighted completion…

The relay channel, consisting of a source-destination pair and a relay, is a fundamental component of cooperative communications. While the capacity of a general relay channel remains unknown, various relaying strategies, including…