Coverage Adaptive Optimization Algorithm of Static‐Sensor Networks for Target Discovery. Issue 2 (1st March 2019)

• Record Type: Journal Article
• Authors: Xiao, Shuo; Li, Tianxu; Tang, Chaogang; Cao, Yuan
• Is Part Of: Chinese journal of electronics. Volume 28:Issue 2(2019)
• Page Start: 398
• Page End: 403
• Publication Date: 2019-03-01
• Subjects: Sensor networks -- Energy efficiency -- Network lifetime -- Discovery latency; probability -- target tracking -- wireless sensor networks; coverage adaptive optimization algorithm -- static‐sensor networks -- sensor network -- target tracking -- sensor nodes -- target discovery ability -- persistent target -- instantaneous target -- target discovery probability -- discovery delay -- target discovery capability -- lifetime; Electronics -- Periodicals; Electronics -- China -- Periodicals; Electronics; China; Periodicals; 621.38105
• DOI: 10.1049/cje.2018.02.009
• Languages: English
• ISSNs: 1022-4653

Abstract

Abstract : 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.