检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王海军[1] 雷建军[1] 杨莉[1] WANG Haijun;LEI Jianjun;YANG Li(School of Computer,Hubei University of Education,Wuhan 430205,China)
机构地区:[1]湖北第二师范学院计算机学院,武汉430205
出 处:《华中师范大学学报(自然科学版)》2018年第5期622-627,共6页Journal of Central China Normal University:Natural Sciences
基 金:国家"十二五"科技支撑计划项目(2015BAK27B02);湖北省自然科学基金项目(2017CFC819);湖北省高等学校省级教学研究项目(2016419)
摘 要:基于移动sink的无线传感器网络环境下的数据收集方案能有效提升网络性能,但在实时性要求较高的应用中,很难同时兼顾时延与数据的收集效率.该文提出了一种考虑时延受限条件下能量高效的移动sink数据收集策略.首先,根据时延约束和网络整体能耗效率优化为目标,对移动sink的最佳驻留点集合进行求解.然后,提出了一种基于驻留点优先级的路径优化选择方法,得到移动sink经过驻留点的最短路径.仿真实验结果表明,与已有算法相比,该文提出的数据收集策略能最大限度的减小时延,并延长网络的生命周期.The data aggregation method with mobile sink can improve the performance of wireless sensor networks effectively.However,it is difficult to give consideration to both the requirement of time delay and the efficiency of data collection in real-time applications.In this paper,an energy efficient data aggregation algorithm in mobile sink environment in proposed.Firstly,the optimization objective is determined to minimize the overall energy consumption of the network with the constraint of transmission delay,which can be converted into the problem of the resolution of the optimal rendezvous point set.Next,a path selection method based on the priority of rendezvous points is proposed to obtain the shortest path of the mobile sink by passing through.Simulation results show that the proposed method can obtain better performance than existing algorithms in aspects of minimize the delay and prolong the lifetime of the network.
关 键 词:时延受限 无线传感器网络 移动SINK 路径选择
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.70