Routing implementation method for wireless multi-hop chain network

Abstract

The invention relates to the technical field of wireless communication and discloses a routing implementation method for a wireless multi-hop chain network. A chain-shaped or tree-shaped topological structure is constructed by a binary tree form. The topological structure is established by accessing nodes into a system one by one. A special addressing mode with logicality is adopted, so that each communication node in the whole network has a unique logic identifier LID (comprising two domains BID and NID) and each LID is reflected in an IP (Internet Protocol) address. The LID of the system has a certain logicality, i.e. the BIDs of nodes on the same furcation are the same, and the NIDs of the forward nodes are greater than those of the reverse nodes, and thus, by utilizing the rule, a routing forwarding function is convenient to implement. The routing implementation method implements routing on the basis of the wireless multi-hop chain network so as to fulfill the aims of low routing control cost, simplification for a routing list and high speed of grouping forwarded data.

Description

technical field [0001] The invention belongs to the technical field of wireless communication, and relates to a routing realization method of a wireless multi-hop chain network. Background technique [0002] With the continuous development of wireless communication technology, a variety of wireless communication network technologies have been realized in practical applications, such as mobile ad hoc networks, wireless local area networks, wireless mesh networks, wireless cellular networks, etc. From the perspective of network topology, wireless communication networks can be divided into star, such as wireless cellular network; mesh, such as wireless mesh network; cluster, such as some sensor networks, etc., applied to different topology technologies. [0003] Existing wireless communication technologies can meet the needs of regional coverage, but it is difficult to meet the technical requirements of high bandwidth, low cost, and low latency in chain topology application sce...

AI Technical Summary

Problems solved by technology

[0005] (1) Due to the irregular topological structure of the existing wireless communication networks listed above, when using the existing routing method to forward data packets, in order to find a suitable path, the source node often uses flooding. This way of finding a path is very blind, consumes a lot of bandwidth, and increases routing overhead;

[0006] (2) According to the different logical structure of the network, the existing routing method adopts a flat structure and a hierarchical structure. In the flat structure, each node has the same status in the routing function, and its scalability is poor, which limits the network to a certain extent. Scale; the layered structure method is complex to implement, and the routing overhead is high;

[0007] (3) In the existing routing methods, it is usually necessary to establish and maintain global routing information in nodes, which will increase the routing control overhead, increase the complexity of routing, and reduce the effective throughput of the network;

[0008] (4) Most of the existing routing methods adopt the proactive routing method and the reactive routing method. Although the proactive routing method has the characteristics of small delay in finding the route, it will cause a waste of bandwidth resources; although the reactive routing method can Reduce routing overhead and improve network throughput, but it will introduce a large delay in routing lookup

Images