@inproceedings{10.1145/1374618.1374621,
author = {Shi, Yi and Sharma, Sushant and Hou, Y. Thomas and Kompella, Sastry},
title = {Optimal Relay Assignment for Cooperative Communications},
year = {2008},
isbn = {9781605580739},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {[https://doi.org/10.1145/1374618.1374621](https://doi.org/10.1145/1374618.1374621)},
doi = {10.1145/1374618.1374621},
abstract = {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.},
booktitle = {Proceedings of the 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing},
pages = {3–12},
numpages = {10},
keywords = {wireless networks, network capacity, cooperative communications},
location = {Hong Kong, Hong Kong, China},
series = {MobiHoc '08}
}