279 search results - page 20 / 56 » Randomized k-Coverage Algorithms For Dense Sensor Networks |
ICDCS
2008
IEEE
14 years 2 months ago
2008
IEEE
Wireless sensor networks (WSNs) deployed for missioncritical applications face the fundamental challenge of meeting stringent spatiotemporal performance requirements using nodes w...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Many models of wireless sensor networks (WSNs) assume a perfect synchronization along the graph of such network as a simplifying assumption. In our contribution we base our invest...
ESA
2005
Springer
14 years 1 months ago
2005
Springer
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
—We study the distributed desynchronization problem for graphs with arbitrary topology. Motivated by the severe computational limitations of sensor networks, we present a randomi...
IEEECIT
2010
IEEE
13 years 6 months ago
2010
IEEE
This paper investigates the energy-saving organization of sensor nodes in large wireless sensor networks. Due to a random deployment used in many application scenarios, much more n...