Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
×
May 7, 2014 · Target coverage is needed to select sensors in a given area that can monitor a set of interesting points. Data collection is needed to transmit ...
People also ask
Lu et al. [24] proposed a sleep scheduling approach for maximizing the network lifetime. The algorithm turns on a group of sensors that sense specific target ...
It is proved that it is NP-hard to find a maximum lifetime scheduling of target cover and data collection for a WSN, even if all the sensors have the same ...
Abstract—Target coverage and data collection are two funda- mental problems for wireless sensor networks. In target coverage, it is needed to select sensors ...
In this section, we briefly survey existing approaches to maximizing the lifetime of sensor networks, while meeting certain coverage objectives. [9] gives a ...
One way to maintain good coverage and extend the network lifetime is to deploy sensors in high density and schedule them to sleep between active cycles. In this ...
An efficient method to compute the maximum lifetime target coverage is proposed centred around a target that is covered by a minimum number of sensor nodes ...
Mar 1, 2020 · In this paper, we investigate the Maximum Coverage Sets Scheduling (MCSS) problem: given a coverage set collection in which each coverage set ...
Jun 28, 2010 · In this paper, we propose a new energy efficient algorithm that takes into account both overlapping target coverage and the residual energy of ...
May 24, 2023 · The partition schedule can be defined as follows: given some partitions of nodes, schedule them to achieve the largest lifetime of path coverage ...