Single-link serial Directional Rumor Routing in wireless sensor networks

The Rumor routing is a routing algorithm based on propagating software agents with random motion in wireless sensor networks. Rumor routing schema is based on the encounter of query agents and event propagator agents in sensor field. In this paper, we propose a new approach of rumor routing families that optimizes one of the newly introduced generations of rumor algorithm called Directional Rumor Routing (DRR). In our new approach, serial dispatching of query agents is suggested. Though, the routing energy consumption is reduced, but also some of shortcomings such as delays and path lengths are increased. Therefore, we combined it with single-link clustering method in order to statistically estimate new event area in the network. That is, having used this technique we, successfully, eliminated the aforementioned shortcomings. Simulation results show noticeable improvement in case of average energy consumption, and final route path over DRR.