WO2019119346A1 - Method and network device for determining communication path - Google Patents

Abstract

The present application discloses a method and a network device for determining a communication path, used to conserve wireless network resources when a source node does not directly reach a communication path of a destination node, so as to improve reliability and efficiency of wireless data transmission. The method of the present application comprises: a control node obtaining network information of a wireless communication system, wherein the network information comprises a scheduling waiting time and a channel quality between any two routing nodes that can directly perform communication in the wireless communication system; the control node receiving a routing request transmitted by a source node, wherein the routing request comprises addresses of the source node and a destination node, and the source node and the destination node are any two routing nodes that cannot directly perform communication in the wireless communication system; and the control node determining, according to the scheduling waiting time and the channel quality associated with the source node and a target node, a target communication path from the source node to the destination node.

Description

Communication path determination method and network device Technical field

The present application relates to the field of wireless communications technologies, and in particular, to a communication path determining method and a network device.

Background technique

IPv6 over Low-Power Wireless Personal Area Networks (6LoWPAN) is the most widely used IPv6-based short-range wireless communication standard. The 6LoWPAN protocol stack includes: an application layer, a transport layer, an IPv6 network layer, an adaptation layer, a media access control (MAC) layer, and a physical layer related protocol. Mesh-under routing technology is a routing method that uses the MAC address to perform path calculation in the adaptation layer, and transmits the data to the destination node in a multi-hop manner through wireless signals, that is, the data packet is transmitted to the intermediate node through the source node. Then, the intermediate node forwards the data packet to the destination node. There are various routing protocols supporting the above Mesh-under routing technology in the 6LoWPAN protocol stack. Among them, the ad hoc on-demand distance vector routing (AODV) protocol is one of many routing protocols. In the AODV routing protocol, when the source node needs to send data to the destination node in the communication system network, if the source node does not directly reach the route of the destination node, the source node advertises the network layer carrying the active node and the destination node in multicast form. The route request message of the address finds the path from the source node to the target node, and the source node sends data to the destination node through the found path.

In the foregoing AODV routing protocol, when the source node does not directly reach the path of the destination node, the source node needs to send a route request packet to find the path through the multicast mode. The route request packet needs to occupy the wireless network resource, and the search path takes a certain period of time. Therefore, in the case that the source node does not directly reach the path of the destination node, determining the communication path of the source node to the destination node using the above multicast method may cause waste of wireless network resources.

Summary of the invention

The present application provides a communication path determining method and a network device, which are used to save wireless network resources and improve the reliability and efficiency of wireless data transmission when the source node does not directly reach the communication path of the destination node.

In a first aspect, the application provides a communication path determining method, including:

The control node acquires network information of the wireless communication system, where the network information includes scheduling waiting time and channel quality between any two routing nodes that can directly communicate in the wireless communication system;

The control node receives the routing request sent by the source node, where the routing request carries the addresses of the active node and the destination node, and the source node and the destination node are any two nodes in the wireless communication system that cannot directly communicate;

The control node determines the target communication path from the source node to the destination node according to the scheduling wait time and channel quality associated with the source node and the target node.

As can be seen from the above technical methods, the communication path determination method in the present application has the following advantages:

When the source node and the destination node cannot communicate directly, the control node determines the communication path between the routing nodes according to the scheduling waiting time and the channel quality between the source node and the destination node in the communication system network, and it is known that the communication path is determined during the communication path determination process. The wireless network resource is not occupied, so the communication path determining method of the present application can save wireless network resources.

With reference to the first aspect of the present application, in a first implementation manner of the first aspect of the present application, the control node determines, according to a scheduling waiting duration and a channel quality associated with the source node and the target node, After the source node reaches the target communication path of the destination node, the method further includes:

The control node assigns a target path identifier to the target communication path, where the target path identifier is used to uniquely identify the target communication path;

And the control node generates a graph path adding message according to the target communication path and the target path identifier;

Sending, by the control node, the graph path addition message to each routing node on the target communication path;

The control node receives the first type of path confirmation message sent by each routing node on the target communication path, and the first type of picture path confirmation message is used to confirm the picture path addition message.

Assigning a path identifier to the communication path identifies the path, so that the routing node directly searches for the path identifier in the routing table to determine the next hop address, fast jumps, and improves the routing speed when performing the routing next hop. With reference to the first aspect of the present application or the first implementation manner of the first aspect, in the second implementation manner of the first aspect of the application, the acquiring, by the control node, the network information of the wireless communication system includes:

The control node acquires neighbor information of the control node, where neighbor information of the control node includes a scheduling waiting duration of the neighboring node of the control node to the control node, and the control node and the control node The channel quality between the neighbor nodes, the neighbor node of the control node is a node that can directly communicate with the control node, and the network information includes neighbor information of the control node;

The control node acquires neighbor information of the routing node, where the network information includes neighbor information of the routing node.

Each routing node reports the neighbor information to the control node, so that the control node can quickly and accurately know the topology of the entire wireless communication system, thereby determining the communication path according to the scheduling waiting time and the link quality between the routing nodes, thereby saving wireless network resources. With reference to the second implementation manner of the first aspect, in the third implementation manner of the first aspect of the application, the acquiring, by the control node, the neighbor information of the routing node includes:

The control node receives the neighbor report message sent by the routing node, where the neighbor report message carries the neighbor information of the routing node, and the neighbor information of the routing node includes the routing node to the a scheduling waiting duration of a neighboring node of the routing node, and a channel quality between the routing node and a neighboring node of the routing node, the neighboring node of the routing node being a node capable of directly communicating with the routing node;

The control node sends a second type of path confirmation message to the routing node, and the second type of path confirmation message is used to confirm the neighbor report message.

In combination with the first aspect, the first implementation manner of the first aspect, or any implementation manner of the third implementation manner of the first aspect, the control node is configured according to the scheduling related to the source node and the target node After determining the target communication path of the source node to the destination node, the method further includes:

When the one or more routing nodes on the target communication path are not in the working state, the control node sends a path deletion message to the source node, the destination node, and other routing nodes on the communication path, The target path deletion identifier carries the target path identifier, so that the source node, the destination node, and the other routing node delete the target communication path and the target path identifier;

The control node receives a third type of path confirmation message sent by the source node, the destination node, and the other routing node, where the third type of path confirmation message is used to delete the report of the path Confirmation of the text.

By maintaining the path, you can delete the failed path in time, re-determine the new path, avoid different paths, and prevent data transmission or transmission delay. This can improve the reliability and certainty of the wireless communication system.

The second aspect of the present application provides a network device, where the network device has a function of implementing the behavior of the network device in the foregoing first aspect. This function can be implemented in hardware or in hardware by executing the corresponding software. The hardware or software includes one or more modules corresponding to the functions described above.

In a third aspect, an embodiment of the present application provides a network device, including: a processor, a memory, a bus, and a communication interface; the memory is configured to store a computer execution instruction, and the processor is connected to the memory through the bus, when the network device In operation, the processor executes the computer-executable instructions stored by the memory to cause the network device to perform the communication path determining method of any of the above first aspects.

In a fourth aspect, the embodiment of the present application provides a computer readable storage medium, configured to store computer software instructions used by the network device, and when executed on a computer, enable the computer to perform any one of the foregoing first aspects. The communication path determination method of the item.

In a fifth aspect, an embodiment of the present application provides a computer program product comprising instructions, which, when run on a computer, cause the computer to perform the communication path determining method of any of the above first aspects.

In addition, the technical effects brought by the design mode of any one of the second aspect to the fifth aspect can be referred to the technical effects brought by different design modes in the first aspect, and details are not described herein again.

DRAWINGS

1 is a schematic structural diagram of a system for determining a communication path in an embodiment of the present application;

2 is a schematic diagram of a wireless communication system in a method for determining a communication path according to an embodiment of the present application;

3 is a schematic diagram of an embodiment of a method for determining a communication path according to an embodiment of the present application;

4 is a diagram of a relationship between scheduling wait times between routing nodes in an embodiment of the present application;

FIG. 5 is a diagram of a link quality relationship between routing nodes in the embodiment of the present application;

FIG. 6 is a schematic diagram of an embodiment of a network device according to an embodiment of the present application;

FIG. 7 is a schematic diagram of another embodiment of a network device according to an embodiment of the present application;

FIG. 8 is a schematic structural diagram of a hardware of a network device according to an embodiment of the present application.

Detailed ways

The present application provides a communication path determining method and a network device, which are used to save wireless network resources and improve the reliability and efficiency of wireless data transmission when the source node does not directly reach the communication path of the destination node.

The technical solutions in the present application are clearly and completely described in the following with reference to the drawings in the present application. It is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments.

The terms "first", "second", "third", "fourth", etc. (if present) in the specification and claims of the present application and the above figures are used to distinguish similar objects without having to use To describe a specific order or order. It is to be understood that the data so used may be interchanged where appropriate so that the embodiments described herein can be implemented in a sequence other than what is illustrated or described herein. In addition, the terms "comprises" and "comprises" and "the" and "the" are intended to cover a non-exclusive inclusion, for example, a process, method, system, product, or device that comprises a series of steps or units is not necessarily limited to Those steps or units may include other steps or units not explicitly listed or inherent to such processes, methods, products or devices.

The communication path determination method in the present application is mainly applied to an industrial wireless sensor network, and the system architecture of the application is a 6LoWPAN protocol stack. The system architecture is as shown in FIG. 1 , and the 6LoWPAN protocol stack includes: an application layer, a transport layer, and an IPv6 network layer. The relevant protocols of the adaptation layer, MAC layer and physical layer are described as follows:

First, the application layer, the application layer of the 6LoWPAN protocol stack adopts the CoAP protocol, which is a REST-based application layer protocol designed by the IETF working group for resource-constrained networks (such as wireless sensor networks), and supports CoAP client access and operation. Resources included in the CoAP server;

Second, the transport layer, the transport layer of the 6LoWPAN protocol stack supports the UDP protocol, and the 6LoWPAN protocol stack supports both the transmission control protocol (TCP) and the user datagram protocol (UDP) because of limited device resources and TCP. The protocol is more complicated, and the UDP transmission method is mostly used in practical applications, and the [RFC 4944] standard and the latest [RFC 6282] standard both design a compression mechanism for UDP;

Third, IPv6 network layer, the network layer of 6LoWPAN protocol stack adopts standard IP protocol, supports neighbor discovery, internet control message protocol version 6, ICMPv6 and resource reservation;

4. Adaptation layer: The adaptation layer coordinates the difference between the IP layer and the IEEE802.15.4 bottom layer (including the MAC layer and the physical layer). In order to provide support for the IPv6 network layer, it supports the fragment reassembly function and the header compression mechanism.

5. IEEE 802.15.4 MAC layer and physical layer, 6LoWPAN bottom layer supports IEEE802.15.4 standard. The bottom layer of the protocol stack supports time division multiple access (TDMA) and determination according to deterministic, reliable and real-time application requirements. Sexual scheduling.

In the 6LoWPAN protocol stack described above, the Mesh-under routing protocol works at the adaptation layer. For the AODV routing protocol in the Mesh-under routing protocol, using the multicast mode to determine the communication path may cause waste of wireless network resources. In this application, the adaptation layer and the network layer of the 6LoWPAN protocol stack are redesigned, as shown in FIG. 1, the path identifier PATH ID is added in the IPv6 network layer, and the map routing header including the PATH ID in the adaptation layer configuration is used for Data forwarding between routing nodes, and four new ICMPv6 messages are added: graph neighbor report (GNR), graph add report (GAR), and graph delete message. (Graph Delete Report, GDR) and graph path confirm report (GPCR), where GNR is specifically used to report the neighbor node information to the system manager after the node is powered on and the subsequent neighbor nodes. Information update, the neighbor node information may include a message to the node's scheduling waiting time, link quality, and the like; GAR: specifically refers to a message used by the system manager to add a path to each node in the network; GDR: Specifically, a packet used by the system manager to delete a path in the network; GPCR: specifically for a node to receive the GNR, GAR, and GDR three packets to the source node Confirmation message. Through the above design, the present application proposes a centralized scheduling graph routing protocol, which can better optimize the routing in the entire wireless communication network system, and improve the accuracy, reliability and transmission efficiency of data transmission.

For a better understanding of the communication path determining method in the embodiment of the present application, the following describes the communication path determining method in the embodiment of the present application in detail, as follows:

The wireless communication system shown in FIG. 2 includes six routing nodes, which in turn are nodes A, B, C, D, E, and F, wherein node A is the control node that bears the system manager in the wireless communication system. Function, Node B, C, D, and E are the nodes that undertake the route forwarding function, and Node F is the node that does not have the route forwarding function.

The communication path determination method in the present application will be described in detail by taking the wireless communication system shown in FIG. 2 as an example.

As shown in FIG. 3, an embodiment of the method for determining a communication path in the embodiment of the present application includes:

301. The control node acquires network information in the wireless communication system.

The network information includes scheduling waiting time and channel quality between any two directly communicating nodes in the wireless communication system, and two nodes that can communicate directly are called neighbor nodes, and the network information includes: neighbor information and routing of the controlling node. Neighbor information of the node.

Optionally, the acquiring, by the control node, the network information of the wireless communication system includes: the control node acquires the neighbor information of the control node, and the control node acquires the neighbor information of the other routing node, where the neighbor information of the control node includes the neighbor of the control node to the control node. The scheduling wait time of the node and the channel quality between the control node and the neighbor node of the control node. The neighbor information of the routing node includes the scheduling waiting duration of the neighboring nodes of the other routing nodes to the routing node, and the neighbor nodes of the routing node and the routing node. Channel quality between.

Optionally, the acquiring, by the control node, the neighbor information of the other routing node includes: the control node receiving the neighbor report message sent by the routing node, where the neighbor report message carries the neighbor information of the routing node.

When the control node obtains the map neighbor report message sent by the routing node, the control node sends a second type of picture acknowledgement message to the routing node, and the second type of picture acknowledgement message is used to confirm the picture neighbor report message.

Optionally, a possible frame format of the neighbor report message in the foregoing figure is: a report neighbor information sequence number GNRSequence maintained by the node, a node capability Node Capacity, a long address enable flag Long Address Enable, and a short address enable flag. Short Address Enable, reserved flag bit option Flag, reserved bit Reserved, reporting node's own link layer address Source Address, neighbor node description item Option.

In the case that each routing node has not yet established a communication path after power-on, the control node sets a default route for the routing node that cannot directly communicate with the control node, so that the routing node sends the graph neighbor report to the control node through the default route. The message reports neighbor information. The default route may be a neighbor node with the best link quality detected by the routing node as the default router, and the direct communication path of the routing node to the default router is used as the default path. The default route for each node is assigned the same route identifier as PATH ID=0xFFFF.

Taking the wireless communication system shown in FIG. 2 as an example: the node A obtains the neighbor information of the neighbor node B and the node C of the node A through the neighbor discovery function, and the description of the IPv6 network layer is as described above. The neighbor transmission function is in the IPv6 network layer. A basic function. The neighbor information obtained by node A is shown in Table 1 below:

Table 1

Node address	Scheduling wait time	Link quality
B	30	0.9
C	10	0.8

Among them, the link quality between nodes is a normalized result, 1 is the best, 0 is the worst, and the scheduling waiting time is in milliseconds ms. The scheduling waiting time mentioned below is in ms. This will not be repeated here.

The neighbor information maps of Node B, C, D, E, and F obtained by the neighbor discovery function are shown in Table 2 to Table 6 below:

Table 2

Node address	Scheduling wait time	Link quality	Is it the default router?
A	60	0.8	Yes
C	20	0.6	no
D	80	0.8	no
F	50	0.9	no

Table 2 above is the routing information of the Node B. Although the node F has the highest link quality, the node F is the leaf router and does not assume the routing function. Therefore, the node A is used as the default router.

table 3

Node address	Scheduling wait time	Link quality	Is it the default router?
A	10	0.9	Yes
B	30	0.6	no
E	40	0.7	no

Table 4

Node address	Scheduling wait time	Link quality	Is it the default router?
B	40	0.8	no
C	30	0.7	no
E	60	0.9	Yes

table 5

Node address	Scheduling wait time	Link quality	Is it the default router?
C	30	0.7	Yes
D	50	0.9	no

Table 6

Node address	Scheduling wait time	Link quality	Is it the default router?
B	70	0.9	Yes

Table 3 is the neighbor information of the node C, Table 4 is the neighbor information of the node D, Table 5 is the neighbor information of the node E, and Table 6 is the neighbor information of the node F.

According to the neighbor information acquired by each node, the node A can obtain the scheduling time relationship diagram between the nodes as shown in FIG. 4 and the link quality relationship diagram between the nodes shown in FIG. 5.

Taking the node D as the power-on preparation to access the wireless communication system shown in FIG. 2 as an example, it is assumed that a communication path is established between other nodes except the node D. At this time, the node D acquires the For the neighbor information shown in Table 4, the node D will encapsulate the information of the three neighboring nodes B, C, and E in the neighbor node description item Option in the frame format of the neighbor report packet, because the current node D routes. The table is empty and there is no path information. In this case, the path ID of the graph routing header is set to 0xFFFF, indicating that the route has not been established yet. The default route is used, and the D node sends the packet to its default router E.

When receiving the packet from D, the E-node will know that the packet is sent to node A by analyzing the destination address in the routing header. However, the Path ID field of the routing header is 0xFFFF, indicating that the default route is used. At this time, node E searches for its own routing table with A as the destination address, and selects the next hop of the path with A as the destination address as the next hop of the packet. In this way, the D neighbor report message will be forwarded to the A node.

302. The control node receives a routing request sent by the source node.

The control node receives the routing request sent by the source node, where the routing request carries the addresses of the active node and the destination node, and is used to request the control node to allocate a communication path between the source node and the destination node, where the source node and the destination node It is a node that cannot communicate directly.

In other words, the source node and the destination node are not in direct communication with each other's neighbor nodes, and the control node must assign a communication path to it so that the source node can send data to the destination node. It can be understood that the communication path is the direction. Sex, for the same pair of source and destination nodes, the communication path from the source node to the destination node, and the communication path from the destination node to the source node are determined by the control node, and whether the two paths are forwarded through the same routing node. Directly inevitable contact.

Taking Figure 2 as an example, node A needs to send data to node D. At this time, node A will add a path from A to D. If nodes B, C, D, E, and F need to send data to other nodes that cannot communicate directly. At this time, it is necessary to send a routing request as described above to the node A.

303. The control node determines a target communication path from the source node to the destination node according to a scheduling waiting duration and a channel quality associated with the source node and the destination node.

The control node first determines a plurality of communication paths from the source node to the destination node according to the scheduling waiting time and channel quality associated with the source node and the destination node in the network information, and then calculates the weight of each path, and the one with the largest weight. The path is determined as the target path.

A possible weight calculation method is as follows: first, normalize the scheduling waiting time and link quality to obtain a normalized value, and secondly, subtract 1 to normalize the scheduling waiting time. The value is then added to the normalized value of the link quality to get the weight of each path.

Taking the path from node A to node D in Figure 2 as an example: First, node A determines that the three alternative paths of nodes A to D are: path one A->C->D, path two A->B->D, Path three A->C->E->D; according to the above weight calculation method, the weights of the three paths are obtained, and finally the path A->C->D is taken as the target communication path from node A to node D according to the weight. .

Optionally, in the communication path determining process, in addition to considering the foregoing scheduling waiting time length and link quality, the remaining energy of the node may be used as an indicator to determine the communication path, so that the remaining energy value is not low. The path corresponding to the node of the preset threshold is used as the target communication path.

Taking the path one, the path two and the path three of the above node A to the node D as an example, if the control node knows that the remaining power of the node C is insufficient, the control node takes the path two A->B->D as the target communication path.

Optionally, in the process of determining the communication path, the foregoing two factors of determining the scheduling waiting duration and the link quality are used as the basis for determining the target communication path, where the request is sent in the routing request of the source node, if the routing request is in the routing request. Path requirements are prioritized for their path requirements.

Taking path 1, path 2, and path 3 of node A to node D as an example, if there is a packet request that must be forwarded by node E in the route request, node A can only path three A->C->E- >D The destination communication path from node A to node D.

304. The control node allocates a target path identifier to the target communication path.

After the control node determines the target communication path in the above step 303, the control node assigns a path identifier to the target communication path between the source node and the destination node, and the path identifier is a unique target communication path identifying the source node to the destination node.

Optionally, the control node generates a graph addition message GAR carrying the target communication path and the target path identifier, and the control node notifies the routing information of the foregoing graph to the routing nodes on the target communication path, and further, the routing node receives After the message sent by the control node adds the message, the routing node replies to the control node with the first type of picture acknowledgement message to confirm the added message of the above figure, and the routing node adds the target communication path and the target path identifier in the picture increase message. Go to the routing table for routing forwarding.

When the source node performs data transmission, the source node writes the target path identifier into the packet header of the data packet, so that each routing node can directly forward the data according to the target road strength identifier.

Optionally, a possible frame format of the message GAR added in the foregoing figure is: an added path sequence number GARSequence, a reserved bit Reserved, and a path information Option maintained by the system manager.

Taking the path A->C->D described in the above step 303 as an example: after adding the routing table for itself, the node A constructs a graph to add a path message GAR to the node C, regarding A->C- The path information of the >D is loaded in the path information Option in the format of the added message frame described above. The contents of the path information Option are as follows:

Table 7

Path ID	Destination address	Original address	Next hop address
0x01FF	D	A	C

After receiving the path message, the node C adds the content of the path information Option to the routing table of the node C. Thus, the path establishment process of A->C->D is completed. If A needs to send a data packet to D, node C constructs a map routing header in the adaptation layer, and finds its own routing table, and then A->C->D path The Path ID is added to the graph routing header of the packet, and the corresponding next hop address is selected as its next hop. When routing node C searches for the route, it searches the routing table according to the Path ID to select the next hop address. Path ID It remains unchanged during the transfer.

It should be noted that in a wireless network system, a system may allocate multiple paths between two nodes. For example, the path A->C->D and path A-> may be simultaneously allocated between node A and node D. B->D.

Optionally, the method in this embodiment further includes: when one or more routing nodes on the target communication path are not in the working state, the control node sends the deletion message to the source node, the destination node, and other routing nodes on the communication path, The target deletion path carries the target path identifier, so that the source node, the destination node, and other routing nodes delete the target communication path and the target path identifier.

The control node receives the third type of path confirmation message picture confirmation message sent by the source node, the destination node, and other routing nodes, and the third type of path confirmation message picture confirmation message is used to delete the message picture deletion report of the picture path. Confirmation of the text.

Optionally, one possible frame format of the GDR deletion message in the above figure is: a deletion path sequence number GDRSequence maintained by the system manager, a reserved flag bit option Flag, and an undefined option Option.

The path maintenance process in the embodiment of the present application is described by taking the above A->C->D path as an example:

Taking node C failure as an example, if node B checks that node C is unreachable, node B sends a graph neighbor report message to node A to report the event. Since node C belongs to the dropped state, when constructing the neighbor description Option for node C, the "O" flag will be set to 0 to indicate that this is a dropped report. After receiving the neighbor report message sent by the node B, the node A knows that the node C has been dropped. At this time, the node A will find all the paths related to the node C, and send the map deletion path message GDR to each node on the relevant path. The figure delete path message contains the path ID of the path to be deleted. After the path is deleted, the node A needs to recalculate the path for the affected node, and then sends the routing message to the relevant node through the graph.

If node D also detects that node C is unreachable before the path is repaired, it will also perform the same reporting as node B. The only difference is that if there is only one path to the node A in the routing table of the node C, the neighbor report packet cannot be sent to the node A through the route of the graph. In this case, the same process as when the power is turned on must be repeated. This is done by selecting the default router.

Optionally, a possible picture path confirmation message GPCR frame format is: an event type, a sequence sequence of the acknowledgement message, a confirmed state, an undefined option Option, and an undefined option Option; When the event type is a neighbor report event, the path confirmation message obtained according to the GPCR frame format is the second type path confirmation message; when the event type is a path increase event, according to the GPCR frame format. The obtained path confirmation message is the first type of path confirmation message; when the event type is the picture path deletion event, the picture path confirmation message obtained according to the GPCR frame format is the third type of path. Confirm the message.

The graph routing header corresponding to the foregoing neighbor report message, the map add message, and the picture delete message includes: an event type description value and a path identifier PATH ID, wherein, in the graph routing header of the graph neighbor report message: an event The type description value refers to the graph neighbor report event. In the graph routing header of the graph, the event type description value refers to the graph path increment event. In the graph routing header of the graph delete message: the event type description value refers to The map path deletes the event.

In this embodiment, when the source node and the destination node cannot directly communicate with each other, the control node determines the communication path between the routing nodes according to the scheduling waiting time and the channel quality between the source node and the destination node in the communication system network, and it is known that In the process of determining the communication path, the wireless network resources are not occupied. Therefore, the communication path determining method of the present application can save wireless network resources.

In order to make the 6LoWPAN standard applicable to the industrial application environment and meet the deterministic scheduling requirements, the protocol stack adaptation layer and the network layer are redesigned. In order to realize the centralized control 6LoWPAN Mesh-under diagram routing protocol, the adaptation layer header is added. Figure routing header, adding 4 new ICMPv6 messages at the network layer. The routing protocol needs to implement a similar system manager function on the aggregation node or the border router, and uses centralized control to manage the entire network route, which can better optimize the entire network routing, improve the determinism, reliability, and transmission efficiency of data transmission. .

As shown in FIG. 6 , a network device in the embodiment of the present application, where the network device is a control node, includes:

The obtaining module 601 is configured to acquire network information of the wireless communication system, where the network information includes scheduling waiting duration and channel quality between any two routing nodes that can directly communicate in the wireless communication system;

The receiving module 602 is configured to receive a routing request sent by the source node, where the routing request carries an address of the active node and the destination node, where the source node and the destination node are any two routing nodes in the wireless communication system that cannot directly communicate;

The determining module 603 is configured to determine a target communication path of the source node to the destination node according to a scheduling waiting duration and a channel quality associated with the source node and the target node.

In the first example, as shown in FIG. 7, the network device further includes:

An allocating module 704, configured to allocate a target path identifier for the target communication path, where the target path identifier is used to uniquely identify the target communication path;

a generating module 705, configured to generate a message according to the target communication path and the target path identifier;

The sending module 706 is configured to send the graph addition message to each routing node on the target communication path;

The receiving module 702 is further configured to:

The first type of picture acknowledgement message sent by each routing node on the target communication path is received, and the first type of picture acknowledgement message is used to confirm the picture added message.

In the second example, the obtaining module 701 is specifically configured to:

Obtaining neighbor information of the control node, the neighbor information of the control node includes a scheduling waiting duration of the neighbor node of the control node to the control node, and a channel quality between the control node and the neighbor node of the control node, and the neighbor node of the control node is capable of a node that directly controls communication of the node, and the network information includes neighbor information of the control node;

Obtain neighbor information of the routing node, where the network information includes neighbor information of the routing node. In conjunction with the second example above, in a third example, the receiving module 702 is further configured to:

Receiving the neighbor report message sent by the routing node, where the neighbor report message carries the neighbor information of the routing node, and the neighbor information of the routing node includes the scheduling waiting time of the neighboring node of the routing node to the routing node, and the routing node and the routing node. The channel quality between the neighbor nodes, and the neighbor nodes of the routing node are nodes that can directly communicate with the routing node;

The sending module 706 is further configured to:

The second type of picture acknowledgement message is sent to the routing node, and the second type of picture acknowledgement message is used to confirm the picture neighbor report message.

In combination with the network device shown in FIG. 6 and the network device of any one of the first to third examples, in the fourth example, the sending module 706 is further configured to:

When the one or more routing nodes on the target communication path are not in the working state, the image deletion message is sent to the source node, the destination node, and the other routing nodes on the communication path, and the deleted message carries the target path identifier, so that The source node, the destination node, and other routing nodes delete the target communication path and the target path identifier;

The Receive Mode 702 block is also used to:

The third type of picture confirmation message sent by the source node, the destination node, and other routing nodes is received, and the third type of picture confirmation message is used to confirm the picture deletion message.

For other descriptions of the network device in this embodiment, refer to the related description of the control node in the embodiment corresponding to FIG. 3 above, and details are not described herein again. The beneficial effects of the network device in this embodiment are similar to those in the embodiment corresponding to FIG. 3 above, and details are not described herein again.

FIG. 8 is a schematic diagram of a hardware structure of a network device in the embodiment of the present application, where the network device 80 includes:

The main control board 801, the switching network board 803, the two interface boards are 802 and 804 respectively, and the connection relationship between the four boards is as shown in FIG. 8;

The interface boards 802 and 804 each include: a central processing unit, a forwarding entry storage, a physical interface card, and a network processor;

The forwarding entry storage is used to store the routing table, the physical interface card slot is used to connect with other external devices, the network processor is used to process the data received by the physical interface card, and the central processor is used to store the forwarding entry in the memory. The routing table performs the routing forwarding function and controls the network processor to perform corresponding processing operations.

In addition, the network device 80 is also used to perform the operations of the control node in the embodiment corresponding to FIG. 3 under the coordinated control of the main control board, the central processing unit, and the network processor. For detailed operations, refer to the implementation of FIG. 3 above. The related description of the example section is not described here.

The embodiment of the present application further provides a computer storage medium for storing computer software instructions used by the network device 90, and when the computer is running on the computer, the computer can execute the communication path determining method performed by the network device 90. . The storage medium may be specifically the foregoing forwarding entry storage.

The embodiment of the present application further provides a computer program product comprising instructions, when executed on a computer, to enable a computer to execute a communication path determining method performed by the network device.

In the above embodiments, it may be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented in software, it may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, the processes or functions described in accordance with the present application are generated in whole or in part. The computer can be a general purpose computer, a special purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer readable storage medium or transferred from one computer readable storage medium to another computer readable storage medium, for example, the computer instructions can be from a website site, computer, server or data center Transmission to another website site, computer, server or data center via wired (eg coaxial cable, fiber optic, digital subscriber line (DSL)) or wireless (eg infrared, wireless, microwave, etc.). The computer readable storage medium can be any available media that can be stored by a computer or a data storage device such as a server, data center, or the like that includes one or more available media. The usable medium may be a magnetic medium (eg, a floppy disk, a hard disk, a magnetic tape), an optical medium (eg, a DVD), or a semiconductor medium (eg, a solid state disk (SSD)) or the like.

A person skilled in the art can clearly understand that for the convenience and brevity of the description, the specific working process of the system, the device and the unit described above can refer to the corresponding process in the foregoing method embodiment, and details are not described herein again.

In the several embodiments provided by the present application, it should be understood that the disclosed system, apparatus, and method may be implemented in other manners. For example, the device embodiments described above are merely illustrative. For example, the division of the unit is only a logical function division. In actual implementation, there may be another division manner, for example, multiple units or components may be combined or Can be integrated into another system, or some features can be ignored or not executed. In addition, the mutual coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection through some interface, device or unit, and may be in an electrical, mechanical or other form.

The units described as separate components may or may not be physically separate, and the components displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of the embodiment.

In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above integrated unit can be implemented in the form of hardware or in the form of a software functional unit.

The integrated unit, if implemented in the form of a software functional unit and sold or used as a standalone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application, in essence or the contribution to the prior art, or all or part of the technical solution may be embodied in the form of a software product stored in a storage medium. A number of instructions are included to cause a computer device (which may be a personal computer, server, or network device, etc.) to perform all or part of the steps of the methods described in various embodiments of the present application. The foregoing storage medium includes: a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk, and the like, which can store program code. .

The above embodiments are only used to explain the technical solutions of the present application, and are not limited thereto; although the present application has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that they can still The technical solutions described in the embodiments are modified, or some of the technical features are equivalently replaced; and the modifications or substitutions do not deviate from the technical solutions of the embodiments of the present application.

Claims (13)

1. A communication path determining method, comprising:

   The control node acquires network information of the wireless communication system, where the network information includes scheduling waiting time and channel quality between any two nodes in the wireless communication system that can directly communicate;

   Receiving, by the control node, a routing request sent by the source node, where the routing request carries an address of the source node and the destination node, where the source node and the destination node are any that cannot be directly communicated in the wireless communication system. Two nodes;

   The control node determines a target communication path of the source node to the destination node according to a scheduling waiting duration and a channel quality associated with the source node and the target node.
2. The method according to claim 1, wherein the control node determines a target of the source node to the destination node according to a scheduling waiting duration and a channel quality associated with the source node and the target node. After the communication path, the method further includes:

   The control node assigns a target path identifier to the target communication path, where the target path identifier is used to uniquely identify the target communication path;

   The control node generates a map adding message according to the target communication path and the target path identifier;

   Sending, by the control node, the picture addition message to each routing node on the target communication path;

   The control node receives the first type of picture acknowledgement message sent by each routing node on the target communication path, and the first type of picture acknowledgement message is used to confirm the picture added message.
3. The method according to claim 1 or 2, wherein the acquiring, by the control node, the network information of the wireless communication system comprises:

   The control node acquires neighbor information of the control node, where the neighbor information of the control node includes a scheduling waiting duration of the neighboring node of the control node to the control node, and the control node and the control node a channel quality between the neighbor nodes, the neighbor node of the control node is a node that can directly communicate with the control node, and the network information includes neighbor information of the control node;

   The control node acquires neighbor information of the routing node, where the network information includes neighbor information of the routing node.
4. The method according to claim 3, wherein the obtaining, by the control node, the neighbor information of the routing node comprises:

   The control node receives the neighbor report message sent by the routing node, where the neighbor report message carries the neighbor information of the routing node, and the neighbor information of the routing node includes the routing node to the a scheduling waiting duration of a neighboring node of the routing node, and a channel quality between the routing node and a neighboring node of the routing node, the neighboring node of the routing node being a node capable of directly communicating with the routing node;

   The control node sends a second type of picture acknowledgement message to the routing node, and the second type of picture acknowledgement message is used to confirm the picture neighbor report message.
5. The method according to any one of claims 1 to 4, wherein the control node determines that the source node is based on a scheduling waiting time and channel quality associated with the source node and the target node After the target communication path of the destination node, the method further includes:

   When the one or more routing nodes on the target communication path are not in the working state, the control node sends a map deletion message to the source node, the destination node, and other routing nodes on the communication path. The target deletion path carries the target path identifier, so that the source node, the destination node, and the other routing node delete the target communication path and the target path identifier;

   The control node receives a third type of picture confirmation message sent by the source node, the destination node, and the other routing node, and the third type of picture confirmation message is used to confirm the picture deletion message. .
6. A network device, wherein the network device is a control node, and includes:

   An acquiring module, configured to acquire network information of a wireless communication system, where the network information includes scheduling waiting duration and channel quality between any two nodes in the wireless communication system that can directly communicate;

   a receiving module, configured to receive a routing request sent by the source node, where the routing request carries an address of the source node and the destination node, where the source node and the destination node are incapable of directly communicating in the wireless communication system Any two nodes;

   And a determining module, configured to determine a target communication path of the source node to the destination node according to a scheduling waiting duration and a channel quality associated with the source node and the target node.
7. The device according to claim 6, wherein the network device further comprises:

   An allocating module, configured to allocate a target path identifier for the target communication path, where the target path identifier is used to uniquely identify the target communication path;

   a generating module, configured to generate a message according to the target communication path and the target path identifier;

   a sending module, configured to send the graph addition message to each routing node on the target communication path;

   The receiving module is further configured to:

   And receiving a first type of picture acknowledgement message sent by each routing node on the target communication path, where the first type of picture acknowledgement message is used to confirm the added message of the figure.
8. The device according to claim 6 or 7, wherein the obtaining module is specifically configured to:

   Obtaining neighbor information of the control node, where neighbor information of the control node includes a scheduling waiting duration of the neighboring node of the control node to the control node, and between the control node and a neighbor node of the control node Channel quality, the neighbor node of the control node is a node that can directly communicate with the control node, and the network information includes neighbor information of the control node;

   Obtaining neighbor information of the routing node, where the network information includes neighbor information of the routing node.
9. The device according to claim 8, wherein the receiving module is further configured to:

   And receiving the neighbor report message sent by the routing node, where the neighbor report message carries the neighbor information of the routing node, and the neighbor information of the routing node includes the neighbor of the routing node to the routing node. a scheduling waiting duration of the node, and a channel quality between the routing node and the neighboring node of the routing node, the neighboring node of the routing node being a node capable of directly communicating with the routing node;

   The sending module is further configured to:

   Sending a second type of picture confirmation message to the routing node, where the second type of picture confirmation message is used to confirm the picture neighbor report message.
10. The device according to any one of claims 6 to 9, wherein the sending module is further configured to:

    When the one or more routing nodes on the target communication path are not in the working state, sending a delete message to the source node, the destination node, and other routing nodes on the communication path, where the map deletes the report. The target path identifier is carried in the text, so that the source node, the destination node, and the other routing node delete the target communication path and the target path identifier;

    The receiving module is further configured to:

    Receiving a third type of picture confirmation message sent by the source node, the destination node, and the other routing node, where the third type of picture confirmation message is used to confirm the picture deletion message.
11. A network device, wherein the network device is a control node, and includes:

    Receiver, transmitter, memory, bus, and processor;

    The bus for connecting the receiver, the transmitter, the memory, and the processor;

    The memory is configured to store an operation instruction;

    The processor is configured to perform the operations of any one of the preceding claims 1 to 5 by calling the operation instruction.
12. A computer readable storage medium for storing computer instructions that, when run on a computer, cause the computer to perform the communication path of any one of claims 1 to 5 Determine the method.
13. A computer program product, comprising computer instructions that, when run on a computer, cause the computer to perform the communication path determining method of any one of claims 1 to 5.

Images