By Topic

A new data fusion routing algorithm for 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

3 Author(s)
Xinbing Yao ; Coll. of Inf. Sci., Shenyang Univ. of Technol., Shenyang, China ; Xiangdong Wang ; Shujiang Li

This paper proposes a multi-hop fusion routing algorithms to explore a more effective way to reduce excessive consumption of energy while a sensor communicates with the base station. It is a kind of new routing algorithm based on data fusion, designed to reduce the data that cluster head nodes send to the base station and reduce energy consumption. The algorithm first clusters according to heed algorithm, and then ring the cluster head nodes in the different regions according to the distance between each cluster head node and base station. Since base station outside one by one it is layer 1, layer 2, layer 3...layer k. While the cluster head nodes send data to base station through multiple hops, a cluster head node in layer k comprehensively evaluates a cluster head node in k-1 layer the data relevance and the remaining energy. Cluster head nodes choose their next hop cluster head nodes according the evaluation and select the next hop cluster head nodes for data fusion until the data is sent to the base station. The simulation results show that the new algorithm is efficient in the extension of the network life relative to heed.

Published in:

Computer Science and Automation Engineering (CSAE), 2011 IEEE International Conference on  (Volume:1 )

Date of Conference:

10-12 June 2011