基于移动sink的可充电传感器网络数据收集优化算法研究

发布时间：2018-03-20 13:16

本文选题：可充电传感器网络　切入点：时间片调度　出处：《南京邮电大学》2017年硕士论文　论文类型：学位论文

【摘要】：可充电无线传感器网络技术正在成为许多应用领域的关键技术,如环境监测、农业生产、区域监控等。而数据收集是无线传感器网技术应用关注的重要问题之一。基于移动sink的数据收集方案由于其所具有的优点逐渐成为研究工作热点,数据收集算法在很大程度上影响着网络工作性能,提升和优化数据收集算法对推动无线传感器网络技术的发展具有重要意义。本文首先研究了移动sink在固定路径情况下的数据收集算法,在可充电无线传感网中,移动sink周期性地沿着固定路径运动,同时收集附近单跳感应节点发送来的数据,传感器节点随机部署在路径两边,并且能够通过太阳能进行充电,为了最大化移动sink收集数据的效用,本文设计了一种固定路径的数据收集算法,我们将移动sink的整个运动周期划分为若干个等长的时间片,通过分配时间片来决定移动sink在各个时间片通信的感应节点,每个时间片都是尽可能分配给通信范围内数据效用最大的感应节点。其次,本文研究了移动sink路径规划算法,在一个可充电无线传感器网络中,移动sink沿着预先规划好的路径在规定时延范围内收集感应数据,该路径由若干停留点组成,移动sink在停留点收集附近单跳节点发送来的感应数据,为了使移动sink在各个停留点收集的总数据量最大,本文设计了移动sink路径规划算法,算法首先通过网络路由树计算所有节点的预计收益,选择收益最大的节点作为停留点,并且,每次选择停留点后,计算通过所有停留点的最短路径,保证移动sink在规定时延范围内回到出发点。最后,通过仿真实验对两种情况下的算法性能进行验证,试验结果表明两种方案下的数据收集算法有着很好的表现。
[Abstract]:Rechargeable wireless sensor network technology is becoming a key technology in many application fields, such as environmental monitoring, agricultural production, Data collection is one of the most important issues in wireless sensor network application. Data collection based on mobile sink has become a hot research topic because of its advantages. Data collection algorithms affect the performance of the network to a large extent. It is important to improve and optimize the data collection algorithm for the development of wireless sensor network technology. Firstly, this paper studies the data collection algorithm of mobile sink in the case of fixed path, which can be used in rechargeable wireless sensor network. The mobile sink moves periodically along a fixed path while collecting data from nearby single-hop sensor nodes that are randomly deployed on either side of the path and can be charged by solar energy. In order to maximize the utility of mobile sink data collection, a fixed path data collection algorithm is designed in this paper. We divide the entire mobile sink motion cycle into several equal time slices. By allocating time slices to determine the sensing nodes of mobile sink communication in each time slice, each time slice is assigned to the sensor node with the greatest data utility in the communication range as far as possible. Secondly, the mobile sink path planning algorithm is studied in this paper. In a rechargeable wireless sensor network, mobile sink collects induction data within a specified delay range along a pre-planned path, which consists of a number of residence points. The mobile sink collects the sensing data from the single hop node nearby at the stop point. In order to make the total data collected by the mobile sink at each stop point maximum, a path planning algorithm for mobile sink is designed in this paper. The algorithm first calculates the expected income of all nodes through the network routing tree, and selects the node with the highest return as the stopover point, and calculates the shortest path through all the stopping points each time after selecting the stopover point. The mobile sink is guaranteed to return to the starting point within the specified time delay. Finally, the performance of the algorithm is verified by simulation experiments. The experimental results show that the data collection algorithm under the two schemes has a good performance.
【学位授予单位】：南京邮电大学
【学位级别】：硕士
【学位授予年份】：2017
【分类号】：TP212.9;TN929.5

【参考文献】