Outage optimum routing for wireless networks

Abstract

Abstract-A new routing metric for multi-hop wireless ad hoc networks is presented. The proposed metric is based on the computation of Signal-to-Noise Ratio (SNR) and minimization of wireless network outage probability in a fading environment. This metric improves the Quality-of-Service by reducing dropped packets. Further, by modeling the network with a Trellis diagram and then using Viterbi Algorithm to select the best routing path, we reduce the routing complexity of our approach. Simulation results demonstrate the improvement achieved by implementation of this new metric. Performance of the proposed metric is compared to other commonly used routing metrics such as Minimum Hop Count (MinHop), Expected Transmission Count (ETX) and two other SNR-based metrics in both mobile and stationary networks.

Selective Route Based on SNR with Cross-Layer Scheme in Wireless Ad Hoc Network

“…From the simulations, the proposed method achieved higher throughput than the conventional routing protocol that used hop count as routing metric. In [20], routing selection was improved using minimum summation of the inverse SNR. The metric was equivalent to this method of all the links in the path.…”

“…The use of SNR and Receive Power (RP) to find the route was proposed by [18,19] by adding up the SNR information into Route Reply (RREP) mechanism. In [20] and [21], routing selection was improved using minimum summation of inverse SNR and weighted SNR average of all links in the path, respectively. Moreover, a study reported in [22] proposed a routing protocol for wireless sensor networks through SNR-based dynamic clustering, while that reported in [23] used cooperative Automatic Repeat reQuest (ARQ) system to minimize total network energy consumption while delivering a minimum required SNR.…”

A cross-layer metric for application-constrained MAC-aware capacity optimization

“…Outage probability is an important parameter and has been considered as optimization criteria [18], [19]. For an application with outage probability requirement of P , one constraint which needs to be satisfied is P out ≤ P .…”

Optimal Routing for Multi-user Multi-hop Relay Networks via Dynamic Programming

“…In the literature, the multi-hop RS problem has been mainly analyzed for relay networks with a single user [6]- [8]. In [6], the authors show that an efficient dynamic programming approach implemented at a central processor can find the optimal relay path by comparing the bottleneck-link signal-to-noise-ratios (SNRs) of each path.…”

“…In the literature, the multi-hop RS problem has been mainly analyzed for relay networks with a single user [6]- [8]. In [6], the authors show that an efficient dynamic programming approach implemented at a central processor can find the optimal relay path by comparing the bottleneck-link signal-to-noise-ratios (SNRs) of each path. When compared to exhaustive search, for a single-user decode-and-forward (DF) relay network, the optimal RS can be found very efficiently based on this approach.…”