Sciweavers

441 search results - page 29 / 89
» Approximate Coverage in Wireless Sensor Networks
Sort
View
IPPS
2008
IEEE
15 years 3 months ago
Sweep coverage with mobile sensors
Many efforts have been made for addressing coverage problems in sensor networks. They fall into two categories, full coverage and barrier coverage, featured as static coverage. In...
Wei-Fang Cheng, Mo Li, Kebin Liu, Yunhao Liu, Xian...
TMC
2010
155views more  TMC 2010»
14 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...
107
Voted
UIC
2007
Springer
15 years 3 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»
14 years 9 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»
14 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