Heterogeneous Wireless Sensor Network Clustering Routing Algorithm For The Study

Due to recent advances in micro-electro-mechanical systems (MEMS), wireless sensor networks (WSNs) which are mostly used to collect data, have received a lot of attentions both in military and civil fields. Generally, such systems consist of mass tiny nodes with sensing, data processing and wireless communication modules on them. These nodes collaborate with each others in a self-organized way, to send the sensed information in the vicinity back to the sink node through the network effectively. Since this kind of system is able to cover large sensing fields while guaranteeing high quality, it is widely used in military sensing, security, environmental monitoring, traffic surveillance, medical treatment, building and structures monitoring and even anti-terrorism.However, due to the limited energy of WSNs, the lifetime becomes one of the key performance indexes of WSNs. So far clustering routing algorithm is supposed to be an efficient way to perform energy management and extend the network lifetime. In this paper, the author put great efforts on researching the clustering routing algorithm according to the characteristic of WSNs.First, the author analyzes the unique characteristics that make wireless sensor networks different from other traditional wireless networks (e.g. Ad-Hoc). It is followed by the analysis of current routing algorithms in WSNs based on cross-layer, including flat routing and cluster-based routing. The author tries to conclude the pros and cons of these routing algorithms and design the novel algorithm for clustering nodes based on them.Second,the author analyzes the energy consumption under the different data fusion degree and compares with the direct communication mode. Results show the importance of data fusuion to clustering routing. The performance of clustering routing under different data fusion degree is given.Third,because most of researches on current clustering routing algorithm focus on the homogeneous networks, besides, there is no optimized theory to compute probability for choosing the cluster head, only based the experience express. For those defects, first, the author theoretically computes the cluster head choosing probability, and then proposes a new clustering routing algorithm. It improves the performance of the clustering routing algorithm in heterogeneous networks.Fourth,the network coverage issue is one of the basic problems in designing WSNs; so far, no routing method is researched based on coverage preservation. The author combines coverage preservation with clustering routing algorithm to improve the performance of the clustering routing algorithm in heterogeneous networking environment. This algorithm tries to distribute the energy consumption to every sensor node according to the importance of coverage. The proposed algorithm improves the performance of coverage preservation by using the method to prolong the lifetime of those nodes which are more critical for coverage character.At last, we conclude our work and give some suggestions for the future work.