Mobility

Theoretical Analysis of Selective Relaying, Cooperative Multi-Hop Networks With Fairness Constraints

Free registration required

Executive Summary

The authors consider the problem of selective relaying in multi-hop networks. At each slot, a relay and a node along the optimal non-cooperative path are opportunistically selected to transmit to the next-hop node in a cooperative manner. Being a promising scheme for fair resource allocation, the Proportional Fair Scheduling (PFS) algorithm provides excellent balance between throughput and fairness via multi-user diversity and game-theoretic equilibrium. To maximize the overall utility along a cooperative multi-hop path, they apply the Proportional Fair (PF) criterion in selecting nodes and relays for cooperative transmission. Furthermore, they analyze and provide an analytical expression for end-to-end throughput of an opportunistic relaying, cooperative multi-hop path with proportional fairness constraints over a Rayleigh flat-fading channel.

  • Format: PDF
  • Size: 275.7 KB