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.
翻译:运行是无线传感器网络中的关键和持续的挑战之一。主要的挑战始终是制定减少通信间接费用的路线协议,从而节省网络传感器的能量。据知,高层次路径协议是无线传感器网络中最节能的路线协议。在本文中,对基于树数据结构的无线传感器网络引入了更加普遍的等级排序协议。拟议协议中的集群采用普通树的形式,根据传感器的距离以适应方式构建。结果显示,拟议的树型协议在能源消耗和网络使用寿命方面比现有的等级方法带来了重大的好处。