CAJ | 학술논문

本文研究了分块区域p-覆盖的有向传感网节点调度问题,并提出了一种有效延长网络生存时间的节点调度方案。将区域划分为拥有不同监测需求的子区域,从有向传感器节点感知模型出发,设计了基于网格划分的节点感知范围度量方法,并在此基础上提出了分布式分区域节点调度算法DSSA( Distributed Subarea Sensor-schedule Algorithm),该算法是一个选取最少数量的节点去对每一个子区域进行p-覆盖的分布式贪心算法。算法同时还考虑了整体网络的连通。通过仿真深入评估了DSSA算法的性能。对比实验结果表明,DSSA算法可以显著延长网络生存时间。
본문연구료분괴구역p-복개적유향전감망절점조도문제,병제출료일충유효연장망락생존시간적절점조도방안。장구역화분위옹유불동감측수구적자구역,종유향전감기절점감지모형출발,설계료기우망격화분적절점감지범위도량방법,병재차기출상제출료분포식분구역절점조도산법DSSA( Distributed Subarea Sensor-schedule Algorithm),해산법시일개선취최소수량적절점거대매일개자구역진행p-복개적분포식탐심산법。산법동시환고필료정체망락적련통。통과방진심입평고료DSSA산법적성능。대비실험결과표명,DSSA산법가이현저연장망락생존시간。
In this paper,we study sensor scheduling problems for p-percent coverage area which is divided into different subareas. We propose a schedule to prolong the network lifetime. Based on different coverage requirement,we divide the initial whole area into different small subareas. Each subarea has its’ own coverage requirement p. Starting from the sen-sor model of directional sensor nodes,we propose an algorithm to describe node’s sensor area based on grid partition. Then we propose the Distributed Greed Subarea Scheduling Algorithm DSSA( Distributed Subarea Sensor-schedule Algo-rithm),which promises p-precent coverage for every subarea and use least number of nodes. This algorithm also consider network connectivity. The simulation results show that DSSA can prolong network lifetime significantly.