309 search results - page 32 / 62 » Compact Wakeup Scheduling in Wireless Sensor Networks |
QSHINE
2009
IEEE
14 years 2 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...
ALGOSENSORS
2004
Springer
14 years 1 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...
MOBIHOC
2006
ACM
14 years 7 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...
JCO
2006
13 years 7 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...
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
This paper proposes a concurrency model which integrates the asynchronous and event-driven nature of wireless etworks with higher-level abstractions that provide a more familiar p...