Directional rumor routing in wireless sensor networks

Abstract

Rumor routing is a classic routing algorithm based on the random walk of agents. In this paper, a method to improve the performance of this routing algorithm is proposed. Here, we try to improve the latency and energy consumption of the traditional algorithm using propagation of query and event agents in straight lines, instead of using purely random walk paths. As our results confirm, this method improves the delivery ratio of the queries which is a drawback of traditional rumor routing. To compare the performance measures with traditional algorithm, a simulation framework is developed and extensive simulations are performed.