JOURNAL ARTICLE

Orthogonal multi-relay networks: capacity bounds and optimal resource allocation

Abstract

An orthogonal multi-relay network is investigated, where the transmissions are separated into two phases which are orthogonalized in time-frequency plane in order to satisfy practical constraints. In phase I, the source transmits to the relays and destination. In phase II, the relays transmit to the destination simultaneously. The capacity bounds on such orthogonal multi-relay networks are derived. We find that the optimal resource allocation problems for maximizing these capacity bounds are equivalent to the multi-objective optimization problems. We then propose a resource allocation scheme that converts such multi-objective optimization problems to the convex optimization problems. Simulation results show that our resource allocation has a significant impact on the performance.

Keywords:
Relay Resource allocation Computer science Mathematical optimization Optimization problem Convex optimization Capacity optimization Resource management (computing) Resource (disambiguation) Scheme (mathematics) Regular polygon Distributed computing Mathematics Computer network Algorithm

Metrics

0
Cited By
0.00
FWCI (Field Weighted Citation Impact)
15
Refs
0.10
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Topics

Cooperative Communication and Network Coding
Physical Sciences →  Computer Science →  Computer Networks and Communications
Full-Duplex Wireless Communications
Physical Sciences →  Engineering →  Electrical and Electronic Engineering
Advanced Wireless Communication Technologies
Physical Sciences →  Engineering →  Electrical and Electronic Engineering
© 2026 ScienceGate Book Chapters — All rights reserved.