文献类型：期刊文献

英文题名：A hybrid multi-path routing algorithm for industrial wireless mesh networks

作者：Zuo, Yun[1,2];Ling, Zhihao[1,2];Yuan, Yifeng[1,2]

机构：[1]E China Univ Sci & Technol, Sch Informat Sci & Engn, Shanghai 200237, Peoples R China;[2]E China Univ Sci & Technol, Minist Educ, Key Lab Adv Control & Optimizat Chem Proc, Shanghai 200237, Peoples R China

年份：2013

卷号：2013

期号：1

外文期刊名：EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING

收录：;EI(收录号：20132216374105);WOS:【SCI-EXPANDED(收录号:WOS:000330237300004)】；

基金：This study was supported by the National High Technology Research and Development Program of China (863 Program) under Grant no. 2011AA040103 and a grant from the Shanghai Leading Academic Discipline Project, China (no.B504).

语种：英文

外文关键词：Multi-path routing; Industrial wireless mesh networks; Enhanced Dijkstra's algorithm; Ant colony optimization algorithm

摘要：Multi-path routing, a routing technique that enables data transmission over multiple paths, is an effective strategy in achieving reliability in wireless sensor networks. However, multi-path routing does not guarantee deterministic transmission. This is because more than one path is available for transferring data from the source node to the destination node. A hybrid multi-path routing algorithm is proposed for industrial wireless mesh networks for improving reliability and determinacy of data transmission, as well as to effectively deal with link failures. The proposed algorithm adopts the enhanced Dijkstra's algorithm for searching the shortest route from the gateway to each end node for first route setup. A virtual pheromone distinct from the regular pheromone is introduced to realize pheromone diffusion and updating. In this way, multiple routes are searched based on the ant colony optimization algorithm. The routes used for data transmission are selected based on their regular pheromone values, facilitating the delivery of data through better routes. Link failures are then handled using route maintenance mechanism. Simulation results demonstrate that the proposed algorithm outperforms traditional algorithms in terms of average end-to-end delay, packet delivery ratio, and routing overhead; moreover, it has a strong capacity to cope with topological changes, thereby making it more suitable for industrial wireless mesh networks.