Related papers: Asymptotically Optimal Scheduling for Compute-and-…
Many modern datacenter applications involve large-scale computations composed of multiple data flows that need to be completed over a shared set of distributed resources. Such a computation completes when all of its flows complete. A useful…
Compute-and-forward (CPF) strategy is one category of network coding in which a relay will compute and forward a linear combination of source messages according to the observed channel coefficients, based on the algebraic structure of…
Using physical layer network coding, compute-and-forward is a promising relaying scheme that effectively exploits the interference between users and thus achieves high rates. In this paper, we consider the problem of finding the optimal…
In this letter, we propose a joint resource allocation algorithm for an OFDM-based multi-user system assisted by an improved Decode-and-Forward (DF) relay. We aim at maximizing the sum rate of the system by jointly optimizing subcarrier…
Cell-Free (CF) Massive multiple-input multiple-output(MIMO) is a distributed antenna system, wherein a large number of back-haul linked access points randomly distributed over a coverage area serve simultaneously a smaller number of users.…
It is well known that opportunistic scheduling algorithms are throughput optimal under full knowledge of channel and network conditions. However, these algorithms achieve a hypothetical achievable rate region which does not take into…
In this paper, utilizing the relay buffers, we propose an opportunistic decode-wait-and-forward relay scheme for a point-to-point communication system with a half-duplexing relay network to better exploit the time diversity and relay…
We derive the capacity of the binary multi-way relay channel, in which multiple users exchange messages at a common rate through a relay. The capacity is achieved using a novel functional-decode-forward coding strategy. In the…
In this paper, the filter-and-forward (FF) relay design for orthogonal frequency-division multiplexing (OFDM) transmission systems is considered to improve the system performance over simple amplify-and-forward (AF) relaying. Unlike…
This paper studies the application of compute-and-forward to multiple access relay channels (MARC). Despite its promising advantage of improving network throughput, it is not straightforward to apply compute-and-forward to the MARC. This…
We consider the full-duplex two-way relay channel with direct link between two users and propose two coding schemes: a partial decode-forward scheme, and a combined decode-forward and compute-forward scheme. Both schemes use rate-splitting…
In this paper, for a fading decode-and-forward full-duplex relay channel, we analytically derive optimum power allocations. Individual power constraints for the source and the relay are assumed and the related optimization problem is…
This paper presents a novel two-way decode-and-forward (DF) relay strategy for Orthogonal Frequency Division Multiplexing (OFDM) relay networks. This DF relay strategy employs multi-subcarrier joint channel coding to leverage frequency…
In a multicell multiuser MIMO downlink employing random beamforming as the transmission scheme, the heterogeneous large scale channel effects of intercell and intracell interference complicate analysis of distributed scheduling based…
In a multiway relay channel (MWRC), pairwise transmission strategy can be used to reduce the computational complexity at the relay and the users without sacrificing the data rate, significantly. The performance of such pairwise strategies,…
In this paper we have studied downlink packet scheduling algorithms proposed for LTE cellular networks. The study emphasize on three most promising scheduling algorithms such as: FLS, EXP rule and LOG rule. The performance of these three…
Interference is usually viewed as an obstacle to communication in wireless networks. This paper proposes a new strategy, compute-and-forward, that exploits interference to obtain significantly higher rates between users in a network. The…
This paper considers the finite-field multi-way relay channel with pairwise message sharing, where multiple users exchange messages through a single relay and where the users may share parts of their source messages (meaning that some…
In this paper, we consider the problem of sum rate maximization in a bidirectional relay network with fading. Hereby, user 1 and user 2 communicate with each other only through a relay, i.e., a direct link between user 1 and user 2 is not…
In a wireless network, the efficiency of scheduling algorithms over time-varying channels depends heavily on the accuracy of the Channel State Information (CSI), which is usually quite ``costly'' in terms of consuming network resources.…