#### DMCA

## A constant approximation algorithm for link scheduling in arbitrary networks under physical interference model (2009)

Venue: | Proc. ACM FOWANC |

Citations: | 13 - 4 self |

### Citations

3243 | The capacity of wireless networks,”
- Gupta, Kumar
- 2000
(Show Context)
Citation Context ...ssume that the spread of links is bounded by any constant. 143. RELATED WORK Link scheduling in randomly deployed wireless networks has been intensely studied from the information theory perspective =-=[8, 11]-=-. However, these results typically do not provide algorithmic tools to find a feasible and efficient link scheduling. In wireless networks, whether a given subset of links can be scheduled to transmit... |

949 | Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks.
- Tassiulas, Ephremides
- 1992
(Show Context)
Citation Context ...hput (i.e., ∑f i=1 λi) with bounded buffer at every node by carefully designing routing schemes and scheduling the set of links to transmit at every time-slot has been widely studied. It was shown in =-=[19, 20]-=- that scheduling links with maximum total weight at every time-slot will maximize the expected throughput usi ng bounded buff e r. H e r e t he w ei ght of a l i nk l i s defi ned as r(l) · q(l),where... |

283 | Joint Scheduling and Power Control for Wireless Ad-hoc Networks,”
- ElBatt, Ephremides
- 2002
(Show Context)
Citation Context ...io P (u)·g(u,v) (SINR) N+ ∑ is more than some specified threshold. w P (w)g(w,v) The problem of joint scheduling and power control in the SINR model has been well studied previously. For instance, in =-=[5, 6]-=-, optimization models and heuristics for this problem are proposed. In [7,17], topology control with SINR constraints is studied. In [15], a power-assignment algorithm which schedules a strongly conne... |

208 |
Linear complexity algorithms for maximum throughput in radio networks and input queued switches. In:
- Tassiulas
- 1998
(Show Context)
Citation Context ...hput (i.e., ∑f i=1 λi) with bounded buffer at every node by carefully designing routing schemes and scheduling the set of links to transmit at every time-slot has been widely studied. It was shown in =-=[19, 20]-=- that scheduling links with maximum total weight at every time-slot will maximize the expected throughput usi ng bounded buff e r. H e r e t he w ei ght of a l i nk l i s defi ned as r(l) · q(l),where... |

194 | A.: Optimal routing, link scheduling and power control in multihop wireless networks. In:
- Cruz, Santhanam
- 2003
(Show Context)
Citation Context ...io P (u)·g(u,v) (SINR) N+ ∑ is more than some specified threshold. w P (w)g(w,v) The problem of joint scheduling and power control in the SINR model has been well studied previously. For instance, in =-=[5, 6]-=-, optimization models and heuristics for this problem are proposed. In [7,17], topology control with SINR constraints is studied. In [15], a power-assignment algorithm which schedules a strongly conne... |

156 | Computing and communicating functions over sensor networks,”
- Giridhar, Kumar
- 2005
(Show Context)
Citation Context ...ssume that the spread of links is bounded by any constant. 143. RELATED WORK Link scheduling in randomly deployed wireless networks has been intensely studied from the information theory perspective =-=[8, 11]-=-. However, these results typically do not provide algorithmic tools to find a feasible and efficient link scheduling. In wireless networks, whether a given subset of links can be scheduled to transmit... |

140 | Computationally efficient scheduling with the physical interference model for throughput improvement in wireless mesh networks,” proc.
- Brar, Blough, et al.
- 2006
(Show Context)
Citation Context ...t be directly used for finding a maximum weighted independent set of links in physical interference model. This makes the design and analysis of algorithms more challenging than in graph based models =-=[2, 15, 16]-=-. Goussevskaia et al. [10] pointed out that we can construct instances that indicate that the relative error between the accuracy of these two different interference models might be as big as Θ(n), i.... |

129 | On the complexity of scheduling in wireless networks,”
- Sharma, Mazumdar, et al.
- 2006
(Show Context)
Citation Context ...ol interference model in which a receiver v is interfered by another sender w if and only if ‖vw‖ ≤1. Scheduling problems in this interference graph model can be solved using some graph-based methods =-=[12, 13, 18]-=-. However, this simple interference graph model cannot capture many features of wireless networks. A more complex model is the SINR model in which each sender u transmits at a power P (u) and we assum... |

125 | Understanding the capacity region of the greedy maximal scheduling algorithm in multihop wireless networks,”
- Joo, Lin, et al.
- 2009
(Show Context)
Citation Context ...ol interference model in which a receiver v is interfered by another sender w if and only if ‖vw‖ ≤1. Scheduling problems in this interference graph model can be solved using some graph-based methods =-=[12, 13, 18]-=-. However, this simple interference graph model cannot capture many features of wireless networks. A more complex model is the SINR model in which each sender u transmits at a power P (u) and we assum... |

115 | The Complexity of Connectivity in Wireless Networks.
- Moscibroda, Wattenhofer
- 2006
(Show Context)
Citation Context ...ent algorithms to maximize the throughput, by often assuming that the packets arrive at a constant bit rate. The algorithmic challenges of worst-case networks have also received some attention, e.g., =-=[10,14,15]-=-. These studies suggest that there is a significant gap between the capacities of randomly deployed and worst-case networks. For example, when each node transmits at the same power 13P and the data r... |

103 | Topology control meets SINR: the scheduling complexity of arbitrary topologies,” in
- Moscibroda, Wattenhofer, et al.
- 2006
(Show Context)
Citation Context ...hat can transmit simultaneously, where all requests are single-hop and all nodes transmit at a fixed power level. This problem was shown to be NP-complete in [9] and several methods were presented in =-=[1, 10, 13, 15, 17]-=- with various approximation guarantees under different conditions. The main contributions of this paper are as follows. We first give an algorithm with constant approximation ratio, based on a breakth... |

94 |
Algorithmic aspects of capacity in wireless networks,”
- Kumar, Marathe, et al.
- 2005
(Show Context)
Citation Context ...hat can transmit simultaneously, where all requests are single-hop and all nodes transmit at a fixed power level. This problem was shown to be NP-complete in [9] and several methods were presented in =-=[1, 10, 13, 15, 17]-=- with various approximation guarantees under different conditions. The main contributions of this paper are as follows. We first give an algorithm with constant approximation ratio, based on a breakth... |

77 | Complexity in geometric SINR,”
- Goussevskaia, Oswald, et al.
- 2007
(Show Context)
Citation Context ...slots needed to schedule all these links successfully. Notice that unlike the traditional wired networks, finding the maximum number of links that can be scheduled simultaneously is NP-hard questions =-=[1, 4, 9, 10]-=- for wireless ad hoc networks. There are two different lines in studying the capacity of wireless networks in the literature, depending on the topology of the network. The first line of work investiga... |

73 | Capacity of Arbitrary Wireless Networks.
- Goussevskaia, Wattenhofer, et al.
- 2009
(Show Context)
Citation Context ...nd a maximum “independent set” (MIS) of links, i.e., the maximum number of links that can transmit successfully in one time-slot, given a set of input links. This problem has been shown to be NP-hard =-=[10]-=-. Here we propose the first link scheduling algorithm with a constant approximation ratio for arbitrary background noise N ≥ 0. When each link l has a weight w(l) > 0, we propose a method for weighted... |

64 |
The Worst-Case Capacity of Wireless Sensor Networks.
- Moscibroda
- 2007
(Show Context)
Citation Context ...ent algorithms to maximize the throughput, by often assuming that the packets arrive at a constant bit rate. The algorithmic challenges of worst-case networks have also received some attention, e.g., =-=[10,14,15]-=-. These studies suggest that there is a significant gap between the capacities of randomly deployed and worst-case networks. For example, when each node transmits at the same power 13P and the data r... |

53 | Maximizing Capacity in Arbitrary Wireless Networks in the SINR Model: Complexity and Game Theory.
- Andrews, Dinitz
- 2009
(Show Context)
Citation Context ...slots needed to schedule all these links successfully. Notice that unlike the traditional wired networks, finding the maximum number of links that can be scheduled simultaneously is NP-hard questions =-=[1, 4, 9, 10]-=- for wireless ad hoc networks. There are two different lines in studying the capacity of wireless networks in the literature, depending on the topology of the network. The first line of work investiga... |

48 | Approximation algorithms for computing capacity of wireless networks with SINR constraints,” in Infocom,
- Chafekar, Kumar, et al.
- 2008
(Show Context)
Citation Context ...slots needed to schedule all these links successfully. Notice that unlike the traditional wired networks, finding the maximum number of links that can be scheduled simultaneously is NP-hard questions =-=[1, 4, 9, 10]-=- for wireless ad hoc networks. There are two different lines in studying the capacity of wireless networks in the literature, depending on the topology of the network. The first line of work investiga... |

40 | Cross-layer latency minimization for wireless networks using SINR constraints,” in Mobihoc,
- Chafekar, Kumar, et al.
- 2007
(Show Context)
Citation Context ...oposed. In [7,17], topology control with SINR constraints is studied. In [15], a power-assignment algorithm which schedules a strongly connected set of links in poly-logarithmic time is presented. In =-=[3]-=-, the combined problem of routing and power control is addressed. In [9], the scheduling problem without power control in the SINR model, where nodes are arbitrarily distributed in Euclidean space, ha... |

24 | Topology control for maintaining network connectivity and maximizing network capacity under the physical model
- Gao, Hou, et al.
- 2008
(Show Context)
Citation Context ...,v) The problem of joint scheduling and power control in the SINR model has been well studied previously. For instance, in [5, 6], optimization models and heuristics for this problem are proposed. In =-=[7,17]-=-, topology control with SINR constraints is studied. In [15], a power-assignment algorithm which schedules a strongly connected set of links in poly-logarithmic time is presented. In [3], the combined... |