Performance Analysis of Ad-Hoc Routing in Clustered Multi-hop Wireless Networks

TL;DR

This paper provides a comprehensive performance analysis of clustered decode-and-forward multi-hop relaying wireless networks with ad-hoc routing, deriving exact and asymptotic expressions for key metrics across all SNR levels.

Contribution

It introduces a unified analytical framework combining ad-hoc routing and cooperative diversity, deriving closed-form expressions for SNR distribution, SER, capacity, outage, and SNR gain.

Findings

Closed-form SNR distribution at destination

Analytical SER and capacity expressions

High SNR asymptotic performance results

Abstract

This paper analyzes the performance of clustered decode-and-forward multi-hop relaying (CDFMR) wireless Rayleigh fading networks, and sheds light on their design principles for energy and spectral efficiency. The focus is on a general performance analysis (over all SNR range) of heterogeneous wireless networks with possibly different numbers of relays in clusters of various separations. For clustered multi-hop relaying systems, ad-hoc routing is known as an efficient decentralized routing algorithm which selects the best relay node on a hop-by-hop basis using local channel state information. In this article, we combine ad-hoc routing and cooperative diversity in CDFMR systems, and we derive (i) a closed-form expression for the probability distribution of the end-to-end SNR at the destination node; (ii) the system symbol error rate (SER) performance for a wide class of modulation schemes; and (iii) exact analytical expressions for the system ergodic capacity, the outage probability and the achievable probability of the SNR (power) gain. We also provide simple analytical asymptotic expressions for SER and the outage probability in high SNR regime. Simulation results are provided to validate the correctness of the presented analyses.