Sciweavers

6 search results - page 1 / 2
» Optimal Universal Schedules for Discrete Broadcast
Sort
View
TIT
2008
84views more  TIT 2008»
13 years 5 months ago
Optimal Universal Schedules for Discrete Broadcast
In this paper we study the scenario in which a server sends dynamic data over a single broadcast channel to a number of passive clients. We consider the data to consist of discret...
Michael Langberg, Alexander Sprintson, Jehoshua Br...
INFOCOM
2000
IEEE
13 years 9 months ago
Broadcast Disks with Polynomial Cost Functions
— In broadcast disk systems, information is broadcasted in a shared medium. When a client needs an item from the disk, it waits until that item is broadcasted. The fundamental al...
Amotz Bar-Noy, Boaz Patt-Shamir, Igor Ziper
ALGOSENSORS
2009
Springer
13 years 11 months ago
Near-Optimal Radio Use for Wireless Network Synchronization
In this paper we consider the model of communication where wireless devices can either switch their radios off to save energy (and hence, can neither send nor receive messages), o...
Milan Bradonjic, Eddie Kohler, Rafail Ostrovsky
MOBICOM
2009
ACM
13 years 11 months ago
Opportunistic flooding in low-duty-cycle wireless sensor networks with unreliable links
Intended for network-wide dissemination of commands, configurations and code binaries, flooding has been investigated extensively in wireless networks. However, little work has ...
Shuo Guo, Yu Gu, Bo Jiang, Tian He
HPDC
2007
IEEE
13 years 11 months ago
A fast topology inference: a building block for network-aware parallel processing
Adapting to the network is the key to achieving high performance for communication-intensive applications, including scientific computing, data intensive computing, and multicast...
Tatsuya Shirai, Hideo Saito, Kenjiro Taura