Next Article in Journal
Face Liveness Detection Using Defocus
Previous Article in Journal
Structure Optimization of a Grain Impact Piezoelectric Sensor and Its Application for Monitoring Separation Losses on Tangential-Axial Combine Harvesters
Article Menu

Export Article

Open AccessArticle
Sensors 2015, 15(1), 1518-1536; doi:10.3390/s150101518

An Efficient Distributed Algorithm for Constructing Spanning Trees in Wireless Sensor Networks

1
PPGIa, Pontifical Catholic University of Parana – Parana, Curitiba 80215-901, Brazil
2
CPGEI, Federal University of Technology – Parana, Curitiba 80230-901, Brazil
*
Author to whom correspondence should be addressed.
Received: 21 November 2014 / Accepted: 8 January 2015 / Published: 14 January 2015
(This article belongs to the Section Sensor Networks)
View Full-Text   |   Download PDF [292 KB, uploaded 14 January 2015]   |  

Abstract

Monitoring and data collection are the two main functions in wireless sensor networks (WSNs). Collected data are generally transmitted via multihop communication to a special node, called the sink. While in a typical WSN, nodes have a sink node as the final destination for the data traffic, in an ad hoc network, nodes need to communicate with each other. For this reason, routing protocols for ad hoc networks are inefficient for WSNs. Trees, on the other hand, are classic routing structures explicitly or implicitly used in WSNs. In this work, we implement and evaluate distributed algorithms for constructing routing trees in WSNs described in the literature. After identifying the drawbacks and advantages of these algorithms, we propose a new algorithm for constructing spanning trees in WSNs. The performance of the proposed algorithm and the quality of the constructed tree were evaluated in different network scenarios. The results showed that the proposed algorithm is a more efficient solution. Furthermore, the algorithm provides multiple routes to the sensor nodes to be used as mechanisms for fault tolerance and load balancing. View Full-Text
Keywords: wireless sensor networks; distributed spanning tree algorithms; routing; shortest path trees wireless sensor networks; distributed spanning tree algorithms; routing; shortest path trees
Figures

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Lachowski, R.; Pellenz, M.E.; Penna, M.C.; Jamhour, E.; Souza, R.D. An Efficient Distributed Algorithm for Constructing Spanning Trees in Wireless Sensor Networks. Sensors 2015, 15, 1518-1536.

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Sensors EISSN 1424-8220 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top