Wang, Yafeng and Liang, Min and Xiang, Wei (2011) Semi-distributed relay selection algorithm for multi-user cooperative wireless networks. Journal of Networks, 6 (6). pp. 907-911. ISSN 1796-2056
|HTML Citation||EndNote||Dublin Core||Reference Manager|
Full text not available from this archive.
Identification Number or DOI: doi: 10.4304/jnw.6.6.907-911
In this paper, we propose a novel semi-distributed algorithm with low overhead and complexity for multi-user cooperative wireless networks with opportunistic relaying. The source is required to satisfy its minimum rate requirement with a feasible relay and help another source as a relay. The optimal solution can be obtained by exhaustive search with intractable computational complexity. Simulation results suggest that the proposed relay selection algorithm has the similar outage probability as the exhaustive search approach but with much less computational burden.
|Item Type:||Article (Commonwealth Reporting Category C)|
|Uncontrolled Keywords:||relay selection; scheduling; opportunistic relaying; cooperative networks|
|Fields of Research (FOR2008):||10 Technology > 1005 Communications Technologies > 100503 Computer Communications Networks|
08 Information and Computing Sciences > 0805 Distributed Computing > 080504 Ubiquitous Computing
10 Technology > 1005 Communications Technologies > 100510 Wireless Communications
|Socio-Economic Objective (SEO2008):||B Ecomonic Development > 89 Information and Communication Services > 8901 Communication Networks and Services > 890103 Mobile Data Networks and Services|
|Deposited On:||27 Feb 2012 22:19|
|Last Modified:||07 Jun 2012 09:12|
Archive Staff Only: edit this record