The Impact of Interference on Optimal Multi-path Routing in Ad Hoc Networks

Abstract

We develop a queueing model characterizing explicitly the impact of interference on end-to-end performance measures such as throughput in ad hoc networks, emphasizing the performance trade-off between single-path and multi-path routing. It may seem attractive to employ multi-path routing, but as all nodes share a single channel, efficiency may drop due to increased interference levels thus yielding single-path performance for some topologies. We formulate a nonlinear programming problem to optimize network performance. Next, we focus on network capacity and show that for this objective the optimum could be found by solving an exponential number of linear programmes. We propose a greedy algorithm that efficiently searches these programmes to approximate the optimal solution. Numerical results for small topologies provide structural insight in optimal path selection and demonstrate the excellent performance of the proposed algorithm. Besides, larger networks and more advanced scenarios with multiple source-destination pairs and different radio ranges are analyzed.

Performance evaluation of radio disjoint multipath routing

“…• Previous work [7][8][9] does not provide a solution to discover multiple paths, though it discusses how to determine sustainable throughput when using multipath. This paper introduces two different criteria to select multiple paths: interference between paths and BTL in a path.…”

“…In the previous work, analysis of behaviour of different types of multipath routes is not done except in Reference [9], but it analyses scenarios without considering BTL.…”

“…This paper introduces two different criteria to select multiple paths: interference between paths and BTL in a path. Previous work [7][8][9] computes the sustainable throughput only considering the effect of interference. This paper extends the computation to consider both the interference and BTL.…”

“…In contrast to Reference [7], interference constraints are computed using Farkas' lemmas, giving only a tighter upper bound of the throughput. Reference [9] presents a stochastic framework to model the impact of interference between nodes. Instead of the max-flow problem, it uses a nonlinear programming model incorporating the interference to compute the network throughput.…”

A Link Quality Based Dispersity Routing Algorithm for Mobile Ad Hoc Networks

“…It is shown that adopting interference reduction measures can bring in improvement in the throughput. [18] presents a stochastic framework for analysis of interference and develops a mathematical model to assess network capacity for multipath routing using non linear programming. But these methods proves to be inefficient even for small networks due its complexity .…”