Multipath QoS routing algorithm based on Ad Hoc network in mine environment
-
摘要: 为提高矿山环境下数据传输的完整性和准确性,提出了一种基于Ad Hoc网络的多路径QoS路由算法。该算法将区块链引入路由建立过程中,首先对节点进行区块化封装,使各节点利用Merkle tree维护其邻居节点;然后根据邻居节点的时间延迟和存活时间更新路径生存活力并进行区块连接;最后依次以中间节点相关性数值之和、路径长度、路径形成先后顺序作为路径选择标准,筛选数据传输主路径和备选路径。通过3个方面对路由进行维护:① 由于采用区块链使得每个节点均保留其邻居节点的信息,可通过查询路径出现断裂处的上一个节点的路由表,使用相邻节点替代,进而恢复路由。② 在主路径的可靠性评估下降到一定程度后即可启用备选路径。③ 在源节点处重新发起路由查找。仿真结果表明,在不同的节点数、数据包发送速率、节点移动速度情况下,该算法相比AODV,DSR算法具有较低的误码率和较好的路径生存能力。Abstract: In order to improve the integrity and accuracy of data transmission in mine environment, a multipath QoS routing algorithm based on Ad Hoc network is proposed. The algorithm introduces the blockchain into the routing establishment process. Firstly, the nodes are block encapsulated so that each node uses the Merkle tree to maintain its neighbor nodes. Secondly, the path viability is updated according to the time delay and viability time of the neighbor nodes and the blocks are connected. Finally, the sum of intermediate node correlation values, path length and path formation sequence are used as path selection criteria in turn to filter the main and alternative paths for data transmission. The routing is maintained from three aspects as follows. ① The blockchain is applied so that each node retains the information of its neighbor nodes. The routing can be restored by querying the routing table of the previous node where the path is broken and using the neighbor nodes for substitution. ② After the reliability assessment of the main path drops to a certain level, the alternate path can be enabled. ③ The algorithm re-initiates routing querying at the source node. The simulation results show that compared with AODV, the DSR algorithm has a lower bit error rate and better path viability under different number of nodes, data packet transmission rate and node movement speed.
-
Key words:
- mine data transmission /
- wireless data transmission /
- multipath QoS routing /
- Ad Hoc network /
- blockchai
点击查看大图
计量
- 文章访问数: 103
- HTML全文浏览量: 10
- PDF下载量: 5
- 被引次数: 0