A Routing Fault Recovery Method Based on Link Quality Update in Wireless Local Area Networks

A wireless local area network and link quality technology, applied in the field of route fault recovery based on link quality update, can solve the problems of difficult network performance, affecting the rapid update of routing policies, slow network convergence, etc. The effect of recovery and quick troubleshooting of faulty nodes

CN104618945BInactive Publication Date: 2018-05-01刘乃安 +1
6 Cites 0 Cited by

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Publication Date
2018-05-01
Estimated Expiration
Not applicable · inactive patent

Smart Images

  • Figure 1
    Figure 1
  • Figure 2
    Figure 2
  • Figure 3
    Figure 3
Patent Text Reader

Abstract

The invention discloses a link quality updating based route failure recovery method in WLAN. The method is characterized by comprising following contents: increasing the broadcasting frequency by shortening Hello packet broadcasting interval; accelerating source node list updating by reducing cleaning time interval; improving the link quality RQ value and improving the convergence rate. By the aid of the method, by combining shortening of the Hello packet broadcasting interval to increase the broadcasting frequency, the routing table updating interval and the RQ value optimizing strategy, the network re-convergence time during node failures is shortened, and the network robustness is further enhanced.
Need to check novelty before this filing date? Find Prior Art

Description

technical field

[0001] The invention belongs to the technical field of communication networks, and in particular relates to a route fault recovery method based on link quality update in a wireless local area network. Background technique

[0002] The L2MPM (Layer 2Mesh Protocol for Mobile Layer 2 MESH protocol) routing protocol works at the data link layer and is a priori routing protocol. The basic idea of ​​the L2MPM routing protocol is to find the best neighbor node on the corresponding path for the destination node among all single-hop reachable neighbor nodes of the source node, and use the best neighbor node as the next hop node in the data forwarding process, while There is no need to calculate and determine the topology and routing information of the entire network. The basis for determining the best neighbor node is the link quality, which determines the speed of network establishment and update and the performance of the network.

[0003] The data packets communi...

Examples

Embodiment 1

[0050] The invention provides a new routing convergence strategy to realize the restoration of routing faults in time. Due to transmission link quality and external interference, data packets continue to lose packets during transmission. According to the calculation improvement of the RQ value of Hello after packet loss in the present invention, the routing path with serious packet loss can be quickly eliminated, and the receiver’s communication can be avoided. damaged.

[0051] Such as figure 1 As shown, among them, all hosts A, B, C, and D in the network have two network cards responsible for link transmission, so there are two transmission paths from host A to host C, which are: A0-B1-B2-C1 And A1-D1-D2-C2, if a serious packet loss occurs on the link from A1 to C2, if the RQ value of the lost Hello packet is set to 0, and the 0 value will be filtered when calculating the RQ value, you need to wait until the packet is lost The deterioration of the link can only be found wh...