自组织网络数据传输最短路径路由算法仿真

Simulation of Shortest Path Routing Algorithm for Self-Organized Network Data Transmission

已有路由算法未利用容积Kalman滤波补偿数据传输时延,导致获取传输最短路径过程中出现节点能量消耗高、时间开销大、网络寿命低、输出幅值大问题。为解决以上问题,提出自组织网络数据低时延传输最短路径路由算法。构建自组织传输信道模型,通过容积Kalman滤波方法补偿数据传输时延。基于控制结果,利用DSPR算法完成网络的路由节点部署。利用Dijkstra算法计算路由节点,从而实现自组织网络数据低时延传输最短路径的获取。实验结果表明,利用所提算法获取数据传输最短路径时,网络节点能量消耗低、时间开销小、网络寿命高、输出幅值低。

The existing algorithms fail to use the cubature Kalman filter to compensate for data transmission delay, resulting in high node energy consumption, high time overhead, short network life and large output amplitude in the process of searching for the shortest transmission path. In order to solve the above problems, this paper presents a shortest path routing algorithm for low delay data transmission in a self-organizing network. Firstly, a self-organizing transmission channel model was constructed, and then the data transmission delay was compensated by the cubature Kalman filtering method. Based on control results, the DSPR algorithm was used to complete the deployment of network routing nodes. Moreover, Dijkstra algorithm was adopted to calculate the routing nodes, and thus to obtain the shortest path. Experimental results show that the proposed algorithm can achieve the low energy consumption of network nodes, low time overhead, long network lifetime and low output amplitude.