移动汇聚节点在仓储中的数据采集技术及应用  

Data Acquisition Technology and Application of Mobile Sink in Storage

作　　者：常李 管有庆[1] CHANG Li;GUAN You-qing(School of Internet of Things,Nanjing University of Posts and Telecommunications,Nanjing 210003,China)

机构地区：[1]南京邮电大学物联网学院,江苏南京210003

出　　处：《计算机技术与发展》2018年第11期168-172,共5页Computer Technology and Development

基　　金：江苏省高校自然科学研究计划项目(05KJD520146)

摘　　要：提出了一种在无线传感器网络中通过感知节点将采集的数据汇聚到锚节点,再传给移动汇聚节点的方法。重点研究了锚节点的选择,使得移动汇聚节点到锚节点的距离最短,以此来降低数据传输的能量消耗。考虑到传感器节点的数据聚集和工作中节点能量不平衡的问题,以及经常被忽略的空间问题,提出了一种启发式-列表搜索算法(HLSA)。先选出合适的备用锚节点,再根据算法中的公式选出最终锚节点,从空间层面规划锚节点到移动汇聚节点的最短路径。在每一轮数据采集中,该算法均能综合锚节点与移动汇聚节点的距离、节点密度和节点剩余能量,自动选择出拥有最长网络周期的锚节点。模拟仿真结果表明,该算法应用在物流中转站中的大型仓库中,能够有效地延长网络寿命,平衡节点间的能量。We propose a method in wireless sensor network that the data gathered by sensor nodes will be send to anchor nodes and mobile sink nodes.The selection of anchor nodes is emphatically studied so that the distance between mobile sink nodes and anchor nodes will be the shortest,to lower the energy consumption of data transmission.Considering the problem of data aggregation of sensor nodes and energy imbalance of working nodes,as well as the space problem that is frequently ignored,we propose a heuristic list search algorithm(HLSA).The spare anchor nodes will be selected first,then the final anchor nodes are selected according to the formula in the algorithm.The shortest path is planned in spatial level from anchor node to mobile sink node.In each round of data acquisition,the algorithm can select the anchor nodes with the longest network lifetime by synthesizing the distance between anchor nodes and mobile sink nodes,the consistency of nodes and the dump energy.Simulation shows that the algorithm can extend the network lifetime and balance the energy between nodes effectively when it is applied to the large warehouse in logistics.

关 键 词：无线传感器网络 移动汇聚节点 启发式-列表搜索算法 最短路径 

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