An Efficient Distributed Algorithm for Constructing Spanning Trees in Wireless Sensor Networks
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...
Main Authors: | Rosana Lachowski, Marcelo E. Pellenz, Manoel C. Penna, Edgard Jamhour, Richard D. Souza |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2015-01-01
|
Series: | Sensors |
Subjects: | |
Online Access: | http://www.mdpi.com/1424-8220/15/1/1518 |
Similar Items
-
Performance Evaluation using Spanning Tree Protocol, Rapid Spanning Tree Protocol, Per-VLAN Spanning Tree, and Multiple Spanning Tree
by: Dana Faiq Abd, et al.
Published: (2024-01-01) -
Disjoint Spanning Tree Based Reliability Evaluation of Wireless Sensor Network
by: Sonam Lata, et al.
Published: (2020-05-01) -
Solving the Shortest Total Path Length Spanning Tree Problem Using the Modified Sollin and Modified Dijkstra Algorithms
by: Wamiliana, et al.
Published: (2023-10-01) -
A spanning tree construction algorithm for industrial wireless sensor networks based on quantum artificial bee colony
by: Yuanzhen Li, et al.
Published: (2019-07-01) -
On the Maximal Shortest Paths Cover Number
by: Iztok Peterin, et al.
Published: (2021-07-01)