论文标题
至少：无线传感器网络的低能自适应可扩展树的路由协议
LEAST: a Low-Energy Adaptive Scalable Tree-based routing protocol for Wireless Sensor Networks
论文作者
论文摘要
路由是无线传感器网络中的关键和持续挑战之一。主要的挑战一直是拥有一个路由协议，以减少通信开销，从而节省网络中传感器的能量。已知层次路由协议是无线传感器网络最节能的路由协议。在本文中，针对基于树数据结构的无线传感器网络引入了更广泛的层次路由协议。提出的协议中的聚类具有一般树的格式，该格式是根据传感器距离以自适应方式构造的。结果表明，所提出的基于树的协议在现有的层次结构方法上引入了网络能源消耗和寿命的重要好处。
Routing is one of the critical and ongoing challenges in Wireless Sensor Networks. The main challenge has always been to have a routing protocol that reduces the communication overhead, hence saving the energy of the sensors in the network. Hierarchical routing protocols are known to be the most energy-efficient routing protocols for Wireless Sensor Networks. In this paper, a more generalized hierarchical routing protocol is introduced for Wireless Sensor Network, which is based on tree data structures. The clustering in the proposed protocol has the format of a general tree, which is constructed in an adaptive manner based on the distance of the sensors. Results show that the proposed tree-based protocol introduces a significant benefit in energy consumption and lifetime of the network over the existing hierarchical approaches.
