By Topic

A New Routing Algorithm to Reduce Consumed Energy in Wireless Sensor

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
$31 $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

1 Author(s)
Samani, M. ; Comput. Eng. Dept., Payame Noor Univ., Tehran, Iran

Topology control and energy saving is one of the most important problems in wireless sensor networks because of special property of these networks such as limited transmission range, limited power resource and the impossibility of recharging. To solve this problem, CHRA (clustering hierarchical routing algorithm), a centralized cluster formation algorithm for routing algorithm is proposed. At the beginning the centralized algorithm will be used to overcome the defect that the clusters distribute unevenly. After this step, a centralized algorithm will be implemented. The all node sends information about location and energy to the head node in a cluster. after receiving the information, the head node run a dummy center algorithm to select a new head node and a spare head node in the next round. The head nodes run hierarchical based algorithm to create a path through to the sink node. Through network simulation we show that our algorithm reduces average consumed energy and improves network lifetime.

Published in:

Computational Intelligence, Communication Systems and Networks (CICSyN), 2011 Third International Conference on

Date of Conference:

26-28 July 2011