Routing in Wireless Networks with Interferences

TL;DR

This paper studies dynamic routing in multi-hop wireless networks with interference, showing instability under certain adversaries and proposing an algorithm with bounded latency for balanced adversaries.

Contribution

It introduces a new model accounting for interference caused by overlapping packets and develops a routing algorithm with guaranteed performance against balanced adversaries.

Findings

Unbalanced adversaries cause instability in all routing algorithms.

A routing algorithm with bounded latency is achieved against balanced adversaries.

The model captures interference effects due to packet overlaps in wireless networks.

Abstract

We consider dynamic routing in multi-hop wireless networks with adversarial traffic. The model of wireless communication incorporates interferences caused by packets' arrivals into the same node that overlap in time. We consider two classes of adversaries: balanced and unbalanced. We demonstrate that, for each routing algorithm and an unbalanced adversary, the algorithm is unstable against this adversary in some networks. We develop a routing algorithm that has bounded packet latency against each balanced adversary.