Systems Engineering and Electronics ›› 2018, Vol. 40 ›› Issue (5): 1135-1141.doi: 10.3969/j.issn.1001-506X.2018.05.27

Previous Articles     Next Articles

Highly-efficient routing repair algorithm based on loop-free for LLN

YAO Yukun, LIU Jiangbing, LI Xiaoyong, REN Zhi   

  1. Key Laboratory of Mobile Communications Technology of Chongqing, Chongqing University of Posts and Telecommunications, Chongqing 400065, China
  • Online:2018-04-28 Published:2018-04-25

Abstract:

To deal with the problems that the existing routing repair algorithms in low power and lossy networks (LLNs) have the control overhead redundancy, large recovery latency and routing loops, a highly-efficient loop-free based repair routing protocol for LLN(HLR-RPL) is proposed. This algorithm mainly carries out three optimization schemes. Firstly, it adopts a new destination oriented directed acyclic graph (DODAG) information solicitation amend (DIS-A) which makes the process of link interruption notification and the process of path finding carried out simultaneously. Secondly, a mechanism of reducing the control overhead is proposed to avoid all the nodes reply the DODAG information object message when receiving a DIS-A message. Finally, a sub-nodes switching mechanism of the link broken node is proposed which optimizes the network topology. The simulation results show that HLR-RPL outperforms the existing routing repair algorithms in terms of control overhead and routing recovery latency. In addition, it can avoid the routing loops thoroughly.

[an error occurred while processing this directive]