Abstract
Rumor Routing is one of the routing algorithm categories in wireless sensor networks which is well extended and optimized in the recent years. Common principal ideas in all rumor routing algorithms are conjunction of query-agents with the traversed path of event information propagator agents in the network. In this paper we propose a new method to reduce the number of routing agents to consequently reduce the energy consumption during the routing process. The main idea is based on setting appointments between agents in the center of gravity of the network. In the other word, agents set appointment in the center of the network instead of searching each other in the network. Simulation result depicts a considerable improvement in energy consumption and final rout length over other similar methods such as Directional Rumor Routing (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.
