Font Size: a A A

Low Power Routing Algorithm Based On Bisecting K-means

Posted on:2019-08-09Degree:MasterType:Thesis
Country:ChinaCandidate:H X JiangFull Text:PDF
GTID:2428330548491229Subject:Computer application technology
Abstract/Summary:PDF Full Text Request
With the continuous advancement of microelectronic technology and wireless communication technology,wireless sensor network(WSN)technology,as the core technology of the Internet of Things,has developed rapidly in recent years.Because of the limited energy of sensor nodes in wireless sensor networks,how to save the energy consumption of sensor nodes and prolong the lifetime of wireless network is a difficult problem that WSN must face.Domestic and foreign scholars have done a lot of research on this issue.Through research,it has been shown that the topology and routing algorithm optimization of wireless sensor networks are of great significance to prolonging the lifetime of wireless networks.When WSN adopts the plane routing algorithm,all nodes of the sensor network have the same position and function in the network topology.The plane routing altorithm is more suitable for the sensor network with small network size and fewer wireless sensor nodes.Compared with the plane routing algorithm,clustering routing algorithms,which selects cluster heads and forms clusters for data transmission,can manage nodes and data in the network more effectively,and is suitable for the wireless sensor networks with many nodes and large scale.This thesis mainly studies the single layer clustering routing algorithm and the multi-layer clustering routing algorithm in wireless sensor networks.The research contents and innovations are as follows.(1)Aiming at the defects of single layer clustering routing algorithm LEACH in the selection process of cluster head,such as the uncertainty of the number of cluster heads,the uneven distribution of cluster heads,the random selection process and the unreasonable selection of cluster heads,this paper proposes a single-layer clustering routing algorithm UCOA based on the uniform clustering of the dichotomy k-means algorithm.The algorithm first determines the optimal number of cluster heads of WSN based on the theoretical analysis of network energy consumption,and then uses the the dichotomy k-means algorithm to perform uniform network clustering based on the optimal number of cluster heads.Then we use the threshold formula which adds the residual energy and relative distance of nodes to select cluster heads in cluster.The algorithm can make the selection process of cluster head more rigorous and scientific,and the distribution of cluster head nodes more reasonable,and the selection of cluster head nodes the best.In this paper,the performance of UCOA and LEACH routing algorithms is compared through simulation experiments.The simulation results show that the UCOA algorithm is superior to the LEACH algorithm in prolonging the network lifetime and reducing the energy consumption of the entire network.(2)The multi-layer clustering routing algorithm can well overcome the shortcomings of the single layer clustering routing algorithm,which requires high communication distance between wireless sensor nodes.Based on the research of the single layer clustering routing algorithm and the analysis of the advantages and disadvantages of other multi-layer clustering routing algorithms,this paper proposed a multi-layer clustering routing algorithm MLCRA based on multiple hops node.Firstly,based on the relationship between the data sent by the node and the transmission distance,the algorithm determines the optimal distance for multiple transmission.In the process of data transmission between clusters,an auxiliary cluster head is added to bear the energy consumption of the the cluster head to send data.Data transfer tasks between clusters are performed using nodes with sufficient residual energy.This method of data transmission can greatly reduce the requirement of the network for the transmission distance between nodes,and greatly enhance the practicability of the algorithm.In this paper,the performance of MLCRA and LEACH-M algorithm is compared by simulation experiments.The simulation results show that the MLCRA algorithm is superior to the LEAC-M algorithm in reducing the communication distance of the entire network,reducing the energy consumption of nodes and prolonging the network lifetime.
Keywords/Search Tags:Wireless sensor network, Optimal number of cluster heads, Residual energy, Uniform clustering routing algorithm, Multiple transmission of nodes
PDF Full Text Request
Related items