Sciweavers

33 search results - page 4 / 7
» Practical lazy scheduling in sensor networks
Sort
View
IPSN
2007
Springer
15 years 3 months ago
The worst-case capacity of wireless sensor networks
The key application scenario of wireless sensor networks is data gathering: sensor nodes transmit data, possibly in a multi-hop fashion, to an information sink. The performance of...
Thomas Moscibroda
SUTC
2010
IEEE
15 years 1 months ago
Pushing the Throughput Limit of Low-Complexity Wireless Embedded Sensing Systems
—To maximize the communication throughput for wireless sensing systems, designers have attempted various combinations of protocol design and manual code optimization. Although th...
Vahid Salmani, Pai H. Chou
ALGOSENSORS
2009
Springer
15 years 4 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
ICDCS
2010
IEEE
14 years 11 months ago
Distributed Coverage in Wireless Ad Hoc and Sensor Networks by Topological Graph Approaches
Abstract—Coverage problem is a fundamental issue in wireless ad hoc and sensor networks. Previous techniques for coverage scheduling often require accurate location information o...
Dezun Dong, Yunhao Liu, Kebin Liu, Xiangke Liao
RTSS
2008
IEEE
15 years 4 months ago
Rate-Harmonized Scheduling for Saving Energy
—Energy consumption continues to be a major concern in multiple application domains including powerhungry data centers, portable and wearable devices, mobile communication device...
Anthony Rowe, Karthik Lakshmanan, Haifeng Zhu, Rag...