[go: up one dir, main page]

WO2019119346A1 - Procédé et dispositif de réseau pour déterminer un trajet de communication - Google Patents

Procédé et dispositif de réseau pour déterminer un trajet de communication Download PDF

Info

Publication number
WO2019119346A1
WO2019119346A1 PCT/CN2017/117717 CN2017117717W WO2019119346A1 WO 2019119346 A1 WO2019119346 A1 WO 2019119346A1 CN 2017117717 W CN2017117717 W CN 2017117717W WO 2019119346 A1 WO2019119346 A1 WO 2019119346A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
routing
target
communication path
path
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/CN2017/117717
Other languages
English (en)
Chinese (zh)
Inventor
刘培
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to CN201780038263.3A priority Critical patent/CN110178410A/zh
Priority to PCT/CN2017/117717 priority patent/WO2019119346A1/fr
Publication of WO2019119346A1 publication Critical patent/WO2019119346A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks

Definitions

  • the present application relates to the field of wireless communications technologies, and in particular, to a communication path determining method and a network device.
  • 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.
  • the ad hoc on-demand distance vector routing (AODV) protocol is one of many routing protocols.
  • 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.
  • the source node 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.
  • 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 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.
  • the communication path determination method in the present application has the following advantages:
  • 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.
  • 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;
  • control node generates a graph path adding message according to the target communication path and the target path identifier
  • 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.
  • 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.
  • 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.
  • 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:
  • the control node 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • FIG. 1 is a schematic structural diagram of a system for determining a communication path in an embodiment of the present application
  • FIG. 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
  • FIG. 3 is a schematic diagram of an embodiment of a method for determining a communication path according to an embodiment of the present application
  • FIG. 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.
  • 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 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:
  • 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;
  • the transport layer, the transport layer of the 6LoWPAN protocol stack supports the UDP protocol
  • the 6LoWPAN protocol stack supports both the transmission control protocol (TCP) and the user datagram protocol (UDP) because of limited device resources and TCP.
  • TCP transmission control protocol
  • UDP user datagram protocol
  • 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;
  • 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;
  • 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.
  • 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.
  • TDMA time division multiple access
  • the Mesh-under routing protocol works at the adaptation layer.
  • 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.
  • GNR graph neighbor report
  • GAR graph add report
  • GNR graph Delete Report
  • GPCR graph path confirm report
  • 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.
  • 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.
  • an embodiment of the method for determining a communication path in the embodiment of the present application includes:
  • 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.
  • 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 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.
  • 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.
  • control 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.
  • 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.
  • 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 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.
  • the neighbor information obtained by node A is shown in Table 1 below:
  • 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.
  • 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 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
  • Table 6 is the neighbor information of the node F.
  • 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.
  • 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.
  • 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.
  • 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.
  • the E-node 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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. .
  • 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.
  • the control node takes the path two A->B->D as the target 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.
  • node A can only path three A->C->E- >D The destination communication path from node A to node D.
  • the control node allocates a target path identifier to the target communication path.
  • control node 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.
  • 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.
  • the source node 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.
  • 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.
  • the node A 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:
  • the node 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • node B 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.
  • 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.
  • 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;
  • 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
  • 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
  • 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.
  • the event type description value refers to the graph path increment event.
  • the event type description value refers to The map path deletes the event.
  • 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.
  • the protocol stack adaptation layer and the network layer are redesigned.
  • 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. .
  • 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.
  • 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.
  • the obtaining module 701 is specifically configured to:
  • 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;
  • the receiving module 702 is further configured to:
  • 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.
  • the sending module 706 is further configured to:
  • 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.
  • 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
  • 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.
  • 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.
  • the network device 80 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.
  • the computer program product includes one or more computer instructions.
  • 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 magnetic medium eg, a floppy disk, a hard disk, a magnetic tape
  • an optical medium eg, a DVD
  • a semiconductor medium eg, a solid state disk (SSD)
  • the disclosed system, apparatus, and method may be implemented in other manners.
  • the device embodiments described above are merely illustrative.
  • the division of the unit is only a logical function division.
  • 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.
  • 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.
  • 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.
  • a computer readable 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. .

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

La présente invention concerne un procédé et un dispositif de réseau pour déterminer un trajet de communication, utilisés pour économiser des ressources de réseau sans fil lorsqu'un nœud source n'atteint pas directement un trajet de communication d'un nœud de destination, de façon à améliorer la fiabilité et l'efficacité de transmission de données sans fil. Le procédé selon la présente invention comprend les étapes suivantes : un nœud de commande obtient des informations de réseau d'un système de communication sans fil, les informations de réseau comprenant un temps d'attente de planification et une qualité de canal entre deux nœuds de routage quelconques qui peuvent directement effectuer une communication dans le système de communication sans fil; le nœud de commande reçoit une demande de routage transmise par un nœud source, la demande de routage comprenant les adresses du nœud source et un nœud de destination, et le nœud source et le nœud de destination sont deux nœuds de routage quelconques ne pouvant pas effectuer directement une communication dans le système de communication sans fil; et le nœud de commande détermine, en fonction du temps d'attente de planification et de la qualité de canal associée au nœud source et au nœud cible, un trajet de communication cible du nœud source au nœud de destination.
PCT/CN2017/117717 2017-12-21 2017-12-21 Procédé et dispositif de réseau pour déterminer un trajet de communication Ceased WO2019119346A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201780038263.3A CN110178410A (zh) 2017-12-21 2017-12-21 一种通信路径确定方法及网络设备
PCT/CN2017/117717 WO2019119346A1 (fr) 2017-12-21 2017-12-21 Procédé et dispositif de réseau pour déterminer un trajet de communication

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2017/117717 WO2019119346A1 (fr) 2017-12-21 2017-12-21 Procédé et dispositif de réseau pour déterminer un trajet de communication

Publications (1)

Publication Number Publication Date
WO2019119346A1 true WO2019119346A1 (fr) 2019-06-27

Family

ID=66992994

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/117717 Ceased WO2019119346A1 (fr) 2017-12-21 2017-12-21 Procédé et dispositif de réseau pour déterminer un trajet de communication

Country Status (2)

Country Link
CN (1) CN110178410A (fr)
WO (1) WO2019119346A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11929907B2 (en) 2022-03-08 2024-03-12 T-Mobile Usa, Inc. Endpoint assisted selection of routing paths over multiple networks

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110401596B (zh) * 2019-09-10 2023-05-26 迈普通信技术股份有限公司 报文传输方法、装置、电子设备及可读存储介质
CN111885668B (zh) * 2020-06-19 2023-03-24 国网湖南省电力有限公司供电服务中心（计量中心） 一种双模Mesh网络的混合路由建立方法
CN112003787B (zh) * 2020-08-14 2022-09-09 北京灵汐科技有限公司 一种路由路径确定方法、装置、控制设备和存储介质
CN113472646B (zh) * 2021-05-31 2023-02-10 华为技术有限公司 一种数据传输方法、节点、网络管理器及系统
CN115767667A (zh) * 2022-10-25 2023-03-07 深圳市欧瑞博科技股份有限公司 基于无线Mesh网络的非中心节点路由建立方法及相关设备
CN119420689B (zh) * 2025-01-02 2025-05-30 阿里云飞天(杭州)云计算技术有限公司 网络通信系统及方法、设备、存储介质及程序产品

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103118413A (zh) * 2013-02-04 2013-05-22 重庆邮电大学 一种基于确定性调度的IPv6工业无线传感器网络路由方法
US20140098685A1 (en) * 2004-08-02 2014-04-10 Steve J. Shattil Content Delivery in Wireless Wide Area Networks
CN106604348A (zh) * 2017-01-04 2017-04-26 清华大学 一种无线自组网的路由方法及装置

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101854696B (zh) * 2010-05-25 2012-10-10 重庆邮电大学 基于调度与链路质量的无线传感器网络路由方法
CN106851769A (zh) * 2015-12-03 2017-06-13 电信科学技术研究院 生成路由信息及确定传输路径的方法、装置

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140098685A1 (en) * 2004-08-02 2014-04-10 Steve J. Shattil Content Delivery in Wireless Wide Area Networks
CN103118413A (zh) * 2013-02-04 2013-05-22 重庆邮电大学 一种基于确定性调度的IPv6工业无线传感器网络路由方法
CN106604348A (zh) * 2017-01-04 2017-04-26 清华大学 一种无线自组网的路由方法及装置

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11929907B2 (en) 2022-03-08 2024-03-12 T-Mobile Usa, Inc. Endpoint assisted selection of routing paths over multiple networks

Also Published As

Publication number Publication date
CN110178410A (zh) 2019-08-27

Similar Documents

Publication Publication Date Title
WO2019119346A1 (fr) Procédé et dispositif de réseau pour déterminer un trajet de communication
EP3228123B1 (fr) Gestion de ressource et d'ordonnancement hybride efficace dans des réseaux à saut de canal à créneau temporel
JP6463839B2 (ja) モバイル環境におけるフローベースのアドレス指定のためのシステム及び方法
US10057342B2 (en) Infrastructure access via neighbor awareness networking data path
CN102158407B (zh) 一种配置地址解析协议arp表项的方法和装置
CN101521895A (zh) 无线自组织网络中用于构建多跳路由转发的方法
US20180176853A1 (en) Distributed reactive resource and schedule management in time slotted channel hopping networks
JP2016105611A (ja) ハイブリッドネットワーク内のトポロジ発見
CN103841621B (zh) 一种基于6LoWPAN树型网络的冗余路由方法
CN106330731B (zh) 一种无线自组网的多播树建立方法
JP2007142612A (ja) 無線マルチホップネットワーク、通信端末及びそれらに用いる資源予約通信方法
WO2014056412A1 (fr) Procédé d'envoi de message, système et pont de routage
CN103391245A (zh) 网络域内构建多态路由的方法、装置及路由器
CN106900174B (zh) 无线局域网网状网络的数据传输方法、装置及系统
Mu An improved AODV routing for the zigbee heterogeneous networks in 5G environment
CN105991446A (zh) Trill网络中三层组网及数据处理方法、设备和系统
Jin et al. MANET for Disaster Relief based on NDN
CN104852771B (zh) 一种适用于水声局域网的多跳接入方法
CN105247842A (zh) 用于选择通信接口的方法和设备
CN101729135A (zh) 无线网状网的传输方法、通信设备及通信系统
WO2023005745A1 (fr) Procédé, dispositif et système de transfert de message, et support de stockage lisible par ordinateur
US20160182252A1 (en) Wireless and Powerline Communication Mesh Network
WO2013042208A1 (fr) Appareil de nœud et procédé de communication
CN115801675A (zh) 一种报文处理方法及相关装置
CN102769676B (zh) Ip网络移动管理方法、装置和系统

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 17935205

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 17935205

Country of ref document: EP

Kind code of ref document: A1