Deakin home > Deakin University Library > Deakin Research Online > Unicast and broadcast throughput maximization in amplify-and-forward relay networks

Unicast and broadcast throughput maximization in amplify-and-forward relay networks

Li, Peng, Guo, Song, Xiang, Yong and Jin, Hai 2012, Unicast and broadcast throughput maximization in amplify-and-forward relay networks, IEEE transactions on vehicular technology, vol. 61, no. 6, pp. 2768-2776.

Attached Files (Some files may be inaccessible until you login with your Deakin Research Online credentials)
Name Description MIMEType Size Downloads

Title Unicast and broadcast throughput maximization in amplify-and-forward relay networks
Author(s) Li, Peng
Guo, Song
Xiang, Yong
Jin, Hai
Journal name IEEE transactions on vehicular technology
Volume number 61
Issue number 6
Start page 2768
End page 2776
Total pages 9
Publisher IEEE
Place of publication Piscataway, N. J.
Publication date 2012-07
ISSN 0018-9545
Keyword(s) approximation algorithm
cooperative communication
throughput maximization
wireless relay network
Summary Cooperative 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.
Language eng
Field of Research 089999 Information and Computing Sciences not elsewhere classified
Socio Economic Objective 970108 Expanding Knowledge in the Information and Computing Sciences
HERDC Research category C1 Refereed article in a scholarly journal
Copyright notice ©2012, IEEE
Persistent URL http://hdl.handle.net/10536/DRO/DU:30047002

Document type: Journal Article
Collection: School of Information Technology
Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in Deakin Research Online is owned by the author, with all rights reserved.

Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in TR Web of Science
Access Statistics: 20 Abstract Views, 2 File Downloads  -  Detailed Statistics
Created: Mon, 13 Aug 2012, 12:59:01 EST