TY - GEN
T1 - Cluster-based fair allocation algorithm for multi-relay single carrier distributed networks
AU - Eghbali, H.
AU - Abualhaol, I.
AU - Muhaidat, S.
AU - Iraqi, Youssef
PY - 2012
Y1 - 2012
N2 - In this paper, we investigate a novel Random-based Fair-Allocation Fuzzy Comprehensive Evaluation- based Strategy with Relay Clustering (RFRC) for dual-hop Single- Carrier Frequency-Domain Equalization (SC-FDE) in cooperative systems with multiple relays and amplify-and- forward (AF) relaying. We address the problem of fair resource allocation for SC-FDE minimum mean square error (MMSE) receivers. In particular, relays are classified into multiple disjoint clusters through the K-means algorithm, where each cluster is identified by a centroid. The centroids of the clusters are directly related to the average amount of resources available to the relays belonging to that cluster, as well as the quality of the relaying' links. The final centroids of the clusters after the convergence of the K-means algorithm, are used to generate contribution factors for each group. Different sub-channels are further associated with uniform random distribution where the thresholds of the uniform random variables are associated with the cluster's contribution factors. RFRC for SC-FDE proves superior SER performance as well as improved diversity gain which is achieved by randomizing the allocation. The employed algorithm further improves the performance by optimizing the number of clusters. Numerical results are provided to corroborate the mathematical modeling.
AB - In this paper, we investigate a novel Random-based Fair-Allocation Fuzzy Comprehensive Evaluation- based Strategy with Relay Clustering (RFRC) for dual-hop Single- Carrier Frequency-Domain Equalization (SC-FDE) in cooperative systems with multiple relays and amplify-and- forward (AF) relaying. We address the problem of fair resource allocation for SC-FDE minimum mean square error (MMSE) receivers. In particular, relays are classified into multiple disjoint clusters through the K-means algorithm, where each cluster is identified by a centroid. The centroids of the clusters are directly related to the average amount of resources available to the relays belonging to that cluster, as well as the quality of the relaying' links. The final centroids of the clusters after the convergence of the K-means algorithm, are used to generate contribution factors for each group. Different sub-channels are further associated with uniform random distribution where the thresholds of the uniform random variables are associated with the cluster's contribution factors. RFRC for SC-FDE proves superior SER performance as well as improved diversity gain which is achieved by randomizing the allocation. The employed algorithm further improves the performance by optimizing the number of clusters. Numerical results are provided to corroborate the mathematical modeling.
UR - http://www.scopus.com/inward/record.url?scp=84864988029&partnerID=8YFLogxK
U2 - 10.1109/VETECS.2012.6240330
DO - 10.1109/VETECS.2012.6240330
M3 - Conference contribution
AN - SCOPUS:84864988029
SN - 9781467309905
T3 - IEEE Vehicular Technology Conference
BT - IEEE 75th Vehicular Technology Conference, VTC Spring 2012 - Proceedings
T2 - IEEE 75th Vehicular Technology Conference, VTC Spring 2012
Y2 - 6 May 2012 through 9 June 2012
ER -