Sciweavers

625 search results - page 21 / 125
» Approximating Travel Times Using Opportunistic Networking
Sort
View
RANDOM
2001
Springer
15 years 4 months ago
Minimizing Stall Time in Single and Parallel Disk Systems Using Multicommodity Network Flows
We study integrated prefetching and caching in single and parallel disk systems. A recent approach used linear programming to solve the problem. We show that integrated prefetching...
Susanne Albers, Carsten Witt
WINET
2010
159views more  WINET 2010»
14 years 10 months ago
Approximation algorithm for minimal convergecast time problem in wireless sensor networks
In this paper we consider how to collect data from sensors deployed in the Euclidean plane in a timeefficient way. We assume that all sensors could adjust their transmission range...
Weiping Shang, Peng-Jun Wan, Xiaodong Hu
DCOSS
2007
Springer
15 years 3 months ago
Efficient Computation of Minimum Exposure Paths in a Sensor Network Field
The exposure of a path p is a measure of the likelihood that an object traveling along p is detected by a network of sensors and it is formally defined as an integral over all poin...
Hristo Djidjev
WIMOB
2008
IEEE
15 years 6 months ago
Using LED Lighting for Ubiquitous Indoor Wireless Networking
—Wireless networking is currently dominated by radio frequency (RF) techniques. However, the soon-to-be ubiquity of LED-based lighting motivated by significant energy savings pro...
Thomas D. C. Little, Peter Dib, Kandarp Shah, Nick...
UIC
2007
Springer
15 years 5 months ago
Maximizing Network Lifetime Under Reliability Constraints Using a Cross-Layer Design in Dense Wireless Sensor Networks
Abstract. Recent experimental studies have shown that radio links between low-power devices are extremely unreliable. In particular, the instability and unpredictability of low-pow...
Shan Guo Quan, Young Yong Kim