Conference Paper

An Optimized User Selection Method for Cooperative Diversity Systems.

Dept. of Electr. & Comput. Eng., Aristotle Univ. of Thessaloniki, Thessaloniki
DOI: 10.1109/GLOCOM.2006.853 Conference: Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November - 1 December 2006
Source: IEEE Xplore

ABSTRACT Multi-user cooperative diversity is a recent techni- que promising great improvement of the performance of wireless communication systems operating in fading environments. Based on combinatorial optimization theory and specifically on the so-called knapsack problem, this paper presents a method of optimizing the selection among the potential cooperating users, when amplify-and-forward relays are used. In particular, two optimization problems are studied: the error probability mini- mization subject to total energy consumption constraints, and the dual one, the energy consumption minimization under error performance constraints. Depending on the frequency of repea- ting this selection, the above problems are categorized into short- term and long-term node selection. Numerical examples verify the expected knapsack scheme's advantage of adapting the number of cooperating users, depending on the desired performance- consumption tradeoff. Moreover, long-term node selection seems to lead to similar error or consumption performance compared to the short-term one, despite its simplicity. I. INTRODUCTION In the last few years, a new concept that is being acti- vely studied in multihop-augmented networks is multi-user cooperative diversity, where several terminals form a kind of coalition to assist each other with the transmission of their messages. In general, cooperative relaying systems have a source node multicasting a message to a number of cooperative relays, which in turn resend a processed version to the intended destination node. The destination node combines the signal received from the relays, taking into account the source's original signal (1)- (4).

0 Bookmarks
 · 
78 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: Virtual multiple-input multiple-output (VMIMO) enables the implementation of conventional MIMO on mobile devices equipped with insufficient numbers of antennas via cooperation. This paper considers a spectral efficient broadcasting network in which selected mobile devices form a VMIMO system to relay the broadcasted data to help other devices decode the source data more reliably. In particular, the relay selection problem, a fundamental issue in the construction of VMIMO, is examined. We first review existing selection schemes for users operating in the amplify-and-forward (AF) mode. We then propose a distributed selection scheme based on post-processing SNR. In the proposed scheme, each user individually finds the most favorable candidates for VMIMO construction and then all users obtain a joint decision through a voting process. Simulation results show that the proposed distributed scheme outperforms existing distributed selection schemes and achieves a near-optimal performance with lower complexity compared to the centralized scheme.
    Wireless Communications and Networking Conference (WCNC), 2013 IEEE; 01/2013
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In a wireless system with a large number of distributed nodes, the quality of communication can be greatly improved by pooling the nodes to perform joint transmission/reception. In this paper, we consider the problem of optimally selecting a subset of nodes from potentially a large number of candidates to form a virtual multi-antenna system, while at the same time designing their joint linear transmission strategies. We focus on two specific application scenarios: 1) multiple single antenna transmitters cooperatively transmit to a receiver; 2) a single transmitter transmits to a receiver with the help of a number of cooperative relays. We formulate the joint node selection and beamforming problems as cardinality constrained optimization problems with both discrete variables (used for selecting cooperative nodes) and continuous variables (used for designing beamformers). For each application scenario, we first characterize the computational complexity of the joint optimization problem, and then propose novel semi-definite relaxation (SDR) techniques to obtain approximate solutions. We show that the new SDR algorithms have a guaranteed approximation performance in terms of the gap to global optimality, regardless of channel realizations. The effectiveness of the proposed algorithms is demonstrated via numerical experiments.
    IEEE Journal on Selected Areas in Communications 09/2012; · 3.12 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, the utilization of mobile devices (MDs) as decode-and-forward relays in a device-to-device assisted virtual MIMO (VMIMO) system is studied. Single antenna MDs are randomly distributed on a 2D plane according to a Poisson point process, and only a subset of them are sources leaving other idle MDs available to assist them (relays). Our goal is to develop an efficient algorithm to cluster each source with a subset of available relays to form a VMIMO system under a limited feedback assumption. We first show that the NP- hard optimization problem of precoding in our scenario can be approximately solved by semidefinite relaxation. We investigate a special case with a single source and analytically derive an upper bound on the average spectral efficiency of the VMIMO system. Then, we propose an optimal greedy algorithm that achieves this bound. We further exploit these results to obtain a polynomial time clustering algorithm for the general case with multiple sources. Finally, numerical simulations are performed to compare the performance of our algorithm with that of an exhaustive clustering algorithm, and it shown that these numerical results corroborate the efficiency of our algorithm.
    IEEE Transactions on Wireless Communications 12/2013; 13(3). · 2.42 Impact Factor

Full-text (4 Sources)

View
71 Downloads
Available from
May 31, 2014