基于路由树的分布式自适应动态多跳分簇路由协议

Distributed adaptive dynamic multi-hop clustering routing based on routing tree

针对已有的分簇路由算法中存在的簇间路由路径选择不合理等问题,提出了基于路由树的分布式自适应动态多跳分簇路由协议DADMC。分簇阶段通过设置不同剩余能量的节点不同的延迟时间来让能量高的节点优先成为簇首。簇间路由路径的选择为以sink节点为根节点的动态路由树,每个节点从父节点中选择使得自己路由权值最小的节点作为下一跳。仿真实验结果表明,与已有的分簇路由算法相比,提出的算法可以更好地实现能耗均衡并延长网络生存时间。

DADMC, distributed adaptive dynamic multi-hop clustering routing based on routing tree, is proposed to solve the problems in existing clustering routing algorithms, such as unreasonable routing path selection. In the clustering stage, the nodes with different residual energy have different delay time to make the nodes with high energy more likely to become cluster heads. the inter-cluster routing is a dynamic routing tree with the sink node as the root node. Each node selects the node with the smallest routing weight as the next hop from the parent node. The simulation results show that compared with the existing clustering routing algorithm, the proposed algorithm can better achieve energy balance and prolong network lifetime.