An Energy-Balanced Multi-hop Clustering Routing Algorithm In Wireless Sensor Networks

The Internet of things is rapid development in the last few years. Wirelesssensor networks are likened to the nerve endings of the Internet of things, which israpid development as one of the main technical for the Internet of things, so thelong-term technology development plan includes this technology in our country.Power problem in wireless sensor network still need to study, it is a hot topic thathow to maximum save energy to lengthen the working life of the network under thecondition of without affecting the task. As one of the core of the network technology,routing protocol not only need deal with the problem of data transmission, but alsoneed consider the energy consumption and the actual problem. So it is essential todesign a reasonable routing protocol for wireless sensor networks.This thesis analyzes the existing routing protocol using wireless sensor networkand focus on analyzing LEACH protocol that it is the classic clustering routingprotocol and its existing improved protocol. In this article, the main tasks are asfollow:1. It introduces the characteristics of wireless sensor networks and theperformance evaluation indicators of wireless sensor networks. Then analyze the keyissues of designing the routing protocols and several typical routing protocols.In-depth analysis of the advantages and disadvantages of LEACH protocol and itsimprovement, and compare the several typical routing protocols.2. It describes the characteristics of the ant colony algorithm and the advantagesthat the ant colony algorithm is applied in wireless sensor networks. It is necessary tostudy on working principle of Ant Colony algorithm.3. This thesis proposes three improvements by analyzing the deficiencies of theLEACH protocol. In the data transfer phase, the communication mode of clusterheads to the sink node is a multi hop and the multi-hop path is obtained through the improved ant colony algorithm. In the cluster head selection, it is reasonable to takeinto account the residual energy of node and the area density that the node is locatedwithin the region. Then select the secondary cluster head from the cluster heads thathave been selected after the introduction of the neighbor nodes by analyzing andcalculating the optimal number of cluster heads. Through these improvements,improved algorithm can effectively balance the energy consumption of nodes in thenetwork and extend the working life of the network.Combining these studies, the thesis conducts simulation tests in MATLAB. Theresults show that the improved algorithm can effectively balance the energyconsumption of the nodes in the network, prolong the working life of the networkand expand the coverage of LEACH. It is obvious that the performance of theimproved algorithm is better than that of LEACH, LEACH-m and DEEC.