Routing Protocol For Wireless Sensor Networks Clustering In The Query

Wireless sensor network which node energy, computing power and storage capacity is limited strictly, it has many characteristics such as no center, self-organizing and topology easy to change. At present, the research mainly focus on the design of the optimization program under various constraints. Paper selection as one of the current hot-spots research in this field, which as the research and design of wireless sensor network routing protocol, and we along the topic for discuss and research.Paper expounds the basic concepts of wireless sensor network and its routing protocol, introduces several aspects such as structure, characteristics and key technology of sensor network, analyses the classification and characteristics of sensor network routing protocols, and mainly introduces two categories of routing protocols which are planar and stratified, then compares the performances of them, and researches on LEACH algorithm in detail, which algorithm is a typical clustering routing protocol in wireless sensor networks at present, mainly starts to explain aspects from the network model, main ideas and working principle. LEACH algorithm routing protocols is specially designed for wireless sensor networks, but there are many problems in practical applications. Based on the classical LEACH algorithm and some of the its improved algorithm, this paper presents a new routing protocol, namely QMR-LEACH, which is a query-based multi-hop clustering routing algorithm. The sink node queries the monitoring area on-demand, and the target cluster-head responses to this query, and the residual energy of nodes, the next-hop energy consumption and the number of hops and other parameters are introduced in the process of data upload to select the optimal path, meanwhile, it is decided to choose a multi-hop or single-hop mode for data upload according to the actual deployment situation of node which need to transmit data by comparing the distance between the target cluster-head and the sink node. The computer simulation results show that the presented QMR-LEACH algorithm can adaptively select an optimal path or in a single-hop mode to upload data, it extends the life cycle of nodes and entire network effectively, moreover it reduces the data loss rate.Subsequently, using the information theory knowledge, introduces concept of data "reliability", presents a data aggregation algorithm which is based on query type clustering routing protocol, namely NQMR-LEACH, to do data aggregation processing within the nodes which may exist redundant data. Data aggregation is the analysis and synthesis of the data information, and through this way to save network nodes energy consumption, reduce the external interferences, lower the burden of channel transmission and improve the utilization rate of radio channel. The NQMR-LEACH algorithm is on the basis of query type clustering routing protocol, to do data aggregation processing respectively within inner-cluster and inter-cluster, effectively reduces data redundancy, improves data accuracy, saves communication energy consumption of nodes and extends the network life cycle.