Research On Energy Balanced Routing Algorithm Of WSN Based On Rough C-Means Clustering

With the rapid development of sensors’ technology, embedded technology, network and communication technology, distributed processing technology, wireless sensor networks(WSN) have been widely used in environmental monitoring, agriculture, medical, military and other fields. The tens of thousands sensor nodes are randomly deployed in WSN. The sensor nodes have the capability of communication and computing capability in the monitoring region, which using self-organized capability to detect monitoring area. However, due to the limited energy of nodes and no energy supplement, which makes the research of energy dissipation and load balanced routing algorithm has become a hot research. At the same time, the traditional hierarchical routing protocol exists that nodes’ distribution is not uniform and energy consumption is not balanced. Aming these problems, the paper makes some improvements, as following.Firstly, when traditional rough C-means clustering algorithm deals with the nodes clustering of LEACH, in its iterative update of the cluster center process, nodes objects in the upper and lower approximation use unified weight values, which ignoring the diffience between the objects of samples in the cluster, so that it results some classification errors. This paper proposes a new clustering algorithm, the weighted rough C-means clustering algorithm(WCRCM). According to calculate the degree of sample objects offset themselves cluster centers, each object is given different weight value and the more near the cluster center of the sample, the more cluster weight is greater, which shows that this object makes the heaviest contribution to the cluster. By this method, it dynamicly gives different weights for each object. The MATLAB simulation shows that the new method improves the performance of the algorithm and nodes’ clustering in LEACH.Secondly, in traditional LEACH algorithm, the cluster head node’s distribution is extremely uneven. The nodes which deviating from the cluster head nodes consume more energy when communicating with cluster head. It can cause nodes easily exhauste and loss the ability to work. Therefore, this paper applies the WCRCM algorithm to LEACH algorithm. First of all, the sensor nodes in the WSN are divided into multiple clusters, and the number and location of nodes in each region is roughly similar, so algorithm completes the construction of network. Then it uses LEACH algorithm in each cluster, so as to ensure that the cluster head nodes are evenly distributed geographically. At the same time, the classic LEACH protocol are arbitrary to choose the cluster heads and nodes was selected to be a cluster head with a equal probability. It is lack of considering the energy characteristics. When selecting the cluster head nodes, the paper uses the concept of the upper and lower approximation in WCRCM algorithm. The nodes was signed into upper nodes or lower nodes, and the lower nodes must belong to the cluster, so it selects cluster head nodes in lower nodes. Then, considering the residual energy of nodes in each round, that’s means energies of head nodes in each round is greater than the averge within the cluster. The probability of becoming a cluster head is generated by the size of cluster in WSN which adaptively giving for each nodeFinally, in the study of communication between nodes, it sets single hop combine multi hop, according to the node of the initial energy, the a mount of information transmission and node communication radius. This way saves the energy consumption of the nodes. Then the paper forms four aspects, such as cluster head nodes’ s distribution, WSN life cycle, each round of the residual energy nodes, survival distribution of nodes, and compares this four aspects, which shows that the improved algorithm is more effective and prolongs the network lifetime, balances the network load.