无线传感器网络分簇式路由算法研究与改进
发布时间：2019-01-25 21:34
【摘要】：无线传感器网络(WSN)是一种由大量随机部署在监测区域内具有信息采集、数据处理及数据传输等功能的廉价微型传感器节点以无线通信方式形成的多跳式自组织网络。 本文针对无线传感器网络技术中的分簇式路由算法展开基础理论研究。由于无线传感器网络节点本身存在软硬件资源及能量供应受限的特点,故需要在维持网络性能的同时尽可能降低节点能耗以延长网络生命周期。论文从无线传感器网络路由拓扑结构的合理性及数据传输的高效性两个角度出发,分析并研究两种典型分簇式路由算法LEACH和HEED,提出改进型算法I-LEACH(Improved-LEACH)与I-HEED(Improved-HEED),具体的研究内容与贡献如下： 第一,对无线传感器网络技术的相关概念、发展历程、研究内容等进行简要说明与总结,介绍了无线传感器网络协议栈、网络节点结构及特点,以及无线传感器网络及的应用领域,研究了无线传感器网络路由协议的技术标准、性能评估标准,并对典型的无线传感器网络路由算法进行了分析和比较。 第二,重点针对分簇式路由算法进行研究与分析,选择两种不同类型的分簇式路由算法LEACH与HEED作为研究对象,详细说明这两种无线传感器网络路由算法的执行过程,并分析这两种算法存在的局限性。在充分运用LEACH算法优点的基础上,本文提出一种改进型路由算法I-LEACH,在I-LEACH路由算法中分别对以下三个方面提出改进：(1)阈值公式；(2)最优簇头个数；(3)簇头分布。针对HEED路由算法存在的不足,本文提出改进型算法I-HEED,有以下改进方案：(1)设计一种非均匀分簇机制；(2)对HEED路由算法中产生的孤立节点设计一种处理方法。 最后,本文将提出的改进型算法进行试验仿真,将多种协议在网络生存时间、簇头节点分布、网络能耗均衡性等方面进行比较,验证改进型路由算法的先进性。通过对仿真结果的比较与分析表明,改进型的无线传感器网络路由算法相对于原路由算法,具有更好的网络性能及更长的网络生命周期。
[Abstract]:Wireless sensor network (WSN) is a multi-hop ad hoc network based on wireless communication, which is composed of a large number of cheap micro sensor nodes deployed randomly in the monitoring area with the functions of information collection, data processing and data transmission. In this paper, the basic theory of clustering routing algorithm in wireless sensor networks (WSN) is studied. Due to the limitation of hardware and software resources and energy supply in wireless sensor network nodes, it is necessary to reduce the node energy consumption while maintaining the network performance to prolong the network life cycle. Based on the rationality of routing topology and the efficiency of data transmission in wireless sensor networks, two typical clustering routing algorithms, LEACH and HEED, are analyzed and studied in this paper. The improved algorithms I-LEACH (Improved-LEACH) and I-HEED (Improved-HEED) are proposed. The specific research contents and contributions are as follows: first, the related concepts and development process of wireless sensor network technology are introduced. The research contents are briefly described and summarized. The protocol stack, the structure and characteristics of network nodes, and the application fields of wireless sensor networks are introduced. The technical standards of routing protocols in wireless sensor networks are studied. The performance evaluation criteria and the typical routing algorithms for wireless sensor networks are analyzed and compared. Secondly, focusing on the research and analysis of clustering routing algorithm, two different clustering routing algorithms, LEACH and HEED, are selected as the research objects, and the execution process of these two routing algorithms is explained in detail. The limitations of these two algorithms are analyzed. On the basis of making full use of the advantages of LEACH algorithm, this paper proposes an improved routing algorithm I-LEACH. in I-LEACH routing algorithm, the following three aspects are improved: (1) threshold formula; (2) optimal number of cluster heads; (3) cluster head distribution. Aiming at the shortcomings of HEED routing algorithm, this paper proposes an improved I-HEED algorithm with the following improved schemes: (1) designing a non-uniform clustering mechanism; (2) designing a processing method for isolated nodes generated in HEED routing algorithm. Finally, the proposed improved algorithm is simulated and compared in the aspects of network lifetime, cluster head node distribution, network energy consumption balance, and so on, to verify the advanced nature of the improved routing algorithm. The comparison and analysis of simulation results show that the improved routing algorithm has better network performance and longer network lifetime than the original routing algorithm.
【学位授予单位】：安徽理工大学
【学位级别】：硕士
【学位授予年份】：2014
【分类号】：TP212.9;TN929.5
本文编号：2415211
[Abstract]:Wireless sensor network (WSN) is a multi-hop ad hoc network based on wireless communication, which is composed of a large number of cheap micro sensor nodes deployed randomly in the monitoring area with the functions of information collection, data processing and data transmission. In this paper, the basic theory of clustering routing algorithm in wireless sensor networks (WSN) is studied. Due to the limitation of hardware and software resources and energy supply in wireless sensor network nodes, it is necessary to reduce the node energy consumption while maintaining the network performance to prolong the network life cycle. Based on the rationality of routing topology and the efficiency of data transmission in wireless sensor networks, two typical clustering routing algorithms, LEACH and HEED, are analyzed and studied in this paper. The improved algorithms I-LEACH (Improved-LEACH) and I-HEED (Improved-HEED) are proposed. The specific research contents and contributions are as follows: first, the related concepts and development process of wireless sensor network technology are introduced. The research contents are briefly described and summarized. The protocol stack, the structure and characteristics of network nodes, and the application fields of wireless sensor networks are introduced. The technical standards of routing protocols in wireless sensor networks are studied. The performance evaluation criteria and the typical routing algorithms for wireless sensor networks are analyzed and compared. Secondly, focusing on the research and analysis of clustering routing algorithm, two different clustering routing algorithms, LEACH and HEED, are selected as the research objects, and the execution process of these two routing algorithms is explained in detail. The limitations of these two algorithms are analyzed. On the basis of making full use of the advantages of LEACH algorithm, this paper proposes an improved routing algorithm I-LEACH. in I-LEACH routing algorithm, the following three aspects are improved: (1) threshold formula; (2) optimal number of cluster heads; (3) cluster head distribution. Aiming at the shortcomings of HEED routing algorithm, this paper proposes an improved I-HEED algorithm with the following improved schemes: (1) designing a non-uniform clustering mechanism; (2) designing a processing method for isolated nodes generated in HEED routing algorithm. Finally, the proposed improved algorithm is simulated and compared in the aspects of network lifetime, cluster head node distribution, network energy consumption balance, and so on, to verify the advanced nature of the improved routing algorithm. The comparison and analysis of simulation results show that the improved routing algorithm has better network performance and longer network lifetime than the original routing algorithm.
【学位授予单位】：安徽理工大学
【学位级别】：硕士
【学位授予年份】：2014
【分类号】：TP212.9;TN929.5
【参考文献】
相关期刊论文 前1条
1 张荣博;曹建福;;利用蚁群优化的非均匀分簇无线传感器网络路由算法[J];西安交通大学学报;2010年06期
，本文编号：2415211
本文链接：https://www.wllwen.com/kejilunwen/wltx/2415211.html
