一种面向多目标关联覆盖的无线传感器网络节点优化调度算法

An Optimized Sensor Node Scheduling Algorithm for Multiple Target Associated Coverage in Wireless Sensor Networks

  • 摘要: 提出一种面向多目标关联点覆盖的无线传感器网络节点优化调度算法D-MTAC.该算法基于数据挖掘中的关联规则和无线传感器网络的能量高效原则,通过挖掘随机部署的网络节点与待监控目标间的关联感知关系给出高频关联目标集,采用优化时间分片和动态自适应选择机制确定能够令责任节点工作状态与网络寿命实现最优匹配的优化调度决策集合.仿真结果表明:在保证目标监控质量的前提下,该算法能够有效降低网络累积能耗并延长网络寿命.

     

    Abstract: An optimized sensor node scheduling algorithm,namely disked-multiple target associated coverage(D-MTAC), is proposed for multiple target associated coverage in wireless sensor networks(WSNs).Based on the idea from association rule of data mining and energy-efficient principle of WSN,the sets of intensely associated targets are given from associated relations between randomly deployed sensor nodes and targets.By optimizing the time division and dynamic self-adaptive selection mechanism,we provide the optimized scheduling and decision-making sets to realize optimal matching between working situation of responsible nodes and network lifetime.Simulation results show that the proposed approach improves the monitoring quality,effectively decreases the accumulative energy consumption,and prolongs the network lifetime.

     

/

返回文章
返回