71 search results - page 6 / 15 » Approximation Algorithms for Wireless Link Scheduling With S... |
152
click to vote
GLOBECOM
2007
IEEE
15 years 9 months ago
2007
IEEE
— Graph-based algorithms for point-to-point link scheduling in Spatial reuse Time Division Multiple Access (STDMA) wireless ad hoc networks often result in a significant number ...
158
click to vote
INFOCOM
2010
IEEE
15 years 1 months ago
2010
IEEE
—In this paper we consider the problem of maximizing wireless network capacity (a.k.a. one-shot scheduling) in both the protocol and physical models. We give the first distribut...
118
click to vote
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
135
click to vote
WINET
2010
15 years 1 months ago
2010
Abstract Algorithms for scheduling TDMA transmissions in multi-hop networks usually determine the smallest length conflict-free assignment of slots in which each link or node is a...
128
click to vote
ICC
2009
IEEE
15 years 10 months ago
2009
IEEE
— Both fast scheduling and spatial signal processing have proven to be capacity-increasing methods in wireless communication systems. However, when applied in the downlink of a c...