Deterministic approximation conjecture for Nakagami fading channels
Deterministic approximation conjecture for Nakagami fading channels
Consider a two-dimensional wireless network in which channel attenuation consists of a constant attenuation at a reference distance, distance-dependent attenuation with path-loss index , and random fading . The fading is Nakagami- or Rayleigh fading, and ergodic performance metrics include throughput and delay.
Deterministic approximation conjecture. If has a Nakagami- distribution with , then the fading channel can be well approximated by a deterministic channel gain without introducing a significant gap in ergodic performance metrics such as spectral efficiency, energy efficiency, throughput, and delay. If has Rayleigh fading, replacing by its -th moment, , results in sufficiently accurate analysis of these metrics.
The conjecture concerns simplifying wireless-network interference and performance analysis by replacing random fading with a deterministic channel. The paper supports the claim through numerical observations, while the corresponding general statement is not established theoretically.
Sources & referencesView supporting material
Primary source
Hossein Shokri-Ghadikolaei, Carlo Fischione and Eytan Modiano, “Interference Model Similarity Index and Its Applications to mmWave Networks: Extended version”, arXiv:1710.02659 (2017).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.