Optimal Coverage Algorithm for Point Target in Wireless Sensor Networks
Xiaobing Pei · Journal of Chinese Computer Systems · 2009
Among current point targets coverage algorithm in wireless sensor networks,Disjoint Set Covers algorithm has the advantage of simpleness in which sensor nodes are divided into disjoint sets so that every set covers every target.But it is only adaptable to network model in which all sensor nodes has the equal power supply,further reduces severely network lifetime by distributing all power supply of sensor node in one time.In this paper,we propose a Heuristic Greedy Optimal Coverage Algorithm(HG-OCA) for point target based on improving the algorithm.Firstly,we first make a network model in which power supply of sensor nodes follows a normal distribution.Secondly,we analyze disjoint cover set problem and optimal coverage problem of target set based on time slot.In particular,we put forward the definition of critical target and the coverage priority of critical target priority after analyzing energy model of target coverage.Moreover,we choose sensor node with most energy efficiency as active node.Finally,based on minimize energy consume of critical target and maximizing energy efficiency of sensor node,we present HG-OCA to maximize network lifetime.Measurement results show that the new algorithm could increase 80% longer network lifetime and achieve more adaptability and stability.