Sciweavers

Share
MOBIHOC
2008
ACM

Optimal relay assignment for cooperative communications

9 years 2 months ago
Optimal relay assignment for cooperative communications
Recently, cooperative communications, in the form of keeping each node with a single antenna and having a node exploit a relay node's antenna, is shown to be a promising approach to achieve spatial diversity. Under this communication paradigm, the choice of relay node plays a significant role in the overall system performance. In this paper, we study the relay node assignment problem in a network environment, where multiple source-destination pairs compete for the same pool of relay nodes in the network. The main contribution of this paper is the development of a polynomial time algorithm to solve this problem. A key idea in this algorithm is a "linear marking" mechanism, which is able to offer a linear complexity for each iteration. We give a formal proof of optimality for this algorithm. We also show several attractive properties associated with this algorithm. Categories and Subject Descriptors C.2.1 [Network Architecture and Design]: Wireless communication General T...
Yi Shi, Sushant Sharma, Y. Thomas Hou, Sastry Komp
Added 24 Dec 2009
Updated 24 Dec 2009
Type Conference
Year 2008
Where MOBIHOC
Authors Yi Shi, Sushant Sharma, Y. Thomas Hou, Sastry Kompella
Comments (0)
books