Sciweavers

316 search results - page 1 / 64
» Oblivious interference scheduling
Sort
View
PODC
2009
ACM
14 years 4 months ago
Oblivious interference scheduling
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
Alexander Fanghänel, Berthold Vöcking, H...
INFOCOM
2007
IEEE
13 years 10 months ago
On Optimal MAC Scheduling With Physical Interference
— We propose a general family of MAC scheduling algorithms that achieve any rate-point on a uniform discretelattice within the throughput-region (i.e., lattice-throughputoptimal)...
Yung Yi, Gustavo de Veciana, Sanjay Shakkottai
MOBIHOC
2010
ACM
13 years 2 months ago
Longest-queue-first scheduling under SINR interference model
We investigate the performance of longest-queue-first (LQF) scheduling (i.e., greedy maximal scheduling) for wireless networks under the SINR interference model. This interference...
Long Bao Le, Eytan Modiano, Changhee Joo, Ness B. ...
VTC
2006
IEEE
132views Communications» more  VTC 2006»
13 years 10 months ago
Interference Diversity in Frequency-Hopped Systems with Soft Decoding
— In this paper, we analyze the effect of interference diversity on the capacity of a cellular system that employs frequency hopping, power control and bit-interleaved coded modu...
Kostas Stamatiou, John G. Proakis
TMC
2012
11 years 6 months ago
Fast Data Collection in Tree-Based Wireless Sensor Networks
—We investigate the following fundamental question—how fast can information be collected from a wireless sensor network organized as tree? To address this, we explore and evalu...
Özlem Durmaz Incel, Amitabha Ghosh, Bhaskar K...