Related papers: When Network Coding and Dirty Paper Coding meet in…
Dirty Paper Coding (DPC) is considered as the optimal precoding which achieves capacity for the Gaussian Multiple-Input Multiple-Output (MIMO) broadcast channel (BC). However, to find the optimal precoding order, it needs to repeat N! times…
In this paper, we investigate the impact of network coding at the relay node on the stable throughput rate in multicasting cooperative wireless networks. The proposed protocol adopts Network-level cooperation in contrast to the traditional…
Network coding is a highly efficient data dissemination mechanism for wireless networks. Since network coded information can only be recovered after delivering a sufficient number of coded packets, the resulting decoding delay can become…
Cooperative communications have emerged as a significant concept to improve reliability and throughput in wireless systems. On the other hand, WLANs based on random access mechanism have become popular due to ease of deployment and low…
A multiple-input multiple-output (MIMO) version of the dirty paper channel is studied, where the channel input and the dirt experience the same fading process and the fading channel state is known at the receiver (CSIR). This represents…
When two or more users in a wireless network transmit simultaneously, their electromagnetic signals are linearly superimposed on the channel. As a result, a receiver that is interested in one of these signals sees the others as unwanted…
A generalization of the problem of writing on dirty paper is considered in which one transmitter sends a common message to multiple receivers. Each receiver experiences on its link an additive interference (in addition to the additive…
This chapter presents joint interference suppression and power allocation algorithms for DS-CDMA and MIMO networks with multiple hops and amplify-and-forward and decode-and-forward (DF) protocols. A scheme for joint allocation of power…
This study investigates the problem of communication for a network composed of two half-duplex parallel relays with additive white Gaussian noise. Two protocols, i.e., \emph{Simultaneous} and \emph{Successive} relaying, associated with two…
In this work, we consider the problem of coding for the half-duplex non-orthogonal amplify-and-forward (NAF) cooperative channel where the transmitter to relay and the inter-relay links are highly reliable. We derive bounds on the diversity…
Cooperative computation is a promising approach for localized data processing at the edge, e.g. for Internet of Things (IoT). Cooperative computation advocates that computationally intensive tasks in a device could be divided into…
Fast data synchronization in wireless ad hoc networks is a challenging and critical problem. It is fundamental for efficient information fusion, control and decision in distributed systems. Previously, distributed data synchronization was…
We study an incremental redundancy (IR) cooperative coding scheme for wireless networks. To exploit the spatial diversity benefit we propose a cluster-based collaborating strategy for a quasi-static Rayleigh fading channel model and based…
One of the most efficient methods of exploiting space diversity for portable wireless devices is cooperative communication utilizing space-time block codes. In cooperative communication, users besides communicating their own information,…
In this paper, we study an interference relay network with a satellite as relay. We propose a cooperative strategy based on physical layer network coding and superposition modulation decoding for uni-directional communications among users.…
This work addresses the physical layer channel code design for an uncoordinated, frame- and slot-asynchronous random access protocol. Starting from the observation that collisions between two users yield very specific interference patterns,…
Network coding and opportunistic routing are two recognized innovative ideas to improve the performance of wireless networks by utilizing the broadcast nature of the wireless medium. In the last decade, there has been considerable research…
We evaluate the secrecy performance of a multiple access cooperative network where the destination node is wiretapped by a malicious and passive eavesdropper. We propose the application of the network coding technique as an alternative to…
We consider an ad hoc network in which each multi-antenna transmitter sends independent streams to multiple receivers in a Poisson field of interferers. We provide the outage probability and transmission capacity scaling laws, aiming at…
Dirty paper coding (DPC) allows a transmitter to send information to a receiver in the presence of interference that is known (non-causally) to the transmitter. The original version of DPC was derived for the case where the noise and the…