# Wireless Network Stability in the SINR Model

## Abstract

We study link scheduling in wireless networks under stochastic arrival processes of packets, and give an algorithm that achieves stability in the physical (SINR) interference model. The efficiency of such an algorithm is the fraction of the maximum feasible traffic that the algorithm can handle without queues growing indefinitely. Our algorithm achieves two important goals: (i) efficiency is independent of the size of the network, and (ii) the algorithm is fully distributed, i.e., individual nodes need no information about the overall network topology, not even local information. Specifically, we make the following contributions. We design a distributed algorithm that achieves -efficiency on all networks (where is the number of links in the network), for all length-monotone, sublinear power assignments. In the same setup, we design an alternative distributed algorithm with efficiency (where is the length diversity of the network). We design a fast centralized algorithm with -efficiency for the power control problem, and a distributed algorithm for the same problem with -efficiency (where is the length diversity of the link set).

## 1Introduction

We study the problem of scheduling packets over links in a wireless network, each link being a sender-receiver pair of wireless nodes. Since wireless signals propagate in all directions, simultaneous transmissions interfere with each other. This interference limits the number of transmissions that can succeed simultaneously. A wireless packet scheduling algorithm thus has to schedule packets efficiently, with respect to the limits imposed by interference.

In this setting, consider the following two related problems. The first: Given a set of links, how quickly (i.e., using how few slots) can all of the links be scheduled, taking interference into account? The second: Given is a set of links, and packets arrive at the senders of each link according to some stochastic process, where they remain queued until successfully transmitted to the receiver. Can one ensure that queue sizes at the senders remain bounded, in expectation? The first question is an “off-line” algorithmic problem, whereas the second comes from a queueing theoretic perspective where the input is probabilistic. In spite of their obvious commonalities, they are generally studied using quite disparate techniques. Our goal in this paper is to bridge a gap between these two related areas; specifically, to use recently developed algorithmic techniques to achieve results for the stochastic setting.

To do this, a crucial first step is to choose the right interference model – one that is faithful to physical reality yet is simple enough to be rigorously analyzable. In this paper, we adopt the SINR (Signal to Interference and Noise ratio) or *physical* model of interference. Compared to the more traditional and widely studied graph based models, the SINR model has been found to be realistic, and is enjoying increased attention and adoption [17]. This model (precisely defined in Section 2) is based on a realistic geometry of signal propagation (compared to unrealistic graph based interference models).

We are thus interested in algorithms that keep queue sizes bounded when faced with stochastic packet arrivals over arbitrary periods of time, assuming the SINR interference model. A network in which this goal is achieved is called *stable*. Stability has been an widely-studied metric for analyzing the performance of scheduling algorithms for wireless networks for quite some time. In a seminal work, Tassiulas and Ephremides [22], gave a characterization of those stochastic processes for which stability is possible in principle. The characterization is general enough to work for virtually any interference model. In light of this, the goal for the algorithm designer is to produce an (simple and efficient) algorithm that stabilizes networks for all (or a fair chunk) of these arrival processes. There is a long tradition of such work, e.g., [12], but they almost exclusively apply to graph-based interference models.

The Tassiulas-Ephremides characterization *is* formulated as a computational problem, which, if solved, would stabilize a network under all potentially stabilizable arrival rates. However, for the SINR model, this problem (known as the maximum weighted *capacity* problem) is NP-hard [1]. Not much is known about the algorithmic complexity of this problem (see [11] about a recent centralized result for linear power and more discussion about its relation to network stability), and almost nothing about possible distributed implementations. Thus, alternative approaches need to be sought.

In this work, we develop efficient and distributed scheduling algorithms for wireless network stability — by applying intuitions developed in recent research on the SINR model ([10] and [7] contain many references), all of which provide approximation algorithms to some relevant algorithmic questions.

One possible approach would be to apply algorithms for some of the core optimization problems as black boxes. For example, there are constant factor approximation algorithms for the capacity problem [8]. These alone are not sufficient, as there is no guarantee of fairness. Still, they can be easily turned into a -approximation for the weighted capacity problem. The problem with this approach, however, is that these algorithms are centralized, with no effective distributed algorithms in sight. Distributed algorithms are of crucial importance in the current setting. Our approach is therefore more of a “gray-box” one – while we adopt an algorithm of [14] as our basis, our analysis depends not on the overall approximation factor, but on more subtle properties of that algorithm.

Apart from being distributed, the main property a scheduling algorithm should have is high efficiency. “Efficiency” has a specific technical meaning which we define in Section 2. Intuitively, it captures how well the algorithm does compared to the Tassiulas-Ephremides characterization.

We achieve, depending on the algorithm chosen, efficiency ratios of , and , that are comparable or better than existing work on this topic. Our main algorithm requires only a “carrier sense” primitive to make it completely distributed. This is in contrast to many distributed algorithms in the literature (e.g., [18]) that are better described as “localized” – requiring an underlying infrastructure for wireless nodes to communicate with nearby nodes. This infrastructure, moreover, is usually not subject to the interference constraints of the original network. This is a rather strong assumption, especially in light of the fact that in a wireless network, one is presumably trying to establish such an infrastructure in the first place.

The paper is organized as follows. In Sections Section 2 and Section 3 we present the system model, our results, and more specific discussion on related work. In Section 4 we describe a general algorithmic framework for wireless scheduling. We then provide a specific instantiation of this framework that achieves good throughput performance for a large class of power assignments in general metric spaces, with implications for the power control case, where the power can be selected by links separately. Finally, in Section 5, we prove a more efficient, but centralized result for the power control case and present simulation results.

## 2Model and Preliminaries

#### The SINR Model

The wireless network is modeled as a set of links, where each link represents a potential transmission from a sender to a receiver , both points in a metric space. The distance between two points and is denoted . The distance from ’s sender to ’s receiver is denoted . The length of link is denoted simply by .

The set may be associated with a *power assignment*, which is an assignment of a transmission power to be used by each link . The signal received at point from a sender at point with power is where the constant is the *path-loss exponent*.

We can now describe the *physical* or SINR-model of interference. In this model, a receiver successfully receives a message from the sender if and only if the following condition holds:

where is the environmental noise, the constant denotes the minimum SINR (signal-to-interference-noise-ratio) required for a message to be successfully received, and is the set of concurrently scheduled links in the same *slot* (we assume that time is slotted.). We say that is *SINR-feasible* (or simply *feasible*) if (Equation 1) is satisfied for each link in .

A power assignment is *length-monotone* if whenever and *sub-linear* if whenever . This class includes the most interesting and practical power assignments, such that uniform power (all links use the same power), linear power (, known to be energy efficient in the presence of noise), and mean power (, the assignment that produces maximum capacity in this class). We will also consider the “power control” case, where the power assignments are not predetermined, but have to be found out by the algorithm, and can be arbitrary.

Let , where and are, respectively, the maximum and minimum lengths in .

The definition of affectance was introduced in [6] and achieved the form we are using in [14]. When clear from the context we drop the superscript . Also, let . Using the idea of affectance, Equation 1 can be rewritten as

for all .

A link can schedule at most one packet during a slot, in other words, if a link has a queue, at most one packet from the queue can be scheduled during a single slot.

#### Stability of Stochastic Processes

We assume that packets arrive at the sender of each link according to a stochastic process with average arrival rate .

We define stability as such.

The *throughput region* is then the set of all possible arrival rate vectors such that there exists some scheduling policy that can stabilize the network. As proved in [22], the throughput region is characterized by

here is the set of vectors in characterizing all maximal feasible sets (i.e., each vector in is a binary vector with 1’s in indices corresnponding to links belonging to the relevant maximal feasible set). is the convex hull of ; and are vectors in , indicating arrival rates on links, and means that each entry of is less than or equal to the corresponding entry in .

In the best case, one would like stabilize all of . If that is not possible, the hope is to achieve a high *efficiency ratio*:

We assume that the arrival processes are independent accross time (and links). For a certain efficiency , for all permissible arrival rate vectors , where each is a maximal feasible set, and are weights such that . Let the expected arrival rate on a link be , it can be easily seen that

## 3Results and related work

Our main results are:

We are aware of two earlier papers on stability in the SINR model. In [16], the authors study the Longest Queue First algorithm (a classical algorithm that can be seen as a natural extension of maximal weighted matching). They show that LQF is not stable, but a variant works well. A “localized” implementation is provided, i.e., it is shown that the algorithm can be implemented in a distributed manner if links can communicate with other “neighboring” links arbitrarily. The achieved efficiency ratio in (the dependence on is not explicitly mentioned, but can be seen to be necessary). Our recent paper [2] is a companion of the current work, where an extremely simple and completely distributed algorithm achieving efficiency is introduced. In comparison, the results in the current work involve efficiency that is logarithmically dependent on (and, in one case, doubly logarithmic in ). Dependence on and are theoretically not comparable, and either could be preferable in practice. The distributed algorithm in this paper has to assume a carrier-sense primitive, which is not assumed in [2]. However, it does not need to have a special communication infrastructure with neighboring links.

The body of work on wireless network stability in *other* models is too vast to survey properly. In terms of efficiency ratio, a range of results have been derived in a variety of models. Naturally one seeks efficiency of [18] whenever possible, but results for efficiency ratios of under certain conditions [4], or [12] can be found in the literature. Ratios in terms of certain network characteristics are known as well [12]. For the SINR model, which is being studied only very recently, an efficiency ratio of a constant that is independent of network parameters is not known.

Technically, we depend heavily on [14] that provides a approximation algorithm for the scheduling problem. The algorithm and technical aspects of this work used here will be introduced in the following section as needed.

We are aware of a very recent unpublished work of Kesselheim [15] achieving results in the SINR model very similar to the present paper.

## 4Main Algorithm

The basic algorithmic framework used is listed as **General** below. For simplicity, we treat it as a centralized procedure first and discuss distributed implementations later.

The algorithm takes two parameters. One is , a number that defines the “period” of the algorithm. The second parameter is an algorithm which can solve the *scheduling problem*, used as a black box by **General** to compute schedules. The *scheduling problem* is the optimization problem where given a set of links, one seeks to partition into minimum number of sets such that each of these sets is feasible (i.e., can be transmitted in one slot). Since the problem is NP-hard, we will work with approximation algorithms. Depending on the result we seek, we will set and accordingly.

General

can be alternatively described in the following way. The algorithm divides the time slots into consecutive periods of length each. Let us denote these periods as etc. At the beginning of period , the algorithm computes a schedule of the links produced in . It does so using . **General** then adds these computed feasible sets to the set . Now during each slot of , the algorithm schedules the first set from (which is implemented as a FIFO queue). It does this until ends, in which case it moves on to the next period, or until is empty, in which case it waits until the end of . Note that there is nothing to schedule during , we just wait during this time.

Let be the queue length at link at time . First, note that for all , where at time ( is as in the algorithm ). This is the number of slots we require to schedule all links outstanding at time . Obviously, one cannot schedule all links in time less than the size of the longest queue (since copies of the same link cannot be scheduled together). Thus a bound on immediately gives us a bound on (for all ). Consequently, from now on we will focus on bounding . Also note that it suffices to bound on period boundaries, i.e., at times such that . This is because, in expectation, the queue lengths cannot grow by much during the course of a period. Let be a large enough constant.

For simplicity, we will assume that the arrival distributions at every link is a Bernoulli random variable with mean . To prove Theorem ?, we set .

### 4.1The scheduling algorithm

We also select as the scheduling algorithm described in [14]. It is known [7] that this algorithm achieves a O-approximation factor to the scheduling problem. We are, however, interested in a slightly different performance measure of the algorithm in [14]. For a link set , define the *maximum average affectance* . It is known that:

We now turn our attention to proving the stability of the algorithm, i.e., Thm. ?. Given the efficiency claimed in Thm. ?, it sufficient to deal with stochastic processes satisfying

Define to be the outgoing affectance from a link to longer links appearing in slot . Formally, if is the Bernoulli random variable denoting the number of packets that arrived at the sender of link during slot , then

Let be the sum of over all slots in the period, or,

Now, we claim,

In [14], it is shown that for any feasible set

Thus, for any time slot ,

with explanations of numbered (in)equalities:

By definition of (Eqn. Equation 4)

by definition, since they both express the expected number of packets arriving in each time slot on .

By Equation 2.

Rearrangement.

By Equation 5.

By Equation 3.

Now, by the Chernoff-Hoeffding inequality (see, for example, Eqn. 1.8, Thm. 1.1 of [5]):

for all . Defining , and union bounding we get,

We analogously define to be the incoming affectance from longer links. We similarly define , and obtain that , which depends on the bound

also proven in [14]. (Note that the bound here is tighter than Equation 5).

It is not hard to verify that that . Thus,

Now, by Theorem ?, , where denotes expectation over the random bits of the algorithm (which is randomized). Noting that the random bits of the algorithm are independent of the arrival process, we can use the bound on to claim that

Now we can prove Thm. ?. Note that by Lemma ?, the expected scheduling cost required for packets produced during a single period () is strictly smaller than the scheduling capacity of a single period (). With this observation, we can reduce our system to a very basic queueing system:

A single server, an infinite queue, and slotted time. The time slots in this system correspond to the periods of the original system.

At the beginning of each slot a fixed number of packets are served and leave the system ( corresponds to ).

At the end of every slot, a random number of new packets arrive. This is a random variable on the non-negative integers, and ( corresponds to ).

Now, if , the corresponding countable Markov chain has a stationary distribution, and if is square integrable, the expected queue length will be finite (see [3], for example). The condition is easily seen to be true (since by Lemma ?). Square integrability of follows from the fact that admits a large deviation bound (this is implicit in the proof of Lemma ?). Of course the “queue length” of this system corresponds to , the number of slots the outstanding packets would require to be scheduled. Thus we have proven to be bounded, and as observed before, this is enough to complete the proof of the theorem.

### 4.2Implications for the power control problem

It was shown in [9] that *mean power* (where is set to ) achieves a good approximation to the power control problem. Since Thm. ? covers the mean power assignment, this gives us a distributed algorithm for the power control problem. To achieve the bound claimed in Thm. ? for the distributed algorithm, the main ingredient is the following bound (analogous to Equation 5).

With this bound (and a similar analog of Equation 6) in hand, the proof technique of Thm. ? can be duplicated to achieve the bound claimed in Thm. ? for distributed algorithms.

### 4.3Distributed implementation

We now demonstrate how to implement **General** in a distributed fashion. Interestingly, we require very few additional assumptions to make this work. The basic tool is the algorithm in [14], listed as **Distr-SingleLink**.

The first thing to note here is that **Distr-SingleLink** itself is completely distributed. In other words, **General**, if applied to the links produced during a single period, could be implemented in a distributed manner straightaway. The challenge is that our bounds assume that the algorithm works in a FIFO manner, thus **Distr-SingleLink** for a packet produced in should not start executing until all packets produced up to have been successfully scheduled.

To implement this, we assume that each sender in the system maintains a few counters. The first counter keeps track of the current period, and a second counter tracks the current period being *scheduled* (naturally ). For each outstanding packet in the queue, the sender also maintains the period in which it was generated (). The counter is easily maintained, by incrementing it once every slots. The third counter is equally simple, when a packet arrives, is assigned the current value of . We will describe how is maintained below, but note that given , the algorithm can now be easily implemented in a distributed fashion. For each packet , the sender waits until , and then runs **Distr-SingleLink** for until the link successfully transmits.

Maintaining is slightly more, but not too, involved. It is here that we need to make an additional assumption, which is that nodes (senders) can sense the channel to determine transmission activity. This is a not uncommon assumption (see, e.g., [21]), based on the Clear Channel Assessment capability in the 802.11 wireless standard.

Let us divide the time slots into consecutive pairs. The first time slot is used for normal transmission (i.e., executing **General** and **Distr-SingleLink**). The second slot is used for signaling. Senders that are transmitting currently (i.e., senders that have at least one non-transmitted packet for which ) use the signaling slot to simply signal that they have still not completed. Thus when all links from period succeed, a silent signaling slot appears. All senders register this event by sniffing the channel, and increment .

From a practical point of view, wasting every other slot for signaling, as well as assuming some sort of “perfect” carrier sensing capability, is problematic. Simulation studies presented are done with practically reasonable approximations to these assumptions (indeed, these heuristics seem to help the algorithm).

## 5Extensions and simulations

In the power control version of the problem, selecting (an arbitrary) power for each link is a part of the problem. Feasible sets are now those for which there exists an (unknown) power assignment that allows for simultaneous transmissions of all the links.

Using a centralized algorithm of [13], a throughput is achievable. We omit details.

We implemented **General** (using **Distr-SingleLink**) on a random topology. As Figure 1 shows, efficiency ratios upto 0.4 is achieved, which is quite good. Details are omitted due to space restrictions.

### References

**Maximizing capacity in arbitrary wireless networks in the SINR model: Complexity and game theory.**

Matthew Andrews and Michael Dinitz. In*INFOCOM*, pages 1332–1340, 2009.**A Fully Distributed Algorithm for Throughput Performance in Wireless Networks.**

Eyjólfur I. Ásgeirsson, Magnús M. Halldórsson, and Pradipta Mitra. In*CISS*, 2012.*Applied Probability and Queues*.

Soren Asmussen. Springer, 2nd edition, 2003.**Sufficient conditions for stability of longest-queue-first scheduling: second-order properties using fluid limits.**

Antonis Dimakis and Jean Walrand.*Advances in Applied Probabability*, 38(2):505–521, 2006.*Concentration of Measure for the Analysis of Randomized Algorithms*.

Devdatt P. Dubhashi and Alessandro Panconesi. Cambridge University Press, 2009.**Capacity of Arbitrary Wireless Networks.**

O. Goussevskaia, M. M. Halldórsson, R. Wattenhofer, and E. Welzl. In*INFOCOM*, pages 1872–1880, April 2009.**Nearly optimal bounds for distributed wireless scheduling in the SINR model.**

M. M. Halldórsson and P. Mitra. In*ICALP*, 2011.**Wireless Communication is in APX.**

M. M. Halldórsson and R. Wattenhofer. In*ICALP*, pages 525–536, July 2009.**Wireless scheduling with power control.**

Magnús M. Halldórsson. In*ESA*, pages 361–372, 2009.**Wireless Capacity with Oblivious Power in General Metrics.**

Magnús M. Halldórsson and Pradipta Mitra. In*SODA*, 2011.**Wireless capacity and admission control in cognitive radio.**

Magnus M. Halldorsson and Pradipta Mitra. In*INFOCOM*, 2012.**Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multi-Hop Wireless Networks.**

Changhee Joo, Xiaojun Lin, and N.B. Shroff. In*INFOCOM*, 2008.**A Constant-Factor Approximation for Wireless Capacity Maximization with Power Control in the SINR Model.**

T. Kesselheim. In*SODA*, 2011.**Distributed contention resolution in wireless networks.**

T. Kesselheim and B. Vöcking. In*DISC*, pages 163–178, August 2010.**Dynamic packet scheduling in wireless networks.**

Thomas Kesselheim. http://arxiv.org/abs/1203.1226.**Longest-queue-first scheduling under SINR interference model.**

Long B. Le, Eytan Modiano, Changhee Joo, and Ness B. Shroff. In*MobiHoc*, 2010.**A measurement study of interference modeling and scheduling in low-power wireless networks.**

Ritesh Maheshwari, Shweta Jain, and Samir R. Das. In*SenSys*, pages 141–154, 2008.**Maximizing throughput in wireless networks via gossiping.**

Eytan Modiano, Devavrat Shah, and Gil Zussman. In*SIGMETRICS/Performance*, pages 27–38, 2006.**Protocol Design Beyond Graph-Based Models.**

Thomas Moscibroda, Roger Wattenhofer, and Yves Weber. In*Hotnets*, November 2006.**Topology control meets SINR: The scheduling complexity of arbitrary topologies.**

Thomas Moscibroda, Roger Wattenhofer, and Aaron Zollinger. In*MobiHoc*, pages 310–321, 2006.**An dominating set protocol for wireless ad-hoc networks under the physical interference model.**

Christian Scheideler, Andréa W. Richa, and Paolo Santi. In*MobiHoc*, pages 91–100, 2008.**Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks.**

L. Tassiulas and A. Ephremides.*IEEE Trans. Automat. Contr.*, 37(12):1936–1948, 1992.