A Geometry-Inclusive Analysis for Single-Relay Systems
Author(s) -
Yu Meng,
Jing Li,
Hamid R. Sadjadpour
Publication year - 2009
Publication title -
international journal of digital multimedia broadcasting
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.164
H-Index - 17
eISSN - 1687-7586
pISSN - 1687-7578
DOI - 10.1155/2009/146578
Subject(s) - relay , computer science , relay channel , node (physics) , channel (broadcasting) , topology (electrical circuits) , quality (philosophy) , mode (computer interface) , power (physics) , signal (programming language) , telecommunications , computer network , mathematics , physics , combinatorics , quantum mechanics , programming language , operating system
Successful message relay, or the quality of the interuser channel, is critical to fully realize thecooperative benefits promised by the theory. This in turn points out the importance of the geometry ofcooperative system. This paper investigates the impact of the relay's location on the system capacity andoutage probability for both amplify-forward (AF) and decode-forward (DF) schemes. Signal attenuationis modeled using power laws, and capacity is evaluated using the max-flow min-cut theory. A capacitycontour for DF, the more popular mode of the two, is provided to facilitate the derivation of engineeringrules. Finally, a selective single-relay system, which selects the best relay node among a host ofcandidates according to their locations, is analyzed. The average system capacity and outage, averagedover all possible candidates' locations, are evaluated. The result shows that the availability of a smallcandidate pool of 3 to 5 nodes suffices to reap most of the cooperative gains promised by a selectivesingle-relay system
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom