论文部分内容阅读
在分簇传感器网络中引入移动sink,用于协助其上层网进行数据汇聚.为解决时延约束与节能需求间的矛盾,提出一种基于效用优先级和反效用优先级的移动sink路径优化选择算法.依据最小能耗原则首先为非访问节点设计了数据迁移路径寻找方案,随后在此基础上提出一种基于节点效用优先级的访问点集贪婪构造算法,并基于反效用优先级为其设计了两种优化方案.仿真实验验证了所提出算法的有效性,保障时延要求的同时最大限度地降低了网络能耗.
In the cluster sensor network, a mobile sink is introduced to assist its upper-layer network in data aggregation.In order to solve the conflict between delay constraints and energy-saving requirements, a mobile sink path optimization option based on utility priority and back-in-priority is proposed Algorithm.According to the principle of minimum energy consumption, a scheme of data migration path seeking is designed for non-visited nodes firstly, and then based on this, an access point set greedy algorithm based on node utility priority is proposed and designed based on its priority Two kinds of optimization schemes are given in this paper.The simulation results verify the effectiveness of the proposed algorithm and guarantee the delay requirements while minimizing the network energy consumption.