K-coverage Algorithm Based on Target Association in Wireless Sensor Network

DOI

10.2991/iccasm.2012.49How to use a DOI?

Keywords

Wireless sensor network (WSN), Event probability, Coverage, Energy

Abstract

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.

Copyright

© 2012, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Zeyu Sun
AU  - Chuanfeng Li
PY  - 2012/08
DA  - 2012/08
TI  - K-coverage Algorithm Based on Target Association in Wireless Sensor Network
BT  - Proceedings of the 2012 International Conference on Computer Application and System Modeling (ICCASM 2012)
PB  - Atlantis Press
SP  - 193
EP  - 196
SN  - 1951-6851
UR  - https://doi.org/10.2991/iccasm.2012.49
DO  - 10.2991/iccasm.2012.49
ID  - Sun2012/08
ER  -