Research Of Cluster-routing Protocol For Wireless Sensor Networks

Due to the limitation of power, calculation ability and communication bandwidth, the traditional wireless routing protocols are not suitable for wireless sensor networks. It is the key point for the research to save power and prolong the total network lifetime. In it, cluster-based routing algorithm in routing layer is an effective energy conservation scheme in WSN.Firstly, we give a detailed introduction of cluster-based routing algorithms proposed by now, and compared the several representative sensor network routing protocols. From analyses the actuality and shortcomings of existing work, we summarize the feature of cluster-based routing protocols. Base on this, proposed a new cluster-based routing protocol of energy efficient. The new protocol is named as CRPE. In CRPE, integrative improvements are made on the cluster head selection, cluster formation and inter-cluster communication according to the shortages of existing protocols.As for the problem of some clustering routing protocol not considering the energy of nodes when selecting cluster heads, CRPE proposes an optimal algorithm for the non-cluster-head nodes to choose the cluster-head, which takes the current energy of the cluster-head into consideration. So as to adjust the possibility of node becoming a cluster-head and the node with more energy has bigger possibility to become the cluster-head. In the clustering process each ordinary node selects a cluster to join according to the signal strength and residual energy of each cluster head. Select the close node which has more remaining energy to act as its cluster as far as possible. More clusters are formed in the area nearer to sink node to share the task of delivering routing load. CRPE relieved the area energy unbalancing problem caused by the multi-to-one transmission mode of WSN in earlier cluster-based routing algorithm. In the inter-cluster communication method, each cluster head selects single hop or multi-hop route to transmit intergraded data to the base station according to the distance between them. CRPE selects the neighbor cluster with smaller hop value and whose head has more power as the next cluster. Source node pick the neighbor node with less delivering cost and better energy condition according to the distances between nodes and the nodes' remaining power as the next hop. From these improves, balances the loading of nodes and prolongs the lifetime of network.At last, we simulate the CRPE and LEACH routing algorithms and analysis of the results. Simulation results show that CRPE exceeds LEACH in saving the network's energy and prolonging the network's lifetime.