Sciweavers

2190 search results - page 20 / 438
» Distributed algorithms for dynamic coverage in sensor networ...
Sort
View
INFOCOM
2009
IEEE
14 years 2 months ago
Trap Coverage: Allowing Coverage Holes of Bounded Diameter in Wireless Sensor Networks
—Tracking of movements such as that of people, animals, vehicles, or of phenomena such as fire, can be achieved by deploying a wireless sensor network. So far only prototype sys...
Paul Balister, Zizhan Zheng, Santosh Kumar, Prasun...
SECON
2008
IEEE
14 years 2 months ago
Coordinated Locomotion of Mobile Sensor Networks
Stationary wireless sensor networks (WSNs) fail to scale when the area to be monitored is open (i.e borderless) and the physical phenomena to be monitored may migrate through a la...
Seokhoon Yoon, Onur Soysal, Murat Demirbas, Chunmi...
HYBRID
2009
Springer
14 years 2 months ago
Convergence of Distributed WSN Algorithms: The Wake-Up Scattering Problem
In this paper, we analyze the problem of finding a periodic schedule for the wake-up times of a set of nodes in a Wireless Sensor Network that optimizes the coverage of the region...
Daniele Fontanelli, Luigi Palopoli, Roberto Passer...
JCO
2006
153views more  JCO 2006»
13 years 7 months ago
Efficient point coverage in wireless sensor networks
We study minimum-cost sensor placement on a bounded 3D sensing field, R, which comprises a number of discrete points that may or may not be grid points. Suppose we have types of se...
Jie Wang, Ning Zhong
AHSWN
2010
177views more  AHSWN 2010»
13 years 7 months ago
Dynamic Point Coverage Problem in Wireless Sensor Networks: A Cellular Learning Automata Approach
One way to prolong the lifetime of a wireless sensor network is to schedule the active times of sensor nodes, so that a node is active only when it is really needed. In the dynami...
Mehdi Esnaashari, Mohammad Reza Meybodi