Research Of Clustering Routing Protocol In Wireless Sensor Network

With the continuous development of sensor technology, contemporary network and wirelesscommunication technology, wireless sensor network attracts more and more scholars. It has beenwidely used in environment, medical, architecture, industry and other fields. Compare to traditionalwireless networks, the energy of sensor nodes is very limited, therefore, how to make the mosteffective usage of those energy is one of the most important problems in wireless sensor network.Routing is one of the key technologies in network. This thesis describes the networkarchitecture and the basic features of wireless sensor network, introduces several basic parametersthat to evaluate network. Then introduces the classification on routing protocols of wireless sensornetwork by several typical routing protocols from both of flat routing protocols and clusteringrouting protocol, comparing both of the advantages and disadvantages, analyzes the problems ofuniform clustering routing protocols and proposes a clustering algorithm: CR_ACO algorithm. It isan uneven cluster routing and improved from EEUC.In single hop communication, the cluster heads which far away from sink will lose lots of energyand result in short network lifetime, while multi-hop cluster algorithm will bring "hot spots" effect.CR_ACO refers to EEUC network model in cluster head election and proposes a method aboutcluster head round election to improve the energy balance among cluster heads; during the datatransfer time, CR_ACO adds ant colony optimization algorithm to improve dynamic optimalmulti-hop topology between cluster heads and sink node; based on the residual energy and theactual network model, CR_ACO improves the visibility calculations of ant colony optimizationalgorithm, improves two parameters about residual energy and distance squared to balance theenergy consumption of network nodes effectively, saving network energy and making networklifetime longer.