Cooperation with multiple relays in wireless sensor networks: optimal cooperator selection and power assignment

This is the latest version of this item.

Official URL: http://dx.doi.org/10.1007/s11276-013-0585-x

We consider the energy-minimal joint cooperator set selection and power assignment problem in a cooperation scenario with multiple relays, under transmit power constraints, while satisfying a target frame error rate (FER) at the destination receiver. We first derive the FER of a cooperative system and present a simplified calculation that also involves a simple, yet close approximation to the average bit error rate of a multiple input single output system. Our FER calculation facilitates a closed-form solution for the joint optimization problem, resulting in the Optimal Cooperator Selection and Power Assignment (O-CSPA) algorithm. Next, we devise the Distributed Cooperator Selection and Power Assignment (D-CSPA) algorithm in which the relays individually decide to become a cooperator and determine their power levels. We evaluate the performance of O-CSPA and D-CSPA algorithms under several network topologies, varying target FER levels and different power consumption models, by considering the energy dissipated in the transceiver circuits and amplifiers of all involved nodes. We show that both algorithms provide notable energy savings and conclude that the extent of the savings depends significantly on the power consumption model. D-CSPA’s performance is shown to be not only close to that of optimal solution, but also robust to errors in channel estimation.