A predictive strategy for lifetime maximization in selective relay networks

  • Authors:
  • S. A. Mousavifar;T. Khattab;C. Leung

  • Affiliations:
  • Department of Electrical and Computer Engineering, University of British Columbia, Vancouver, BC;Department of Electrical Engineering, Qatar University, Doha, Qatar;Department of Electrical and Computer Engineering, University of British Columbia, Vancouver, BC

  • Venue:
  • SARNOFF'09 Proceedings of the 32nd international conference on Sarnoff symposium
  • Year:
  • 2009

Quantified Score

Hi-index 0.01

Visualization

Abstract

Two algorithms based on an energy conserving dynamic transmit power threshold are proposed for improving the lifetime in relay networks utilizing selective relay strategies with Amplify-and-Forward (AF) relays. the lifetime of the relay network is defined as the maximum number of successfully received messages satisfying a desired SNR at the destination under probability of outage constraints. In the first algorithm, the predicted outage probability, calculated based on the energy conserving dynamic threshold, is constrained at each transmission. In this case, when the number of relays is large, the improvement is substantial. As the number of relays decreases, the method improves the lifetime under the condition of high initial energy levels at the relays. In the second method, targeting applications which are not sensitive to the distribution of outage throughout the lifetime of the relay network, the predicted probability of outage, calculated based on laws-of-physics limitations only, is constrained at each transmission. Using the second method, greater lifetime improvements are achieved and average outage constraints are maintained at the expense of a few instantaneous outage probability violations. Both algorithms are implemented in conjunction with previously proposed energy greedy relay selection strategies such as Minimum Power Transmission (MPT), Maximum Residual Energy (MRE), Minimum Energy Index (MEI), and Maximum Outage Probability (MOP).