We have proposed a 2-approximation algorithm for the point sweep coverage problem, where each mobile sensor node visits every PoI. The best known approximation ...
Coverage is one of the most important issues in wireless sensor networks (WSNs) and it is a well studied research area. To ensure coverage, a set of sensors ...
Abstract—Sweep coverage plays an important role in many applications like data gathering, sensing coverage, and devices control. In this paper, we deal with ...
Missing: wireless | Show results with:wireless
We propose a 5-approximation algorithm for the general problem. As an application of the barrier sweep coverage problem for a set of line segments, we formulate ...
A solution is proposed to sweep cover a finite length curve with optimal number of mobile sensors. An energy restricted barrier sweep coverage problem is ...
Apr 8, 2017 · We propose a 5-approximation algorithm for the general problem. As an application of the barrier sweep coverage problem for a set of line ...
We propose three constant-factor approximations, namely, CycleSplit, HeteroCycleSplit, and PathSplit, to minimize the longest sweep period of mobile sensors ...
It is proved that finding the minimum number of data mules to collect data periodically from every mobile sensor is NP-hard and a 3-approximation algorithm ...
Periodic monitoring is sufficient for sweep coverage with a small number of mobile sensor nodes, whereas a continuous monitoring with static sensor nodes is ...
We propose three constant-factor approximations, namely, CycleSplit, HeteroCycleSplit, and PathSplit, to minimize the longest sweep period of mobile sensors ...
People also ask
What are the routing strategies in wireless sensor networks?
What are the components of a sensor node?
Which of the following are the applications of WSN?
What are the challenges of sensor nodes?