【作者】 杨金峰；

【导师】 赵增华；

【作者基本信息】 天津大学 ， 计算机科学与技术， 2012， 硕士

【摘要】 随着无线传感器网络的发展，为随机移动的Sink提供有效的数据交付是无线传感器网络中的重要问题。需要传感器网络能够支持向多个随时随机移动的Sink交付数据的应用需求正在急剧增加。然而当前大部分工作主要聚焦在单个静止Sink情况下的数据交付，而对存在多个随时随机移动Sink的研究相对较少。已有的工作或者依赖节点精确地理位置信息，或者需要维护庞大的树结构，能量消耗较大并且无法提供较高的数据交付成功率。本文研究存在多个随时随机移动Sink情况下的无线传感器网络多播路由路径构造及算法设计。文章首先简述移动多Sink传感器网络路由算法研究问题与现状，分析了当前基于树状结构构造的路由算法面临的问题。之后提出三种不需构建汇聚树的基于RLW（随即直线行走）模型的路径构造算法LR、XR和CR。最后通过仿真实验得出CR协议整体性能较优的结论。之后基于CR协议构造的路径，提出的三种多播路由算法SMR、PMR和FPMR算法。SMR算法原理简单，但得到的路径较长，能耗较高；PMR算法能够找到多播路由的最优解；FPMR算法针对PMR算法的时间复杂度较高的问题，提出了求解近似解的快速算法。针对Sink的移动性，文章提出了通过Sink广播序号值追踪移动Sink轨迹，最终有效交付事件数据给移动Sink的方法。文章最后对PMR、FPMR算法的性能做了理论分析以及仿真实验。通过理论分析与大量仿真实验对以上算法进行性能评价。结果表明：1）路径构造：在事件数据缓存路径与查询下发路径建立时，随着直线路径条数以及直线路径间的夹角的增加，两路径相交的成功率显著提高并且很快接近100%；能耗和路径长度都会有所增加但会逐渐趋于平稳；2）多播路由算法：在事件数据向多个移动Sink交付时，随着网络密度或者Sink数量的增加，路径合并有效百分比会逐渐增加。最后在将事件数据向移动Sink交付时，与已有的工作WARP进行了仿真实验的性能比较，结果显示，随着Sink移动速度的增加，查询成功率和查询能耗总体性能优于后者。更多还原

【Abstract】 With the development of wireless network, delivering data to the random movingsinks effectively is the important issue. More and more applications need sensornetwork so as to support several mobile Sinks to collect data anytime and anywhere.However, the present studies just focus on data retrieval of single and static Sink.Little attention is paid on Sink which could move at any time randomly. If there is any,most of them depend on the precise location information of nodes, or require tomaintain the huge tree structure. They have either high energy consumption or lowdata delivery success rate.This paper studies the Multicast Routing Problem in the mobile multi-sinkwireless sensor networks. We first present an overview of multicast routing inmulti-sink wireless sensor networks and the status in this area. And point out theproblem facing the tree-based algorithms. Then, we describe three path constructionalgorithms: LR, XR, CR. They are all based on the RLW model with no need forcollection tree. The path construction algorithm is the basis of the Multicast routingalgorithms. Then, the no-tree based Multicast algorithms SMR, PMR and FPMR arepresented. All these three algorithms are based on CR protocol. And they are aimed toreduce the multicast path length and energy consumption. The PMR algorithm canfind the optimal path, but with high time complexity. And the FPMR Algorithm aimedto reduce the time complexity, but unable to get the optimal path. Finally, we track theSink using the sink’s beacon sequence number.We evaluate the performance of the algorithm on the simulator. The result showsthat:1)During the period of data discovering, with the paths number and the angleincreasing, the success rate of paths intersection increase to the100%quickly.2)During the period of data delivery, with the increase of the Sink speed, the percentof the path multiplexing is bigger and bigger.更多还原