Efficient Algorithms for Maximum Link Scheduling in Distributed Computing Models with SINR Constraints

Efficient Algorithms for Maximum Link Scheduling
in Distributed Computing Models with SINR Constraints

Guanhong Pei1, Anil Kumar S. Vullikanti2 1Dept. of Electrical and Computer Engineering and Virginia Bioinformatics Institute, Virginia Tech, Blacksburg, VA 24061 2Dept. of Computer Science and Virginia Bioinformatics Institute, Virginia Tech, Blacksburg, VA 24061

A fundamental problem in wireless networks is the maximum link scheduling (or maximum independent set) problem: given a set of links, compute the largest possible subset of links that can be scheduled simultaneously without interference. This problem is particularly challenging in the physical interference model based on SINR constraints (referred to as the SINR model), which has gained a lot of interest in recent years. Constant factor approximation algorithms have been developed for this problem, but low complexity distributed algorithms that give the same approximation guarantee in the SINR model are not known. Distributed algorithms are especially challenging in this model, because of its non-locality.

In this paper, we develop a set of fast distributed algorithms in the SINR model, providing constant approximation for the maximum link scheduling problem under uniform power assignment. We find that different aspects of available technology, such as full/half-duplex communication, and non-adaptive/adaptive power control, have a significant impact on the performance of the algorithm; these issues have not been explored in the context of distributed algorithms in the SINR model before. Our algorithms’ running time is , where for different problem instances, and is the “link diversity” determined by the logarithmic scale of a communication link length. Since is small and remains in a constant range in most cases, our algorithms serve as the first set of “sublinear” time distributed solution. The algorithms are randomized and crucially use physical carrier sensing in distributed communication steps.

I Introduction

One of the most basic problems in wireless networks is the Maximum Link Scheduling problem (MaxLSP): given a set of links, compute the largest possible subset of links that can be scheduled simultaneously without conflicts; this is also referred to as the one-shot scheduling [1] or max independent link set problem [2]. One of the main challenges for this problem is wireless interference, which limits the subsets of links that can transmit simultaneously. A commonly used model is based on “conflict graphs” [3], broadly referred to as graph-based interference models; examples of such models include: the unit disk graph model, the -hop interference model, and the protocol model. MaxLSP is challenging in these models — the decision version of this problem is NP-Complete, but efficient constant factor approximation algorithms are known for many interference models [3], because of their inherent locality. However, graph based models are known to be inaccurate and an oversimplification of wireless interference. In recent years, a more realistic interference model based on SINR constraints (henceforth referred to as the SINR model) [1, 4] has gained a lot of interest: a set of links are feasible simultaneously if the signal to interference plus noise constraints are satisfied at all receivers (see Section III for the formal definition). This is much harder than graph based interference models because of the inherently non-local and non-linear nature of the model; only recently constant factor approximation algorithms have been developed in this model [5, 6, 2].

Since link scheduling is a common subroutine in many other problems, distributed algorithms with low complexity are crucial. A commonly studied model for distributed computing in wireless networks is the “Radio Broadcast Network (RBN)” model, in which the transmissions on two links conflict if the links interfere (in the corresponding graph-based model); variations have been studied of this model, depending on capabilities such as collision detection. Efficient distributed algorithms are known in the RBN model for MaxLSP, as well as other fundamental problems such as coloring and dominating set, e.g., [7, 8, 9]. A solution to MaxLSP computed in the RBN model might not be feasible in the SINR constraints (see, e.g., [1, 10]). Further, the distributed wireless communication mechanism can be quite different. In other words, a distributed algorithm in the RBN model cannot be implemented in general in the SINR-based model. Therefore, we need to rethink the design of distributed algorithms in the SINR model in a fundamentally new way.

In this paper, we focus on distributed algorithms for MaxLSP in the SINR model, which is defined in the following manner: at each time step of the algorithm, only those links for which the SINR constraints are satisfied at the receivers are successful. The goal of the algorithm is to end up with a feasible solution to MaxLSP, whose size is maximized. We have to rethink distributed algorithms in the SINR model for MaxLSP because of the fundamental differences between the graph-based and the SINR interference models. As mentioned earlier, even centralized algorithms for this problem are much harder in the SINR model, than in the disk based interference model; recent work by [5, 6, 2, 11, 12] gives constant factor approximation algorithms for various instances of MaxLSP in the SINR model. The centralized algorithms of [5, 2, 6] are based on a greedy ordering of the links, which requires estimating the “affectance,” (which, informally, is a measure of interference), at each stage (this is discussed formally later in Section III) — this is one of the challenges in distributed solutions to MaxLSP. We note that efficient time distributed algorithms for scheduling all the links (i.e., the coloring version) is already known [13]. Adapting them would immediately yield a distributed -approximation to MaxLSP, but it is not clear how to obtain a distributed -approximation. Further, an important aspect of MaxLSP is that the senders and receivers of all the links should know whether they have been chosen, since this is an important requirement in many networking applications; this seems to be difficult to ensure through random access based approaches.

I-a Contributions

In this paper, we develop fast distributed constant factor approximation algorithms for MaxLSP, in which all nodes are constrained to use uniform power levels for data transmission (we refer to this as MaxLSP), improving upon the results implied by [14, 15]. Our algorithms and the proofs build on ideas from [2, 6, 5] and [16], and one of the key technical contributions of our work is the notion of an “-ruling” (discussed below) and its distributed computation in the SINR model. Our results raise two new issues in the context of distributed algorithms in the SINR model — adaptive power control (i.e., the feature of using lower than the maximum power level, as needed), and full/half duplex communication (i.e., whether nodes can transmit and receive simultaneously). We find these features impact the performance of the algorithms quite a bit. We summarize some of the key aspects of the results and main challenges below.

  1. Performance and technology tradeoffs. In the case of “non-adaptive power control” (i.e., if all nodes are required to use fixed uniform power levels), we design a distributed algorithm that provably runs in time and gives an approximation to the optimum solution for half duplex communication, and we improve the running time to for the case of full duplex communication; here denotes the “link diversity”, which is the logarithm of the ratio of the largest to the smallest link length (this is defined formally in Section III). If nodes are capable of “adaptive power control” (i.e., they can use varying power levels for scheduling, but not data transmission), we improve the running time of the above algorithm to time for half duplex communication, and time for full duplex communication. Note that in the adaptive power control case, the algorithm uses varying power levels during its run, but the links which are selected finally use the fixed uniform power level for data transmission.

  2. Key distributed subroutine. One of our key ideas is the parallelization of the link selection, which would have require sorting all links, processing a larger set of links simultaneously, and efficient filtering based on spatial and interference constraints in parallel. Moreover, it turns out that the usual notion of independence based on spatially separated nodes is inadequate because of the spatial separation of the sender and the receiver of a link: it is the senders which makes the distributed decision of transmission and the participation in the independent set, while the SINR model is receiver-oriented and it is hard for each sender of a candidate link to determine the interference caused by the chosen links at the corresponding receiver. One of the important steps of our algorithm involves the distributed construction of a “ruling” (a spatially-separated node cover, first introduced in [17]) which relates to the notion of independence and aids the solution to MIS and coloring problems in graph topologies [18, 19]. The extension of the notion of ruling and its computation in the SINR model is one of the important technical contributions of our paper. We believe this basic construct would be useful in other link and topology control problems.

  3. Sensing-based message-less distributed computing. We make crucial use of physical carrier sensing, and in solving MaxLSP we let the wireless nodes make distributed decisions purely based on the Received Signal Strength Indication (RSSI) measurement without the need of exchanging or decoding any messages. Given a threshold , a node is able to detect if the total sensed power strength is . As discussed in [16], this can be done using the RSSI measurement possible through the Clear Channel Assessment capability in the 802.11 standard. In this way, the protocol is much simplified such that the wireless nodes only need to control the physical layer to access the medium with a certain power or to sense the channel. Further, our algorithm uses constant size messages, and all the steps can be implemented within the model without additional capabilities or assumptions (as those made in [14]).

I-B Key Challenges and Comparisons between Models

Comparison between interference models It is known that solutions to the link scheduling problems developed under the graph-based models can be inefficient, if not infeasible, under the SINR model. For instance, Le et al. [20] show that the longest-queue-first scheme may result in zero throughput under SINR constraints (unlike that in the graph based model) for the case of dynamic traffic. As for MaxLSP, it is easy to show that when all the transmitters have uniform transmission/interference ranges, an optimum solution developed under a graph-based model may turn out to be a solution whose size is a fraction of of that of an optimum under the SINR model, where is the length of the longest link and is the uniform transmission range. This is because that given a set of links under the SINR model, as long as all the senders are separated by , where is some constant, all the links form an independent set. Since we are dealing with an arbitrary topology, may be small, leading to a much conservative solution under the SINR model.

Comparison between distributed computing models In light of the huge amount of research on distributed algorithms in the RBN model for many problems, including MaxLSP (e.g., [9, 21]), it is natural to ask if it might be possible to “reduce” the SINR model problem to the RBN model instead of developing new algorithmic techniques. Though it has not been rigorously proven, results from recent papers suggest this might not be feasible, or might only yield larger than constant factor gaps. For instance, Chafekar et al. [10] discuss an instance where the solution in the “equivalent” RBN model could be significantly smaller than that in the SINR model; see also [22]. Further, the RBN model does not allow for capabilities to determine the signal strength and make decisions based on that.

I-C Organization

We discuss the network model and relevant definitions in Section III. We present the high-level distributed algorithm in Algorithm 1 with a constant approximation ratio in Section IV. We introduce and analyze the distributed algorithm to compute a ruling in Section V. In Section VI we show the detailed implementation for each step of the high-level Algorithm 1; we present a second method to implement Algorithm 1 in Section VII, improving the running time by a logarithmic factor.

Ii Related Work

There has been a lot of research on link scheduling and various related problems, because of their fundamental nature. Two broad versions of these problems are: scheduling the largest possible set of links from a given set (maximum independent set), and constructing the smallest schedule for all the links (minimum length schedule). These problems are well understood in graph based interference models and efficient approximation algorithms are known for many versions; see, e.g., [3]. Distributed algorithms are also known for node and link scheduling (and many related problems) in the radio broadcast model [23, 9, 7, 8, 24]. These algorithms are typically randomized and based on Luby’s algorithm [23], and run in synchronous polylogarithmic time. There are varying assumptions on the kind of information and resources needed by individual nodes. For instance, [23] require node degrees at each step (which might vary, as nodes become inactive). Moscibroda et al. [7] develop algorithms that do not require the degree information, and run in time. In recent work, Afek et al. [9] develop a distributed algorithm for the maximal independent set problem, which only requires the an estimate of the total number of nodes, but not degrees.

Link scheduling in the SINR model is considerably harder than in graph based models. Several papers developed -approximations for MaxLSP, e.g., [1, 4], which have been improved to constant factor approximations by [5, 2, 6] for uniform power assignments. Some of these papers use “capacity” [5, 6] to refer to the maximum link scheduling; however, we prefer to avoid the term capacity in order to avoid confusion with the total throughput in a network, which has been traditionally referred to as the capacity (e.g., [25]). Recently, Halldórsson and Mitra [12] extend the approx. ratio to a wide range of oblivious power assignments for both uni- and bi-directional links (including uniform, mean and linear power assignments). This has been improved by Kesselheim [11], who developed the first -algorithm for MaxLSP with power control and an thus an -algorithm for the minimum length schedule problem. Most of the results except those using uniform power assignments, assume unlimited power values; otherwise the results may degrade by a factor depending on the ratio of the maximum and minimum transmission power values.

Most of the above algorithms for scheduling in the SINR model are centralized and it is not clear how to implement them in a distributed manner efficiently. The closest results to ours are by Ásgeirsson and Mitra [14] and Dinitz [15], using game theoretic approaches; the former obtains a constant approx. ratio improving over the latter’s approximation for MaxLSP. Their running time can be much higher than ours, and they require additional assumptions (such as acknowledgements without any cost), which might be difficult to realize in the SINR model.

For the minimum length schedule problem (MinLSP) (where one seeks a shortest schedule to have all the links in transmit successfully) under a length-monotone sub-linear power assignment, Fanghänel et al. [26] develop a distributed algorithm with an approximate ratio of times a logarithmic factor. Recently, Kesselheim and Vöcking [27] propose an -approximate algorithm for any fixed length-monotone and sub-linear power assignment. The approx. ratio of that algorithm has been improved to (matching the best performance of known centralized algorithms) by the analysis of Halldórsson and Mitra [13], who also prove that if all links uses the same randomized strategy, there exists a lower-bound of on the approx. ratio. However, it is not clear how to use these results for MinLSP to get a constant factor approximation for MaxLSP, in which the senders and receivers of all links know their status.

Iii Preliminaries and Definitions

network graph dist. of and
set of nodes set of links
#nodes link diversity
#links optimum instance
path-loss exponent sender of link
SINR threshold receiver of link
background noise length of link
affectance sensed power
TABLE I: Notation.

We let denote a set of tranceivers (henceforth, referred to as nodes) in the Euclidean plane. We assume is a set of links with end-points in , which form the set of communication requests for the maximum link scheduling problem at any given time, and . Links are directed, and for link , and denote the transmitter (or sender) and receiver respectively. For a link set , let denote the set of senders of links in . Let denote the Euclidean distance between nodes . For link , let denote its link length. For links , let . Let and denote the smallest and the largest transmission link lengths respectively. Let denote the ball centered at node with a radius of . Each transmitter uses power for transmission on link ; we assume commonly used path loss models [1, 4], in which the transmission on link is possible only if:


where is the “path-loss exponent”, is the minimum SINR required for successful reception, is the background noise, and is a constant (note that and are all constants).

We partition the set of transmission links into non-overlapping link classes. We define link diversity . Partition , where each is the set of links of roughly similar lengths. Let , such that is an upperbound of link length of ; and , we define . In a distributed environment, nodes use their shared estimates of minimum and maximum possible link length to replace and , as stated in the previous section. in most cases and remains a constant*** The minimum link length is constrained by the device dimension, empirically at least 0.1 meter; the maximum link length depends on the type of the network, and is usually bounded by meters. For example, the Wi-Fi transmission range is below hundred meters and even long-distance Wi-Fi networks [28] have an experimental limit of hundred kilometers; in cellular networks the coverage is at most tens of kilometers; the transmission range in Bluetooth or 60GHz networks is smaller. This implies often .; further, as discussed earlier, each link can compute which link class it belongs to. The reverse link of a link , denoted by , is the same link with transmission direction inverted. For a link set , We use to denote the set of reverse links of .

Wireless Interference. We use physical interference model based on geometric SINR constraints (henceforth referred to as the SINR model), where a subset of links can make successful transmission simultaneously if and only if the following condition holds for each link :


Such a set is said to be independent in the context.

The Maximum Link Scheduling Problem (MaxLSP). Given a set of communication requests (links) , the goal of the MaxLSP problem is to find a maximum independent subset of links that can be scheduled simultaneously in the SINR model. MaxLSP is an instance of MaxLSP where links in a solution use a uniform power level for data transmission; note that this does not necessarily restrict scheduling to uniform power. In this paper, we use to denote an optimum solution to the MaxLSP, and thus is the cardinality of the largest such independent set. As discussed earlier, computing is NP-hard, and we focus on approximation algorithms. We say an algorithm gives a -approximation factor if it constructs an independent link set with .

Distributed Computing Model in the SINR-based Model. Traditionally, distributed algorithms for wireless networks have been studied in the radio broadcast model [29, 7, 8] and its variants. The SINR based computing model is relatively recent, and has not been studied that extensively. Therefore, we summarize the main aspects and assumptions underlying this model: (1) The network is synchronized and for simplicity we assume all slots have the same length. (2) All nodes have a common estimate of , the number of links, within a polynomial factor; (3) For each link , and have an estimate of , but they do not need to know the coordinates or the direction in which the link is oriented; (4) All nodes share a common estimate of and , the minimum and maximum possible link lengths; (5) We assume nodes have physical carrier sensing capability and can detect if the sensed signal exceeds a threshold. As discussed in [16], this can be done using the RSSI measurement possible through the Clear Channel Assessment capability in the 802.11 standard. Given a threshold , we assume that a node is able to detect if the sensed power strength is .

Sensed Power-strength and Affectance. For ease of analysis based on links, we define affectanceSometimes it shares the same definition with the term relative interference, e.g., in [2]; however, “relative interference” may refer to other forms, e.g., in [6]. as that in [12, 6]: the affectance, caused by the sender of link to the receiver of link , is Likewise, we have affectance from a set of links, as . It can be verified that Inequality (2) is equivalent to , signifying the success of data transmission on .

To simplify the analysis based on nodes, we define sensed power-strength , as the signal power that node receives when only is transmitting (which includes background noise); that is, . Likewise, we have SP from a node set : . Let be a function of distance , such that for a node , if any other node is transmitting in a range of , its sensed power will exceed .

Node Capabilities for Distributed Scheduling (1) Half/full Duplex Communication: Wireless radios are generally considered half duplex, i.e., with a single radio they can either transmit or receive/sense but not both at the same time. Full duplex radios, which are becoming reality, enable wireless radios to perform transmission and reception/sensing simultaneously. (2) Non-adaptive/adaptive Power: Although links in a solution to MaxLSP use a uniform power level for data transmission, they are usually capable of using adaptive power which vary across different power levels that may be used for scheduling. The capabilities can play a vital role in distributed computation.

Iv Distributed Algorithm: Overview

In this section, we present the distributed algorithm for MaxLSP. Because the algorithm is quite complicated, we briefly summarize the sequential algorithm of [2, 5, 6] below, and then give a high-level description of the distributed algorithm and its analysis, without the implementation details of the individual steps in the SINR model. Section V describes the algorithm for computing a ruling in the full and half duplex models. The complete distributed implementation and other details are discussed in Sections VI and VII, for the non-adaptive and adaptive power control settings, respectively.

Iv-a The Centralized Algorithm

We discuss the centralized algorithm adapted from [2, 5, 6] for MaxLSP, which forms the basis for our distributed algorithm. The algorithm processes links in non-decreasing order of length. Let be the initial set of links, and the set of links already chosen (which is empty initially). Each iteration involves the following steps:

  1. picking the shortest link in and removing from ,

  2. removing from all the links in where is a constant, i.e., all the links in that suffer from high interference caused by all chosen links in , and

  3. removing from all the links in where is a constant, i.e., all the nearby links of in .

The results of [5, 2, 6] show that: is feasible (i.e., the SINR constraints are satisfied at every link), and is within a constant factor of the optimum. Consider a link that is added to in iteration . The proof of feasibility of set involves showing that for this link , the affectance due to the links added to after iteration is at most , so that simultaneous transmission by all the links in does not cause high interference for . The approximation factor involves the following two ideas: (1) for any link , there can be at most links in which are within distance , and (2) in the set of links removed in step 2 due to the affectance from , there can be at most links in . We note that the second and third steps are reversed in [2], while [6] does not use the third step. However, we find it necessary for our distributed algorithm, which uses the natural approach of considering all the links in a given length class simultaneously (instead of sequentially). Our analysis builds on these ideas, and property (1) holds for our case without any changes. However, property (2) is more challenging to analyze, since many links are added in parallel. Another complication is that the distributed implementation has to be done from the senders’ perspective, so that the above steps become more involved.

Iv-B Additional Definitions

Fig. 1: Example of an -ruling: is the set of all dots (open and dark), while which is the set of all the open dots denotes a -ruling of . Note that all the nodes in are -covered by , while all the nodes in are away from each other.

Cover and Ruling. Let denote two node sets. We say a node is -covered by , if and only if ; based on that, we say is -covered by , or equivalently -covers , if and only if every node in is -covered by . An -ruling (where ) of , introduced in [17], is a node set denoted by , such that

  1. ;

  2. all the nodes in are at least -separated; that is, , ; and

  3. is -covered by .

Here, we have adopted a generalized definition by considering Euclidean distance rather than graph distance. The concept of ruling has a vital role in our algorithm: it is used for choosing a set of spatially separated links and removing the nearby links of the chosen links. Figure 1 gives an example to illustrate these notions.

Iv-C High-level Description of the Distributed Algorithm

input : Set of links
output : One-shot Schedule
1 ;
2 foreach  do /* for each link class in */
3       , ;
       /* 1st step (Lines 1-1): check affectance constraints, s.t. links in are not subject to high interference by links of smaller lengths chosen in previous phases. Note: we use reverse to check affectance at */
4       if  then
5             , ;
6             , ;
8       end if
       /* 2nd step (Lines 11): check spatial constraints, to obtain an -ruling of , s.t. the selected links () are spatially separated and nearby links () of similar or larger lengths are excluded */
9       construct link set , s.t. is an -ruling of ;
10       construct link set , s.t. (1) and (2) ;
       /* 3rd step (Lines 11): select and discard links */
       , ;
       /* select links */
       /* discard links */
12 end foreach
13, Return ;
Algorithm 1 Distributed Maximum Link Scheduling

We have provided a detailed discussion of the centralized algorithms and basic ideas in Section IV-A; now we discuss the distributed algorithm at a high level (Algorithm 1), and prove the main properties. We use the following constants in the algorithm and as an arbitrary constant , where are constants in described in Inequality (1) and is a constant that can take any value from . The algorithm sweeps through the link classes in phases. In the th phase, where , it selects a subset of links from to include in , and removes a subset of links from to speed up later phases; the comments in Algorithm 1 explain each step.

  1. Step 1 in line 1-1 of the algorithm eliminate links which do not satisfy affectance constraints — its implementation is formally described in Sections VI and VII, and crucially relies on the measurement of the received power at each sender.

  2. Step 2 in line 1 of the algorithm constructs the distributed ruling, which is discussed in Section V for the non-adaptive power case, and extended to the adaptive case in Section VII.

Lemma IV.1 (Correctness).

The algorithm results in an independent set .

Lemma IV.1 shows the correctness and is proved in Appendix A-A. Algorithm 1 results in a constant approximation ratio shown in Theorem IV.2; its proof is in Appendix A-B, where this theorem is backed by Lemma A.2 and A.3 in Appendix A-B. The two lemmas, independent of Algorithm 1, stands on its own to provide insights of how an optimum solution is shaped under the SINR model; they can be proved by using a combination of techniques found in [2, 6]. We provide their proofs in Appendix A-B to make the paper complete and help the reading.

Theorem IV.2 (Approximation Ratio).

, if , where , where and . are functions with constant output values for constant input arguments.

V Distributed Algorithm: -Ruling

In this section, we present Algorithm 2, the distributed algorithm to compute an -ruling, for full duplex communication under the physical interference model; in the end of the section, we extend it to the half duplex setting (where a node can perform transmission and reception/sensing at the same time) with added running time. While this algorithm can be interesting by itself, it serves as a significant building block for our distributed implementation. For the algorithm to function properly, we require the input parameter . Recall that denotes the ball centered at with a radius of . Let be the total number of nodes. The last input parameter denote the estimate of the maximum number of nodes in the ball of any node ; in the worst case, .

input : 
output : : an -ruling of
/* Each does the following */
1 for  to  do
2       for  to  do
3             if  is active then
                   /* Coordination Step (Lines 2-2): 1 slot */
4                  ;
5                   if  then  flips to 1 w/ prob. ;
6                  ;
7                   if  then
8                         transmits and senses,   the power receives in this slot;
9                         if  then  ;
10                         ;
12                   end if
                   /* Decision Step (Lines 2-2): 1 slot */
                  if  then  transmits,   joins ;
                   /* inactive */
13                   ;
14                   else
15                         senses, the power receives in this slot;
                         if  then  joins ;
                         /* inactive */
16                         ;
18                   end if
20             end if
22       end for
24 end for
25return ;
Algorithm 2 : Distributed algorithm for computing an -ruling with full duplex radios.

In this algorithm, we call an iteration of the outer loop (Line 2) a phase; we call an iteration of the inner loop (Line 2) a round, consisting of the coordination step (Lines 2 through 2) and the decision step (Lines 2 through 2). A node is said to be active if has not joined either or ; otherwise, becomes inactive.

In each round, the coordination step provides a probabilistic mechanism for active nodes to compete to get in the ruling (at Line 2). Lines 2 through 2 constitute a module to resolve the issue of sensing and transmitting at the same time, such that two nearby nodes do not both enter the ruling (i.e., Lemma V.3). Next, during the decision step, a subset of active nodes decide to join or .

In each phase, there are rounds, such that we can ensure a fraction of the node population have either joined or , and we expect the maximum number of active nodes in the nearby region of any active node to decrease by a half (proved in Lemma B.3 in Appendix B-A). After each phase, the probability for each active node to access the channel and compete doubles (at Line 2). After the total of phases, we have Lemmas V.2V.4V.5 that lead to Theorem V.1.

Theorem V.1 (Correctness).

Algorithm 2 terminates in time. By the end of the algorithm: (1) forms an -ruling of , and (2) and w.h.p.

Theorem V.1 follows directly from the lemmas below. Lemmas V.2V.3 and V.5 prove that is an -ruling of , w.h.p. Lemmas V.2V.4V.5 together shows that complements in and partially in with desired properties, w.h.p. To help the reading flow and due to the page limit, we defer much of the technical content — the proof of Lemma V.2 (which involves Lemmas B.1B.2 and B.3) and the proof of Lemma V.5 — to Appendix B.

Lemma V.2 (Completion).

By the end of the algorithm, all nodes in have joined either or , i.e., all nodes in become inactive, w.h.p.

Lemma V.2 implies that . We say a node is “good,” if and only if and . In Algorithm 2, When a node enters , it makes sure that there are no other ones entering within a range of , and it deactivate all the active nodes in the same range. Therefore, we have the following Lemmas V.3 and V.4.

Lemma V.3 (Quality of ).

All nodes in are good, with probability of 1.

Lemma V.4 (Quality of : Part 1).

contains all the nodes in that are -covered by , with probability of 1.

Lemma V.5 (Quality of : Part 2).

Further, suppose all nodes in are good, then all nodes in are -covered by , .

Half Duplex Communication. Now, we assume that nodes are in the half duplex mode, so that they cannot perform transmission and reception/sensing at the same time. In Algorithm 2, Lines 2 through 2 make use of the full duplex capability, such that Lemma V.3 is true. To account for the case of half duplex communication, if we replace the one-slot deterministic full duplex mechanism (Lines 2 through 2) with a randomized -time loop — illustrated by the following lines of pseudo code — we have Lemma V.6 for half duplex communication as the counterpart of Lemma V.3 for full duplex. The cost incurred includes (1) the increase in the total running time to obtain an -ruling by , and (2) a weakened statement in Lemma V.6 compared to Lemma V.3.

1 for  to  do /* resolving half duplex communication */
       /* in each slot */
2       if  then  transmits with prob. ;
3       if  does not transmit then
4             senses, the power receives in this slot;
             if  then  ;
             /* stops */
5             ;
7       end if
8      ;
10 end for
Algorithm 3 In replacement of Lines 2 through 2 in Algorithm 2 for using half duplex radios.
Lemma V.6 (Quality of : Half Duplex Mode).

All nodes in are good, w.h.p.

Since Lemmas V.2V.4 and V.5 remain valid, we obtain the following theorem for the half duplex case.

Theorem V.7 (Half Duplex).

There exists a modified version of for the half duplex case, such that it finishes in time and by the end of the algorithm: (1) forms an -ruling of , and (2) and , w.h.p.

Vi Distributed Implementation with Non-adaptive Uniform Transmission Power for Scheduling

Putting everything together, we present in this section the distributed implementation of Algorithm 1 when restricted to using one uniform power level for scheduling.

Theorem VI.1 (Performance).

Our distributed implementation of Algorithm 1 with non-adaptive uniform transmission power has the following properties:

  1. in half duplex mode, it terminates in time,

  2. in full duplex mode, it terminates in time, and

  3. in both modes, it produces a constant-approximate solution to MaxLSP.

For the th phase of Algorithm 1, we present the distributed implementation that works even when there is only one fixed power level available. We assign a constant value , and let , and . The distributed implementation goes as follows.

input : Link sets
output : ,
/* in 1 time slot: */
1 if  then  transmits;
2 ;
3 else if  then
4       senses, the power receives;
5       if  then
6             if  then  joins ;
7            ; if  then  joins ;
8            ;
10       else
11             if  then  joins ;
12            ; if  then  joins ;
13            ;
15       end if
17 end if
18return ;
Algorithm 4 : Distributed algorithm for checking affectance.

Distributed Implementation: 1st Step: With Algorithm 4, we run to implement the 1st step for phase in Algorithm 1. , on Line 4 of Algorithm 4, we get . Then, since

is equivalent to

the sets of links whose sender nodes are in correspond to in Algorithm 1 respectively.

Distributed Implementation: 2nd Step: Recall that for a link set , is the set of all sender nodes. To implement the 2nd step for phase in Algorithm 1. we feed to Algorithm 2 and run . Thus, we obtain an -ruling of and that complements in time for half duplex and time for full duplex, Then, the sets of links whose sender nodes are in respectively correspond to in Algorithm 1.

Distributed Implementation: 3rd Step: The 3rd step of Algorithm 1 means all the links in class and those longer links removed in the 1st step exit Algorithm 1. Because our algorithm is sender based, the corresponding links will quit upon the decision of their sender nodes in the 1st and the 2nd steps.

Vii Distributed Implementation with Adaptive Transmission Power for Scheduling

In this section, suppose we have multiple power levels at our disposal on each node In this paper we only study MaxLSP where links in a solution use a uniform power level for data transmission; this does not necessarily restrict scheduling control to using uniform power. The general version of the problem MaxLSP that explores power control in both scheduling and data transmission in a distributed setting is a hard problem and remains open.; we present how this aids the distributed implementation of Algorithm 1.

Theorem VII.1 (Performance).

Our distributed implementation of Algorithm 1 with adaptive transmission power has the following properties:

  1. in half duplex mode, it terminates in time,

  2. in full duplex mode, it terminates in time, and

  3. in both modes, it produces a constant-approximate solution to MaxLSP.

Again, note that these adaptive power levels are only for scheduling in the control phase; for data transmission in the resulting independent set we still use one uniform power level. Specifically, we require that (1) nodes have access to a set of power levels; and (2) for each , there exists a power level to use such that , where is a constant.

We present a second method to implement the 2nd step of each phase in Algorithm 1, reducing the running time by one logarithmic factor, by (1) performing a preprocessing to reduce to some constant in time, (2) running Algorithm 2 with the constant in time with half duplex radios and time with full duplex radios, and (3) performing a postprocessing to obtain the sets of links required as a result of 2nd step of Algorithm 1 in one slot.

We introduce a new constant , and assign a constant value . For the th phase of Algorithm 1, let , , and .

We reuse the implementation for the 1st and the 3rd steps from the previous section. We implement the 2nd step of each phase in Algorithm 1 with the following three sub-steps.

Vii-a Preprocessing: Constant Density Dominating Set

Scheideler, Richa, and Santi in [16] propose a distributed protocol to construct a constant density dominating set of nodes under uniform power assignment within slots. They define as a dominating set of a node set with transmission power of on each node, such that is -covered by , where is the transmission range under . Then, by ”constant density”, they mean that is a -approximation of the minimum dominating set of , such that within the transmission range of each node in there are at most a constant number of nodes chosen by .

At phase of Algorithm 1, after the 1st step of checking affectance, we execute the protocol on the node set with power which corresponds to a transmission range of , and thus obtain a constant density dominating set out of . has the following properties:

  1. ;

  2. dominating set: all the node in -covered by ; and

  3. constant density: , , where is a constant.

Vii-B Construction of Ruling

produces as an -ruling of , and such that

  1. ;

  2. ; and

  3. , i.e., is -covered by .

We argue that is an -ruling of due to the following two properties: (1) and any two nodes in are -separated, and (2) is -covered by . Property (2) can be deduced from the facts below: (1) is -covered by due to the preprocessing step, (2) is -covered by as a result of , and (3) by our construction. Therefore, corresponds to in the 2nd step of Algorithm 1.

Vii-C Postprocessing: Accounting for

Construct ; the following is true:

  1. ;

  2. ; and

  3. , i.e., is -covered by .

Therefore, corresponds to in the 2nd step of Algorithm 1.

Viii Conclusion

In this paper, we present the first set of fast distributed algorithms in the SINR model with a constant factor approximation guarantee for MaxLSP. We extensively study the problem by accounting for the cases of half/full duplex and non-adaptive/adaptive power availability for scheduling. The non-local nature of this model and the asymmetry between senders and receivers makes this model very challenging to study. Our algorithm is randomized and crucially relies on physical carrier sensing for the distributed communication steps, without any additional assumptions. Our main technique of distributed computation of a ruling is likely to be useful in the design of other distributed algorithms in the SINR model.


  • [1] O. Goussevskaia, Y. A. Oswald, and R. Wattenhofer, “Complexity in geometric sinr,” in ACM MobiHoc, 2007.
  • [2] P.-J. Wan, X. Jia, and F. Yao, “Maximum independent set of links under physical interference model,” in Proceedings of WASA, 2009, pp. 169–178.
  • [3] S. Ramanathan and E. L. Lloyd, “Scheduling algorithms for multihop radio networks,” IEEE/ACM Trans. on Netw., vol. 1, pp. 166–177, 1993.
  • [4] D. Chafekar, V. S. A. Kumar, M. V. Marathe, S. Parthasarathy, and A. Srinivasan, “Cross-layer latency minimization in wireless networks with sinr constraints,” in ACM MobiHoc, 2007, pp. 110–119.
  • [5] O. Goussevskaia, M. Halldórsson, R. Wattenhofer, and E. Welzl, “Capacity of arbitrary wireless networks,” in IEEE INFOCOM, 2009.
  • [6] M. M. Halldórsson and R. Wattenhofer, “Wireless communication is in apx,” in ICALP, 2009, corrected version: http://www.hr.is/faculty/mmh/papers/juniform.pdf.
  • [7] T. Moscibroda and R. Wattenhofer, “Maximal independent sets in radio networks,” in ACM symposium on Principles of distributed computing (PODC), 2005.
  • [8] J. Schneider and R. Wattenhofer, “A log* distributed maximal independent set algorithm for growth-bounded graphs,” in ACM symposium on Principles of distributed computing (PODC), 2005.
  • [9] Y. Afek, N. Alon, O. Barad, E. Hornstein, N. Barkai, and Z. Bar-Joseph, “A biological solution to a fundamental distributed computing problem,” Science, vol. 331, pp. 183–185, 2011.
  • [10] D. Chafekar, V. S. A. Kumar, M. Marathe, S. Parthasarathy, and A. Srinivasan, “Approximation algorithms for computing capacity of wireless networks with sinr constraints,” in INFOCOM 2008, 2008, pp. 1166 –1174.
  • [11] T. Kesselheim, “A constant-factor approximation for wireless capacity maximization with power control in the sinr model,” in ACM-SIAM Symposium on Discrete Algorithms (SODA), 2011.
  • [12] M. M. Halldórsson and P. Mitra, “Wireless capacity with oblivious power in general metrics,” in ACM-SIAM Symposium on Discrete Algorithms (SODA), 2011.
  • [13] ——, “Nearly optimal bounds for distributed wireless scheduling in the sinr model,” in ICALP, 2011.
  • [14] E. Ásgeirsson and P. Mitra, “On a game theoretic approach to capacity maximization in wireless networks,” in IEEE INFOCOM, 2011.
  • [15] M. Dinitz, “Distributed algorithms for approximating wireless network capacity,” in IEEE INFOCOM, 2010.
  • [16] C. Scheideler, A. Richa, and P. Santi, “An dominating set protocol for wireless ad-hoc networks under the physical interference model,” in ACM MobiHoc, 2008, pp. 91–100.
  • [17] R. Cole and U. Vishkin, “Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms,” in ACM symposium on Theory of computing (STOC), 1986, pp. 206–219.
  • [18] B. Awerbuch, M. Luby, A. V. Goldberg, and S. A. Plotkin, “Network decomposition and locality in distributed computation,” in IEEE Symposium on Foundations of Computer Science (FOCS), 1989, pp. 364–369.
  • [19] A. Panconesi and A. Srinivasan, “Improved distributed algorithms for coloring and network decomposition problems,” in ACM symposium on Theory of computing (STOC), 1992, pp. 581–592.
  • [20] L. Le, E. Modiano, C. Joo, and N. B. Shroff, “Longest-queue-first scheduling under sinr interface model,” in ACM MobiHoc, 2010.
  • [21] D. Peleg, Distributed computing: a locality-sensitive approach.   SIAM, 2000.
  • [22] T. Moscibroda, “The worst-case capacity of wireless sensor networks,” in International Conference on Information Processing in Sensor Networks (IPSN), 2007, pp. 1–10.
  • [23] M. Luby, “A simple parallel algorithm for the maximal independent set problem,” in ACM STOC, 1985.
  • [24] Y. Metivier, J. M. Robson, N. Saheb-Djahromi, and A. Zemmari, “An optimal bit complexity randomized distributed mis algorithm,” in SIROCCO, 2009, pp. 323–337.
  • [25] P. Gupta and P. R. Kumar, “The capacity of wireless networks,” IEEE Trans. on Info. Theory, vol. 46, no. 2, pp. 388–404, 2000.
  • [26] A. Fanghänel, T. Kesselheim, and B. Vöcking, “Improved algorithms for latency minimization in wireless networks,” in Internatilonal Collogquium on Automata, Languages and Programming (ICALP), 2009, pp. 447–458.
  • [27] T. Kesselheim and B. Vöcking, “Distributed contention resolution in wireless networks,” in DISC, 2010.
  • [28] R. Patra, S. Nedevschi, S. Surana, A. Sheth, L. Subramanian, and E. Brewer, “WiLDNet: Design and implementation of high performance WiFi based long distance networks,” in USENIX NSDI, 2007, pp. 87–100.
  • [29] H. Balakrishnan, C. Barrett, V. S. A. Kumar, M. Marathe, and S. Thite, “The distance 2-matching problem and its relationship to the MAC layer capacity of adhoc wireless networks,” IEEE Journal on Selected Areas in Communications, vol. 22, no. 6, pp. 1069–1079, 2004.
  • [30] T. Moscibroda, R. Wattenhofer, and A. Zollinger, “Topology control meets sinr: the scheduling complexity of arbitrary topologies,” in ACM MobiHoc, 2006, pp. 310–321.

Appendix A Appendix to Section Iv

A-a Proof of Lemma iv.1

The statement of Lemma IV.1 is equivalent to that . Let be an arbitrary link in , and w.l.o.g., we assume , and thus . In each phase , because