Modified Rumor Routing for Wireless Sensor Networks

Abstract

Due to the limited processing power, and finite power available to each sensor node, regular ad-hoc routing techniques cannot be directly applied to sensor networks domain. Thus, energy-efficient routing algorithms suitable to the inherent characteristics of these types of networks are needed. However highly efficient data centric model of routing will improve the longevity of the network. This paper describes a mechanism of improvisation through simulation of existing feature of Rumor routing. The improvised rumor routing algorithm handles node failures and allows for tradeoffs between setup overhead and delivery reliability.