【作者】 郑明才；

【导师】 张大方；

【作者基本信息】 湖南大学 ， 计算机应用技术， 2010， 博士

【摘要】 无线传感器网络作为人类主观世界与物理世界的联系纽带,具有广泛的应用前景,引起全世界各行业的普遍关注,是目前信息技术领域的研究热点之一。无线传感器网络是一类测控网络,数据采集和任务分发是网络的主要任务,路由技术是无线传感器网络研究的关键技术之一。无线传感器网络的路由技术依赖于网络逻辑拓扑结构,综合已有研究成果,无线传感器网络的逻辑拓扑结构主要有分层逻辑拓扑结构和平面逻辑拓扑结构两大类,分层逻辑拓扑结构的维护较为复杂,适用于物理拓扑结构相对稳定的网络；平面逻辑拓扑结构维护简单,不仅适用于物理拓扑结构相对稳定的网络,也适用于物理拓扑结构动态变化的网络。最小跳数路由无线传感器网络是平面逻辑拓扑结构无线传感器网络的典型代表之一,其数据汇聚依赖的逻辑拓扑结构主要是最小跳数梯度场,不仅能反映无线传感器网络中信息传送普遍存在的方向性,且具有路径最短、时延最小、能耗最少的潜在优势,但传统最小跳数路由无线传感器网络中存在一些缺陷,使其潜在优势难以充分发挥,影响其实际应用。本文以完善传统最小跳数路由无线传感器网络为目的,对最小跳数路由无线传感器网络做进一步研究,主要研究内容和成果如下：1)通过对最小跳数路由无线传感器网络运行模式的几何结构学分析,得出最小跳数路由无线传感器网络逻辑拓扑结构、查询分组传播模型、数据分组传播模型等在几何结构上的特点,以及数据分组汇聚路由重复程度的分布特点,初步揭示最小跳数路由无线传感器网络的行为特点。2)在几何结构学分析的基础上,通过仿真分析,进一步揭示传统最小跳数路由无线传感器网络的行为特点,提出梯度化邻居节点的概念,发现节点的梯度化邻居节点数、节点的精细化梯度值与节点在最小跳数梯度场梯度层次中的位置的联系,进一步揭示最小跳数路由无线传感器网络中查询分组和数据分组的传播特征,发现传统最小跳数路由无线传感器网络运行过程中存在最小跳数梯度场稳定周期短、汇聚数据流不均匀、转发负载不均衡等缺陷,并讨论了基于“捎带”的廉价信息提取,为传统最小跳数路由无线传感器网络的改进提供了方向。3)提出基于梯度化邻居节点信息的传感器网络节点距离测量方法DV-GNN和基于精细化梯度的传感器网络节点距离测量方法DV-FGI。在不对传感器网络节点提出任何额外要求的前提下,将传感器网络节点距离测量精度从DV-hop算法的节点有效半径提高到节点间距,不仅提高了节点距离测量精度,而且在一定程度上赋予节点彼此区别的能力。与DV-hop算法相比,DV-GNN方法需增加少量的查询开销,而DV-FGI方法通过对最小跳数梯度场梯度层次边界的精细化梯度值的估计,不需增加查询开销,只增加一定的计算开销,有利于维持DV-hop算法的能量有效性水平。4)提出最小跳数梯度场的梯度层次宽度控制策略。利用最小跳数路由无线传感器网络的最小跳数梯度场中节点的梯度化邻居节点数与梯度层次边界距离的关系,利用节点的梯度化邻居节点信息控制最小跳数梯度场的梯度层次宽度,使实际梯度层次宽度小于节点有效通信半径,达到延长最小跳数梯度场稳定周期、提高数据汇聚可靠性、均衡数据汇聚流的目的。5)提出一种最小跳数路由梯度场的动态调整策略。根据节点通信半径覆盖范围内的源端／目的端邻居节点数和隔跳源端／目的端邻居节点数对节点在最小跳数梯度场中所处梯度层次即节点的最小跳数值进行动态调整,能在一定程度上延长最小跳数梯度场的稳定周期、提高数据汇聚可靠性,避免全新重建最小跳数梯度场所需的巨大能量开销和时间开销。该基于梯度化邻居节点信息的最小跳数梯度场动态调整策略在物理拓扑结构非快速变化的无线传感器网络中具有良好的效果。6)提出一种基于预测的最小跳数路由无线传感器网络数据分组副本自适应控制策略。最小跳数路由无线传感器网络中的数据分组沿多路径重复传送,存在数据分组的多个副本,多副本有利于数据汇聚的可靠性,但副本过多不仅导致能耗大,甚至可能会使数据汇聚性能因碰撞而下降。通过对网络中数据分组副本的自适应控制,保证数据分组副本维持在某个必要的最低水平,同时考虑汇聚数据流的均匀和节点转发负载的均衡,达到优化网络综合性能的目的。本文主要研究了最小跳数路由无线传感器网络的行为特征,改进了传统最小跳数路由无线传感器网络中的一些缺陷,目的在于能改善最小跳数路由无线传感器网络在实际应用中的效果。更多还原

【Abstract】 As the link between the subjective world of human and the physical world, wireless sensor networks have extensively application prospect, increase popular cause for concern, and become a hot subject of research in the fields of information technology. Wireless sensor networks is a kind of network for measurement and control, data acquisition and task distribution are the main work, and routing technology is one of the core technologies. The routing technology of wireless sensor networks depends on the network’s logic topology structure, which can be divided into two types such as the hierarchical topology structure and the planar topology structure according to the current achievements in the research. The maintaining of the hierarchical topology structure is complicated, so the hierarchical topology structure is suitable for the networks with stable physical topology structure. The maintaining of the planar topology structure is simple, so the planar topology structure is suitable for the networks with stable or dynamical physical topology structure. Minimum hop routing wireless sensor networks is a typical representative of planar logic topology structure networks, it’s logic topology structure supporting the data sinking is mainly the minimum hop gradient field, which not only can adapt the direction of the data sinking, but also has the potential advantages such as the shortest path, the least overheads and the least time delay. But there are some drawbacks in traditional minimum hop routing wireless sensor networks, which hinder the potential advantages to bring into full play, and influence the effectiveness of practical application. In this paper, the wireless sensor network is made further improvements, and the main research content and research achievements are as follows.1) By analysis of the operation model of minimum hop routing wireless sensor networks with the help of geometric structure theory, the characteristics of the logic topology structure, inquiring packet’s disseminating model and data packet’s propagating model in the aspect of geometric structure, and the characteristics of operating model in minimum hop routing wireless sensor networks are provisionally revealed.2) On the basis of geometric structure analysis, the operating characteristics of minimum hop routing wireless sensor networks are further revealed through simulating, the conception of gradient neighbor node or fine-grain gradient value is presented, the relation between the number of gradient neighbor nodes and the distance from a node to the relevant gradient level boundary is found. The propagating characteristics of inquiring packet and data packet are further brought to light, the drawbacks such as the short stable cycle, the uneven data stream, and the imbalanced transmitted traffic are discovered, and the methods of low cost information extracting based on piggyback are discussed, these pointed out the direction to improve the traditional minimum hop routing wireless sensor networks.3) The distance estimating method based on the information of gradient neighbor node (DV-GNN) and the distance estimating method based on fine-grain gradient value (DV-FGI) are presented, these methods can increase the measurement precision from effective radio-range to the space between nodes, compared with DV-hop algorithm, and these two distance estimating methods give network node the capability of distinguish each other. Compared with DV-hop algorithm, the DV-GNN method may increase a little inquiring overhead, but the DV-FGI only increases some computing overhead rather than inquiring overhead, which can keep the energy efficiency to the level of DV-hop algorithm.4) The control strategy of the gradient level width of minimum hop gradient field in minimum hop routing wireless sensor networks is presented. Making use of the relation between the number of gradient neighbor node and the distance from the node to the gradient level boundary, the width of gradient level is controlled based on the information of gradient neighbor node, which leads to the gradient level width narrower than the node’s effective radio range, and achieves the goal of prolonging the minimum-hop-gradient-field’s stable period, improving the data-sinking reliability, and balancing the sinking data stream.5) The dynamically adjusting strategy of minimum hop gradient field is given. By adjusting the minimum hop gradient field based on the number of source-end neighbor, destination-end neighbor, interleaved-source-end neighbor and interleaved-destination-end neighbor, the stable cycle of minimum hop gradient field can be extended, the reliability of data sinking can be enhanced, and the massive energy dissipation and time overhead resulting from rebuilding a new minimum hop gradient field can be reduced. The dynamically adjusting strategy of minimum hop gradient field has better sound effects in minimum hop routing wireless sensor networks whose physical topology structure changes with a lower speed.6) The adaptive controlling strategy of data-packet replica based on prediction is presented. In minimum hop routing wireless sensor networks, the data packet is repeatedly transferred along multi-path, there exist multiple data-packet replicas, and multi-replica is good for the data-sinking reliability, but it not only leads to massive energy dissipation but also may result in poorer combination property of data sinking. By controlling the data-packet replica to the necessary and the lowest level, the data-sinking stream and the transferring traffic can be balanced, and the combination properties of network can be optimized.In this paper, the behavior characteristics of minimum hop routing wireless sensor networks were conferred, and some drawbacks of the traditional minimum hop routing wireless sensor networks were improved. We hope that the applying effect of minimum hop routing wireless sensor networks in practical networks can be further improved through these works.更多还原