Determining the end-to-end throughput capacity in multi-hop networks: methodology and applications
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Capacity of MIMO systems with semicorrelated flat fading
IEEE Transactions on Information Theory
Cooperative diversity in wireless networks: Efficient protocols and outage behavior
IEEE Transactions on Information Theory
A simple Cooperative diversity method based on network path selection
IEEE Journal on Selected Areas in Communications
Hi-index | 0.01 |
We 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, we apply the proportional fair (PF) criterion in selecting nodes and relays for cooperative transmission. Furthermore, we 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. To our knowledge, it is the first time that a closed-form expression is obtained for the throughput of a proportional fair relaying, cooperative multi-hop path. This research is an extension of previous theoretical work on PF for cellular networks.