Distributed appointment points in query-driven routing in wireless sensor networks

Rumor Routing is one of the query-driven routing algorithm categories in wireless sensor networks which is well extended and optimized in the recent years. Common principal ideas in all rumor routing algorithms are conjunction of query-agents with the traversed path of event information propagator agents in the network. In all rumor routing protocols, Agents conjunct each other in undefined point and make a route between sink and node which detect an event. In one kind of these protocols, agents make an appointment with each others in a predefined point (in Center of Gravity of network) due to conjunction. This idea helps nodes to consume less energy and decrease the routes´ length in short-term, But it increases node dead range due to the central nodes over usage in long-term. In this paper, we extend this idea with creation of numbers of center of gravity in network generated by a statistical normal distribution function to do a better load balancing in network during routing time. Simulation results depict decreasing range of nodes failure and increasing network life time due to using this technique. Also, it shows a considerable improvement in energy consumption and final route length over other similar methods such as Directional Rumor Routing (DRR).