Deriving Pareto-optimal performance bounds for 1 and 2-relay wireless networks - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

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

Abstract

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.
Fichier principal
Vignette du fichier
Wang_12498.pdf (1.02 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01148403 , version 1 (04-05-2015)

Identifiers

  • HAL Id : hal-01148403 , version 1
  • OATAO : 12498

Cite

Qi Wang, Katia Jaffrès-Runser, Claire Goursaud, Jean-Marie Gorce. Deriving Pareto-optimal performance bounds for 1 and 2-relay wireless networks. IEEE International Conference on Computer Communications and Networks - ICCCN 2013, Jul 2013, Nassau, Bahamas. pp. 1-17. ⟨hal-01148403⟩
632 View
22 Download

Share

Gmail Facebook X LinkedIn More