Papers
Topics
Authors
Recent
Search
2000 character limit reached

Resource Allocation and Relay Selection for Collaborative Communications

Published 24 Oct 2008 in cs.IT and math.IT | (0810.4366v1)

Abstract: We investigate the relay selection problem for a decode and forward collaborative network. Users are able to collaborate; decode messages of each other, re-encode and forward along with their own messages. We study the performance obtained from collaboration in terms of 1) increasing the achievable rate, 2) saving the transmit energy and 3) reducing the resource requirement (resource means time-bandwidth). To ensure fairness, we fix the transmit-energy-to-rate ratio among all users. We allocate resource optimally for the collaborative protocol (CP), and compare the result with the non-collaborative protocol (NCP) where users transmits their messages directly. The collaboration gain is a function of the channel gain and available energies and allows us 1) to decide to collaborate or not, 2) to select one relay among the possible relay users, and 3) to determine the involved gain and loss of possible collaboration. A considerable gain can be obtained if the direct source-destination channel gain is significantly smaller than those of alternative involved links. We demonstrate that a rate and energy improvement of up to $(1+\sqrt[\eta]{\frac{k}{k+1}})\eta$ can be obtained, where $\eta$ is the environment path loss exponent and $k$ is the ratio of the rates of involved users. The gain is maximum for low transmit-energy-to-received-noise-ratio (TERN) and in a high TERN environment the NCP is preferred.

Citations (17)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.