504 search results - page 53 / 101 » Minimum-latency aggregation scheduling in wireless sensor ne... |
128
click to vote
QSHINE
2009
IEEE
15 years 10 months ago
2009
IEEE
To achieve required sensing coverage for a very long period of time is an important and challenging problem in sensor network design. Recently, Tong et al. have proposed a node rep...
163
click to vote
ALGOSENSORS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Wireless sensor networks benefit from communication protocols that reduce power requirements by avoiding frame collision. Time Division Media Access methods schedule tra...
135
click to vote
MOBIHOC
2006
ACM
16 years 3 months ago
2006
ACM
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...
160
click to vote
GSN
2009
Springer
15 years 8 months ago
2009
Springer
The understanding of complex environmental phenomena, such as deforestation and epidemics, requires observations at multiple scales. This scale dependency is not handled well by to...
199
click to vote
JCO
2006
15 years 4 months ago
2006
We study a novel "coverage by directional sensors" problem with tunable orientations on a set of discrete targets. We propose a Maximum Coverage with Minimum Sensors (MCM...