This paper considers the problem of selecting a set of relay nodes to assist a transmitting node in a two-hop wireless network. Throughput-maximizing relay subset selection is a difficult problem that depends on variables such as node locations and power constraints. It is proposed that all relays employ partial decode-and-forward operations to improve the tractability of the relay selection problem. This allows relay selection to be transformed into a simpler relay placement problem which motivates two proximity-based relay selection algorithms. These algorithms are compared with a greedy algorithm based on relay channel gains to the sink and an algorithm that randomly selects relays. The diversity gain achieved by employing multiple relay nodes is derived. The proposed proximity-based algorithms offer good performance in terms of the expected achieved rate.
Relay Subset Selection in Wireless Networks Using Partial Decode-and-Forward Transmission
Published 2007 in IEEE Vehicular Technology Conference
ABSTRACT
PUBLICATION RECORD
- Publication year
2007
- Venue
IEEE Vehicular Technology Conference
- Publication date
2007-11-20
- Fields of study
Mathematics, Computer Science, Engineering
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-40 of 40 references · Page 1 of 1
CITED BY
Showing 1-60 of 60 citing papers · Page 1 of 1