Rate Allocation for Cooperative Transmission in Parallel Channels

Abstract

In this paper, we consider cooperative transmission between two source and destination pairs. Exchange of data is allowed between the two source nodes. In addition to the direct transmission link from the source to the intended destination, we have a two-hop relay link that sends the data via the neighboring source node. We partition the bandwidth into two parts, and each part is utilized by one source node, such that the transmissions from the two sources are orthogonal to each other. In this way, the cooperative interference channel is reduced to two independent broadcast channels. The bandwidth of each source node is divided into orthogonal sub-channels, and results from parallel broadcast channel is used to find the optimal allocation of power and rate to each links. We propose an iterative algorithm that maximizes the weighted sum rate, and plot the achievable rate region.

Source-cooperated transmission protocol in a wireless cluster

“…However, compared to ref. [11], we have no limitation on the number of sources and destinations. The relay nodes in our system are those source nodes that are not only transmitting their own information, but also forwarding other sources' information in a decodeand-forward (DF) mode.…”

“…It integrates in the design the physical broadcasting property of wireless devices and utilizes the concurrent signals from multiple relaying nodes to enhance the detection, instead of having these signals served as interference to each other. Authors of [11] considered a cooperative transmission system with multiple sources and multiple destinations. They devised an iterative algorithm that computes the maximum weighted sum rate for the system with sources occupying disjoint frequency bands.…”

Grouping Algorithm for Partner Selection in Cooperative Transmission

“…Based on this model, we propose our partner selection algorithm in Sect. 4. Then, we evaluate the performance of the algorithm in Sect.…”

“…The partnered node decodes the incoming message, re-encodes and forwards it to the destination node. The achievable rate region for two node pairs is studied in [4].…”