无线传感器网络自适应动态路由算法仿真

Simulation of Adaptive Dynamic Routing Algorithm for Wireless Sensor Networks

传统传感器路由算法存在信息传输能耗较高,且网络节点存活率偏低问题,提出无线传感器网络自适应动态路由算法,简称为HDAR算法。结合平面路由和层次路由构建新的无线传感器网络路由框架,在数据获取模块中选取层次路由,在数据传输模块中选取平面路由。调整节点非线性自适应权重,动态成簇自适应路由算法HDAR通过数据动态成簇来实现数据汇总,利用自适应路由选择算法将数据运转到Sink节点,最终实现HDAR算法设计。为验证所提算法的有效性,进行一次实验。实验结果表明:HDAR算法节能效果更好,且上述算法下节点存活数量更多,适用性较强,具有很好的应用前景。

The traditional sensor routing algorithm has problems of high energy consumption for information transmission and low survival rate of network nodes. Therefore, this article put forward an adaptive dynamic routing algorithm for wireless sensor networks, which was known as the HDAR algorithm for short. A new wireless sensor network routing framework was constructed by planar routing and hierarchical routing. The hierarchical routing was selected from the data acquisition module and the planar routing was selected from the data transmission module. The non-linear adaptive weights of nodes were adjusted. The dynamic clustering adaptive routing algorithm HDAR implemented the data aggregation through dynamic clustering of data. The adaptive routing algorithm was used to translocate the data into the Sink node. Finally, the design of the HDAR algorithm was achieved. In order to verify the effectiveness of the proposed algorithm, a simulation experiment was carried out. Experimental results show that the HDAR algorithm has a better energy-saving effect, and the survival number of nodes is more than the traditional algorithm. Meanwhile, the applicability is stronger, so this method has a good application prospect.