Download now Free registration required
This paper considers relay selection and power allocation in a two-hop multi-source multi-destination mesh network wherein fixed relay nodes use the decode-and-forward protocol. The jointly optimal solution is of exponential complexity. Introducing a set of time-sharing factors into the objective function, and relaxing the selection constraint, provides an upper bound to the original problem. The authors also provide a heuristic method to impose selection on each source-destination pair. Second, they propose a decentralized selection scheme in which each individual source-destination pair chooses its best relay independently followed by power allocation.
- Format: PDF
- Size: 134.83 KB