动态分层的水下传感器网络分簇路由算法

针对平面路由难以适应较大规模水下传感器网络的局限，该文提出一种能更好地适用于较大规模网络的分簇路由算法DLCR(Dynamic Layered Clustering Routing)。该算法将网络自上向下划分为多层，并选择层内与sink节点距离较近、剩余能量较高的节点作为簇头节点，从而降低簇头节点的通信能耗。为了避免同一节点连续被选举为簇头节点，提出一种动态分层机制，每一轮数据采集周期都将网络重新划分为多层。实验证明DLCR不仅具有良好的稳定性，还降低了网络的能耗，延长了网络的寿命。

Dynamic Layered Clustering Routing Algorithm in Underwater Sensor Networks

To deal with the limitation that flat routing can hardly be accustomed to large scale Underwater Sensor Networks (USN), a new clustering routing algorithm Dynamic Layered Clustering Routing (DLCR) is proposed, which can be accustomed to larger scale networks. This algorithm divides the networks into several layers from top to bottom, and selects the nodes which have more remaining energy and shorter distance to sink as the cluster head nodes, thus, clusters communication energy consumption are reduced. In order to avoid the same nodes being elected to be cluster head nodes continuously, a dynamic layered mechanism that the networks are divided into different layers in each circle of data gathering is proposed. The experiment shows that DLCR not only has a better stability, but also reduces the energy consumption and prolongs the lifetime of the whole networks.