Research on fairness based target coverage maximization in directional sensor networks
Directional sensors represented by video sensors and image sensors can provide effective information for safe guarding,and have been widely used in various occasions.This paper studies the fairness based target coverage maximization problem in directional sensors networks,where each directional sensor has P working directions,aiming at maximizing the minimum accumulated coverage time of targets by scheduling the minimum number of directional sensors.Firstly,the paper selects the minimum number of sensors ensuring full coverage of all targets,which is NP-hard,and proposes a polynomial time(1+lnγ)-approximation algorithm,where γ=max1≤i≤N{|si||si∈S}.Then based on the largest demand first serve principle,the maximum set of conflict free targets selection algorithm is designed to solve the problem.Finally,simulation results are presented to demonstrate the performance of the algorithm.
万方数据
维普
