The paper introduces a novel routing algorithm called Rumor Routing for sensor networks, which aims to efficiently distribute queries to nodes that have observed specific events. This algorithm is designed to reduce communication overhead and improve network longevity by leveraging data-centric routing. Unlike traditional geographic routing, Rumor Routing is suitable for scenarios where a coordinate system is unavailable or the phenomenon of interest is not geographically correlated. The authors propose a method to create paths leading to each event, allowing queries to be delivered through these paths rather than flooding the entire network. This approach is particularly effective when the number of queries is significantly lower than the number of events. The algorithm uses long-lived agents that create and propagate paths to events, optimizing routes as they encounter shorter paths. Agents also update the event tables of nodes they visit, ensuring that the network maintains up-to-date information about event locations. The paper evaluates Rumor Routing through simulations, comparing its performance to query flooding and event flooding. Results show that Rumor Routing can achieve high delivery rates with lower energy consumption compared to these alternatives. The algorithm is also shown to be stable and fault-tolerant, with delivery rates degrading gracefully as the number of failed nodes increases. Future work includes exploring a wider range of simulation scenarios, such as asynchronous events and non-localized events, and investigating alternative algorithm design options, including non-random next-hop selection and constrained flooding. The goal is to further optimize the algorithm for different application requirements and real-world sensor networks.The paper introduces a novel routing algorithm called Rumor Routing for sensor networks, which aims to efficiently distribute queries to nodes that have observed specific events. This algorithm is designed to reduce communication overhead and improve network longevity by leveraging data-centric routing. Unlike traditional geographic routing, Rumor Routing is suitable for scenarios where a coordinate system is unavailable or the phenomenon of interest is not geographically correlated. The authors propose a method to create paths leading to each event, allowing queries to be delivered through these paths rather than flooding the entire network. This approach is particularly effective when the number of queries is significantly lower than the number of events. The algorithm uses long-lived agents that create and propagate paths to events, optimizing routes as they encounter shorter paths. Agents also update the event tables of nodes they visit, ensuring that the network maintains up-to-date information about event locations. The paper evaluates Rumor Routing through simulations, comparing its performance to query flooding and event flooding. Results show that Rumor Routing can achieve high delivery rates with lower energy consumption compared to these alternatives. The algorithm is also shown to be stable and fault-tolerant, with delivery rates degrading gracefully as the number of failed nodes increases. Future work includes exploring a wider range of simulation scenarios, such as asynchronous events and non-localized events, and investigating alternative algorithm design options, including non-random next-hop selection and constrained flooding. The goal is to further optimize the algorithm for different application requirements and real-world sensor networks.