Sciweavers

1687 search results - page 33 / 338
» On the complexity of scheduling in wireless networks
Sort
View
BROADNETS
2004
IEEE
15 years 9 months ago
The Effects of the Sub-Carrier Grouping on Multi-Carrier Channel Aware Scheduling
Channel-aware scheduling and link adaptation (LA) methods are widely considered to be crucial for realizing high data rates in wireless networks. Multi-carrier systems that spread...
Fanchun Jin, Gokhan Sahin, Amrinder Arora, Hyeong-...
TON
2010
127views more  TON 2010»
15 years 23 days ago
Approximation Algorithms for Wireless Link Scheduling With SINR-Based Interference
In this paper, we consider the classical problem of link scheduling in wireless networks under an accurate interference model, in which correct packet reception at a receiver node ...
Douglas M. Blough, Giovanni Resta, Paolo Santi
LCN
2003
IEEE
15 years 11 months ago
Scheduling Nodes in Wireless Sensor Networks: A Voronoi Approach
A wireless sensor network is a special kind of ad-hoc network with distributed sensing and processing capability that can be used in a wide range of applications, such as environm...
Marcos Augusto M. Vieira, Luiz Filipe M. Vieira, L...
142
Voted
FLAIRS
2007
15 years 8 months ago
Temporal Networks with Alternatives: Complexity and Model
Temporal Networks play an important role in solving planning problems and they are also used, though not as frequently, when solving scheduling problems. In this paper we propose ...
Roman Barták, Ondrej Cepek
GLOBECOM
2006
IEEE
16 years 4 days ago
Throughput Guarantees for Wireless Networks with Opportunistic Scheduling
In this letter we develop an expression for the approximate throughput guarantee violation probability (TGVP) for users in time-slotted networks for any scheduling algorithm with ...
Vegard Hassel, Geir E. Øien, David Gesbert