|
|
Reliable and efficient routing of wireless sensors and actuator networks |
QI Xiao-gang1, WANG Zhen-yu1, LIU Li-fang2, LIU Xing-cheng1, MA Jiu-long1 |
1. School of Mathematics and Statistics, Xidian University, Xi'an 710126, China;
2. School of Computing, Xidian University, Xi'an 710071, China |
|
|
Abstract A fault-tolerant, real-time, efficient and reliable prior route FRER was designed based on the Kautz graph in order to solve the problem of real-time in current wireless sensor and actuator network as well as the dynamic problem in industrial wireless environment. The method only uses node IDs rather than routing table. The shortest path from the target node can be found quickly according to the matching length of the node IDs. When nodes fail, upstream node can quickly find the shortest path of the remaining nodes by matching its ID and target node ID instead of reselecting the path. Considering the diversity of path, not limited to Kautz topology, neighbor node information was utilized to expand the diversity of paths in the network. Link availability based history information was used to combine multipath considering link failure in order to guarantee the availability of routing path with the acceptable levels of network. The experimental results show that FRER is superior to both of them with respect to real-time, fault-tolerance and reliability performance compared to REFER and Debruijn graph.
|
Received: 03 June 2017
Published: 11 October 2018
|
|
无线传感器和执行器网络可靠高效路由
针对当前的无线传感器与执行器网络(WSAN)技术缺乏实时性能以及工业无线环境的动态性问题,基于Kautz图设计容错、实时、高效、可靠的先验式路由FRER,不需要维持路由表,只利用节点IDs,根据节点IDs的匹配长度快速找到目标节点的最短路径.当节点故障时,不需要进行路径重挑,根据自身ID与目标节点ID的匹配,上一跳节点能够快速找到剩余节点的最短路径.考虑路径的多样性,不局限于Kautz拓扑,利用邻居节点信息拓展网络中路径的多样性.考虑链路故障,基于链路可用性历史信息组合多路径,保证在链路故障情况下网络维持可接受水平的路由路径可用性.实验结果表明,与REFER和Debruijn图相比,FRER在实时性、容错性和可靠性性能上优于两者.
|
|
[1] CHACZKO Z, CHIU C, ASLANZADEH S, et al. Software infrastructure for wireless sensor and actuator networks[C]//Proceedings of the 21st International Conference on Systems Engineering (ICSEng). Las Vegas:IEEE, 2011:474-479.
[2] ZHU J, ZOU Y, ZHENG B. Physical-layer security and reliability challenges for industrial wireless sensor networks[J]. IEEE Access, 2017, 5(99):5313-5320.
[3] ZENG Y, LI D, VASILAKOS A V. Real-time data report and task execution in wireless sensor and actuator networks using self-aware mobile actuators[J]. Computer Communications, 2013, 36(9):988-997.
[4] LU C, SAIFULLAH A, LI B, et al. Real-time wireless sensor-actuator networks for industrial cyber-physical systems[J]. Proceedings of the IEEE, 2016, 104(5):1013-1024.
[5] NATH S, BANIK S, SEAL A, et al. Optimizing MANET routing in AODV:an hybridization approach of ACO and firefly algorithm[C]//20162nd International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN). Kolkata:IEEE, 2016:122-127.
[6] BAKHT H. A comparative study of MAODDP with ZRP and DSR routing protocols for mobile AD-HOC network[J]. Computer Science and Telecommunications, 2016, 1(47):64-68.
[7] NIU J, CHENG L, GU Y, et al. R3E:Reliable reactive routing enhancement for wireless sensor networks[J]. IEEE Transactions on Industrial Informatics, 2014, 10(1):784-794.
[8] PRADITTASNEE L, CAMTEPE S, TIAN Y C. Efficient route update and maintenance for reliable routing in large-scale sensor networks[J]. IEEE Transactions on Industrial Informatics, 2017, 13(1):144-156.
[9] SEPULCRE M, GOZALVEZ J, COLL-PERALES B. Multipath QoS-driven routing protocol for industrial wireless networks[J]. Journal of Network and Computer Applications, 2016, 8(74):121-132.
[10] LI Z, SHEN H. A QoS-oriented distributed routing protocol for hybrid wireless networks[J]. IEEE Transactions on Mobile Computing, 2014, 13(3):693-708.
[11] LI D, LU X, WU J, et al. A scalable constant degree and low congestion DHT scheme based on Kautz[C]//IEEE Conference on Computation Communication. Miami:IEEE, 2005:1677-1688.
[12] FABREGA J, MARTÍ-FARRÉ J, MUNOZ X. Layer structure of DeBruijn and Kautz digraphs:an application to deflection routing[J]. Electronic Notes in Discrete Mathematics, 2016, 9(54):157-162.
[13] GUO D, LIU Y, KI X. Bake:a balanced kautz tree structure for peer-to-peer networks[C]//The 27th Conference on Computer Communications. Phoenix:IEEE, 2008:351-355.
[14] ZUO K, HU D, WANG H, et al. An efficient clustering scheme in mobile peer-to-peer networks[C]//International Conference International Conference on Information Networking. Busan, South Korea:IEEE, 2008:1-5.
[15] RAVIKUMAR C P, RAI T, VERMA V. Kautz graphs as attractive logical topologies in multihop lightwave networks[J]. Elsevier Science, 1997, 20(14):1259-1270.
[16] CHIANG W K, CHEN R J. Distributed fault-tolerant routing in Kautz networks[J]. Parallel Distributed Computing, 1994, 6(20):99-106.
[17] SHEN H, LI Z. A Kautz-based wireless sensor and actuator network for real-time, fault-tolerant and energy-efficient transmission[J]. IEEE Transactions on Mobile Computing, 2016, 15(1):1-16.
[18] 刘盛云. 基于Kautz图的数据中心网络拓扑结构研究[D]. 长沙:国防科学技术大学, 2010:1-67. LIU Sheng-yun. Research on the topology of Kautz based data centers network[D]. Changsha:National University of Defense Technology, 2010:1-67.
[19] GROSS J L, YELLEN J. Graph theory and its applications[M].[S. 1.]:CRC, 2005:1-767. |
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
|
Shared |
|
|
|
|
|
Discussed |
|
|
|
|