A lightweight routing design method and system suitable for a chain broadband wireless ad hoc network

Abstract

The application 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 node-in configuration packet classifier module, a delay module, a general module, a neighbor list module, a neighbor information manager module, a delay estimator module, a packet queue module, a queue processing module, a MAC receiver module and a MAC transmitter module. The method is to classify and calculate the queuing of delay packet and general packet according to the data frame structure; to regularly update the neighbor list according to the data packet of the adjacent relationship; to estimate the time required for local queue transmission; to queue delay data and general data according to the priority; and to establish a forwarding link. The node of the application automatically completes path planning and queue sorting in real time according to the routing protocol architecture, does not need to be uniformly and centrally dispatched by the upper layer routing, and does not occupy network resources. The method maximally utilizes the node resources on the basis of guaranteeing the communication delay.

Description

TECHNICAL FIELD

[0001] The application belongs to the field of wireless communication, and particularly relates to a lightweight routing design method and system suitable for a chain-shaped broadband wireless ad hoc network. BACKGROUND

[0002] A wireless ad hoc network is a peer-to-peer point-to-point communication network without the establishment of a central base station, and each node can communicate with one or more peer nodes. The wireless ad hoc network is convenient and simple to deploy, and can form a chain type, a star type and a hybrid type network topology according to application scenarios, and can be flexibly applied to power systems, public safety, emergency rescue and other scenarios. However, in the special application scenarios such as monitoring of long-distance high-voltage transmission lines in power systems, the transmission performance of multi-hop ad hoc network end-to-end generally deteriorates sharply with the increase of the number of hops, and the design of a routing protocol is crucial. How to effectively reduce the network routing overhead and improve the communication bandwidth after multi-hop is a hot issue in the industry. The existing scheme is not flexible enough in communication resource allocation, and the routing mechanism is not simple enough, so that the end-to-end service quality cannot be guaranteed. Therefore, a new lightweight routing design method suitable for a chain-shaped broadband wireless ad hoc network is needed to realize high-reliability multi-hop transmission under the constraint of service quality. SUMMARY

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

[0004] The technical solution adopted by the application to achieve the above purpose is: a lightweight routing system suitable for a chain-shaped broadband wireless ad hoc network, which is configured with network nodes and defines a node routing architecture, and includes the following modules:

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

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

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

[0008] A neighbor list module is used to store neighbor node information;

[0009] a neighbor information manager module for periodically updating the neighbor list according to the adjacency relationship data packet;

[0010] a delay estimator module for estimating the time for local queue transmission;

[0011] a data packet queue module for storing data queues;

[0012] a queue processing module for queuing delay data and general data according to priority;

[0013] a MAC receiver module for receiving the adjacency relationship data packet sent by the neighbor node;

[0014] a MAC transmitter module for sending data to the neighbor node according to the neighbor information.

[0015] The data frame structure comprises a data packet type identifier, a source ID, a sequence number, a minimum hop count HCmin from the source node to the destination node, and a total delay cost DTOT.

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

[0017] The delay calculation is based on the neighbor list information to calculate the total delay cost of data transmission 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 transmitted and the last bit being transmitted.

[0018] The neighbor information manager module is periodically updated by deleting the node information in the neighbor list if the HP data of the neighbor node is not received within the time stamp.

[0019] The priority of the delay 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 delay data packet to improve its priority.

[0020] A lightweight routing design method suitable for a chain-shaped broadband wireless ad hoc network, which performs the following steps: the ad hoc network generates a low-delay transmission link:

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

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

[0023] S3, the MAC receiver module receives the adjacent relationship data packet sent by the adjacent node, and the neighbor information manager module regularly updates the neighbor list according to the adjacent relationship data packet;

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

[0025] S5, a queue processing module, used for queuing the delay data and the general data according to the priority and sending to the MAC transmitter module;

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

[0027] The method is used for processing delay-sensitive data and non-sensitive data respectively, forming a new transmission queue, planning a transmission path through a continuously updated neighbor list, and finally realizing the priority transmission of delay-sensitive data and the low-delay transmission of overall data.

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

[0029] 1. The present application aims to provide a lightweight, self-organizing design method in a chain network, in which nodes automatically complete path planning, queue sorting and the like in real time according to a routing protocol architecture, without the unified centralized scheduling by the upper layer routing in the traditional method, and without occupying network resources.

[0030] 2. In the design method, the modular and lightweight design method is adopted considering the computing capacity and response speed of the nodes in the link, so as to maximize the use of node resources on the basis of ensuring communication delay. BRIEF DESCRIPTION OF DRAWINGS

[0031] Figure 1 It is a schematic diagram of the lightweight routing architecture of the system of the present application; DETAILED DESCRIPTION

[0032] In order to make the above-mentioned purposes, features and advantages of the present application more obvious and easy to understand, the technical solutions of the present application will be further described below in combination with examples. In the following description, a large number of specific details are set forth in order to facilitate a full understanding of the present application. However, the present application can be implemented in many other ways different from those described herein, and those skilled in the art can make similar improvements without departing from the spirit of the present application, so the present application is not limited to the specific implementations disclosed below.

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

[0034] Embodiment 1

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

[0036]

[0037] The data frame structure includes a data packet type identifier identifying the data packet type, a source ID of a node generating the data packet, a data packet sequence, a minimum hop count 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 represents that the data packet is a data packet Hello Packets (HP) for verifying and confirming the network adjacency relationship, which is periodically sent; when the identifier is 0x10, it represents that the data is a delay-sensitive data packet Delay-sensitive Packets (DP) with strict end-to-end delay requirements; when the identifier is 0x01 / 0x00, it represents that the data is a general data packet General Packets (GP) without QoS requirements.

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

[0040] 1. First, when receiving the upper layer data, the data is classified and forwarded by the data packet classifier. Among them, the DP data packet is forwarded to the delay module, and the GP data packet is 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, the module calculates the total delay cost of data transmission, finds the optimal transmission path from the source to the destination based on the delay cost, and distributes to the queue processing module in queue. The total delay is defined as the time difference between the first bit of the data packet being transmitted and the last bit being transmitted.

[0043] The general module makes routing decisions for the GP data packet, analyzes the queue state, etc., and distributes to the queue processing module in queue.

[0044] Among them, the 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 periodically broadcasts HP data packet, once the neighbor manager module receives HP data packet from its neighbor, 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 time stamp. Within the time stamp, if the HP data of the neighbor node is not received, the node information is deleted in the neighbor list.

[0050] The neighbor list is updated in real time, which can avoid the stale information update caused by link disconnection.

[0051] 2. After the data processed preliminarily is converged to the queue processing module, the module queues, schedules and forwards the data.

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

[0053] In order to avoid the starvation problem, that is, the GP data packet waits indefinitely, the GP data packet is converted into a DP data packet to improve its priority after a certain time threshold.

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

[0055] Thus, the routing and forwarding protocol is completed.

[0056] Embodiment 2

[0057] The application also provides a lightweight routing design method suitable for chain broadband wireless ad hoc network, which performs the following steps: the ad hoc network generates a low-delay transmission link:

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

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

[0060] S3, the MAC receiver module receives the adjacency relationship data packet sent by the neighbor node, and the neighbor information manager module regularly updates the neighbor list according to the adjacency relationship data packet;

[0061] S4, delay estimator module, used for combining neighbor information list, to-be-sent data packet queue information, estimating time required for local queue transmission;

[0062] S5, queue processing module, queuing delay data and general data according to priority, and sending to MAC transmitter module;

[0063] S6, MAC transmitter module sends data to neighbor nodes according to neighbor information.

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

Claims

1. A lightweight routing system suitable for a chain-based wideband wireless ad hoc network, characterized by, The application discloses a network node configuration method and a network node configuration device. The data packet classifier module is used for classifying and forwarding the upper-layer data packet according to a data frame structure; the data frame structure comprises a data packet type identifier, a source ID, a serial number, a minimum hop count HCmin from a source node to a destination node and a total delay cost DTOT; the data packet type identifier is used for distinguishing data packet types, including delay-sensitive data packets DP, general data packets GP and network adjacency relationship data packets HP; The delay module is used for receiving a delay data packet, performing delay calculation and queuing based on network node information, and distributing data to a queue processing module; the delay calculation is based on neighbor list information, and is used for calculating a total delay cost of data transmission and finding an optimal transmission path from a source to a destination; the total delay is defined as a time difference between when a first bit of the data packet is used for transmission and when a last bit is transmitted; The general module is used for receiving a general data packet, performing routing decision and queuing on the general data packet, and distributing data to the queue processing module; The neighbor list module is used for storing neighbor node information; The neighbor information manager module is used for regularly updating the neighbor list according to the adjacency relationship data packet; The delay estimator module is used for estimating a time required for local queue transmission; The data packet queue module is used for storing a data queue; The queue processing module is used for queuing the delay data packet DP and the general data packet GP according to priorities; the delay data packet DP has a higher priority than the general data packet GP; and when the general data packet GP waits for a preset time, the general data packet GP is converted into the delay data packet DP to improve the priority of the general data packet GP; The MAC receiver module is used for receiving the adjacency relationship data packet sent by a neighbor node; The MAC transmitter module is used for transmitting data to a neighbor node according to neighbor information.

2. The lightweight routing system for chain-based wideband wireless ad hoc network according to claim 1, wherein, The neighbor information manager module regularly updates the neighbor list; if the HP data of the neighbor node is not received within a time stamp, the node information is deleted from the neighbor list.

3. A lightweight routing design method suitable for a chain-based wideband wireless ad hoc network, characterized by, The method is used for processing delay-sensitive data and non-sensitive data respectively, forming a new transmission queue, planning a transmission path through a continuously updated neighbor list, and finally realizing the priority transmission of the delay-sensitive data and the low-delay transmission of the overall data. S1, the data packet classifier module receives the upper-layer data packet, and classifies and forwards the upper-layer data packet according to the data frame structure; S2, the delay module performs delay calculation and queuing based on network node information, and distributes data to the queue processing module; The general module performs routing decision and queuing on the general data packet, and distributes data to the queue processing module; the delay calculation is based on neighbor list information, and is used for calculating a total delay cost of data transmission and finding an optimal transmission path from a source to a destination; the total delay is defined as a time difference between when a first bit of the data packet is used for transmission and when a last bit is transmitted; S3, the MAC receiver module receives the adjacency relationship data packet sent by a neighbor node, and the neighbor information manager module regularly updates the neighbor list according to the adjacency relationship data packet; S4, the delay estimator module estimates a time required for local queue transmission in combination with the neighbor information list and the to-be-sent data packet queue information. S5. A queue processing module queues the delay data packet DP and the general data packet GP according to the priority and sends them to the MAC transmitter module; the delay data packet DP has a higher priority than the general data packet GP; and when the general data packet GP waits for a preset time, it is converted into the delay data packet DP to improve its priority; S6. The MAC transmitter module sends data to the neighbor node according to the neighbor information.

Images