Research Of Energy-Efficient Clustering Rumor Routing Protocol In Wireless Sensor Networks

Recent advances in network technologies, radio communication, embedded & distributed technologies and micro electro mechanical system have led the development of wireless sensor networks. Wireless sensor networks are the Ad-hoc networks system, which is formed from a large number of miniature sensors by radio communication in the monitoring area. Miniature sensors are named as"smart dust"due to its feature of low power, cheap cost and light weight. As one of the emerging technologies in 21 century, wireless sensor networks have become the research frontiers in the area of information technologies nowadays. It has extensive application spaces in the area of battlefield surveillance, environmental monitoring, intelligent transportation, smart home, medical treatment and space exploration, etc. In the wireless sensor networks, sensor energy is constrained. For prolonging the network life time as long as possible, source sensors usually do not communicate with destination sensors directly, and cannot get enormous routing information. It needs to make use of many intermediate sensor nodes with multi-hops based on local network topology to deliver sensor data. Therefore, to develop a routing protocol which takes the charge of routing selection and data forwarding is a key task for wireless sensor networks.In this paper, it integrates clustering routing and rumor routing protocols, and proposes a new routing protocol, clustering rumor routing, based on the analysis and research of optimized algorithms for rumor routing protocol. Clustering rumor routing based on clustering and queries routing protocols, aims at the problems of winding or loop path for traditional rumor routing. In order to improve the delivery rate of the query agents, balance the energy distribution of the sensor nodes and extend the lifetime of the networks, three features of clustering structure, selective next-hop scheme and double variable energy thresholds for rotation of cluster-heads are taken into account in clustering rumor routing. The mechanism of clustering structure provides the communication rules between cluster-members and cluster-heads, the delivery of query or event agents change to cluster-to-cluster hops from node-to-node hops, so the agents can hop the farther area. Since selective next-hop scheme requests agent to be propagated between the unvisited cluster-heads, it effectively avoids the problem of winding path and reduces agent-hops. The mechanism for double variable energy thresholds for rotation of cluster-heads dividing the process of cluster-heads into two courses achieves a significant energy balance between the sensors and saves energy in this process. The experiment results show clustering rumor routing has more advantages in the area of energy consumption, path quality, query delivery and networks lifetime than traditional rumor routing. Clustering rumor routing can not only be applied in the networks with high-density nodes, but also be suitable in the applications for delivering enormous data.