Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
