Font Size: a A A

Research On Energy-saving And Life-extending Routing Protocols For Wireless Sensor Networks

Posted on:2022-09-15Degree:MasterType:Thesis
Country:ChinaCandidate:X H LiFull Text:PDF
GTID:2518306326491004Subject:Communication and Information System
Abstract/Summary:PDF Full Text Request
With the continuous advancement of global information construction,wireless sensor network(WSN)is gradually penetrating into various application fields by virtue of its advantages such as simple configuration and low cost.The special deployment environment and the limited node energy of WSN constrain the network life and performance to a great extent.How to design a reasonable routing protocol to optimize the network energy distribution and prolong the life of the network has become one of the hotspots of WSN research in recent years.In order to realize the energy saving and life extension of WSN,the thesis first analyzes and summarizes the research results of clustering routing protocol.On this basis,researches and improvements are made for the shortcomings of the clustering process and transmission path.The main contents are as follows:1.A clustering routing protocol for clustering process optimization(CRCPO)is proposed,which solves the problem of energy consumption caused by unreasonable clustering number and clustering mode in the process of clustering.Under the medium scale network model,the estimation formula of the number of partitions that can satisfy the single hop between clusters was derived.Then,the number of partitions was combined with the improved K-Means algorithm,and the sink node centralized partitioned the network.Finally,taking into account the location of nodes and the remaining energy,dynamic clustering and stable data transmission are carried out periodically in the region.The simulation results show that the CRCPO protocol can form a stable and reasonable clustering by centralized uniform partitioning and distributed dynamic clustering,and effectively reduces the broadcast energy consumption in the clustering process.Compared with the EECS protocol,the death time of the first node,30% node and 50% node is extended by 67.0%,32.2% and 35.5%,respectively.2.Based on CRCPO protocol,a clustering routing protocol for clustering process and inter-cluster path optimization(CPIPO)is proposed,which can alleviate the problem of uneven load of nodes in large-scale networks.Based on the large-scale network model,the estimation formula of the number of partitions satisfying the multi-hop among clusters is derived.Then,the centralized non-uniform partitioning is performed with the improved K-Means algorithm,so that the size of the partition near to the convergence point is smaller,and the size of the partition far away is larger.In order to reasonably build the multi-hop forwarding path between clusters,the CPIPO protocol not only considers the residual energy of nodes,but also introduces the cosine value and cosine threshold value of nodes,so as to ensure that the remote nodes can transmit data to the sink node with the least number of hops and low energy consumption.The simulation results show that the survival time of CPIPO is longer when non-uniform partitioning is adopted in large-scale network,and the reasonable construction of multi-hop routing between clusters effectively reduces the energy consumption of data forwarding.Compared with EEUC,DEBUC and SNNUC,the death time of the first node in network is prolonged by 57.4%,26.9% and 14.2%,respectively.For the two improved clustering routing protocols,the theoretical derivation and simulation test show that in the process of clustering by controlling the network partition can produce stable and reasonable clustering,in the process of transmission through optimizing path between clusters can reasonable distribution of data traffic and lighten the burden of transit routing nodes.Thus,the two improved clustering routing protocols can realize the energy saving and life extension of the network.
Keywords/Search Tags:wireless sensor network, cluster routing, network partition, K-Means algorithm, network lifetime
PDF Full Text Request
Related items