K-coverage Algorithm Based on Target Association in Wireless Sensor Network
During the process of carrying out K coverage algorithm of WSN to the target area,there are some shortcomings,such as many redundancy nodes will emerge,the process consumes a lot of node energy in the network at the same time,and the process is easily restricted by the outside environmental elements.Countering the shortcomings,this article puts forward an event probability K coverage algorithm.By means of giving different probability value to different monitor degree of the target area nodes,and by way of information exchange and relevance nature between the nodes,the algorithm fixes the smallest nodes collection and the biggest target collection,thus effectively fulfills K coverage to target area nodes,optimizes network resources,reduces energy consumption of the nodes,prolongs the life time of the network.Simulation experiments show that,this algorithm can fulfill K coverage to target area at small cost and increases the whole network life time,has good practical result and stability.
Wireless sensor network (WSN) Event probability Coverage Energy
Zeyu Sun Chuanfeng Li
Department of Computer and Information Engineering,Luoyang Institute of Science and Technology Luoyang, 471023, China
国际会议
沈阳
英文
193-196
2012-07-27（万方平台首次上网日期，不代表论文的发表时间）