The Research On Clustering Routing Algorithm For Wireless Sensor Network Based On Ant Colony Algorithm

In Wireless Sensor Networks, the nodes collaborated with each other and ranindependently, usually been set in harsh environment，such as remote areas, or field of thebattlefield which enemies were difficult to reach or even can not reach. The sensor nodeswere typically battery-powered and its energy was very limited. Obviously, to maintain thenode energy by replacing the battery was unrealistic. Furthermore, wireless sensornetworks have a large number of nodes and covering a wide area, the above problemoffered great challenges to the design and management of sensor networks.The routing protocols, as one of the core technology of the wireless sensor network,solved the problem of data transmission, and its main design goal was to meet theapplication requirements while minimizing the energy consumption of network nodes tobalance network overhead obtain the overall effectiveness of the use of resources, extendthe network lifetime, expand network capacity, and improve the network throughput.Therefore, a reasonable routing protocol in wireless sensor networks was quite essential.On the basis of analzings the wireless sensor network routing protocols,this paper focusedon analysis of the classic clustering routing algorithm for low-power adaptive clusteringrouting protocol LEACH (Low Energy Adaptive Clustering Hierarchy) and relatedimprovements, and proposed an improved algorithm. In this paper, the main tasks were asfollow:(1)It described the characteristics and classification of the routing protocol andwireless sensor networks, analyzed the key issues of the routing protocol design andseveral typical routing protocols, and also compared their advantages and disadvantages. Itdeeply analyzed the LEACH and its associated improvement protocols, and itsshortcomings.(2) It described the characteristics of the ant colony algorithm and its advantageswhen applied in wireless sensor networks.(3) It proposed an improve algorithm which clustered by dividing area namedA-LEACH in clustering stage. Against the problem that the Cluster head nodes forLEACH were unevenly distributed in space and randomly selected, proposed a solvingmethod------clustering by region. The method made the number of nodes in each clusterwas equal, and selected the nodes which have the most energy act as cluster head in eachcluster. Theoretical analysis showed that the algorithm A-LEACH was better than LEACH in the network energy balance, thereby prolonging the network lifetime.(4) It proposed an improve algorithm named MH-LEACH in the stage of the datacommunication.Against the problem that cluster head nodes communicate directly withthe SINK in LEACH, proposes diagnostic mechanism with multi-hop routing algorithm byant colony algorithm. The results of NS-2simulation showed that MH-LEACH algorithmhas obviously advantages in energy consumption and the number of nodes in a significantsurvival.(5) It proposed an improved routing protocol based ant colony algorithm namedBAMH-LEACH. The algorithm took the remaining energy of the cluster node as apheromone, forming the multi-hop routing between clusters and proposed diagnosticmechanism to select multiple paths, thereby effectively improving the reliability of overallnetworks. This paper compared the LEACH and improved BAMH-LEACH protocol byusing theoretical analysis and NS-2simulation, and the results show that the improvedprotocol significantly prolonged the survival time of the network, balancing the energyconsumption of sensor nodes in the network, and reduced the SINK node workload, andperformed better than LEACH protocol.