By Topic

An Energy-efficient Routing Algorithm for Data Gathering 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
$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

2 Author(s)
Jianjian Huang ; Coll. of Math. & Comput. Sci., Fuzhou Univ., Fuzhou, China ; Yanmin Zhao

Clustering routing algorithm is widely used in data gathering to reduce data latency, enhance network scalability, and prolong the network lifetime. When sensor nodes transmit their data to the sink via multi-hop communication, the sensor nodes closer to the sink are burdened with more relay traffic and die early, which will cause network partitions. This paper presents a based uneven clustering algorithm to solve the problem of energy consumption that is not balanced. Simulation results show that the routing algorithm is well balanced the energy consumption of the network, and prolongs the network lifetime.

Published in:

Industrial Control and Electronics Engineering (ICICEE), 2012 International Conference on

Date of Conference:

23-25 Aug. 2012