Sciweavers

Share
209 search results - page 1 / 42
» Constant-approximation for target coverage problem in wirele...
Sort
View
TWC
2008
193views more  TWC 2008»
8 years 8 months ago
Coverage for target localization in wireless sensor networks
Target tracking and localization are important applications in wireless sensor networks. Although the coverage problem for target detection has been intensively studied, few consi...
Wei Wang 0002, Vikram Srinivasan, Bang Wang, Kee C...
ICC
2007
IEEE
138views Communications» more  ICC 2007»
9 years 2 months ago
Optimal Observation Scheduling for connected target coverage problem in Wireless Sensor Networks
— In this paper, we consider the problem of scheduling sensor activity to maximize network lifetime while maintaining both discrete targets coverage and network connectivity. We ...
Qun Zhao, Mohan Gurusamy
INFOCOM
2012
IEEE
6 years 10 months ago
Constant-approximation for target coverage problem in wireless sensor networks
—When a large amount of sensors are randomly deployed into a field, how can we make a sleep/activate schedule for sensors to maximize the lifetime of target coverage in the fie...
Ling Ding, Weili Wu, James Willson, Lidong Wu, Zai...
AHSWN
2010
177views more  AHSWN 2010»
8 years 8 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
CN
2010
183views more  CN 2010»
8 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
books