{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T05:37:56Z","timestamp":1772257076225,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,3,20]],"date-time":"2013-03-20T00:00:00Z","timestamp":1363737600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Wireless Com Network"],"published-print":{"date-parts":[[2013,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>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\u2019s 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.<\/jats:p>","DOI":"10.1186\/1687-1499-2013-82","type":"journal-article","created":{"date-parts":[[2013,3,20]],"date-time":"2013-03-20T13:29:50Z","timestamp":1363786190000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["A hybrid multi-path routing algorithm for industrial wireless mesh networks"],"prefix":"10.1186","volume":"2013","author":[{"given":"Yun","family":"Zuo","sequence":"first","affiliation":[]},{"given":"Zhihao","family":"Ling","sequence":"additional","affiliation":[]},{"given":"Yifeng","family":"Yuan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,3,20]]},"reference":[{"key":"623_CR1","volume-title":"HART7 Overview and Summary (Technical Documentation)","author":"HART Communication Foundation","year":"2007","unstructured":"HART Communication Foundation: HART7 Overview and Summary (Technical Documentation). Austin; 2007."},{"key":"623_CR2","volume-title":"ACM SIGCOMM Computer Communication Review","author":"CE Perkins","year":"1994","unstructured":"Perkins CE, Bhagwat P: Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. ACM SIGCOMM Computer Communication Review 1994. 24 (4), 234\u2013244"},{"key":"623_CR3","volume-title":"Proceedings of IEEE Workshop on Mobile Computing Systems and Applications (WMCSA\u2019 99)","author":"CE Perkins","year":"1999","unstructured":"Perkins CE, Royer EM: Ad hoc on-demand distance vector routing. In Proceedings of IEEE Workshop on Mobile Computing Systems and Applications (WMCSA\u2019 99). New Orleans; \u2009. 25\u201326 February 1999, pp. 90\u2013100"},{"key":"623_CR4","first-page":"221","volume-title":"Ad Hoc Networking","author":"ZJ Haas","year":"2001","unstructured":"Haas ZJ, Pearlman MR: The zone routing protocol: a hybrid framework for routing in ad hoc networks. In Ad Hoc Networking. Edited by: Perkins CE. Addison-Wesley: Reading, MA; 2001:221-254."},{"issue":"4","key":"623_CR5","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1023\/A:1011426611520","volume":"6","author":"A Nasipuri","year":"2001","unstructured":"Nasipuri A, Castaneda R, Das SR: Performance of multipath routing for on-demand protocols in mobile ad hoc networks. Mob. Netw. Appl. 2001, 6(4):339-349. 10.1023\/A:1011426611520","journal-title":"Mob. Netw. Appl"},{"key":"623_CR6","volume-title":"Proceedings of IEEE International Conference on Communications","author":"SJ Lee","year":"2001","unstructured":"Lee SJ, Gerla M: Split multipath routing with maximally disjoint paths in ad hoc networks. Proceedings of IEEE International Conference on Communications ICC 2001. vol. 10, Helsinki, 11\u201314, June 2001, pp. 3201\u20133205"},{"key":"623_CR7","volume-title":"Proceedings of Ninth International Conference on Network Protocols","author":"MK Marina","year":"2001","unstructured":"Marina MK, Das SR: On-demand multipath distance vector routing in ad hoc networks. Proceedings of Ninth International Conference on Network Protocols ICNP 2001. California, 11\u201314 November 2001, pp. 14\u201323"},{"issue":"3","key":"623_CR8","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.adhoc.2004.03.009","volume":"2","author":"E Gelenbe","year":"2004","unstructured":"Gelenbe E, Lent R: Power-aware ad hoc cognitive packet networks. Ad Hoc Netw. 2004, 2(3):205-216. 10.1016\/j.adhoc.2004.03.009","journal-title":"Ad Hoc Netw"},{"key":"623_CR9","first-page":"804","volume":"6","author":"E Gelenbe","year":"2004","unstructured":"Gelenbe E: Cognitive Packet Network. US Patent 2004, 6: 804-201B1.","journal-title":"US Patent"},{"issue":"6","key":"623_CR10","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1016\/S1389-1286(01)00253-5","volume":"37","author":"E Gelenbe","year":"2001","unstructured":"Gelenbe E, Lent R, Xu ZG: Measurement and performance of a cognitive packet networks. Comput. Netw. 2001, 37(6):691-701. 10.1016\/S1389-1286(01)00253-5","journal-title":"Comput. Netw"},{"issue":"5","key":"623_CR11","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1155\/WCN.2005.743","volume":"2005","author":"Q Qu","year":"2005","unstructured":"Qu Q, Pei Y, Modestino JW, Tian XS, Wang B: Cross-layer QoS control for video communications over wireless ad hoc networks. EURASIP J. Wirel. Commun. Netw. 2005, 2005(5):743-756.","journal-title":"EURASIP J. Wirel. Commun. Netw"},{"key":"623_CR12","doi-asserted-by":"crossref","unstructured":"Bagula AB, Mazandu KG: Energy constrained multipath routing in wireless sensor networks. Lecture Notes in Computer Science (LNCS) vol 5061, ed. by FE Sandnes et al. (UIC, 2008), pp. 453\u2013467","DOI":"10.1007\/978-3-540-69293-5_36"},{"issue":"1","key":"623_CR13","first-page":"466","volume":"8","author":"SR Heikalabad","year":"2011","unstructured":"Heikalabad SR, Rasouli H, Nematy F, Rahmani N: QEMPAR: QoS and energy aware multi-path routing algorithm for real-time applications in wireless sensor networks. Int. J. Comput. Sci. Issues 2011, 8(1):466-471.","journal-title":"Int. J. Comput. Sci. Issues"},{"key":"623_CR14","unstructured":"HART Communication Foundation: Network Management Specification. Technical Documentation, Austin, 2007"},{"issue":"1","key":"623_CR15","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW: A note on two problems in connexion with graphs. Numer. Math. 1959, 1(1):269-271. 10.1007\/BF01386390","journal-title":"Numer. Math"},{"issue":"1","key":"623_CR16","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/CI-M.2006.248054","volume":"4","author":"M Dorigo","year":"2006","unstructured":"Dorigo M, Birattari M, Stutzle T: Ant colony optimization-artificial ants as a computational intelligence technique. IEEE Comput. Intell. Mag. 2006, 4(1):28-39.","journal-title":"IEEE Comput. Intell. Mag"},{"key":"623_CR17","doi-asserted-by":"crossref","unstructured":"Lu Y, Zhao GZ, Su FJ: Adaptive ant-based dynamic routing algorithm. Proceedings of 5th World Congress on Intelligent Control and Automation (WCICA 2004) vol. 3, Hangzhou, 15\u201319 June 2004, pp. 2694\u20132697","DOI":"10.1109\/WCICA.2004.1342087"},{"key":"623_CR18","unstructured":"Gunes M, Sorges U, Bouazizi I: ARA\u2014the ant-colony based routing algorithm for MANETs. Proceedings of the International Conference on Parallel Processing Workshops (ICPPW02) Vancouver, 20\u201323 August 2002, pp. 79\u201385"},{"key":"623_CR19","volume-title":"Proceedings of the Second Annual Conference on Wireless On-demand Network Systems and Services (WONS 2005)","author":"F Ducatelle","year":"2005","unstructured":"Ducatelle F, Di Caro GA, Gambardella LM: Ant agents for hybrid multipath routing in mobile ad hoc networks. Proceedings of the Second Annual Conference on Wireless On-demand Network Systems and Services (WONS 2005) \u2009. St Moritz, 19\u201321 January 2005, pp. 44\u201353"},{"issue":"7","key":"623_CR20","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/1538788.1538809","volume":"52","author":"E Gelenbe","year":"2009","unstructured":"Gelenbe E: Steps toward self-aware networks. Commun. ACM 2009, 52(7):66-75. 10.1145\/1538788.1538809","journal-title":"Commun. ACM"},{"key":"623_CR21","first-page":"323","volume-title":"Lecture Notes in Computer Science (LNCS)","author":"G Koh","year":"2003","unstructured":"Koh G, Oh D, Woo H: A graph-based approach to compute multiple paths in mobile ad hoc networks. Lecture Notes in Computer Science (LNCS) vol. 2713 (171), ed. by C-W Chung et al. (HSI, 2003), pp. 323\u2013331"},{"issue":"2","key":"623_CR22","first-page":"169","volume":"5","author":"F Ducatelle","year":"2005","unstructured":"Ducatelle F, Di Caro GA, Gambardella LM: Using ant agents to combine reactive and proactive strategies for routing in mobile ad hoc networks. Int. J. Comput. Intell. Appl. (Special Issue on Nature-Inspired Approaches to Networks and Telecommunications) 2005, 5(2):169-184.","journal-title":"Int. J. Comput. Intell. Appl. (Special Issue on Nature-Inspired Approaches to Networks and Telecommunications)"},{"issue":"3","key":"623_CR23","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"ML Fredman","year":"1987","unstructured":"Fredman ML, Tarjan RE: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 1987, 34(3):596-615. 10.1145\/28869.28874","journal-title":"J. ACM"},{"key":"623_CR24","volume-title":"Reinforcement Learning: An Introduction","author":"RS Sutton","year":"1998","unstructured":"Sutton RS, Barto AG: Reinforcement Learning: An Introduction. Cambridge, MA: MIT Press; 1998."},{"issue":"1","key":"623_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10287-003-0004-3","volume":"1","author":"E Gelenbe","year":"2003","unstructured":"Gelenbe E: Sensible decisions based on QoS. Comput. Manag. Sci. 2003, 1(1):1-14.","journal-title":"Comput. Manag. Sci"},{"issue":"11","key":"623_CR26","first-page":"2450","volume":"20","author":"HW Liang","year":"2007","unstructured":"Liang HW, Chen WM, Li S, Mei T, Meng QH: ACO-based routing algorithm for wireless sensor networks (ARAWSN). Chin. J. Sensors Actuators 2007, 20(11):2450-2455.","journal-title":"Chin. J. Sensors Actuators"}],"container-title":["EURASIP Journal on Wireless Communications and Networking"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1687-1499-2013-82.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/1687-1499-2013-82\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/1687-1499-2013-82.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T01:09:13Z","timestamp":1745975353000},"score":1,"resource":{"primary":{"URL":"https:\/\/jwcn-eurasipjournals.springeropen.com\/articles\/10.1186\/1687-1499-2013-82"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,20]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["623"],"URL":"https:\/\/doi.org\/10.1186\/1687-1499-2013-82","relation":{},"ISSN":["1687-1499"],"issn-type":[{"value":"1687-1499","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,20]]},"assertion":[{"value":"27 July 2011","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 February 2013","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 March 2013","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"82"}}