Centralized routing algorithm in wireless Mesh network

Abstract

The invention discloses a centralized routing algorithm in a wireless Mesh network. The centralized routing algorithm comprises the four stages of initial root route setting-up, link state information uploading, path selecting and grouping forwarding, and route self-healing. A mode of calculating routes in a centralized mode through a root node is adopted for finishing finding paths, nodes upload the link state information to the root node, the root node masters whole-network topology, and a route between a source node and a target node which are to communicate is calculated; after the initial link state is uploaded, all the nodes upload the link state information only when the link state changes and exceeds a certain threshold value or the neighbor nodes change, and the link state information is prevented from being uploaded frequently; after the root node calculates to obtain the optimal path, a backup path which does not intersect with the optimal path can be obtained only by deleting the nodes on the path in the original network topology and recalculating the optimal path. According to the centralized routing algorithm, flooding in the path finding process is avoided, the routing overhead is small, and reliability is high.

Description

technical field [0001] The invention relates to the technical field of wireless Mesh networks, in particular to a centralized routing algorithm in the wireless Mesh network. Background technique [0002] Wireless Mesh network is a multi-hop broadband wireless network structure with self-organization and self-healing characteristics. Compared with traditional networks, it can provide greater convenience, stronger reliability, better adaptability to changing network conditions and provide optimized network performance. [0003] Such as figure 1 as shown, figure 1 The basic architecture of the wireless Mesh network defined for IEEE802.11s, the network consists of backbone Mesh nodes (MAP / MP), gateway nodes MPP (Mesh Portal Point) and terminal STAs, MP (Mesh point) is a wireless Mesh network with A node with relay forwarding capability, MAP (Mesh Access Point) adds access function on the basis of MP. Usually, the mobility of the backbone Mesh nodes is weak, and the MPP of th...

AI Technical Summary

Problems solved by technology

[0005] (1) When the source node does not have a route to the destination node, the broadcast pathfinding process is initiated, and the routing overhead is relatively large;

[0006] (2) A broadcast pathfinding process between the source node and the destination node can only establish one path. When the path fails, the broadcast pathfinding process needs to be re-initiated. During the pathfinding process, the data packet loss is serious;

[0009] (1) All Mesh nodes in the network periodically broadcast routing request messages to other wireless nodes in the wireless mesh network. The routing overhead is large and it is easy to cause network congestion;

[0010] (2) In the process of maintaining the route to the source node in this patent, two paths to the source node must be maintained. These two paths may be intersecting paths, and there is a possibility of failure at the same time

[0012] (1) In this routing method, a tree-like routing with the gateway node as the root node is established, which will cause a traffic bottleneck at the gateway node;

[0013] (2) The routes established in this routing method are all single-path routes, and the reliability is poor

Existing wireless Mesh network routing algorithms generally adopt a distributed routing method. This distributed routing method ensures the reliability of the network, but it leads to problems such as pathfinding flooding.

Especially in the scenario where the network load is heavy, it further increases the burden on the network and affects the performance of the network

Images