首页|Coverage Adaptive Optimization Algorithm of Static-Sensor Networks for Target Discovery

Coverage Adaptive Optimization Algorithm of Static-Sensor Networks for Target Discovery

扫码查看
原文链接
  • NETL
  • NSTL
  • 万方数据
  • 维普
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.

Sensor networksEnergy efficiencyNetwork lifetimeDiscovery latency

XIAO Shuo、LI Tianxu、TANG Chaogang、CAO Yuan

展开 >

School of Computer Science and Technology, China University of Mining and Technology, Xuzhou 221000, China

School of Electronic and Information Engineering,Beijing Jiaotong University, Beijing 100044, China

This work is supported by the Natural Science Foundation of Jiangsu ProvinceThis work is supported by the Natural Science Foundation of Jiangsu ProvinceNational Natural Science Foundation of China

BK20150193No.BK20150201U1534208

2019

10.1049/cje.2018.02.009

中国电子杂志(英文版)

中国电子杂志(英文版)

CSTPCDCSCDSCIEI
ISSN：1022-4653
年,卷(期)：2019.28(2)
  • 18