The Research On Clustering Routing Protocol Based On Connected Graph (CRPCG) In Wireless Sensor Network

With the rapid development of microelectronics technology, low-power embedded technology, wireless communication technology and distributed information processing technology, Wireless Sensor Network (WSN) has become a hotspot of the modern science and technology, known as the third technological revolution. Wireless sensor networks have the following characteristics:limited node power, wireless self-organizing network, low-power and low-cost deployment, data-centric and application of relevance. Therefore, for different application requirements, development of appropriate communication protocol has become a research focus and difficulty.At present, routing protocols of WSN can be divided into flat routing protocols and hierarchical routing protocols. This paper analyses several classic routing protocols, such as the SPIN, LEACH and HEED, etc., summarizes their their deficiencies, and proposes a new Clustering Routing Protocol Based on Connected Graph (CRPCG)CRPCG protocol mainly focus on the shortage of intra-clustering multi-hop routing protocol of tree. The basic idea is that cluster head election, cluster formation and data transfer of cluster are optimized in three aspects; eventually form a connected graph by the base station and all cluster heads. Using the related excellent algorithm of graph theory, balance node energy and prolong the network lifetime, while ensuring the network connectivity and reliability, improve the link quality. Protocol improvement in the following three stages:(1) the improvement in cluster head elections and members into clustering stage, considering the residual energy of nodes, node density and communication cost, make cluster head distribution is more uniform, balance the cluster Size and energy consumption; (2) in clusters formation stage, the base station and all cluster heads form a connected graph, solved the tree structure limitations and intrinsically deficient, and do not break when using the tree structure of data transmission efficiency, even if the local cluster head failure, still can guarantee other cluster head and base station connectivity; (3) in data transmission phase, as the ingenious design of compositing connected graphs, guaranteeing the intra-cluster and inter-cluster data transmission using free space energy model basically, effectively reduce transmission energy loss. Based on the actual demand, we can choose more different transmission paths to the base station, to ensure the reliability of data transmission, and further balance energy consumption between cluster head.Simulation results show that CRPCG protocol can significantly prolong the network survival time and balance the network node energy. Especially when data transfer between cluster heads, improving the reliability and efficiency of data transmission, still can prevent network partial invalidation, significantly overcame structural defects of the Leach and tree routing protocol.