By Topic

Distributed Search for Balanced Energy Consumption Spanning Trees 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

3 Author(s)
Gagarin, A. ; Acadia Univ., Wolfville, NS, Canada ; Hussain, S. ; Yang, L.T.

Sensor networks are commonly used for security and surveillance applications. As sensor nodes have limited battery power, computing, and storage resources, the energy efficient security techniques are needed. We provide a new heuristic approach to search for balanced and small weight routing spanning trees in a network. The approach is a modification of Kruskal's minimum spanning tree (MST) search algorithm and is based on a distributed search by hierarchical clusters. It provides spanning trees with a lower maximum degree, a bigger diameter and can be used for balanced energy consumption routing in wireless sensor networks (WSNs). The approach can be implemented in parallel as well as a simple locally distributed algorithm. Simulations of a realistic scenario WSN are done based on the transmission energy matrix. The simulation results show that the proposed approach can extend the functional lifetime of a WSN in 3-4 times in terms of sensor transmission energy. Possible preliminary clustering of the input network is considered as well.

Published in:

Advanced Information Networking and Applications Workshops, 2009. WAINA '09. International Conference on

Date of Conference:

26-29 May 2009