Global t-Sweep Coverage Problem with Minimum Interference

Sweep coverage is one of the important and recent issue for network monitoring in wireless sensor network (WSN). Sweep coverage is efficiently applicable where periodic monitoring is sufficient than continuous monitoring. Interference minimization is another main objective of topology control problem in wireless sensor network. Reducing interference in turn reduces the number of collision and packet retransmission, which decreases the energy consumption and increases lifetime of the network. In this paper, we introduce the Interference minimization global t-Gsweep coverage problem (IMGtSCP) where the objective is to minimize the interference number induced by set of mobile and static sensors with the constraint that the given set of point of interests (PoIs) guarantee t-Gsweep coverage. We prove that the IMGtSCP problem is NP-hard and cannot be approximated with a factor 2. We propose a new heuristic called Interference Minimization Sweep Coverage with Static and Mobile Sensors. We have shown that the time complexity of this heuristics is O(n3 log n), We also conduct simulation to show the performance of our proposed algorithm.