基于簇结构的无线传感网络能量均衡路由算法研究

发布时间：2018-03-04 05:11

本文选题：无线传感器网络　切入点：路由算法　出处：《河南理工大学》2014年硕士论文　论文类型：学位论文

【摘要】：无线传感器网络的问世,使得物理世界与信息世界的逻辑沟通变成了现实,又因其广阔的应用前景,受到了众多研究学者的青睐,成为计算机网络界最为热门的研究内容之一。无线传感器网络是由大量传感器节点自组织网络而成。传感器是无线传感器网络的核心组成部分,但是传感器节点体积较小,依靠电池供能,采用何种路由算法使得网络能耗最小成为无线传感器网络的关键技术。本文针对节点随机分布的无线传感器网络能耗问题,在分析了无线传感器网络结构模型、网络中分簇数目、分簇结构以及网络覆盖与连通性之后,提出了基于分簇结构的两种新的路由算法:一是基于地理位置的网格定位算法改进;二是基于均匀分簇的正三角模型节点轮换路由算法。两种算法都在分簇的前提下,采用不同方式构建网络模型,进行路由计算。基于地理位置的网格定位算法的基本思想是采用地理位置对检测区域进行网格划分,然后构建分簇。分簇完成之后,簇头节点之间形成高一层次的网络,采用单跳或多跳的方式完成向汇聚节点发送感知数据的任务。基于均匀分簇的正三角模型节点轮换路由算法的基本思想是首先计算网络内节点总能耗最小时的分簇数目,再由汇聚节点选择相应数目的剩余能量最大、地理位置最优的节点为簇首,完成均匀分簇。簇内节点采用正三角模型和节点覆盖概率进行工作节点的选择。仿真结果表明,两种路由算法从网络生命周期、稳定性以及网络时延等性能方面相比于前人提出的典型算法有明显优势。
[Abstract]:With the advent of wireless sensor networks, the logical communication between the physical world and the information world has become a reality, and because of its broad application prospects, it has been favored by many researchers. Wireless sensor network is composed of a large number of sensor nodes self-organized network. Sensor is the core component of wireless sensor network, but sensor node is small. Depending on the battery power supply, which routing algorithm is adopted to minimize the network energy consumption becomes the key technology of wireless sensor networks. In this paper, the wireless sensor network structure model is analyzed in order to solve the problem of the energy consumption of wireless sensor networks with randomly distributed nodes. After clustering number, cluster structure and network coverage and connectivity, two new routing algorithms based on clustering structure are proposed: one is the improvement of grid location algorithm based on geographical location; The second is the node rotation routing algorithm based on uniform clustering. Both algorithms construct network model in different ways under the premise of clustering. The basic idea of the grid location algorithm based on geographical location is to use geographical location to mesh the detection area, and then to construct the cluster. After the clustering is completed, a high level network is formed between the cluster head nodes. The task of sending perceptual data to the convergent node is accomplished by single hop or multi-hop. The basic idea of the node rotation routing algorithm based on uniform clustering is to calculate the number of nodes in the network when the total energy consumption is minimum. Then the cluster nodes with the largest residual energy and the best geographical location are selected as cluster heads, and the nodes in the cluster are selected using the normal triangle model and the coverage probability of the nodes. The simulation results show that, The two routing algorithms have obvious advantages over the previous typical algorithms in terms of network life cycle, stability and network delay.
【学位授予单位】：河南理工大学
【学位级别】：硕士
【学位授予年份】：2014
【分类号】：TP212.9;TN929.5

【相似文献】