Impact of interference on multi-hop wireless network performance

Abstract

In this paper, we address the following question: given a specific placement of wireless nodes in physical space and a specific traffic workload, what is the maximum throughput that can be supported by the resulting network? Unlike previous work that has focused on computing asymptotic performance bounds under assumptions of homogeneity or randomness in the network topology and/or workload, we work with any given network and workload specified as inputs.A key issue impacting performance is wireless interference between neighboring nodes. We model such interference using a conflict graph, and present methods for computing upper and lower bounds on the optimal throughput for the given network and workload. To compute these bounds, we assume that packet transmissions at the individual nodes can be finely controlled and carefully scheduled by an omniscient and omnipotent central entity, which is unrealistic. Nevertheless, using ns-2 simulations, we show that the routes derived from our analysis often yield noticeably better throughput than the default shortest path routes even in the presence of uncoordinated packet transmissions and MAC contention. This suggests that there is opportunity for achieving throughput gains by employing an interferenceaware routing protocol.

Complexity in geometric SINR

“…In [25], an efficient power-assignment algorithm, which schedules a strongly connected set of links in O(log 4 n) time slots in the SIN RG model, is presented. The work of [2,3,16] proposes mathematical programming formulations for deriving optimal schedules. However, the resulting formulations are infeasible from a computational point of view as the running time is exponential in the input.…”

“…Even finding an algorithm determining a good approximation for every problem instance is hard, as is documented by the vast amount of literature with heuristics on this subject [2,3,8,10,16,25,27].…”

MUSTER: Adaptive Energy-Aware Multisink Routing in Wireless Sensor Networks

“…System model. We take inspiration from the multi-commodity network design problem [55], a formulation already applied to throughput and capacity problems in wireless networks [29], [33]. We consider a directed graph (e.g., representing a transportation network) with node set N and arc set A, and a set of commodities C (e.g., goods).…”

Real-Time Video Streaming in Multi-hop Wireless Static Ad Hoc Networks

“…A different approach for the routing problem is based on solving a linear program. In [KMPS05,JPPQ05,ABL05], routing algorithms in the graph model are designed, analyzed, and simulated. One drawback in [KMPS05,JPPQ05,ABL05] is that the simulations were run also in the graph model and not in the physical model.…”