基于DIJKSTRA的无线传感器网络分簇路由算法

Clustering Routing Algorithm Based on DIJKSTRA for Wireless Sensor Networks

摘要:

为加快无线传感器网络最优路径搜索速度、减少路径寻优能量消耗和延长网络寿命,提出了基于改进的DIJKSTRA算法的无线传感器网络分簇路由算法；运用DIJKSTRA算法在无线传感器网络内以多跳接力的方式来搜寻从源节点到目的节点的最短路径；结合能耗优化策略,避免网络能耗热点问题,实现网络能耗均衡；通过与基于蚁群算法的路由算法对比分析,基于Dijkstra的网络分簇路由算法能优化网络分簇并建立较优传输路径,其快速收敛性能减缓了网络中簇头节点的能耗,延长了网络寿命,提高了网络鲁棒性。

Abstract:

In order to speed up the path searching and cut the energy consumption, a new DIJKSTRA based on clustering routing algorithm for improving wireless sensor networks is presented in this manuscript. This algorithm adopts DIJKSTRA-based method to find the optimal multi-hop path from the source node to sink node among the clustering heads while the clustering routing models are established for energy management in wireless sensor networks. It avoids energy for some nodes near the sink node and balances the energy consumption in the network with the clustering routing models. By comparing with the ACA routing algorithm in experiment, this algorithm alleviates the energy consumption of the nodes and extends the service life of wireless sensor networks. It has less dead nodes during the same time and has good robustness. 