Link Scheduling in Local Interference Models

Abstract

Abstract.Choosing an appropriate interference model is crucial for link scheduling problems in sensor networks. While graph-based interference models allow for distributed and purely local coloring approaches which lead to many interesting results, a more realistic and widely agreed on model such as the signal-to-noise-plus-interference ratio (SINR) inherently makes scheduling radio transmission a non-local task, and thus impractical for the development of distributed and scalable scheduling protocols in sensor networks. In this work, we focus on interference models that are local in the sense that admissibility of transmissions only depends on local concurrent transmissions, and correct with respect to the geometric SINR model.In our analysis, we show lower bounds on the limitations that these restrictions impose an any such model as well as approximation results for greedy scheduling algorithms in a class of these models.

Algorithms for Wireless Capacity

“…These concepts have been extended and applied to topology control [15], [37], sensor networks [33], combined scheduling and routing [7], ultra-wideband [27], and analog network coding [19], just to name a few. Apart from these papers, algorithmic SINR results also started appearing here and there, such as in a game theoretic or distributed algorithms context, e.g., [3], [4], [6], [17], [28], [38].…”

Wireless Scheduling with Power Control

“…However, arbitrary networks are beyond the scope of these papers. Apart from these papers, algorithmic SINR results also started showing up here and there, for instance in a game theoretic context or a distributed algorithms context, e.g., [4,5,7,19,37,27].…”

Wireless scheduling with power control

“…However, arbitrary networks are beyond the scope of these papers. Apart from these papers, algorithmic SINR results also started showing up here and there, for instance in a game theoretic context or a distributed algorithms context, for example, Auletta et al [2008], Avin et al [2008], Brar et al [2008], Goussevskaia et al [2008], Scheideler et al [2008], and Katz et al [2008]. Approximation algorithms for the problem of scheduling wireless links with power control in the SINR model were given in Moscibroda et al [2006bMoscibroda et al [ , 2007 and Chafekar et al [2007].…”