返回
An Efficient Distributed Algorithm for Constructing Spanning Trees in Wireless Sensor Networks
DOI:10.3390/s150101518.png)
摘要
En 中文
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.
Keyword:
wireless sensor networks
distributed spanning tree algorithms
routing
shortest path trees
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.5
论文数:
7.2W
被引数:
20.9W
机构
引用论文
Towards a Hybrid Energy Efficient Multi-Tree-Based Optimized Routing Protocol for Wireless Networks
SENSORS
IF3.5
Thirty-five–year Trends in First-time Hospitalization for Hip Fracture, 1-year Mortality, and the Prognostic Impact of Comorbidity
Epidemiology
IF0
A Survey on Routing Protocols for Large-Scale Wireless Sensor Networks大规模无线传感器网络路由协议研究综述
SENSORS
IF3.5

