Summary: Relay Selection for Low-Complexity Coded
Cooperation using the Bhattacharyya Parameter
Josephine P. K. Chu, Raviraj S. Adve and Andrew W. Eckford
Dept. of Electrical and Computer Engineering, University of Toronto, Toronto, Ontario, Canada
Dept. of Computer Science and Engineering, York University, Toronto, Ontario, Canada
E-mail: {chuj,rsadve}@comm.utoronto.ca, aeckford@yorku.ca
Abstract--Demodulate-and-forward (DmF) is an attractive ap-
proach when using cooperative diversity schemes in networks
where only nodes with strict complexity constraints are allowed,
such as sensor networks. In using DmF, the relay only demod-
ulates, but does not decode, the received signal from the source
node. Coding can be used at the relay to improve the performance
over the relay-destination link. In unrelated work, relay selection
has been shown to achieve full diversity order with low overhead
by choosing the best relay node out of a pool of available relays
to assist the source. A simple heuristic scheme for relay selection
while using DmF is available, but this involves the exchange
of channel parameters between the nodes, hence increasing the
overhead. In this paper, we propose the use of the Bhattacharyya
parameter (BP) to facilitate relay selection. The use of BP has