分簇传感器网络中时延约束下移动sink的路径优化  

Optimizing path selection for mobile sink under delay constraint in cluster sensor networks

作　　者：侯贵升[1] 吴晓蓓[1] 黄成[1] 徐志良[1] 

机构地区：[1]南京理工大学自动化学院,南京210094

出　　处：《控制与决策》2015年第8期1423-1428,共6页Control and Decision

基　　金：教育部博士点基金项目(20113219110028)

摘　　要：在分簇传感器网络中引入移动sink,用于协助其上层网进行数据汇聚.为解决时延约束与节能需求间的矛盾,提出一种基于效用优先级和反效用优先级的移动sink路径优化选择算法.依据最小能耗原则首先为非访问节点设计了数据迁移路径寻找方案,随后在此基础上提出一种基于节点效用优先级的访问点集贪婪构造算法,并基于反效用优先级为其设计了两种优化方案.仿真实验验证了所提出算法的有效性,保障时延要求的同时最大限度地降低了网络能耗.The mobile sink is introduced into the cluster sensor network to assist its upper network in aggregating data. In order to solve the contradiction between the delay constraint and the demand of energy saving, an optimal path selection algorithm for the mobile sink based on nodes＇ utility priority and anti utility priority is proposed. According to the principle of minimum energy consumption, a path searching scheme for non-visit nodes moving data is designed. On this basis, a visitpoint set greedy construction algorithm based on nodes＇ utility priority is proposed, and two kinds of optimization scheme for it are designed based on nodes＇ anti utility priority. Simulation experiments verify the effectiveness of the proposed algorithm, and the delay requirement can be guaranteed while minimizing the energy consumption of the network.

关 键 词：分簇传感器网络 移动SINK 数据汇聚 最小能耗访问点集 时延约束 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]