摘要
针对WSN中的多目标覆盖和寿命最大化问题,提出一种关于多目标覆盖问题的能耗模型和传感器调度算法。基于传感器和目标之间的覆盖关系将传感器分组,使每个传感器包含在多个组中,每个组由完全覆盖全部目标的最小数量的传感器构成一个联合集,去除构成的联合集中的重叠目标冗余,确定每个联合集的激活时间,得到最大化的网络寿命。仿真结果表明,该传感器调度算法相比其它常用的调度算法,能获得更长的网络寿命和最低的能耗。
Aiming at the multiple target coverage and lifetime maximization problem in WSN,an energy consumption model for multiple target coverage problem and a sensor scheduling algorithm were proposed.Groups of sensors were made based on the coverage relationship between sensors and targets such that each sensor could be included in multiple groups and each group which consisted of minimum number of sensors to cover all targets completely formed a joint set.The redundancy of overlapped targets was removed from the formed joint sets and the active time of each joint set was determined such that the network lifetime can be maximized.Simulation results show that the proposed sensor scheduling algorithm,compared with other commonly used scheduling algorithms,not only can achieve a longer network lifetime,but also has the lowest energy consumption.
出处
《计算机工程与设计》
北大核心
2017年第12期3207-3212,共6页
Computer Engineering and Design
基金
国家自然科学基金项目(61163066
60902074)
云南省科技厅重点基金项目(KJ1301127)
关键词
WSN寿命
多目标覆盖
传感器调度算法
冗余
能量消耗
WSN lifetime
multiple target coverage
sensor scheduling algorithm
redundancy
energy consumption