By Topic

Energy Minimization for Flat Routing and Hierarchical Routing 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
$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

2 Author(s)
Heesang Lee ; Dept. of Syst. Manage. Eng., Sungkyunkwan Univ., Suwon ; Kyuhong Lee

Energy minimization is a central issue for wireless sensor networks (WSNs). We propose an energy minimization model and suggest a solution algorithm for multi-hop flat routing for WSN. This model is based on some directed minimum spanning trees and the related tree packing problem. We compare this model and some known optimization model and algorithms for two-hop hierarchical routings. In our computational experiments, the model for the flat routing has smaller energy consumption and longer lifetime than those for hierarchical routing. We also show that the weakness of the lifetime of hierarchical routing can be cured by giving extra energy for some super sensors that can be candidates of the heads of the clusters of the hierarchical routing.

Published in:

Sensor Technologies and Applications, 2008. SENSORCOMM '08. Second International Conference on

Date of Conference:

25-31 Aug. 2008