Sciweavers

345 search results - page 19 / 69
» Probabilistic Coverage in Wireless Sensor Networks
Sort
View
ALGOSENSORS
2009
Springer
14 years 3 months ago
Approximating Barrier Resilience in Wireless Sensor Networks
Barrier coverage in a sensor network has the goal of ensuring that all paths through the surveillance domain joining points in some start region S to some target region T will inte...
Sergey Bereg, David G. Kirkpatrick
ICDCS
2010
IEEE
13 years 10 months ago
Distributed Coverage in Wireless Ad Hoc and Sensor Networks by Topological Graph Approaches
Abstract—Coverage problem is a fundamental issue in wireless ad hoc and sensor networks. Previous techniques for coverage scheduling often require accurate location information o...
Dezun Dong, Yunhao Liu, Kebin Liu, Xiangke Liao
TON
2012
11 years 11 months ago
Exploiting Data Fusion to Improve the Coverage of Wireless Sensor Networks
Abstract—Wireless sensor networks (WSNs) have been increasingly available for critical applications such as security surveillance and environmental monitoring. An important perfo...
Rui Tan, Guoliang Xing, Benyuan Liu, Jianping Wang...
ICWN
2008
13 years 10 months ago
Coverage Efficient Clustering Method Based on Time Delay for Wireless Sensor Networks
Energy efficient operations are essential to increase the lifetime of wireless sensor network. A clustering-based protocol is one approach that reduces energy by a data aggregation...
Ji Gong, Hyuntae Kim, Gihwan Cho
CN
2010
183views more  CN 2010»
13 years 8 months ago
A learning automata based scheduling solution to the dynamic point coverage problem in wireless sensor networks
The dynamic point coverage problem in wireless sensor networks is to detect some moving target points in the area of the network using as little sensor nodes as possible. One way ...
Mehdi Esnaashari, Mohammad Reza Meybodi