File(s) under permanent embargo
Unicast and broadcast throughput maximization in amplify-and-forward relay networks
journal contribution
posted on 2012-07-01, 00:00 authored by P Li, S Guo, Yong XiangYong Xiang, H JinCooperative communication (CC) offers an efficient and low-cost way to achieve spatial diversity by forming a virtual antenna array among single-antenna nodes that cooperatively share their antennas. It has been well recognized that the selection of relay nodes plays a critical role in the performance of CC. Most existing relay selection strategies focus on optimizing the outage probability or energy consumption. To fill in the vacancy of research on throughput improvement via CC, we study the relay selection problem with the objective of optimizing the throughput in this paper. For unicast, it is a P problem, and an optimal relay selection algorithm is provided with a correctness proof. For broadcast, we show the challenge of relay selection by proving it nonprobabilistic hard (NP-hard). A greedy heuristic algorithm is proposed to effectively choose a set of relay nodes that maximize the broadcast throughput. Simulation results show that the proposed algorithms can achieve high throughput under various network settings.
History
Journal
IEEE transactions on vehicular technologyVolume
61Issue
6Pagination
2768 - 2776Publisher
IEEELocation
Piscataway, N. J.Publisher DOI
ISSN
0018-9545eISSN
1939-9359Language
engPublication classification
C1 Refereed article in a scholarly journalCopyright notice
2012, IEEEUsage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorks
BibTeX
Ref. manager
Endnote
DataCite
NLM
DC