首页 | 官方网站   微博 | 高级检索  
     

基于k-目标跟踪的节点部署优化算法
引用本文:白秋产,张昊伦.基于k-目标跟踪的节点部署优化算法[J].全球定位系统,2020,45(3):71-76.
作者姓名:白秋产  张昊伦
作者单位:淮阴工学院自动化学院 ,江苏淮安223003;黑龙江大学机电工程学院 ,黑龙江哈尔滨150080
摘    要:针对无线传感网络(WSNs)目标跟踪的节点部署问题,提出了基于k-目标跟踪的节点部署优化算法.该算法考虑不同的k值、目标半径、跟踪角度、节点通信半径和兴趣区域的形状对k个目标跟踪性能的影响.先将兴趣区域划分为等边三角形、矩形和六边形模型,再估计这些模型中的最优边长和节点的跟踪方向.再依据最优边长去估计部署节点位置.最后,依据这些模型,实现k个目标跟踪所需的最少节点数.实验数据表明,提出的算法能够有效地跟踪目标.

关 键 词:传感网络  目标跟踪  定向节点  最优边长  跟踪角度

A target tracking system using directional nodes in wireless sensor networks
BAI Qiuchan,ZHANG Haolun.A target tracking system using directional nodes in wireless sensor networks[J].Gnss World of China,2020,45(3):71-76.
Authors:BAI Qiuchan  ZHANG Haolun
Affiliation:1.Faculty of automation, Huaiyin Institute of Technology, Huai′an 223003, China2.College of mechanical and electrical engineering, Heilongjiang University, Harbin 150080,China
Abstract:To solve the node deployment problem of target tracking in wireless sensor networks (WSNs), a node deployment optimization algorithm based on k-target tracking is proposed. The algorithm considers the influence of k value, target radius, tracking angle, node communication radius and the shape of region of interest on the tracking performance of k targets. The region of interest is first divided into equilateral triangle, rectangle and hexagon models, and then the optimal side length and the tracking direction of nodes in these models are estimated. Then the location of the deployment node is estimated according to the optimal side length. Finally, according to these models, the minimum number of nodes required for k target tracking is realized. Experimental data show that the proposed algorithm can effectively track the target. 
Keywords:sensor networks  target tracking  directional node  optimal side length  tracking angle
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《全球定位系统》浏览原始摘要信息
点击此处可从《全球定位系统》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号