By Topic

Rumor Routing by appointment in center of gravity in wireless sensor networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Hamid Shokrzadeh ; Islamic Azad University, Roudehen, branch, Member of Young Researchers, Club, Roudehen, Iran ; A. T. Haghighat ; P. Saadatmndi ; M. H. Goodarzi

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).

Published in:

The International Conference on Information Networking 2011 (ICOIN2011)

Date of Conference:

26-28 Jan. 2011