Sciweavers

720 search results - page 24 / 144
» Broadcast scheduling: algorithms and complexity
Sort
View
SENSYS
2003
ACM
15 years 3 months ago
Practical lazy scheduling in sensor networks
Experience has shown that the power consumption of sensors and other wireless computational devices is often dominated by their communication patterns. We present a practical real...
Ramana Rao Kompella, Alex C. Snoeren
64
Voted
CORR
2006
Springer
102views Education» more  CORR 2006»
14 years 10 months ago
On the User Selection for MIMO Broadcast Channels
1 In this paper, we consider a downlink communication system, in which a base station (BS) equipped with M antennas communicates with N users each equipped with K receive antennas....
Alireza Bayesteh, Amir K. Khandani
CORR
2007
Springer
76views Education» more  CORR 2007»
14 years 10 months ago
Power Optimal Scheduling for Guaranteed Throughput in Multi-access Fading Channels
Abstract— A power optimal scheduling algorithm that guarantees desired throughput and bounded delay to each user is developed for fading multi-access multi-band channels that can...
Prasanna Chaporkar, Kimmo Kansanen, Ralf R. Mü...
73
Voted
WDAG
1999
Springer
88views Algorithms» more  WDAG 1999»
15 years 2 months ago
Generic Broadcast
This short paper establishes lower bounds on the time complexity of algorithms solving the generic broadcast problem. The paper shows that (a) to deliver messages in one round, no...
Fernando Pedone, André Schiper
ICC
2008
IEEE
199views Communications» more  ICC 2008»
15 years 4 months ago
Lower-Complexity Layered Belief-Propagation Decoding of LDPC Codes
Abstract— The design of LDPC decoders with low complexity, high throughput, and good performance is a critical task. A well-known strategy is to design structured codes such as q...
Yuan-Mao Chang, Andres I. Vila Casado, Mau-Chung F...