基于近邻传播的WSNs分簇路由策略研究

发布时间：2018-06-02 13:22

本文选题：无线传感器网络 + 近邻传播聚类　；参考：《重庆大学》2016年硕士论文

【摘要】：无线传感器网络(Wireless Sensor Networks,简称WSNs),由大量随机部署于目标监测区域的传感器节点组成,具有信息感知、处理、传输的功能,是人类与自然、社会交互的科技手段之一。由于其具有易部署、低成本、低功耗、强抗毁等优点,近年来备受关注。路由协议设计是WSNs的关键技术之一,旨在为信息传输寻求高效路径,为网络提供自组织、节能、安全、数据融合、定位、寻址等功能属性。分簇路由协议由于其分布式的结构特征,具有路由速度快、可扩展性好、算法鲁棒性强等特点,能很好匹配WSNs向复杂化、巨大化、智能化发展的需求,已成为该领域算法研究的主流学派。论文围绕分簇路由协议展开研究,受数据聚类算法思想影响,将近邻传播聚类思想应用到WSNs分簇中,分别提出了两层及三层能量自适应近邻传播无线传感器网络分簇路由协议,并对其进行仿真分析及性能评估,主要工作如下:(1)论文从传感器网络各类路由协议探讨分析入手,在此基础上着重论述了分簇路由协议,对其进行分类和比较,通过仿真实验,对具有代表性的分簇路由协议——低功耗自适应集簇分层型协议(Low Energy Adaptive Clustering Hierarchy,简称LEACH)进行深入解析与研究,为后续工作展开提供切入点。(2)在深入研究分簇路由协议的基础上,结合近邻传播聚类算法,通过重设相似度及偏向值表达式,充分考虑能量、节点距离、簇头分布密度等因素,以节约网络能耗及延长网络寿命为主要设计目标,提出了一种能量自适应近邻传播两层分簇路由协议(LEACH-EAAP),通过先验知识对其进行学习,进一步提高算法性能,并通过理论分析与实验仿真对其进行深入论证。仿真结果表明,该算法适用于小型无线传感器网络,在节约网络能耗及延长网络寿命两方面性能有所提升。(3)针对LEACH-EAAP协议不适用于大规模无线传感器网络的现实问题,在分析不同层次结构分簇路由协议的基础上,对相似度及偏向值表达式进行重新定义,通过设立簇头质量,实现1级簇头集与2级候选簇头集封闭映射,在综合考虑距离、剩余能量等因素的基础上,提出了一种能量自适应近邻传播三层分簇路由协议(LEACH-EATAP),并通过先验知识对算法进行学习。仿真结果表明,LEACH-EATAP算法较之现有三层分簇算法有性能提升,以损失算法复杂度为代价将LEACH-EAAP适用范围进一步扩展。
[Abstract]:Wireless Sensor Networks, which is composed of a large number of sensor nodes deployed randomly in the target monitoring area, has the functions of information perception, processing and transmission. It is one of the scientific and technological means for the interaction between human beings and nature and society. Due to its advantages of easy deployment, low cost, low power consumption and strong survivability, it has attracted much attention in recent years. Routing protocol design is one of the key technologies of WSNs, which aims to find efficient path for information transmission, and to provide self-organizing, energy-saving, security, data fusion, location, addressing and other functional attributes for the network. Because of its distributed structure, the clustering routing protocol has the characteristics of fast routing speed, good scalability and robust algorithm. It can well meet the needs of the development of WSNs to complexity, giant and intelligence. It has become the mainstream school of algorithm research in this field. Under the influence of data clustering algorithm, this paper applies the idea of neighbor propagation clustering to WSNs clustering, and proposes a two-layer and three-layer energy-adaptive nearest-neighbor propagation clustering protocol for wireless sensor networks. The main work of this paper is as follows: 1) based on the discussion and analysis of various routing protocols in sensor networks, the clustering routing protocols are emphatically discussed, classified and compared, and the simulation experiments are carried out. In this paper, the representative clustering routing protocol, low power adaptive cluster-stratified Energy Adaptive Clustering Hierarchy, (low Energy Adaptive Clustering Hierarchy,), is analyzed and studied in depth, which provides a breakthrough point for further work. (2) on the basis of further research on clustering routing protocol, Combined with the nearest neighbor propagation clustering algorithm, by resetting the expression of similarity and deviation value, the energy, node distance, cluster head distribution density and other factors are fully considered. The main design goal is to save network energy consumption and prolong network life. An energy adaptive nearest neighbor propagation two-layer clustered routing protocol (LEACH-EAAPP) is proposed, which can further improve the performance of the algorithm by prior knowledge, and is further demonstrated by theoretical analysis and experimental simulation. The simulation results show that the algorithm is suitable for small wireless sensor networks. The performance of the proposed algorithm is improved in terms of saving network energy and prolonging network lifetime.) aiming at the practical problem that LEACH-EAAP protocol is not suitable for large-scale wireless sensor networks, the simulation results show that the proposed algorithm is suitable for large-scale wireless sensor networks. On the basis of analyzing the different hierarchical clustering routing protocols, the expressions of similarity and bias value are redefined. By setting the cluster head quality, the closed mapping between the class 1 cluster head set and the second level candidate cluster head set is realized, and the distance is considered synthetically. On the basis of residual energy and other factors, an energy adaptive nearest neighbor propagation three-layer clustering routing protocol (LEACH-EATAP) is proposed, and the algorithm is studied by prior knowledge. The simulation results show that the LEACH-EATAP algorithm has better performance than the existing three-layer clustering algorithm, and the LEACH-EAAP application range is further expanded at the cost of the complexity of the lost algorithm.
【学位授予单位】：重庆大学
【学位级别】：硕士
【学位授予年份】：2016
【分类号】：TN929.5;TP212.9

【相似文献】