Open AccessCoverage Adaptive Optimization Algorithm of Static‐Sensor Networks for Target Discovery
Author(s) -
Xiao Shuo,
Li Tianxu,
Tang Chaogang,
Cao Yuan
Publication year - 2019
Publication title -
chinese journal of electronics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.267
H-Index - 25
eISSN - 2075-5597
pISSN - 1022-4653
DOI - 10.1049/cje.2018.02.009
Subject(s) - computer science , wireless sensor network , focus (optics) , duty cycle , range (aeronautics) , real time computing , tracking (education) , algorithm , computer network , engineering , psychology , pedagogy , voltage , aerospace engineering , optics , physics , electrical engineering
Sensor networks contain a large number of nodes that can perceive changes of external environment, which makes sensor networks particularly suitable for target tracking and discovery. In practical applications, once the sensor nodes are arranged, it is difficult to move them. We focus on analysing the target discovery ability of static‐sensor networks. We divided the target into two kinds, one is persistent target and the other is instantaneous target. We investigate target discovery probability and discovery delay with different nodes density, sensing range and duty cycle. Energy saving is still the most important problem for the applications of sensor networks. Balancing target discovery capability and lifetime of the whole sensor network is necessary. Based on the theoretical analysis, we propose a coverage adaptive optimization algorithm that significantly prolongs the life of sensor networks. Simulation results show the advantage of coverage adaptive optimization algorithm over previous proposed methods.