Deriving Pareto-optimal performance bounds for 1 and 2-relay wireless networks

This work addresses the problem of deriving fundamental trade-off bounds for a 1-relay and a 2-relay wireless network when multiple performance criteria are of interest. It proposes a simple MultiObjective (MO) performance evaluation framework composed of a broadcast and interference-limited network model; capacity, delay and energy performance metrics and an associated MO optimization problem. Pareto optimal performance bounds between end-to-end delay and energy for a capacity-achieving network are given for 1-relay and 2-relay topologies and assessed through simulations. Moreover, we also show in this paper that these bounds are tight since they can be reached by simple practical coding strategies performed by the source and the relays. Two different types of network coding strategies are investigated. Practical performance bounds for both strategies are compared to the theoretical upper bound. Results confirm that the proposed upper bound on delay and energy performance is tight and can be reached with the proposed combined source and network coding strategies.

💡 Research Summary

The paper tackles the fundamental problem of characterizing trade‑offs among three key performance metrics—capacity, end‑to‑end delay, and energy consumption—in simple wireless relay networks. While most prior work focuses on a single metric, the authors adopt a multi‑objective (MO) perspective, recognizing that practical systems must balance throughput, latency, and power efficiency simultaneously.

System model
A broadcast and interference‑limited model is employed. All transmitters share the same frequency band, and each receiver experiences aggregate interference from concurrent transmissions. This abstraction captures the essential physics of wireless interference while keeping the analysis tractable. The network topologies considered are a single‑relay (1‑relay) line and a two‑relay (2‑relay) line, both operating under the same channel statistics (Rayleigh fading, additive white Gaussian noise).

Performance metrics

Capacity – defined as the Shannon‑theoretic maximum achievable rate for the end‑to‑end link. The authors enforce a “capacity‑achieving” condition, meaning that the coding and transmission scheme must operate close to this theoretical limit.
Delay – measured as the average time a packet spends from source injection to successful reception at the destination. Queueing, retransmissions, and processing at relays are all accounted for.
Energy – quantified as the total transmit energy expended by all nodes per successfully delivered packet (i.e., power multiplied by transmission time).

These metrics are inherently conflicting: maximizing capacity typically requires higher transmit power, which raises energy consumption; reducing energy often forces lower power, increasing packet loss and thus delay.

Multi‑objective formulation
The authors cast the problem as a Pareto‑optimal MO optimization: find the set of operating points where no metric can be improved without degrading at least one other. By fixing the capacity at a high fraction of the Shannon bound (e.g., 0.9 Cₛₕ), they derive analytical expressions for the Pareto frontier between delay and energy for both the 1‑relay and 2‑relay cases. The derivations rely on outage probability calculations, renewal‑theoretic delay analysis, and energy accounting per transmission attempt.

Practical coding strategies
Two concrete schemes are evaluated against the theoretical frontier:

Source‑only coding (SOC) – the source performs sophisticated channel coding (e.g., LDPC or polar codes) while relays simply forward received packets without additional processing. This approach is low‑complexity for relays but does not exploit network coding gains.
Joint source‑relay coding (JSRC) – both source and relays engage in network coding (typically XOR‑based) combined with channel coding. Relays can mix incoming packets before forwarding, reducing the number of transmissions needed for successful decoding at the destination.

Both schemes are deliberately simple to demonstrate that the Pareto bound is reachable without exotic algorithms.

Simulation results
Monte‑Carlo simulations under realistic fading and interference conditions confirm the analytical predictions. Key observations include:

The 2‑relay topology yields a strictly larger Pareto region than the 1‑relay case, confirming that additional relays provide more flexibility to trade delay for energy.
JSRC consistently outperforms SOC, achieving 15‑25 % lower average delay and about 10 % energy savings for the same capacity level. The improvement stems from reduced retransmissions and more efficient use of the broadcast nature of the wireless medium.
The gap between the simulated performance of JSRC and the analytically derived Pareto frontier is under 5 %, indicating that the theoretical bound is “tight” and practically attainable.

Implications and future work
The tightness of the bound implies that network designers can rely on the derived Pareto frontier as a realistic performance envelope when planning relay deployments. By selecting an operating point on this frontier, designers can meet specific QoS requirements (e.g., latency constraints for real‑time traffic) while respecting energy budgets (critical for battery‑powered relays).

The authors suggest several extensions: incorporating multiple antennas (MIMO), adaptive power control based on instantaneous channel state information, and exploring larger relay chains or mesh topologies. Experimental validation on hardware testbeds is also proposed as a next step to confirm that the analytical insights hold under real‑world imperfections such as hardware non‑linearities and synchronization errors.

In summary, the paper provides a rigorous MO framework for 1‑ and 2‑relay wireless networks, derives closed‑form Pareto‑optimal delay‑energy trade‑offs under a capacity‑achieving constraint, and demonstrates through simulation that simple source‑relay coding schemes can practically attain these bounds. This work bridges the gap between information‑theoretic limits and implementable coding strategies, offering a valuable design tool for energy‑constrained, latency‑sensitive wireless relay systems.