Sciweavers

345 search results - page 30 / 69
» Probabilistic Coverage in Wireless Sensor Networks
Sort
View
INFOCOM
2003
IEEE
14 years 1 months ago
Sensor Deployment and Target Localization Based on Virtual Forces
— The effectiveness of cluster-based distributed sensor networks depends to a large extent on the coverage provided by the sensor deployment. We propose a virtual force algorithm...
Yi Zou, Krishnendu Chakrabarty
TMC
2010
155views more  TMC 2010»
13 years 7 months ago
Maximizing the Lifetime of a Barrier of Wireless Sensors
—To make a network last beyond the lifetime of an individual sensor, redundant sensors must be deployed. What sleep-wakeup schedule can then be used for individual sensors so tha...
Santosh Kumar, Ten-Hwang Lai, Marc E. Posner, Pras...
UIC
2007
Springer
14 years 2 months ago
A Lightweight Scheme for Node Scheduling in Wireless Sensor Networks
Abstract. The coverage problem in wireless sensor networks (WSNs) is to determine the number of active sensor nodes needed to cover the sensing area. The purpose is to extend the l...
Ming Liu, Yuan Zheng, Jiannong Cao, Wei Lou, Guiha...
JUCS
2008
150views more  JUCS 2008»
13 years 8 months ago
Optimal Sensor Network Layout Using Multi-Objective Metaheuristics
: Wireless Sensor Networks (WSN) allow, thanks to the use of small wireless devices known as sensor nodes, the monitorization of wide and remote areas with precision and liveness u...
Guillermo Molina, Enrique Alba, El-Ghazali Talbi
IJWMC
2010
115views more  IJWMC 2010»
13 years 6 months ago
Small-world effects in wireless agent sensor networks
Coverage, fault tolerance and power consumption constraints make optimal placement of mobile sensors or other mobile agents a hard problem. We have developed a model for describin...
Kenneth A. Hawick, Heath A. James