Page 186 - 《软件学报》2020年第12期

软件学报 ISSN 1000-9825, CODEN RUXUEW E-mail: jos@iscas.ac.cn
Journal of Software,2020,31(12):3852−3866 [doi: 10.13328/j.cnki.jos.005877] http://www.jos.org.cn
©中国科学院软件研究所版权所有. Tel: +86-10-62562563

∗
射频供能传感网面向融合检测的部署调度方法

2
1
1
1
李燕君 , 陈雨哲 , 林瑞仲 , 池凯凯 , 胡亚红 1
1
(浙江工业大学 计算机科学与技术学院,浙江 杭州 310023)
2 (诺基亚通信系统技术(北京)有限公司浙江分公司,浙江 杭州 310053)
通讯作者: 林瑞仲, E-mail: rzlin@126.com

摘 要: 当射频供能传感网应用于目标检测时,对节点的部署位置和充电/感知调度表进行合理规划可有效提高
系统检测质量.基于融合检测模型,首先归纳了使得系统检测质量最大化的节点部署和调度联合优化问题,证明了该
问题是 NP 完全问题.然后分析了融合半径对检测率的影响,提出了基于贪婪算法的节点部署调度联合优化算法.通
过小规模网络、大规模网络及基于真实数据集的仿真,将该算法分别与全局最优解、分阶段优化贪婪算法进行了性
能比较.实现结果表明:所提出的联合优化贪婪算法获得的系统检测质量在各组仿真中均优于分阶段贪婪算法,并且
在小规模网络中接近于全局最优解.
关键词: 融合检测;节点部署;节点调度;射频供能传感网
中图法分类号: TP393

中文引用格式: 李燕君,陈雨哲,林瑞仲,池凯凯,胡亚红.射频供能传感网面向融合检测的部署调度方法.软件学报,2020,
31(12):3852−3866. http://www.jos.org.cn/1000-9825/5877.htm
英文引用格式: Li YJ, Chen YZ, LIN RZ, Chi KK, Hu YH. Deployment and scheduling for fusion-based detection in RF-powered
sensor networks. Ruan Jian Xue Bao/Journal of Software, 2020,31(12):3852−3866 (in Chinese). http://www.jos.org.cn/1000-
9825/5877.htm
Deployment and Scheduling for Fusion-based Detection in RF-powered Sensor Networks

1
1
1
1
2
LI Yan-Jun , CHEN Yu-Zhe , LIN Rui-Zhong , CHI Kai-Kai , HU Ya-Hong
1
(School of Computer Science and Technology, Zhejiang University of Technology, Hangzhou 310023, China)
2
(Nokia Solutions and Networks System Technology (Beijing) Co., Ltd. Zhejiang Branch, Hangzhou 310053, China)
Abstract: When RF-powered sensor network is applied to target detection, rational planning of sensor placement and charging/sensing
schedule is an effective way to improve the system detection quality. Based on the fusion-based detection model, firstly, the joint
optimization problem of sensor placement and scheduling problem is formulated to maximize the system detection quality. The problem is
proved to be NP-complete. Then after analyzing the impact of fusion radius on the detection rate, a joint optimization greedy algorithm
(JOGA) is proposed to solve the problem. Finally, the performance of the proposed JOGA is compared with those obtained by exhaustive
search and two-stage greedy algorithm (TSGA), an algorithm that optimizes sensor placement and scheduling separately, through
extensive numerical simulations as well as simulations based on real data traces collected from a vehicle detection experiment. Results
show that, the proposed JOGA always outperforms TSGA in all the simulation scenarios, and is near optimal in small-scale networks.
Key words: fusion-based detection; sensor placement; sensor scheduling; RF-powered sensor networks

∗ 基金项目: 国家自然科学基金(61772472, 61872322, 61472367); 浙江省自然科学基金(LZ21F020005); 浙江省属高校基本科研
业务费专项资金(RF-A2019002); 国家重点研发计划(2018YFB0204003)
Foundation item: National Natural Science Foundation of China (61772472, 61872322, 61472367); Natural Science Foundation of
Zhejiang Province (LZ21F020005); Fundamental Research Funds for the Provincial Universities of Zhejiang (RF-A2019002); National
Key R&D Program of China (2018YFB0204003)
收稿时间: 2018-10-16; 修改时间: 2019-04-20, 2019-06-16; 采用时间: 2019-08-04