Lightweight routing design method and system suitable for chain broadband wireless ad hoc network

Abstract

The invention discloses a lightweight routing design method and system suitable for a chain broadband wireless ad hoc network. The system comprises a configuration network node, a definition node routing architecture, a data packet classifier module configured in the node, a delay module, a general module, a neighbor list module, a neighbor information manager module, a delay estimator module, a data packet queue module, a queue processing module, an MAC receiver module and an MAC transmitter module. The method comprises the following steps: calculating queues of delay data packets and general data packets according to data frame structure classification; regularly updating a neighbor list according to the data packets of the adjacency relationship; estimating the time required by local queue transmission; and queuing the delay data and the general data according to the priority, and establishing a forwarding link. According to the invention, the nodes automatically complete path planning and queue ordering in real time according to a routing protocol architecture, unified and centralized scheduling by an upper-layer route is not needed, and network resources are not occupied. According to the method, node resources are utilized to the greatest extent on the basis of ensuring communication delay.

Description

Technical Field

[0001] The present invention belongs to the field of wireless communications, and in particular relates to a lightweight routing design method and system suitable for a chain-like broadband wireless ad hoc network. Background Art

[0002] A wireless ad hoc network is a peer-to-peer communication network. There is no need to establish a central base station. Each node can communicate with one or more peer nodes. The deployment of wireless ad hoc networks is convenient and simple. It can form chain, star and hybrid network topologies according to the application scenario. It can be flexibly applied to various scenarios such as power systems, public safety, emergency rescue, etc. However, in special application scenarios such as ultra-long-distance high-voltage transmission line monitoring in power systems, there is a common problem that the end-to-end transmission performance of multi-hop ad hoc networks deteriorates sharply with the increase in the number of hops. The design of routing protocols is crucial. How to effectively reduce network routing overhead and increase the communication bandwidth after multiple hops is a hot issue of concern in the industry. The existing solutions are not flexible enough in the allocation of communication resources and the routing mechanism is not simple enough, so the end-to-end service quality cannot be guaranteed. Therefore, it is necessary to propose a new lightweight routing design method suitable for chain-shaped broadband wireless ad hoc networks to achieve highly reliable multi-hop transmission under service quality constraints. Summary of the invention

[0003] Aiming at the time-sensitive problem in broadband wireless networks, the present invention proposes a lightweight routing design method and system suitable for chain-like broadband wireless ad hoc networks. The protocol processes delay-sensitive data and non-sensitive data separately to form a new transmission queue, plans the transmission path through a continuously updated neighbor list, and ultimately realizes the priority transmission of delay-sensitive data and the low-latency transmission of overall data.

[0004] The technical solution adopted by the present invention to achieve the above-mentioned purpose is: a lightweight routing system suitable for a chain-like broadband wireless ad hoc network, configuring network nodes and defining a node routing architecture, including the following modules:

[0005] The data packet classifier module is used to classify and forward upper layer data packets according to the data frame structure;

[0006] The delay module is used to receive delayed data packets, perform delay calculation and queuing based on network node information, and distribute data to the queue processing module;

[0007] The general module is used to receive general data packets, make routing decisions and queue the general data packets, and distribute the data to the queue processing module;

[0008] Neighbor list module, used to store neighbor node information;

[0009] A neighbor information manager module, used for periodically updating a neighbor list based on adjacency data packets;

[0010] A delay estimator module, used to estimate the time taken for local queue transmission;

[0011] A data packet queue module, used for storing data queues;

[0012] A queue processing module is used to queue delayed data and general data according to priority;

[0013] MAC receiver module, used for receiving adjacency relationship data packets sent by neighboring nodes;

[0014] The MAC transmitter module is used to send data to neighbor nodes according to neighbor information.

[0015] The data frame structure includes: a data packet type identifier, a source ID, a sequence number, a minimum number of hops HCmin from a source node to a destination node, and a total delay cost DTOT.

[0016] The data packet type identifier is used to distinguish data packet types: delay-sensitive data packet DP, general data packet GP, network adjacency data packet HP.

[0017] The delay calculation is to calculate the total delay cost of data transmission based on the neighbor list information and find the optimal transmission path from the source to the destination; the total delay is defined as the time difference between the first bit of the data packet being used for transmission and the last bit being transmitted.

[0018] The neighbor information manager module is regularly updated to delete the node information from the neighbor list if the HP data of the neighbor node is not received within the timestamp.

[0019] The priority of the delayed data is higher than that of the general data; and when the general data packet waits for a preset time, it is converted into a delayed data packet to improve its priority.

[0020] A lightweight routing design method suitable for a chain-like broadband wireless ad hoc network is provided, wherein the ad hoc network generates a low-latency transmission link by performing the following steps:

[0021] S1, the data packet classifier module receives the upper layer data packets, and classifies and forwards the upper layer data packets according to the data frame structure;

[0022] S2, the delay module performs delay calculation queuing based on network node information and distributes data to the queue processing module; the general module performs routing decision queuing for general data packets and distributes data to the queue processing module;

[0023] S3, the MAC receiver module receives the adjacency relationship data packets sent by the neighboring nodes, and the neighbor information manager module periodically updates the neighbor list according to the adjacency relationship data packets;

[0024] S4, a delay estimator module, used to estimate the time required for local queue transmission by combining the neighbor information list and the queue information of the data packets to be sent;

[0025] S5, the queue processing module queues the delayed data and the general data according to the priority and sends them to the MAC transmitter module;

[0026] S6. The MAC transmitter module sends data to the neighbor node according to the neighbor information.

[0027] The method is used to process delay-sensitive data and non-sensitive data separately to form a new transmission queue, plan the transmission path through a continuously updated neighbor list, and ultimately achieve priority transmission of delay-sensitive data and low-latency transmission of overall data.

[0028] The present invention has the following beneficial effects and advantages:

[0029] 1. The purpose of the present invention is to propose a design method for a lightweight, self-organizing network in a chain network, in which nodes automatically complete path planning, queue sorting, etc. in real time according to the routing protocol architecture, without the need for centralized scheduling by the upper-level routing in the traditional method, and without occupying network resources.

[0030] 2. When designing the method, the computing power and response speed of the nodes in the link were taken into consideration, and a modular and lightweight design method was adopted to ensure the maximum utilization of node resources while ensuring communication delay. BRIEF DESCRIPTION OF THE DRAWINGS

[0031] Figure 1 A schematic diagram of a lightweight routing architecture of the system of the present invention; DETAILED DESCRIPTION

[0032] In order to make the above-mentioned objects, features and advantages of the present invention more obvious and easy to understand, the technical scheme of the present invention is further described below with reference to examples. In the following description, many specific details are set forth to facilitate a full understanding of the present invention. However, the present invention can be implemented in many other ways different from those described herein, and those skilled in the art can make similar improvements without violating the connotation of the invention, so the present invention is not limited by the specific implementation disclosed below.

[0033] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as those commonly understood by those skilled in the art of the present invention. The terms used in the specification of the invention herein are only for the purpose of describing specific embodiments and are not intended to limit the present invention.

[0034] Example 1

[0035] The overall architecture adopts modular design, mainly including data classifier, delay module, neighbor information manager, general module and queue processing module. The agreed data frame structure is as follows:

[0036]

[0037] The data frame structure includes a packet type identifier that identifies the packet type, a source ID of the node that generates the packet, a packet sequence, a minimum number of hops HCmin from the source node to the destination, and a total delay cost DTOT.

[0038] Among them, the data packet type identifier is divided into three categories, defined as follows: when the identifier is 0x11, it indicates that the data packet is a Hello Packets (HP) used to verify and confirm network adjacency, which is sent periodically; when the identifier is 0x10, it indicates that the data is a Delay-sensitive Packets (DP) with strict end-to-end delay requirements; when the identifier is 0x01 / 0x00, it indicates that the data is a General Packets (GP) without QoS requirements.

[0039] The data transmission process under the lightweight path protocol is as follows:

[0040] 1. First, when receiving upper layer data, the data is classified and forwarded by the packet classifier. Among them, DP packets are forwarded to the delay module and GP packets are forwarded to the general module.

[0041] Among them, the delay module calculates the delay of the DP data packet based on the network node information.

[0042] Based on the neighbor list information, this module calculates the total delay cost of data transmission, finds the optimal transmission path from source to destination based on the delay cost, and queues and distributes it to the queue processing module. The total delay is defined as the time difference between the first bit of the data packet being used for transmission and the last bit being transmitted.

[0043] The general module makes routing decisions for GP packets, analyzes queue status, etc., and queues and distributes them to the queue processing module.

[0044] Among them, network node information, as one of the important reference information of the transmission path, is managed by the neighbor node information manager module, and the neighbor information manager module is mainly used to build and maintain the neighbor list.

[0045] The specific method of building and maintaining the neighbor list is as follows:

[0046] Each node broadcasts HP packets periodically, and once the neighbor manager module receives HP packets from its neighbors, it will be used to update (add / delete / modify) the neighbor list.

[0047] The agreed neighbor list has the following format:

[0048]

[0049] Wherein, Tstanmp is a timestamp. If no HP data of a neighbor node is received within the timestamp, the node information is deleted from the neighbor list.

[0050] Real-time updating of neighbor lists can avoid updating of stale information that may be caused by link disconnection.

[0051] 2. After the data has been initially processed, it is gathered in the queue processing module, which then queues, schedules and forwards the data.

[0052] The priority-based queuing algorithm forwards the data packets waiting in the scheduling queue to the MAC transmitter, gives higher priority to delay-sensitive packets DP, and if there are no DP packets, only general packets are used for transmission.

[0053] To avoid the starvation problem, where GP packets wait indefinitely, after a certain time threshold, GP packets are converted to DP packets to increase their priority.

[0054] 3. Finally, the data transmitter sends the corresponding data packet to the corresponding node according to the calculated optimal transmission path based on the neighbor information.

[0055] This completes the routing forwarding protocol.

[0056] Example 2

[0057] The present invention also provides a lightweight routing design method applicable to a chain-like broadband wireless ad hoc network, which performs the following steps to generate a low-latency transmission link in the ad hoc network:

[0058] S1, the data packet classifier module receives the upper layer data packets, and classifies and forwards the upper layer data packets according to the data frame structure;

[0059] S2, the delay module performs delay calculation queuing based on network node information and distributes data to the queue processing module; the general module performs routing decision queuing for general data packets and distributes data to the queue processing module;

[0060] S3, the MAC receiver module receives the adjacency relationship data packets sent by the neighboring nodes, and the neighbor information manager module periodically updates the neighbor list according to the adjacency relationship data packets;

[0061] S4, a delay estimator module, used to estimate the time required for local queue transmission by combining the neighbor information list and the queue information of the data packets to be sent;

[0062] S5, the queue processing module queues the delayed data and the general data according to the priority and sends them to the MAC transmitter module;

[0063] S6. The MAC transmitter module sends data to the neighbor node according to the neighbor information.

[0064] The embodiments described in the above description will help those skilled in the art to further understand the present invention, but do not limit the present invention in any form. It should be noted that, for those of ordinary skill in the art, several changes and improvements can be made without departing from the concept of the present invention. These all belong to the protection scope of the present invention.

Claims

1. A lightweight routing system suitable for a chain-like broadband wireless ad hoc network, characterized in that: Configure network nodes and define node routing architecture, including the following modules: The data packet classifier module is used to classify and forward upper layer data packets according to the data frame structure; The delay module is used to receive delayed data packets, perform delay calculation and queuing based on network node information, and distribute data to the queue processing module; The general module is used to receive general data packets, make routing decisions and queue the general data packets, and distribute the data to the queue processing module; Neighbor list module, used to store neighbor node information; A neighbor information manager module, used for periodically updating a neighbor list based on adjacency data packets; A delay estimator module, used to estimate the time taken for local queue transmission; A data packet queue module, used for storing data queues; A queue processing module is used to queue delayed data and general data according to priority; MAC receiver module, used for receiving adjacency relationship data packets sent by neighboring nodes; The MAC transmitter module is used to send data to neighbor nodes according to neighbor information.

2. A lightweight routing system suitable for a chain-like broadband wireless ad hoc network according to claim 1, characterized in that: The data frame structure includes: a data packet type identifier, a source ID, a sequence number, a minimum number of hops HCmin from a source node to a destination node, and a total delay cost DTOT.

3. A lightweight routing system suitable for a chain-like broadband wireless ad hoc network according to claim 1, characterized in that: The data packet type identifier is used to distinguish data packet types: delay-sensitive data packet DP, general data packet GP, network adjacency data packet HP.

4. A lightweight routing system suitable for a chain-like broadband wireless ad hoc network according to claim 1, characterized in that: The delay calculation is to calculate the total delay cost of data transmission based on the neighbor list information and find the optimal transmission path from the source to the destination; the total delay is defined as the time difference between the first bit of the data packet being used for transmission and the last bit being transmitted.

5. The lightweight routing system suitable for a chain-like broadband wireless ad hoc network according to claim 1, characterized in that: The neighbor information manager module is regularly updated to delete the node information from the neighbor list if the HP data of the neighbor node is not received within the timestamp.

6. A lightweight routing system suitable for a chain-like broadband wireless ad hoc network according to claim 1, characterized in that: The priority of the delayed data is higher than that of the general data; and when the general data packet waits for a preset time, it is converted into a delayed data packet to improve its priority.

7. A lightweight routing design method suitable for a chain-like broadband wireless ad hoc network, characterized in that: Perform the following steps to generate a low-latency transmission link in an ad hoc network: S1, the data packet classifier module receives the upper layer data packets, and classifies and forwards the upper layer data packets according to the data frame structure; S2, the delay module performs delay calculation queuing based on network node information and distributes data to the queue processing module; the general module performs routing decision queuing for general data packets and distributes data to the queue processing module; S3, the MAC receiver module receives the adjacency relationship data packets sent by the neighboring nodes, and the neighbor information manager module periodically updates the neighbor list according to the adjacency relationship data packets; S4, a delay estimator module, used to estimate the time required for local queue transmission by combining the neighbor information list and the queue information of the data packets to be sent; S5, the queue processing module queues the delayed data and the general data according to the priority and sends them to the MAC transmitter module; S6. The MAC transmitter module sends data to the neighbor node according to the neighbor information.

8. A lightweight routing design method suitable for a chain-like broadband wireless ad hoc network according to claim 7, characterized in that: The method is used to process delay-sensitive data and non-sensitive data separately to form a new transmission queue, plan the transmission path through a continuously updated neighbor list, and ultimately achieve priority transmission of delay-sensitive data and low-latency transmission of overall data.

Images