WO2020119483A1 - 数据传输方法和装置 - Google Patents

数据传输方法和装置 Download PDF

Info

Publication number
WO2020119483A1
WO2020119483A1 PCT/CN2019/122022 CN2019122022W WO2020119483A1 WO 2020119483 A1 WO2020119483 A1 WO 2020119483A1 CN 2019122022 W CN2019122022 W CN 2019122022W WO 2020119483 A1 WO2020119483 A1 WO 2020119483A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
data
control information
priority
nodes
Prior art date
Application number
PCT/CN2019/122022
Other languages
English (en)
French (fr)
Inventor
曹永照
董朋朋
李元杰
窦圣跃
Original Assignee
华为技术有限公司
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
Priority claimed from CN201811515587.4A external-priority patent/CN111314954B/zh
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Publication of WO2020119483A1 publication Critical patent/WO2020119483A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/021—Traffic management, e.g. flow control or congestion control in wireless networks with changing topologies, e.g. ad-hoc networks
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • 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/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
    • 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 communications, and in particular to data transmission methods and devices in the field of communications.
  • a wireless mesh network is also called a "multi-hop" network, which is a network with a mesh topology.
  • the wireless mesh network needs to use the routing protocol to complete the data transmission.
  • the routing protocol of the wireless mesh network is mainly based on the Ad-Hoc network routing protocol, which is mainly divided into the following three types: 1) Table-driven routing protocol, also known as a priori routing protocol, that is, nodes usually maintain a routing table when It is used directly when there is data in the network that needs to be sent; 2) On-demand routing protocol, also known as reactive routing protocol, that is, when the network needs to send data, it starts to prepare for the establishment of the route; 3) hybrid routing protocol, that is, before A mix of the two.
  • Table-driven routing protocol also known as a priori routing protocol, that is, nodes usually maintain a routing table when It is used directly when there is data in the network that needs to be sent
  • On-demand routing protocol also known as reactive routing protocol, that is, when the network needs to send data, it starts to prepare for the establishment of the route
  • hybrid routing protocol that is, before A mix of the two.
  • the final result is to establish a path from the source node to the destination node for the user.
  • the data from the source node to the destination node will be transmitted from the source node to the destination node on the path.
  • the instability of the wireless network environment often causes unpredictable changes in the network environment, which may result in the next hop node on the determined path cannot be accurately addressed, or the next hop node may not be correct Receiving data, resulting in lower throughput of wireless mesh networks and poorer data transmission performance.
  • the present application provides a data transmission method and device, which is beneficial to increase the throughput of a wireless network and further improve data transmission performance.
  • a data transmission method including: a second node receiving data from a first node, the second node being one of at least two candidate next-hop nodes of the first node; The second node sends the data according to priority information, and/or sends first control information, where the priority information is used to indicate that the second node is paired among the at least two candidate next hop nodes The sending priority of the data.
  • the above-mentioned second node may send only the data from the first node, or only the first control information, or both the data from the first node and the first control information according to the priority information.
  • the first control information may include at least one of an acknowledgement (acknowledgement, ACK), a negative reply (non-acknowledgement, NACK), or a scheduling request (SR).
  • one candidate next-hop node of the at least two candidate next-hop nodes may be determined according to its own priority information Whether to send data from the first node, so as to select an appropriate next-hop node for the first node for data transmission.
  • the embodiment of the present application can select one or more next-hop nodes from at least two candidate next-hop nodes to continue transmitting data in real time when the data reaches the candidate next-hop node, and can avoid the instability of the network environment. The resulting impact is conducive to improving the throughput of the wireless network, thereby improving data transmission performance.
  • the second node sends the data according to the priority information, and/or sends the first control information, including: if the second node is in Among the at least two candidate next hop nodes, the sending priority of the data is the highest, and the second node decodes the data correctly, and the second node sends the data.
  • the method further includes: if the second node does not have the highest transmission priority for the data among the at least two candidate next-hop nodes , The second node determines whether second control information from at least one third node is received, the at least one third node being the priority of sending the data among the at least two candidate next hop nodes For a node with a higher priority than the second node for sending the data, the second control information is used to indicate that the data is decoded correctly; the second node sends the data according to the priority information, And/or sending the first control information includes: if the second node does not receive the second control information, and the second node decodes the data correctly, the second node sends the data.
  • the second node sends the data according to the priority information, and/or sends the first control information, including: if the second node receives To the second control information, the second node sends the first control information, the first control information includes the first from the node with the highest transmission priority of the data among the at least one third node 2. Control information.
  • the second node needs to determine whether the transmission priority of the data is received
  • the second control information indicates that the third node decodes the data correctly.
  • the second control information may be ACK. It should be understood that there may be one node or a plurality of nodes with a higher transmission priority for data than the second node, and the embodiment of the present application is referred to as at least one third node.
  • the above-mentioned second control information is respective second control information sent by each third node in the at least one third node; therefore, the number of second control information is the same as the number of third nodes.
  • the second control information may carry a first identifier of a third node corresponding to the first identifier.
  • the first identifier is a node identifier, and is used to indicate a source of the second control information.
  • the first identifier of the third node may be carried explicitly in the second control information sent by the third node, or may be carried in an implicit manner (for example, the second information is scrambled by the identification information Control information, etc.), which is not limited in the embodiments of the present application.
  • the second node sends the data according to the priority information, and/or sends the first control information, including: the second node sends The data and the first control information, the first control information includes a positive reply ACK.
  • the above-mentioned second node may send both data from the first node and first control information according to the priority information.
  • the first control information includes an ACK to indicate that the second node responds to the data from the first node The decoding is correct.
  • the first control information including ACK is sent to facilitate
  • other nodes learn of this situation other nodes can no longer send data from the first node. In this way, the transmission burden of other nodes can be reduced and the power consumption of other nodes can be reduced, thereby helping to reduce the power consumption and operating complexity of the system.
  • the method further includes: if the second node does not have the highest transmission priority for the data among the at least two candidate next-hop nodes , The second node determines whether the third control information from the fourth node is received, and the fourth node is the priority of sending the data among the at least two candidate next-hop nodes over the first The second node has a higher priority for sending the data, and the third control information is used to indicate an error in decoding the data; the second node sends the data according to the priority information, and /Or, sending the first control information includes: if the second node receives the third control information, and the second node decodes the data correctly, the second node sends the data.
  • the second node sends the data according to the priority information, and/or sends the first control information, including: if the second node receives To the third control information, and the second node decodes the data incorrectly, the second node sends the first control information, the first control information includes a negative reply NACK and/or a scheduling request SR.
  • the method further includes: if the second node does not receive the third control information, the second node determines whether it receives from at least one Fourth control information of a fifth node, the at least one fifth node is the priority of sending data to the data in the at least two candidate next hop nodes is higher than the priority of sending data by the second node
  • the fourth control information is used to indicate an error in decoding the data; the second node sends the data according to the priority information, and/or sends the first control information Including: if the second node receives the fourth control information, the second node sends the first control information, and the first control information includes information from the at least one fifth node. Fourth control information of a fifth node with the lowest data transmission priority.
  • the third control information sent by the fourth node with a higher priority than the second node indicates that the fourth node decodes the data from the first node incorrectly, or indicates that the fourth node has not received the data from the first node.
  • the third control information may be NACK and/or SR. It should be understood that there are one or more nodes that have a higher priority for sending data than the second node, and this embodiment of the present application is called a fourth node. Correspondingly, the number of the third control information is also one or more.
  • the third control information may carry a first identifier of a fourth node corresponding thereto, and the first identifier is a node identifier, which is used to indicate a source of the third control information.
  • the first identifier of the fourth node may be carried explicitly in the third control information directly, or may be carried in an implicit manner (for example, the third control information is scrambled by the identification information, etc.). Not limited.
  • multiple different nodes may have the same transmission priority for data from the first node, so that one priority may correspond to one node or multiple nodes.
  • the above-mentioned transmission priority ratio for data The second node may have one or more priority nodes.
  • different nodes have different priorities for data from the first node, such a priority corresponds to only one node, and the transmission priority of the data above is one priority higher than that of the second node
  • the node is a node. It should be understood that whether a priority corresponds to a node or multiple nodes may depend on the configuration of the network or one or more of the interaction processes (such as synchronization process, access process, discovery process, or topology formation process) between nodeskind) OK, not limited here.
  • the “one priority higher” and the “at least two priority higher” in the embodiment of the present application are the ranking of the data transmission priority of at least two candidate next hop nodes of the first node.
  • the next-hop candidate node of node 1 includes node 2, node 3, and node 4, and the priority of sending the data from high to low is node 2, node 3, and node 4 in this order. Therefore, the transmission priority of node 3 for data is one priority higher than the transmission priority of node 4 for data, and the transmission priority of node 2 for data is two priorities higher than the transmission priority of node 4 for data.
  • the candidate next hop node of node 1 further includes other nodes such as node 5, and the priority of data transmission from high to low is node 2, node 3, node 4, node 5, then the priority of node 2 for sending data is higher than the priority of node 5 for sending data, that is, at least two priorities.
  • the second node sends the data according to the priority information, and/or sends the first control information, including: if the second node is in Among the at least two candidate next-hop nodes, the sending priority of the data is the highest, and the second node decodes the data incorrectly, the second node sends the first control information, the
  • the first control information includes NACK and/or SR.
  • the first control information may carry the first identifier of the second node.
  • the identifier of the second node may be carried explicitly in the first control information, or may be carried in an implicit manner (for example, the first control information is scrambled by the identification information, etc.), embodiments of the present application There are no restrictions on this.
  • At least two candidate next-hop nodes of the first node are divided into two node groups: a first node group and a second node group.
  • the nodes in the first node group have higher priority for sending data than the nodes in the second node group have higher priority for sending data.
  • the nodes in the first node group may directly send the data if the data from the first node is decoded correctly, or if the data from the first node is decoded incorrectly or the first node’s
  • control information may be sent.
  • the control information may be NACK or SR, and the control information may carry the first identifier of the sending node.
  • the nodes in the second node group can send the data when they receive the control information sent from the nodes in the first node group and decode the data from the first node correctly. If the nodes in the second node group do not receive the control information sent from the nodes in the first node group, the nodes in the second node group may discard or ignore the data from the first node.
  • the number of nodes in the first node group and the number of nodes in the second node group may be one or more.
  • the one-hop node sends the data from the first node, which can avoid the influence of the instability of the network environment on the data transmission, and is beneficial to improve the throughput of the wireless network, thereby improving the data transmission performance.
  • the reliability of data transmission can be improved, which in turn helps to improve data transmission efficiency.
  • the second node belongs to the first node group, and the second node is A node in the first node group that has the lowest transmission priority for the data; the second node transmits the data according to the priority information, and/or transmits the first control information, including: if the second The node does not receive ACK from other nodes in the first node group, and the second node decodes the data incorrectly, the second node sends the first control information, the first control information Including NACK and/or SR.
  • the other nodes mentioned above are all nodes in the first node group except the second node.
  • At least two candidate next hop nodes of the first node are divided into two node groups: a first node group and a second node group.
  • the nodes in the first node group have higher priority for sending data than the nodes in the second node group have higher priority for sending data.
  • the second node is the node with the lowest transmission priority for data in the first node group.
  • the node with the highest transmission priority for the data can directly transmit the data when the data from the first node is correctly received, and send control information (such as ACK) indicating that the data is correctly received .
  • a node that does not have the highest transmission priority for data may receive control information (such as ACK) sent by a node that does not receive a higher priority than the node itself for transmitting data to indicate correct reception of data, and the node When the data of the first node is decoded correctly, the data is sent.
  • the second node is the node with the lowest priority for sending data in the first node group.
  • the second node may send a control indicating that the data from the first node is not received correctly Information (such as NACK or SR) indicates that none of the nodes in the first node group can send the above data, so as to trigger the nodes of the second node group to send the above data.
  • Control information such as ACK
  • NACK or SR data from the first node group
  • Unable to send here can be understood as that all nodes in the first node group have not correctly received the data from the first node, or decoded the data from the first node incorrectly.
  • the nodes in the second node group can judge the correctness of decoding the data from the first node. Among them, the node with correct decoding can send the data, and the node with wrong decoding can send NACK or SR.
  • a node in the first node group with a higher transmission priority for data from the first node may be preferentially selected as the next hop node of the first node. If there is no node in the first node group, the node can be sent. For data nodes, one or more nodes are selected from the second node group with a lower transmission priority for the data to send the data. In this way, the influence of the instability of the network environment on the data transmission can be avoided, which is beneficial to increase the throughput of the wireless network and thereby improve the data transmission performance.
  • the node with the lowest data transmission priority in the first node group is for a plurality of nodes in the first node group. If the first node group includes only one node, the node may be regarded as the node with the lowest transmission priority for data in the first node group.
  • the priority information corresponds to the first resource; the second node sends the data according to the priority information, and/or sends the first control information Including: the second node sends the first control information on the first resource.
  • the priority information in the embodiment of the present application indicates the priority of the second node for sending data among at least two candidate next-hop nodes of the first node.
  • the priority information of the second node corresponds to the first resource, therefore, the second node may send the first control information on the first resource. That is, the first control information sent by the second node may be carried on the first resource corresponding to the priority information of the second node.
  • the node that receives the first control information (referred to simply as the receiving node) may determine the priority of the node that sends the first control information (referred to simply as the sending node) according to the first resource.
  • priority information of different candidate next-hop nodes may correspond to different resources, and a node that sends control information may send the control information through a resource corresponding to the priority of the node for sending data.
  • the node that receives the control information can determine the priority of data transmission by the node that sends the control information through the resource that sends the control information. In this way, for a candidate next-hop node, the candidate next-hop node only needs to maintain its own priority for sending data, and does not need to maintain the priority information of all candidate next-hop nodes, which reduces the candidate next-hop node. The storage burden of the node.
  • the data is transmitted from the source node to the destination node, and the priority information is based on the candidate next-hop node among the at least two candidate next-hop nodes
  • the hop count to the destination node, and/or the hop count from the source node to the candidate next hop node is determined.
  • the channel quality of each hop from the source node to the candidate next hop node and/or the channel quality of each hop from the candidate next hop node to the destination node can also be determined more accurately to determine the candidate next hop
  • the priority of the node but this embodiment of the present application does not limit this.
  • another data transmission method including: a first node sends data, the first node has at least two candidate next-hop nodes; the first node receives data from the at least two candidate Control information of all or part of the nodes in the one-hop node, the control information is any one of affirmative reply ACK, negative reply NACK or scheduling request SR; the first node according to the control information, from the at least two Among the candidate next-hop nodes, the next-hop node is determined; the first node sends indication information to the next-hop node, and the indication information is used to instruct to send the data.
  • the first node determining the next hop node from the at least two candidate next hop nodes according to the control information includes: A node determines the next hop node from the at least two candidate next hop nodes according to the control information and priority information, and the priority information is used to indicate the at least two candidate next hop nodes The sending priority of the node to the data.
  • the first node may further combine the priority information to determine the next hop node, and the priority information may be maintained only in the first node, and the candidate next hop node of the first node does not need to maintain the above priority For information, only the corresponding control information needs to be fed back according to the received data, so that the burden on each candidate next hop node can be reduced.
  • the first node determines the next hop from the at least two candidate next hop nodes according to the control information and priority information
  • the node includes: among the candidate next-hop nodes that send the ACK, the first node determines at least one node with a higher transmission priority for the data as the next-hop node; or Of the at least two candidate next-hop nodes, the remaining nodes other than the candidate next-hop node that sent the NACK or the SR, the first node will have a higher transmission priority for the data at least One node is determined as the next hop node.
  • the data is transmitted from the source node to the destination node, and the priority information is based on the candidate next-hop node among the at least two candidate next-hop nodes
  • the hop count to the destination node, and/or the hop count from the source node to the candidate next hop node is determined.
  • another data transmission method including: a second node receives data from a first node, the first node has at least two candidate next hop nodes, and the at least two candidate next hop nodes The node includes the second node; the second node sends first control information to the first node according to whether the data is decoded correctly, the first control information is affirmative reply ACK, negative reply NACK or Any one of the scheduling requests SR; the second node receives indication information sent by the first node, the indication information is used to instruct sending of the data; the second node sends the indication according to the indication information data.
  • an apparatus for performing the method in each of the foregoing aspects or any possible implementation manner of each aspect.
  • the device includes a unit for performing the methods in the above aspects or any possible implementation manner of the aspects.
  • an apparatus includes a transceiver, a memory, and a processor.
  • the transceiver, the memory and the processor communicate with each other through an internal connection path
  • the memory is used to store instructions
  • the processor is used to execute the instructions stored in the memory to control the receiver to receive signals, and control the transmitter to send signals
  • the execution causes the processor to execute the above aspects or the method in any possible implementation manner of each aspect.
  • a computer program product comprising: computer program code, when the computer program code is executed by a computing device, causing the computing device to perform the above aspects or any of the aspects In a possible implementation.
  • a computer-readable medium for storing a computer program, the computer program including instructions for performing the methods in the above aspects or any possible implementation manner of the aspects.
  • a chip including: a processor, for calling and running a computer program from a memory, so that the device installed with the chip executes the above aspects or any possible implementation manner of each aspect Methods.
  • FIG. 1 shows a schematic diagram of a network architecture of an embodiment of the present application
  • FIG. 2 shows a schematic flowchart of a data transmission method according to an embodiment of the present application
  • FIG. 3 shows a schematic diagram of a first data transmission method according to an embodiment of the present application
  • FIG. 4 shows a schematic diagram of a second data transmission method according to an embodiment of the present application.
  • FIG. 5 shows a schematic diagram of a third data transmission method according to an embodiment of the present application.
  • FIG. 6 shows a schematic diagram of a fourth data transmission method according to an embodiment of the present application.
  • FIG. 7 shows a schematic diagram of a fifth data transmission method according to an embodiment of the present application.
  • FIG. 8 shows a schematic block diagram of an apparatus according to an embodiment of the present application.
  • FIG. 9 shows a schematic block diagram of another device according to an embodiment of the present application.
  • GSM global mobile communication
  • CDMA code division multiple access
  • WCDMA broadband code division multiple access
  • general packet radio service general packet radio service, GPRS
  • LTE long term evolution
  • LTE frequency division duplex FDD
  • TDD time division duplex
  • UMTS universal mobile communication system
  • WiMAX worldwide interoperability for microwave access
  • the technical solutions of the embodiments of the present application can be applied to various application scenarios requiring high reliability and low latency, for example, industrial control scenarios, robot collaboration scenarios, typical user equipment (UE) collaboration scenarios, and wireless mesh (mesh) ) Scenes and so on.
  • the technical solutions of the embodiments of the present application do not limit uplink transmission, or downlink transmission, or side-link (side-link) transmission between devices.
  • the data transmission in the embodiments of the present application may be between nodes in various combinations, for example, a control node (master) and a driven node (slaves), a base station and a UE, a base station and a base station, a UE and a UE, and so on. Therefore, the scenario applicable to this article is a scenario where there are multiple nodes, and the node may be a terminal device, a network device, a master, slaves, and so on.
  • Master is the control node, used to send control commands; slaves are driven nodes, in addition to receiving control commands, status messages, such as motors, are also fed back.
  • the above terminal equipment may refer to user equipment, access terminal, user unit, user station, mobile station, mobile station, remote station, remote terminal, mobile device, user terminal, terminal, wireless communication device, user agent or user device.
  • Terminal devices can also be cellular phones, cordless phones, session initiation protocol (SIP) phones, wireless local loop (WLL) stations, personal digital assistants (personal digital assistants, PDAs), and wireless communication Functional handheld devices, computing devices or other processing devices connected to wireless modems, in-vehicle devices, wearable devices, terminal devices in future 5G networks or public land mobile communication networks (PLMN) in the future evolution
  • SIP session initiation protocol
  • WLL wireless local loop
  • PDAs personal digital assistants
  • PDAs personal digital assistants
  • the terminal device and the like are not limited in this embodiment of the present application.
  • the above network device may be a device for communicating with a terminal device, and the network device may be a global mobile communication (global system for mobile communications, GSM) system or a base station in a code division multiple access (code division multiple access, CDMA) Transceiver station (BTS) can also be a base station (NodeB, NB) in a wideband code division multiple access (WCDMA) system, or an evolved base station (evolved NodeB, eNB or eNodeB in an LTE system) ), can also be a wireless controller in the cloud radio access network (cloud radio access network, CRAN) scenario, or the network device can be a relay station, access point, in-vehicle device, wearable device, and the network in the future 5G network Devices (for example, gNodeB, gNB, or transmission/receiving point/transmission reception point (TRP)), or network devices in a PLMN network that will evolve in the future are not limited in the embodiments of the present application.
  • the terminal device or the network device includes a hardware layer, an operating system layer running on the hardware layer, and an application layer running on the operating system layer.
  • the hardware layer includes central processing unit (CPU), memory management unit (memory management unit, MMU), and memory (also called main memory) and other hardware.
  • the operating system may be any one or more computer operating systems that implement business processes through processes, for example, a Linux operating system, a Unix operating system, an Android operating system, an iOS operating system, or a windows operating system.
  • the application layer includes browser, address book, word processing software, instant messaging software and other applications.
  • the embodiment of the present application does not specifically limit the specific structure of the execution body of the method provided in the embodiment of the present application, as long as it can run the program that records the code of the method provided by the embodiment of the present application to provide according to the embodiment of the present application
  • the method may be used for communication.
  • the execution body of the method provided in the embodiments of the present application may be a terminal device or a network device, or a functional module in the terminal device or network device that can call a program and execute the program.
  • the term "article of manufacture” as used in this application encompasses a computer program accessible from any computer-readable device, carrier, or medium.
  • the computer-readable medium may include, but is not limited to: magnetic storage devices (for example, hard disks, floppy disks, or magnetic tapes, etc.), optical disks (for example, compact discs (CD), digital universal discs (digital discs, DVDs)) Etc.), smart cards and flash memory devices (for example, erasable programmable read-only memory (EPROM), cards, sticks or key drives, etc.).
  • various storage media described herein may represent one or more devices and/or other machine-readable media for storing information.
  • machine-readable medium may include, but is not limited to, wireless channels and various other media capable of storing, containing, and/or carrying instructions and/or data.
  • FIG. 1 is a schematic diagram of a network architecture 100 according to an embodiment of the present application.
  • the network architecture 100 includes 10 nodes, namely node 1, node 2, node 3, node 4, node 5, node 6, node 7, node 8, node 9 and node 10.
  • the nodes in Figure 1 have neighbor nodes, and the topology is shown in Figure 1.
  • the neighbor nodes of node 1 include node 2, node 3, node 4, node 8, and node 9.
  • the neighbor nodes of node 2 include node 1, node 3, node 4, node 5, node 6, and node 7.
  • the other nodes are similar and will not be listed here one by one.
  • FIG. 1 exemplarily shows 10 nodes.
  • the network architecture 100 may include other numbers of nodes (the number of nodes may be greater than 10, or less than 10), and there may be For other topological structures, this embodiment of the present application does not limit this.
  • nodes except for the destination node may respectively include at least one candidate next hop node.
  • the neighbor node of the node is the reachable node of the node, for example, the reachable node may be a discovery mechanism, synchronization mechanism, topology establishment mechanism, or access mechanism in the establishment of the network topology.
  • the candidate next hop node of the node belongs to the neighbor node of the node.
  • the candidate next hop node of a node is determined based on multiple candidate transmission paths corresponding to the source node and the destination node when the source node and the destination node are known.
  • the source node is 1, the destination node is 7, and the existing candidate transmission paths are: 1-3-5-7, 1-3-2-7, 1-2-7, 1--4- 2-7, 1-4-6-7, therefore, the candidate next hop nodes of node 1 include node 3, node 2 and node 4.
  • the candidate next hop node of a node may depend on the source node and the destination node, and the candidate next hop node of a node may be different for different source nodes and/or destination nodes.
  • the candidate next hop node of a node specifically includes may be defined according to a certain rule, or may be semi-statically configured, which is not limited in this embodiment of the present application.
  • the candidate next hop node of a node can be configured by a control node through radio resource control (RRC) signaling or media access control unit (media access control (element, MAC) CE) signaling And/or the candidate next hop node of the node.
  • RRC radio resource control
  • MAC media access control
  • the control node may be a source node, a destination node, or other nodes, which is not limited in this embodiment of the present application.
  • the candidate next hop node of the present application will be described in detail below with reference to FIG. 1 first.
  • node 10 needs to transmit data to node 7, node 10 is the source node and node 7 is the destination node.
  • the next-hop candidate node of node 10 includes node 8 and node 9
  • the next-hop candidate node of node 8 includes node 1 and node 3
  • the next-hop candidate node of node 9 includes Node 1 and node 4
  • the next-hop candidate node of node 1 includes node 2, node 3 and node 4
  • the next-hop candidate node of node 3 includes node 2 and node 5
  • the next-hop candidate node of node 4 includes node 2
  • node 6 node 5 and node 6 candidate next hop nodes all include node 7, node 2 candidate next hop nodes include node 5, node 6 and node 7.
  • node 7 if node 7 needs to transmit data to node 10, node 7 is the source node and node 10 is the destination node.
  • the candidate next-hop nodes of node 7 include node 2, node 5 and node 6, the candidate next-hop nodes of node 2 include node 1, node 3 and node 4, node 5
  • node 6 candidate next hop nodes include node 2 and node 4
  • node 3 candidate next hop nodes include node 1 and node 8
  • node 1 candidate next hop node Node Node 8 and node 9 are included.
  • the candidate next hop nodes of node 4 include node 1 and node 9, and the candidate next hop nodes of node 8 and node 9 include node 10.
  • a specific source node and a destination node that is, a candidate next hop node of a node in a specific transmission direction
  • the candidate next-hop node among the multiple candidate next-hop nodes may have a transmission priority for data.
  • the above-mentioned sending priority may be combined to select the final candidate node from the multiple candidate next-hop nodes through information interaction between the multiple candidate next-hop nodes.
  • the next hop node to send data In this application, the next hop node that is ultimately used to send data may be one node or multiple nodes.
  • the sending priority of the above nodes to data may also be called priority, sending rule, etc., and the name is not limited in this application.
  • the above priority may be expressed by a numerical value, for example, a smaller value indicates a lower priority, and a larger value indicates a higher priority; or, a smaller value indicates a higher priority, and a higher value Larger means lower priority.
  • the above priority may be expressed through enumeration, for example, an enumeration value low indicates a low priority, an enumeration value medium indicates a medium priority, and an enumeration value high indicates a high priority.
  • next hop node candidate of node 1 in FIG. 1 if node 2 has the highest priority, then node 3 has the highest priority, and node 4 has the lowest priority. Then the priority of node 2 can be expressed as 3, the priority of node 3 can be expressed as 2, the priority of node 4 can be expressed as 1; or, the priority of node 2 can be expressed as 1, the priority of node 3 can be expressed Is 2, the priority of node 4 can be expressed as 3; or, the priority of node 2 can be expressed as high, the priority of node 3 can be expressed as medium, and the priority of node 4 can be expressed as low.
  • the data transmission priority of the candidate next-hop node may be pre-defined or semi-statically configured, which may be specifically controlled by one
  • the node is configured to this node and/or multiple candidate next hop nodes through RRC signaling or MAC CE signaling.
  • the control node may be a source node, a destination node, or other nodes, which is not limited in this embodiment of the present application.
  • FIG. 2 shows a schematic flowchart of a data transmission method 200 according to an embodiment of the present application.
  • the method 200 can be applied to the network architecture 100 shown in FIG. 1, but the embodiments of the present application are not limited thereto.
  • the second node receives data from the first node, and the second node is one of at least two candidate next-hop nodes of the first node;
  • the second node sends the data according to priority information, and/or sends first control information, where the priority information is used to indicate that the second node is in the at least two next hop candidates The sending priority of the data in the node.
  • the first node in the network sends data. Since the first node has at least two candidate next-hop nodes, the candidate next-hop nodes among the at least two candidate next-hop nodes may receive the first Data sent by a node. It should be understood that the above data is sent from the source node to the destination node. Therefore, the first node may be the above source node or any node on the transmission path from the above source node to the above destination node. Examples do not limit this.
  • the second node is one of the candidate next-hop nodes of the first node, and the second node receives the data sent by the first node, so that the second node can be under at least two candidates according to the second node
  • the sending priority of the data in the one-hop node determines whether to send the data.
  • the above-mentioned second node may send only the data from the first node, or only the first control information, or both the data from the first node and the first control information according to the priority information.
  • the first control information may include at least one of an acknowledgement (acknowledgement, ACK), a negative reply (non-acknowledgement, NACK), or a scheduling request (SR).
  • one candidate next-hop node of the at least two candidate next-hop nodes may be determined according to its own priority information Whether to send data from the first node, so as to select an appropriate next-hop node for the first node for data transmission.
  • the embodiment of the present application can select one or more next-hop nodes from at least two candidate next-hop nodes to continue transmitting data in real time when the data reaches the candidate next-hop node, and can avoid the instability of the network environment. The resulting impact is conducive to improving the throughput of the wireless network, thereby improving data transmission performance.
  • the second node sending the data according to the priority information, and/or sending the first control information includes: if the second node is next to the at least two candidates The priority of sending the data in the hop node is the highest, and the second node decodes the data correctly, and the second node sends the data.
  • the second node may directly send the data from the first node:
  • the second node correctly receives the data from the first node, that is, the second node decodes the data correctly;
  • the second node has the highest transmission priority of the data among the at least two candidate next-hop nodes of the first node.
  • the data has been transmitted to the node 1, and the node 1 is the above-mentioned first node.
  • the candidate next hop node of the node 1 includes node 2, node 3 and node 4, and the priority of sending the data from high to low is node 2, node 3 and node 4 in order.
  • node 2 is the above-mentioned second node. Node 2 correctly receives the data from node 1, and node 2 has the highest transmission priority for the data, and node 2 can directly send the data.
  • the candidate next-hop nodes may also use mutual control information (including at least one of first control information, second control information, third control information, and fourth control information) to combine priority Level information, determine whether to send data from the first node, and then select the next hop node of the first node.
  • the above control information may be carried on a physical channel and sent, for example, a physical uplink control channel (physical uplink control channel, PUCCH), a physical downlink control channel (physical downlink control channel, PDCCH), or a physical sidelink shared channel ( physical sidelink control channel (PSCCH) and so on.
  • PUCCH physical uplink control channel
  • PDCCH physical downlink control channel
  • PSCCH physical sidelink shared channel
  • control information for indicating that the data from the first node is correctly received (decoding the data from the first node correctly) as an example.
  • the control information may be ACK.
  • the method further includes: if the second node does not have the highest transmission priority of the data among the at least two candidate next-hop nodes, the second node determines Whether second control information from at least one third node is received, the at least one third node being the priority of sending the data among the at least two candidate next hop nodes is higher than that of the second node pair
  • the second control information is used to indicate that the data is decoded correctly; the second node sends the data according to the priority information, and/or, sends the first control
  • the information includes: if the second node does not receive the second control information, and the second node decodes the data correctly, the second node sends the data.
  • the second node sending the data according to the priority information, and/or sending the first control information includes: if the second node receives the second control information, The second node sends the first control information, and the first control information includes second control information from a node with the highest transmission priority for the data among the at least one third node.
  • the second node needs to determine whether the transmission priority of the data is received
  • the second control information indicates that the third node decodes the data correctly.
  • the second control information may be ACK. It should be understood that there may be one node or a plurality of nodes with a higher transmission priority for data than the second node, and the embodiment of the present application is referred to as at least one third node.
  • the above-mentioned second control information is respective second control information sent by each third node in the at least one third node; therefore, the number of second control information is the same as the number of third nodes.
  • the second control information may carry a first identifier of a third node corresponding to the first identifier.
  • the first identifier is a node identifier, and is used to indicate a source of the second control information.
  • the first identification of the node may be carried explicitly in the control information sent by the node, or it may be carried in an implicit manner (for example, scrambling the control information sent by the node by the identification information, etc.), This embodiment of the present application does not limit this.
  • the second node receives the second control information sent by the third node
  • This situation indicates that there is a node with a higher transmission priority than the second node for sending data, and the second node can carry the received second control information in the first control information and send it. Further, if the second node receives the second control information sent from a plurality of third nodes, the second node may select a third node with the highest transmission priority of data among the plurality of third nodes, Only the second control information of the third node with the highest transmission priority for data may be carried in the first control information and sent. In this way, it is advantageous for other nodes that miss the second control information to obtain the second control information in time, and then determine whether to send data.
  • the second node does not receive the second control information sent by the third node
  • This situation indicates that there is no node with a higher transmission priority than the second node for sending data, and the second node can send the data if the decoding is correct.
  • the data has been transmitted to the node 1, and the node 1 is the above-mentioned first node.
  • the candidate next hop node of the node 1 includes node 2, node 3 and node 4, and the priority of sending the data from high to low is node 2, node 3 and node 4 in order.
  • the above-mentioned second node is not the node with the highest transmission priority of data among the candidate next-hop nodes of node 1, and it is assumed that the second node is node 4.
  • node 4 If node 4 receives the second control information (such as ACK) from node 2 and the second control information (such as ACK) from node 3, since node 2 has higher priority for sending data than node 3, node 4 can send The second control information of node 2. In this case, the node 4 may not need to judge whether it can send data. If node 4 does not receive the second control information from node 2 and the second control information from node 3, and node 4 decodes the data from node 1 correctly, node 4 can send the data directly.
  • the second control information such as ACK
  • the second node sending the data according to the priority information, and/or sending the first control information includes: the second node sending the data and the first control Information, the first control information includes an affirmative reply ACK.
  • the above-mentioned second node may send both data from the first node and first control information according to the priority information.
  • the first control information may include an ACK to indicate that the second node Data decoding is correct.
  • the second node sends the first control information including ACK when it determines to send data (that is, the second node is the next hop node of the first node), so that other nodes can learn this In other cases, other nodes can no longer send data from the first node. In this way, the transmission burden of other nodes can be reduced and the power consumption of other nodes can be reduced, thereby helping to reduce the power consumption and operating complexity of the system.
  • the data has been transmitted to the node 1, and the node 1 is the first node.
  • the candidate next hop node of the node 1 includes node 2, node 3 and node 4, and the priority of sending the data from high to low is node 2, node 3 and node 4 in order.
  • node 2 is the above-mentioned second node.
  • Node 2 correctly receives the data from node 1, and node 2 has the highest transmission priority for the data, and node 2 can directly send the data.
  • node 2 can also send an ACK, and after receiving the ACK from node 2, node 3 and node 4 can determine that they are no longer sending data.
  • control information for indicating that data from the first node is not received or that the data decoding error from the first node is taken as an example.
  • the control information may be NACK or SR.
  • the method further includes: if the second node does not have the highest transmission priority of the data among the at least two candidate next-hop nodes, the second node determines Whether the third control information from the fourth node is received, the fourth node being the priority of sending the data among the at least two candidate next hop nodes is higher than the sending of the data by the second node
  • the third control information is used to indicate the data decoding error; the second node sends the data according to the priority information, and/or sends the first control information
  • the method includes: if the second node receives the third control information, and the second node decodes the data correctly, the second node sends the data.
  • the second node sending the data according to the priority information, and/or sending the first control information includes: if the second node receives the third control information, And the second node decodes the data incorrectly, and the second node sends the first control information, and the first control information includes a negative reply NACK and/or a scheduling request SR.
  • the method further includes: if the second node does not receive the third control information, the second node determines whether the fourth control information from at least one fifth node is received ,
  • the at least one fifth node is a node with at least two priorities higher than the second node to the data in the at least two candidate next hop nodes ,
  • the fourth control information is used to indicate the data decoding error; the second node sends the data according to the priority information, and/or sends the first control information, including: if the second node Receiving the fourth control information, the second node sends the first control information, the first control information includes the first from the at least one fifth node with the lowest transmission priority for the data Fourth control information of five nodes.
  • the third control information sent by the fourth node with a higher priority than the second node indicates that the fourth node decodes the data from the first node incorrectly, or indicates that the fourth node has not received the data from the first node.
  • the third control information may be NACK and/or SR. It should be understood that there are one or more nodes whose data transmission priority is one priority higher than that of the second node, and this embodiment of the present application is called a fourth node. Correspondingly, the number of the third control information is also one or more.
  • the third control information may carry a first identifier of a fourth node corresponding to the first identifier.
  • the first identifier is a node identifier, and is used to indicate a source of the third control information.
  • the first identifier of the fourth node may be carried explicitly in the third control information, or it may be carried in an implicit manner (for example, the third control information is scrambled by the identification information, etc.). Examples do not limit this.
  • multiple different nodes may have the same transmission priority for data from the first node, so that one priority may correspond to one node or multiple nodes.
  • the above-mentioned transmission priority ratio for data The second node may have one or more priority nodes.
  • different nodes have different priorities for data from the first node, such a priority corresponds to only one node, and the transmission priority of the data above is one priority higher than that of the second node
  • the node is a node. It should be understood that whether a priority corresponds to a node or multiple nodes may depend on the configuration of the network or one or more of the interaction processes (such as synchronization process, access process, discovery process, or topology formation process) between nodeskind) OK, not limited here.
  • the second node receives the third control information sent by the fourth node
  • This situation indicates that there is no node with a higher transmission priority than the second node for sending data, and the second node can send the data if the decoding is correct.
  • the second node does not receive the third control information sent by the fourth node
  • the second node needs to further determine whether a fifth node with a priority of at least two priorities for sending the data is received than the second node.
  • the fourth control information indicates that the fifth node decodes the data from the first node incorrectly or does not receive the data from the first node.
  • the fourth control information may be NACK and/or SR. It should be understood that there may be one or more nodes with at least two priorities higher than the second node for sending data, and this embodiment of the present application is referred to as at least one fifth node.
  • the fourth control information is the respective fourth control information sent by each fifth node in the at least one fifth node. Therefore, the number of fourth control information is the same as the number of fifth nodes.
  • the fourth control information may carry a first identifier of a fifth node corresponding thereto, and the first identifier is a node identifier, which is used to indicate the source of the information.
  • the second node may carry the received fourth control information in the first control information and send it. Further, if the second node receives the fourth control information sent from a plurality of fifth nodes, the second node may select the fifth node with the lowest transmission priority among the plurality of fifth nodes, only The fourth control information of the fifth node with the lowest priority may be carried in the first control information and sent. In this way, it is advantageous for other nodes that miss the fourth control information to obtain the fourth control information in time, and then determine whether to send the data. If the second node does not receive the fourth control information sent by the fifth node, the second node may save the data of the first node.
  • the second node may start a timer. If the timer expires, the second node has not received the third control information from the fourth node, and the second node may discard the data of the first node or from the memory To clear the data of the first node.
  • the “one priority higher” and the “at least two priority higher” in the embodiment of the present application are the ranking of the data transmission priority of at least two candidate next hop nodes of the first node.
  • the next-hop candidate node of node 1 includes node 2, node 3, and node 4, and the priority of sending the data from high to low is node 2, node 3, and node 4 in this order. Therefore, the transmission priority of node 3 for data is one priority higher than the transmission priority of node 4 for data, and the transmission priority of node 2 for data is two priorities higher than the transmission priority of node 4 for data.
  • the candidate next hop node of node 1 further includes other nodes such as node 5, and the priority of data transmission from high to low is node 2, node 3, node 4, node 5, then the priority of node 2 for sending data is higher than the priority of node 5 for sending data, that is, at least two priorities.
  • node 1 is the above-mentioned first node.
  • the candidate next-hop nodes of node 1 include node 2, node 3, node 4, and node 5, and the priority of sending the data from high to low is node 2, node 3, node 4, and node 5.
  • the above-mentioned second node is not the node with the highest priority for data transmission among the candidate next-hop nodes of node 1.
  • the second node is node 5, and the node with a higher priority than node 5 is node 4.
  • node 5 receives the third control information (such as NACK or SR) of node 4, and node 5 responds to the The data is decoded correctly, and node 5 can send the data directly. If node 5 does not receive the third control information of node 4, since node 2 and node 3 are at least two priorities higher than the priority of node 5 for sending data, node 5 can determine whether node 4 has received the fourth control information Control information (eg NACK or SR) and/or the fourth control information of the node 3 (eg NACK or SR).
  • the fourth control information eg NACK or SR
  • the fourth control information of the node 3 eg NACK or SR
  • the node 5 may send the fourth control information of the node 3 because the node 3 has a lower transmission priority of the data than the node 2.
  • the node 4 misses the fourth control information of the node 3, the fourth control information of the node 3 can be obtained through the node 5, since the node 3 is a node that is one priority higher than the priority of the node 4 for sending data, The node 4 can directly send the data from the node 1 if the decoding is correct.
  • the second node sending the data according to the priority information, and/or sending the first control information includes: if the second node is next to the at least two candidates The data transmission priority of the hop node is the highest, and the second node decodes the data incorrectly, the second node sends the first control information, and the first control information includes NACK and/or Or SR.
  • the second node may directly send the first control information, which indicates that the second node has not correctly received the data from the first node:
  • the second node does not receive the data from the first node correctly (including the second node does not receive the data, or the second node decodes the data incorrectly);
  • the second node has the highest transmission priority of the data among the at least two candidate next-hop nodes of the first node.
  • the data has been transmitted to the node 1, and the node 1 is the above-mentioned first node.
  • the candidate next hop node of the node 1 includes node 2, node 3 and node 4, and the priority of sending the data from high to low is node 2, node 3 and node 4 in order.
  • node 2 is the above-mentioned second node.
  • Node 2 does not correctly receive the data from node 1, and node 2 has the highest transmission priority for the data, and node 2 can directly send the first control information.
  • the first control information may carry the first identifier of the node 2.
  • the number of next hop nodes may be one or more.
  • At least two candidate next-hop nodes of the first node are divided into two node groups: a first node group and a second node group.
  • the nodes in the first node group have higher priority for sending data than the nodes in the second node group have higher priority for sending data.
  • the nodes in the first node group may directly send the data if the data from the first node is decoded correctly, or if the data from the first node is decoded incorrectly or the first node’s
  • control information may be sent.
  • the control information may be NACK or SR, and the control information may carry the first identifier of the sending node.
  • the nodes in the second node group can send the data when they receive the control information sent from the nodes in the first node group and decode the data from the first node correctly. If the nodes in the second node group do not receive the control information sent from the nodes in the first node group, the nodes in the second node group may discard or ignore the data from the first node.
  • the number of nodes in the first node group and the number of nodes in the second node group may be one or more.
  • the one-hop node sends the data from the first node, which can avoid the influence of the instability of the network environment on the data transmission, and is beneficial to improve the throughput of the wireless network, thereby improving the data transmission performance.
  • the reliability of data transmission can be improved, which in turn helps to improve data transmission efficiency.
  • the data has been transmitted to node 1, which is the first node mentioned above.
  • the candidate next hop node of node 1 includes node 2, node 3 and node 4, and the priority of sending the data from high to low is node 2, node 3 and node 4 in order.
  • node 2 belongs to the first node group, and node 3 and node 4 belong to the second node group. If node 2 receives the data from node 1 and decodes it correctly, node 2 sends the data, and node 3 and node 4 have not received the control information, and may not perform any operation.
  • node 2 may send control information (such as NACK or SR) indicating that the data received from node 1 is incorrect, and nodes 3 and 4 receive the data from node 1. Control information for node 2. If node 3 and/or node 4 decodes the data from node 1 correctly, node 3 and/or node 4 can send the data. At this time, node 1 has 1 or 2 next hop nodes.
  • control information such as NACK or SR
  • the second node belongs to the first node group, and the second node is a counterpoint in the first node group The node with the lowest transmission priority of the data; the second node transmitting the data according to the priority information, and/or transmitting the first control information, including: if the second node does not receive the first ACK from other nodes in the node group, and the second node decodes the data incorrectly, the second node sends the first control information, the first control information includes NACK and/or SR.
  • At least two candidate next hop nodes of the first node are divided into two node groups: a first node group and a second node group.
  • the nodes in the first node group have higher priority for sending data than the nodes in the second node group have higher priority for sending data.
  • the second node is the node with the lowest transmission priority for data in the first node group.
  • the node with the highest transmission priority for the data can directly transmit the data when the data from the first node is correctly received, and send control information (such as ACK) indicating that the data is correctly received .
  • a node that does not have the highest transmission priority for data may receive control information (such as ACK) sent by a node that does not receive a higher priority than the node itself for transmitting data to indicate correct reception of data, and the node When the data of the first node is decoded correctly, the data is sent.
  • the second node is the node with the lowest data transmission priority in the first node group.
  • the second node may send control information (such as NACK or SR) indicating that the data from the first node is not correctly received, indicating that the first node None of the nodes in the group can send the above data, so as to trigger the nodes of the second node group to send the above data.
  • control information such as NACK or SR
  • Unable to send here can be understood as that all nodes in the first node group have not correctly received the data from the first node, or decoded the data from the first node incorrectly.
  • the nodes in the second node group can separately judge the correctness of decoding the data from the first node. Among them, the node with correct decoding can send the data, and the node with wrong decoding can send NACK or SR.
  • a node in the first node group with a higher transmission priority for data from the first node may be preferentially selected as the next hop node of the first node. If there is no node in the first node group, the node can be sent. For data nodes, one or more nodes are selected from the second node group with a lower transmission priority for the data to send the data. In this way, the influence of the instability of the network environment on the data transmission can be avoided, which is beneficial to increase the throughput of the wireless network and thereby improve the data transmission performance.
  • the node with the lowest data transmission priority in the first node group is for a plurality of nodes in the first node group. If the first node group includes only one node, the node can be regarded as the node with the highest priority for sending data in the first node group, or can be regarded as the node with priority for sending data in the first node group The node with the lowest level.
  • the priority information corresponds to the first resource; the second node sends the data according to the priority information, and/or sends the first control information, including: the second node Sending the first control information on the first resource.
  • the priority information in the embodiment of the present application indicates the priority of the second node for sending data among at least two candidate next-hop nodes of the first node.
  • the priority information of the second node corresponds to the first resource, therefore, the second node may send the first control information on the first resource. That is, the first control information sent by the second node may be carried on the first resource corresponding to the priority information of the second node.
  • the node that receives the first control information (herein referred to simply as the receiving node) may determine the priority of the node that sends the first control information (herein referred to simply as the sending node) based on the first resource.
  • the receiving node can also determine the priority order between the sending node and the receiving node (for example, the sending node has higher or lower priority than the receiving node for sending data; for example, the sending node has the priority for sending data How many priorities are higher than the sending priority of the receiving node for data).
  • the candidate next hop node of the first node may send respective control information on the resources corresponding to the respective priority information.
  • the second node receives the control information sent by the other node on the resource corresponding to the transmission priority of the other node, the second node can also determine that the node sending the control information is at least based on the resource carrying the control information The transmission priority of data in the two candidate next-hop nodes.
  • the second node may receive the second control information sent by the third node on the second resource, and the second node may determine the data transmission priority of the third node according to the second resource, and then It is determined that the data transmission priority of the third node is higher than the data transmission priority of the second node.
  • the second node may receive the third control information sent by the fourth node on the third resource, and the second node may determine the transmission priority of the fourth node to the data according to the third resource Then, it is determined that the transmission priority of the fourth node to the data is one priority higher than the transmission priority of the second node to the data.
  • priority information of different candidate next-hop nodes may correspond to different resources, and a node that sends control information may send the control information through a resource corresponding to the priority of the node for sending data.
  • the node that receives the control information can determine the priority of data transmission by the node that sends the control information through the resource that sends the control information. In this way, for a candidate next-hop node, the candidate next-hop node only needs to maintain its own priority for sending data, and does not need to maintain the priority information of all candidate next-hop nodes, which reduces the candidate next-hop node. The storage burden of the node.
  • the candidate next-hop node of the at least two candidate next-hop nodes needs to maintain the correspondence between the transmission priority and the resource, so as to determine the data transmission of the node that sends the control information according to the resource that sends the control information Send priority.
  • the corresponding relationship may be predefined, or configured by the control node to the candidate next hop node, which is not limited in this embodiment of the present application.
  • the correspondence between the sending priority and the resource can be embodied in the form of a table.
  • the above resources may include one or more of time domain resources, frequency domain resources, air domain resources, code domain resources, or identification resources.
  • the time domain resource included in the resource may include at least one frame, at least one sub-frame, at least one slot, at least one mini-slot, or at least one time Domain symbols, etc.
  • the frequency domain resource included in the resource may include at least one carrier, at least one component carrier (CC), at least one bandwidth part (BWP), and at least one resource block group (resource block) group, RBG), at least one physical resource block (PRG), at least one resource block (RB), or at least one sub-carrier (SC), etc.
  • the airspace resource included in the resource may include at least one beam, at least one port, at least one antenna port, or at least one layer/space layer, and so on.
  • the code domain resource included in the physical resource may include at least one orthogonal cover code (OCC) or at least one non-orthogonal multiple access code (NOMA).
  • the identification resource included in the resource may include a radio access network temporary identity (radio network identity, RNTI), and so on.
  • the above resources may include frequency domain resources.
  • the transmission priority of different nodes may correspond to different frequency domain resources.
  • the control information sent by the nodes with different sending priorities can be carried on different frequency domain resources.
  • the receiving node only needs to maintain the correspondence between the transmission priority and the frequency domain resource.
  • the receiving node can determine the data of the sending node that sends the control information according to the frequency domain resource carrying the control information. Sending priority. For example, as shown in the corresponding relationship in Table 1, 0-11 is the identification of frequency domain resources. According to Table 1, it can be seen that frequency domain resource 0, frequency domain resource 1, frequency domain resource 3, and/or frequency domain resource 6-9 are used.
  • the sending priority of the node sending control information is low, which is the lowest, and the sending priority of the node sending control information using frequency domain resource 2, frequency domain resource 5, frequency domain resource 10, and/or frequency domain resource 11 is medium,
  • the node that uses the frequency domain resource 4 to send control information has a priority of high, which is the highest.
  • one priority may correspond to one frequency domain resource or multiple frequency domain resources, which is not limited in this embodiment.
  • the above resources may include time domain resources.
  • the sending priority of different nodes can correspond to different time domain resources.
  • the control information sent by nodes with different sending priorities can be carried on different time domain resources.
  • the receiving node only needs to maintain the correspondence between the transmission priority and the time domain resource. After receiving the control information, the receiving node can determine the data of the sending node that sends the control information according to the time domain resource carrying the control information. Sending priority. For example, as shown in the corresponding relationship in Table 2, 0-13 is the identifier of the time domain resource.
  • the transmission priority of the node that uses the time domain resource 11 to send control information is low, which is the lowest, and the time domain Resource 4, time domain resource 9 and/or time domain resource 10
  • the priority of the node sending control information is medium
  • the time domain resource 0-3 and/or time domain resource 5-8 is the priority of the node sending control information
  • the level is high, which is the highest.
  • one priority may correspond to one time domain resource or multiple time domain resources, which is not limited in this embodiment.
  • the above resource may be a resource control resource set (control reset, set, CORESET), where CORESET represents a set of time-frequency resources used to carry control information.
  • the sending priority of different nodes can correspond to different CORESET.
  • the control information sent by the nodes with different sending priorities can be carried on different CORESET.
  • the receiving node only needs to maintain the correspondence between the above sending priority and CORESET.
  • the receiving node can determine the sending priority of the sending node that sends the control information to the data according to the CORESET carrying the control information. .
  • 1-5 is the identifier of CORESET.
  • the node that uses CORESET 1 to send control information has the lowest transmission priority, which is the lowest, and uses CORESET 2 and/or CORESET 3
  • the sending priority of the node sending control information is medium, and the sending priority of the node sending control information using CORESET 4 and/or CORESET 5 is high, which is the highest.
  • one priority level may correspond to one CORESET or multiple CORESETs, which is not limited in this embodiment.
  • the above resources may include airspace resources.
  • the sending priority of different nodes can correspond to different airspace resources.
  • the control information sent by the nodes with different sending priorities can be carried on different airspace resources.
  • the receiving node only needs to maintain the correspondence between the transmission priority and the airspace resource. After receiving the control information, the receiving node can determine the sending of the control information to the data according to the airspace resource carrying the control information. priority.
  • the above resources may include code domain resources.
  • the sending priority of different nodes may correspond to different code domain resources.
  • the control information sent by nodes with different sending priorities can be carried on different code domain resources.
  • the receiving node only needs to maintain the correspondence between the transmission priority and the code domain resource. After receiving the control information, the receiving node can determine the data of the sending node that sends the control information according to the code domain resource carrying the control information. Sending priority.
  • the above resource may include an identification resource, which is referred to herein as a second identification.
  • the sending priority of different nodes may correspond to different second identifiers, and the second identifier is used to identify the priority of the node that sends the control information.
  • the second identifier may be carried in the control information and may be sent by using the second identifier to scramble the control information.
  • the receiving node only needs to maintain the correspondence between the transmission priority and the second identifier. After receiving the control information, the receiving node can determine the data transmission priority of the sending node that sends the control information according to the second identifier.
  • the second identifier is a radio access network temporary identifier (RNTI), and control information sent by nodes with different transmission priorities may be scrambled by different RNTIs.
  • RNTI radio access network temporary identifier
  • the first control information of the second node may also be scrambled using a group radio access network temporary identity (group radio network identity, Group RNTI).
  • group radio network identity group radio network identity, Group RNTI
  • the control information sent by the nodes of the first node group may be scrambled by a Group RNTI
  • the control information sent by the nodes of the second node group may be After receiving the first control information sent by the second node and scrambled by the Group RNTI, the receiving node can determine that the second node belongs to the first node group according to the Group RNTI. Further, the receiving The node may determine the data transmission priority of the second node in combination with the above resources.
  • control information in the embodiments of the present application may be sent in one of the following ways:
  • the resource is transmitted at the rate of the resource block level of the uplink transmission, downlink transmission, or side link transmission (rate matching) resources, and the transmitted channel can reuse the existing uplink transmission, downlink transmission, or side channel transmission channels;
  • BWP configured bandwidth part
  • the BWP is configured for routing related functions
  • uplink control information (uplink control information, UCI), specifically through physical uplink control channel (physical uplink control channel, PUCCH) or physical uplink shared channel (physical uplink link shared channel, PUSCH);
  • UCI uplink control information
  • PUCCH physical uplink control channel
  • PUSCH physical uplink shared channel
  • sidelink control information is sent by adding a domain indication in the existing sidelink control information (sidelink control information) or adding sidelink control information. Specifically, it can be transmitted through a physical sidelink control channel (physical sidelink control channel, PSCCH) or a physical sidelink shared channel (physical sidelink shared channel, PSSCH).
  • PSCCH physical sidelink control channel
  • PSSCH physical sidelink shared channel
  • the data is transmitted from the source node to the destination node, and the priority information is based on the number of hops from the candidate next hop node to the destination node among the at least two candidate next hop nodes , And/or, the number of hops from the source node to the candidate next hop node is determined.
  • the data transmission priority of each node in the embodiments of the present application may be determined according to some given criteria.
  • the priority of each candidate next-hop node can be determined according to the number of hops from at least two candidate next-hop nodes of the first node to the destination node. If a node has more hops to the destination node, the node’s The lower the priority, the higher the priority of the node.
  • the priority of each candidate next-hop node may be determined according to the number of hops from the source node to the at least two candidate next-hop nodes. If the number of hops from the source node to one node is greater, the priority of the node The lower the value, the higher the priority of the node.
  • channel quality from the source node to the candidate next hop node and/or the channel quality from the candidate next hop node to the destination node can also be combined to determine the priority of the candidate next hop node more accurately, but this application is implemented Examples do not limit this.
  • the source node is node 10
  • the destination node is node 7
  • the candidate next hop nodes of node 1 are node 2, node 3, and node 4.
  • the hop count from node 2 to node 7 is 1 hop
  • the hop count from node 3 to node 7 is 2 hops
  • the hop count from node 4 to node 7 is 2 hops. Since the number of hops from node 2 to the destination node is the smallest, the priority of node 2 can be determined first.
  • the channel quality from node 3 to node 7 and the channel quality from node 4 to node 7 are obtained, and the node with the higher channel quality from node 3 and node 4 to node 7 is selected as the node with the second highest priority.
  • the remaining nodes are the nodes with the lowest priority.
  • An embodiment of the present application further provides another data transmission method, including: a first node sends data, the first node has at least two candidate next-hop nodes, and the at least two candidate next-hop nodes include a second Node, the second node receives data from the first node; the second node sends control information to the first node based on whether the data is decoded correctly, the control information is affirmative reply ACK, negative Reply to either NACK or scheduling request SR; the first node receives control information from all or part of the at least two candidate next-hop nodes; the first node according to the control information, from Determining a next-hop node among the at least two candidate next-hop nodes; the first node sends indication information to the next-hop node, the indication information is used to instruct sending of the data; the second node Receiving instruction information sent by the first node, where the instruction information is used to instruct sending of the data; and the second node sends the data according to the instruction information.
  • the first node may serve as a control node, and according to the control information fed back by multiple candidate next-hop nodes (including control information fed back by the second node), the first node may select from the candidate next-hop nodes that feedback ACK It is used to send data to the next-hop node, and sends instruction information to the next-hop node to instruct the next-hop node to send data.
  • the first node determining the next hop node from the at least two candidate next hop nodes according to the control information and priority information includes: sending the Among the candidate next-hop nodes of ACK, the first node determines at least one node with a higher transmission priority for the data as the next-hop node; or, in the at least two candidate next-hop nodes Among the nodes, the remaining nodes other than the candidate next-hop node that sends the NACK or the SR, the first node determines at least one node that has a higher transmission priority for the data as the next node Jump node.
  • At least one node with a higher priority refers to a node that ranks multiple candidate next-hop nodes in order of priority from high to low, and ranks at least in the first place.
  • the priority is the second node, the third node, the fourth node, and the fifth node in order from high to low
  • the higher priority node is the second Nodes
  • the two nodes with higher priority are the second node and the third node.
  • the first node may further combine the priority information to determine the next hop node, and the priority information may be maintained only in the first node, and the candidate next hop node of the first node does not need to maintain the above priority For information, only the corresponding control information needs to be fed back according to the received data, so that the burden on each candidate next hop node can be reduced.
  • a node decodes data incorrectly may be regarded as a node that has not received a signal
  • a node decodes data correctly may be regarded as a node that has received a signal.
  • a node receiving data may indicate that the node decodes the data correctly
  • a node not receiving data may indicate that the node decodes the data incorrectly.
  • the data has been transmitted to node 1.
  • the candidate next-hop nodes of node 1 include node 2, node 3 and node 4.
  • the priority of sending the data from high to low is node 2, node 3 and node 4.
  • node 1 sends data
  • node 2, node 3, and node 4 all receive data from node 1. Since node 2 has the highest priority for sending the data among the candidate next hop nodes of node 1, node 2 decodes the data correctly, and node 2 can directly send the data. Further, the node 2 may also send an ACK, indicating that the node 2 correctly receives the data from the node 1.
  • the ACK may carry the first identifier of the node 2. In this embodiment, it is simply referred to as A2.
  • Node 3 does not have the highest transmission priority for the data among the candidate next-hop nodes of node 1, and node 3 needs to determine whether it has received an ACK sent by a node with a higher priority than the transmission priority of the node 3 for the data.
  • the node with a higher priority than node 3 for sending the data is node 2.
  • Node 3 does not receive A2 from node 2, and node 3 decodes the data correctly.
  • Node 3 can send an ACK to indicate that node 3 correctly received the data from node 1.
  • the ACK may carry the first identifier of the node 3, which is abbreviated as A3 in this embodiment.
  • node 3 since the transmission priority of the node 3 for the data is not the highest among the candidate next-hop nodes of the node 1, the node 3 cannot directly transmit the data after the decoding is correct. Because node 2 may have sent A2, but node 3 has not received A2, in order to ensure the accuracy of the information, in the embodiment of this application, node 3 can start a timer, before the timer expires, detect whether A2 is received, The A2 may be from other nodes.
  • Node 4 does not have the highest transmission priority for the data among the candidate next-hop nodes of node 1, and node 4 needs to determine whether it has received an ACK sent by a node with a higher priority than the transmission priority of the node 4 for the data. As shown in FIG. 3, node 4 receives A2 from node 2 and A3 from node 3. Since node 2 has a higher transmission priority for the data than node 3 has, the node 4 can send A2 .
  • node 3 receives A2 from node 4 and confirms that a node with a higher priority than node 3 can send the data, and node 3 will not send the data again.
  • node 2 may send the data at any time after determining that the data is decoded correctly (ie, receiving data from the first node), that is, the time for node 2 to send the data may be at node 2 Before sending A2, it is also possible that after node 2 sends A2, the data and A2 can also be sent at the same time, and the order of this application is not limited.
  • candidate next-hop nodes of node 2 are node 5, node 6, and node 7. Since node 7 is the destination node, the priority of node 7 among these three nodes must be the highest. Then, if node 7 receives the data from node 2, node 7 can feedback ACK, then node 5 and node 6 are receiving After the ACK, you can do nothing. If node 7 does not receive the data from node 2 and feeds back NACK or SR, then nodes 5 and 6 need to further select the node to send the above data to node 7 according to the transmission priority of the data. It should be understood that the above embodiments are only exemplified for specific situations. In actual application, there are many possibilities in the process of data transmission between nodes, which is not limited in the embodiments of the present application.
  • node 2 is selected as the next-hop node of node 1 to transmit data by exchanging ACK between candidate next-hop nodes, and the next hop is selected from multiple candidate next-hop nodes in real time
  • Node transmission of data can avoid the impact of instability of the network environment on data transmission, and is beneficial to increase the throughput of wireless networks, thereby improving data transmission performance.
  • node 1 sends data
  • node 3 and node 4 receive data from node 1. Since node 2 has the highest priority for sending the data among the candidate next-hop nodes of node 1, node 2 does not receive the data from node 1, and node 2 can directly send a NACK, indicating that node 2 did not receive the data correctly. Data for node 1.
  • the NACK may carry the first identifier of the node 2, which is simply referred to as N2 in this embodiment.
  • Node 3 does not have the highest transmission priority for the data among the candidate next-hop nodes of node 1, and node 3 needs to determine whether it has received a node that is one priority higher than the transmission priority of the node 3 for the data. NACK.
  • the node that is one priority higher than the priority that node 3 sends to the data is node 2.
  • node 3 does not receive N2 from node 2. It should be noted here that since the transmission priority of node 3 for the data is not the highest among the next-hop candidate nodes of node 1, node 3 cannot determine whether a node with a higher transmission priority for the data than the node 3 The data was received correctly. Because node 2 may have sent N2, but due to network reasons, node 3 has not received N2.
  • node 3 may start a timer, before the timer expires, detect whether to receive To N2, the N2 may be from other nodes.
  • node 4 does not have the highest transmission priority for the data among the candidate next-hop nodes of node 1, and node 4 also needs to determine whether it has received a priority higher than the transmission priority of the node 4 for the data NACK sent by the node.
  • the node that is one priority higher than the transmission priority of node 4 for the data is node 3.
  • Node 4 may start a timer, and before the timer expires, detect whether a NACK carrying the first identifier of node 3 is received, referred to as N3 for short. If the node 4 in this embodiment does not receive N3, it determines not to send the data. As shown in FIG. 3, node 4 receives N2 from node 2, and node 4 sends the N2.
  • Node 3 receives N2 from node 4 before the timer expires, and node 3 decodes the data correctly, then node 3 can send the data.
  • the node 3 receives the data from the node 1. Even if the data is decoded correctly, the node 3 must also receive the data Only after N2 of 2 can the above data be sent.
  • the data from node 1 will continue to be sent from node 3, and node 3 can send the data to the next hop candidate node of node 3.
  • the candidate next hop node of node 3 includes node 2 and node 5, then node 3 can send the data, and then the information between node 2 and node 5 is based on the actual situation Interactively, select a next-hop node to continue sending data to node 7. It should be understood that the above embodiments are only exemplified for specific situations. In actual application, there are many possibilities in the process of data transmission between nodes, which is not limited in the embodiments of the present application.
  • node N3 is exchanged between candidate next-hop nodes, thereby selecting node 3 as the next-hop node of node 1 to transmit data, and selecting the next hop from multiple candidate next-hop nodes in real time
  • Node transmission of data can avoid the impact of instability of the network environment on data transmission, and is beneficial to increase the throughput of wireless networks, thereby improving data transmission performance.
  • node 1 sends data
  • node 3 and node 4 receive data from node 1.
  • multiple candidate next hop nodes of node 1 are divided into two node groups, where node 2 belongs to the first node group, and node 3 and node 4 belong to the second node group.
  • the data transmission priority of the first node group is higher than the data transmission priority of the second node group. Since node 2 has the highest priority for sending the data among the candidate next-hop nodes of node 1, node 2 does not receive the data from node 1, and node 2 can directly send a NACK, indicating that node 2 did not receive the data correctly.
  • the NACK may carry the first identifier of the node 2, which is simply referred to as N2 in this embodiment.
  • Both node 3 and node 4 decode the above data from node 1 correctly, and both node 3 and node 4 receive N2 sent from the node in the first node group (ie node 2), as shown in Figure 5, Both node 3 and node 4 can send this data.
  • this embodiment can send data through multiple next-hop nodes, which can improve the reliability of data transmission.
  • the node 3 may send the data to the candidate next hop node of the node 3.
  • the candidate next hop node of node 3 includes node 2 and node 5, then node 3 can send the data, and then the information between node 2 and node 5 is based on the actual situation Interactively, select the next hop node to continue sending data to node 7.
  • the node 4 may send the data to the candidate next hop node of the node 4.
  • the candidate next hop node of node 4 includes node 2 and node 6, then, node 4 can send the data, and then the information between node 2 and node 6 is based on the actual situation Interactively, select the next hop node to continue sending data to node 7. It should be understood that the above embodiments are only exemplified for specific situations. In actual application, there are many possibilities in the process of data transmission between nodes, which is not limited in the embodiments of the present application.
  • node 3 and node 4 are selected as the next hop node of node 1 to transmit data by interacting NACK between candidate next hop nodes, and real-time selection from multiple candidate next hop nodes
  • the next hop node transmits data, which can avoid the influence of the instability of the network environment on the data transmission, and is beneficial to increase the throughput of the wireless network, thereby improving the data transmission performance.
  • node 1 sends data
  • node 4 receives data from node 1.
  • multiple candidate next hop nodes of node 1 are divided into two node groups, of which node 2 and node 3 belong to the first node group, and node 4 belongs to the second node group.
  • the data transmission priority of the first node group is higher than the data transmission priority of the second node group.
  • node 3 is the node with the lowest transmission priority for data in the first node group.
  • Node 2 does not receive the data from node 1 and will not send an ACK carrying the first identifier of node 2, referred to as A2 for short.
  • node 3 Since node 3 has the lowest priority for sending data in the first node group, node 3 does not receive A2 from node 2, and node 3 can directly send a NACK, indicating that node 3 did not receive the data from node 1 correctly.
  • the NACK may carry the first identifier of the node 3, which is abbreviated as N3 in this embodiment.
  • Node 4 receives N3 from node 3, and node 4 decodes the data correctly, then node 4 can send the data.
  • the data from node 1 will continue to be sent from node 4.
  • the node 4 may send the data to the candidate next hop node of the node 4.
  • the candidate next hop node of node 4 includes node 2 and node 6, then, node 4 can send the data, and then the information between node 2 and node 6 is based on the actual situation Interactively, select the next hop node to continue sending data to node 7.
  • the above embodiments are only exemplified for specific situations. In actual application, there are many possibilities in the process of data transmission between nodes, which is not limited in the embodiments of the present application.
  • node 4 is selected as the next hop node of node 1 to transmit data by exchanging ACK and/or NACK between candidate next hop nodes, and real-time data from multiple candidate next hop nodes Choosing the next hop node to transmit data can avoid the impact of the instability of the network environment on the data transmission, which is beneficial to improve the throughput of the wireless network and thus improve the data transmission performance.
  • node 1 sends data
  • node 3 and node 4 receive data from node 1. Since node 2 does not receive the data from node 1, node 2 may directly send a NACK carrying the first identifier of node 2, abbreviated as N2. Both node 3 and node 4 decode the data correctly.
  • Node 3 can send an ACK carrying the first identifier of node 3, referred to as A3, and node 4 can send an ACK carrying the first identifier of node 4, referred to as A4.
  • Node 1 receives N2, A3, and A4, and determines that node 3 and node 4 can send the data.
  • the node 1 can select a node as the next hop node according to the data transmission priority of the node 3 and the node 4.
  • the priority of node 3 for sending data is higher than the priority of node 4 for sending data, and node 1 can send instruction information to node 3 to instruct node 3 to send the data. After receiving the instruction information from node 1, node 3 can send the data.
  • the data from node 1 will continue to be sent from node 3, and node 3 can send the data to the next hop candidate node of node 3.
  • the candidate next hop node of node 3 includes node 2 and node 5, then node 3 can send the data, and then the information between node 2 and node 5 is based on the actual situation Interactively, select a next-hop node to continue sending data to node 7. It should be understood that the above embodiments are only exemplified for specific situations. In actual application, there are many possibilities in the process of data transmission between nodes, which is not limited in the embodiments of the present application.
  • node 1 is used as the control node, and node 3 is selected as the next node 1 according to the ACK and/or NACK reported by the candidate next-hop node, combined with the data transmission priority of each node
  • the hop node transmits data
  • the next hop node is selected from multiple candidate next hop nodes to transmit data in real time, which can avoid the influence of the instability of the network environment on the data transmission, and is beneficial to increase the throughput of the wireless network, thereby improving the data Transmission performance.
  • each candidate next hop node needs to maintain the transmission priority of each candidate next-hop node for data, while other candidate next-hop nodes need not know their own transmission priority for data from node 1 .
  • each candidate next hop node since each candidate next hop node needs to be judged according to its own priority for sending data of node 1, each candidate next hop node must at least maintain itself The priority of sending data to node 1 in order to execute the subsequent process.
  • FIG. 8 shows an apparatus 800 provided by an embodiment of the present application.
  • the device corresponds to the second node in the foregoing embodiment.
  • the device 800 may be a terminal device or a chip in the terminal device.
  • the apparatus may be a network device or a chip in the network device.
  • the device 800 includes a receiving unit 810 and a sending unit 820.
  • the receiving unit 810 is configured to receive data from a first node, and the second node is one of at least two candidate next-hop nodes of the first node;
  • the sending unit 820 is configured to send the data according to priority information, and/or send first control information, where the priority information is used to indicate that the device is in the at least two candidate next hop nodes Priority for sending the data.
  • the candidate next-hop nodes of the at least two candidate next-hop nodes can determine whether to send according to their own priority information Data from the first node, so as to select the next hop node for the first node to transmit data.
  • the embodiment of the present application can select one or more next-hop nodes from at least two candidate next-hop nodes to continue transmitting data in real time when the data reaches the candidate next-hop node, and can avoid the instability of the network environment. The resulting impact is conducive to improving the throughput of the wireless network, thereby improving data transmission performance.
  • the sending unit 820 is specifically configured to: if the device has the highest priority for sending the data among the at least two candidate next-hop nodes, and the device decodes the data correctly, Send the data.
  • the device further includes: a first processing unit, configured to determine whether the data received from the at least two candidate next-hop nodes has the highest priority for sending the data Second control information of at least one third node, the at least one third node being the priority of sending data to the data in the at least two candidate next hop nodes is higher than the priority of sending data by the device
  • the second control information is used to indicate that the data is decoded correctly
  • the sending unit 820 is specifically configured to: if the device does not receive the second control information, and the device The data is decoded correctly and the data is sent.
  • the sending unit 820 is specifically configured to: if the device receives the second control information, send the first control information, where the first control information includes data from the at least one third node The second control information of the node with the highest transmission priority for the data.
  • the sending unit 820 is specifically configured to send the data and the first control information, and the first control information includes an affirmative reply ACK.
  • the device further includes: a second processing unit, configured to determine whether the data is received from the at least two candidate next hop nodes if the data transmission priority is not the highest Third control information of a fourth node, the fourth node being the priority of sending the data among the at least two candidate next hop nodes by one priority higher than the priority of the device sending the data Node, the third control information is used to indicate an error in decoding the data; the sending unit 820 is specifically configured to: if the device receives the third control information and the device responds to the data The decoding is correct and the data is sent.
  • the sending unit 820 is specifically configured to: if the device receives the third control information and the device decodes the data incorrectly, send the first control information, the first The control information includes a negative reply NACK and/or a scheduling request SR.
  • the second processing unit is further configured to: if the device does not receive the third control information, determine whether to receive fourth control information from at least one fifth node, the at least one fifth The node is a node that has at least two priority levels for sending the data among the at least two candidate next hop nodes that are higher than the device's sending priority for the data, and the fourth control information is used to Indicates that the data decoding error; the sending unit 820 is specifically configured to: if the device receives the fourth control information, send the first control information, the first control information includes The fourth control information of a fifth node with the lowest transmission priority of the data in a fifth node.
  • the sending unit 820 is specifically configured to: if the device has the highest priority for sending the data among the at least two candidate next-hop nodes, and the device decodes the data incorrectly , Sending the first control information, where the first control information includes NACK and/or SR.
  • the priority information corresponds to the first resource; the sending unit 820 is specifically configured to send the first control information on the first resource.
  • the device 800 here is embodied in the form of a functional unit.
  • the term "unit” here may refer to an application-specific integrated circuit (application specific integrated circuit, ASIC), an electronic circuit, a processor (such as a shared processor, a proprietary processor or a group) for executing one or more software or firmware programs Processor, etc.) and memory, merge logic, and/or other suitable components that support the described functions.
  • ASIC application specific integrated circuit
  • processor such as a shared processor, a proprietary processor or a group
  • memory merge logic, and/or other suitable components that support the described functions.
  • the apparatus 800 may specifically be the second node in the foregoing embodiment, and the apparatus 800 may be used to execute various processes and/or corresponding to the second node in the foregoing method embodiment Steps, to avoid repetition, will not repeat them here.
  • the device 800 of each of the above solutions has a function of implementing the corresponding steps performed by the second node in the above method; the function may be implemented by hardware, or may be implemented by hardware executing corresponding software.
  • the hardware or software includes one or more modules corresponding to the above functions; for example, the sending unit may be replaced by a transmitter, the receiving unit 810 may be replaced by a receiver, and other units, such as a determination unit, may be replaced by processors, respectively Perform the sending and receiving operations and related processing operations in each method embodiment.
  • the device in FIG. 8 may also be a chip or a chip system, for example, a system on chip (SoC).
  • the receiving unit 810 and the sending unit may be the transceiver circuit of the chip, which is not limited herein.
  • FIG. 9 shows another device 900 provided by an embodiment of the present application.
  • the device 900 includes a processor 910, a transceiver 920, and a memory 930.
  • the processor 910, the transceiver 920 and the memory 930 communicate with each other through an internal connection path.
  • the memory 930 is used to store instructions.
  • the processor 910 is used to execute the instructions stored in the memory 930 to control the transceiver 920 to send signals and /Or receive signals.
  • the processor 910 is used to: receive data from the first node through the transceiver 920, the device is one of at least two candidate next hop nodes of the first node; according to the priority information, pass The transceiver 920 sends the data, and/or sends first control information, and the priority information is used to indicate the priority of the device for sending the data in the at least two candidate next-hop nodes .
  • the apparatus 900 may specifically be the second node in the foregoing embodiments, and may be used to execute various steps and/or processes corresponding to the second node in the foregoing method embodiments.
  • the memory 930 may include a read-only memory and a random access memory, and provide instructions and data to the processor. A portion of the memory may also include non-volatile random access memory.
  • the memory may also store device type information.
  • the processor 910 may be used to execute the instructions stored in the memory, and when the processor 910 executes the instructions stored in the memory, the processor 910 is used to execute the steps and the method embodiments corresponding to the second node /Or process.
  • the processor of the above device may be a central processing unit (CPU), and the processor may also be other general-purpose processors, digital signal processors (DSPs), and application-specific integrated circuits. (ASIC), field programmable gate array (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc.
  • the general-purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
  • the foregoing memory 930 may be included in the processor 910.
  • the processor 910 itself can execute the function of storing instructions of the memory 930, which is not limited in the embodiment of the present application.
  • each step of the above method may be completed by an integrated logic circuit of hardware in the processor or instructions in the form of software.
  • the steps of the method disclosed in conjunction with the embodiments of the present application may be directly embodied and executed by a hardware processor, or may be executed and completed by a combination of hardware and software units in the processor.
  • the software unit may be located in a mature storage medium in the art, such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory, an electrically erasable programmable memory, and a register.
  • the storage medium is located in the memory, and the processor executes the instructions in the memory and completes the steps of the above method in combination with its hardware. In order to avoid repetition, they are not described in detail here.
  • the disclosed system, device, and method may be implemented in other ways.
  • the device embodiments described above are only schematic.
  • the division of the units is only a division of logical functions.
  • there may be other divisions for example, multiple units or components may be combined or Can be integrated into another system, or some features can be ignored, or not implemented.
  • the displayed or discussed mutual couplings or direct couplings or communication connections may be indirect couplings or communication connections through some interfaces, devices, or units, and may also be electrical, mechanical, or other forms of connection.
  • the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or may be distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the objectives of the solutions of the embodiments of the present application.
  • the functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit.
  • the above integrated unit may be implemented in the form of hardware or software functional unit.
  • the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it may be stored in a computer-readable storage medium.
  • the technical solution of the present application essentially or part of the contribution to the existing technology, or all or part of the technical solution can be embodied in the form of a software product
  • the computer software product is stored in a storage medium
  • several instructions are included to enable 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 the embodiments of the present application.
  • the aforementioned storage media include: U disk, mobile hard disk, read-only memory (ROM), random access memory (random access memory, RAM), magnetic disk or optical disk and other media that can store program codes .

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

本申请提供了一种数据传输方法和装置，该方法包括：第二节点接收来自第一节点的数据，该第二节点为该第一节点的至少两个候选下一跳节点中的一个；该第二节点根据优先级信息，发送上述数据，和/或，发送第一控制信息，该优先级信息用于表示该第二节点在该至少两个候选下一跳节点中对该数据的发送优先级。本申请实施例的数据传输方法和装置，有利于提高无线网络的吞吐量，进而提高数据传输性能。

Description

数据传输方法和装置
本申请要求于2018年12月12日提交中国专利局、申请号为201811515587.4、申请名称为“数据传输方法和装置”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请涉及通信领域，特别涉及通信领域中的数据传输方法和装置。
背景技术
无线网状(mesh)网络也称为“多跳(multi-hop)”网络，是一种具有网状拓扑的网络。无线mesh网络中需借助路由协议完成数据的传输。
目前，无线mesh网络的路由协议主要是借鉴Ad-Hoc网络的路由协议，主要分为以下三种：1)表驱动路由协议，也叫先验式路由协议，即节点平时维护一个路由表，当网络中有数据需要发送时便直接使用；2)按需路由协议，也叫反应式路由协议，即当网络中有数据需要发送时才开始准备路由的建立；3)混合式路由协议，即前二者的混合。以上的路由方法，最终结果都是为用户建立一个从源节点到目的节点的路径。一旦路径建立好，只要路径中节点不损坏，则从源节点到目的节点的数据则会在该路径上由源节点传输至目的节点。但是，无线网络环境的不稳定性使得网络环境经常会发生无法预知的变化，这样可能导致在已确定的路径上的下一跳节点无法通过准确地寻址得到，或者该下一跳节点无法正确接收数据，从而导致无线mesh网络的吞吐量较低，数据传输性能较差。
发明内容
本申请提供一种数据传输方法和装置，有利于提高无线网络的吞吐量，进而提高数据传输性能。
第一方面，提供了一种数据传输方法，包括：第二节点接收来自第一节点的数据，所述第二节点为所述第一节点的至少两个候选下一跳节点中的一个；所述第二节点根据优先级信息，发送所述数据，和/或，发送第一控制信息，所述优先级信息用于表示所述第二节点在所述至少两个候选下一跳节点中对所述数据的发送优先级。
具体而言，上述第二节点可以根据优先级信息，仅发送来自第一节点的数据，或者仅发送第一控制信息，或者既发送来自第一节点的数据，又发送第一控制信息。可选地，该第一控制信息可以包括肯定答复(acknowledgement，ACK)、否定答复(non-acknowledgement，NACK)或调度请求(scheduling request，SR)中的至少一个。
本申请实施例的数据传输方法，通过为第一节点配置至少两个候选下一跳节点，该至少两个候选下一跳节点中的一个候选下一跳节点可以根据自身的优先级信息，确定是否发送来自第一节点的数据，从而为该第一节点选择出合适的下一跳节点进行数据传输。本申 请实施例能够在数据到达候选下一跳节点时，从至少两个候选下一跳节点中实时选择一个或多个下一跳节点继续传输数据，能够避免网络环境的不稳定性对数据传输造成的影响，有利于提高无线网络的吞吐量，进而提高数据传输性能。
结合第一方面，在第一方面的某些实现方式中，所述第二节点根据优先级信息，发送所述数据，和/或，发送第一控制信息，包括：若所述第二节点在所述至少两个候选下一跳节点中对所述数据的发送优先级最高，且所述第二节点对所述数据译码正确，所述第二节点发送所述数据。
结合第一方面，在第一方面的某些实现方式中，所述方法还包括：若所述第二节点在所述至少两个候选下一跳节点中对所述数据的发送优先级不是最高的，所述第二节点确定是否接收到来自至少一个第三节点的第二控制信息，所述至少一个第三节点为所述至少两个候选下一跳节点中对所述数据的发送优先级比所述第二节点对所述数据的发送优先级高的节点，所述第二控制信息用于表示对所述数据译码正确；所述第二节点根据优先级信息，发送所述数据，和/或，发送第一控制信息，包括：若所述第二节点未接收到所述第二控制信息，且所述第二节点对所述数据译码正确，所述第二节点发送所述数据。
结合第一方面，在第一方面的某些实现方式中，所述第二节点根据优先级信息，发送所述数据，和/或，发送第一控制信息，包括：若所述第二节点接收到所述第二控制信息，所述第二节点发送所述第一控制信息，所述第一控制信息包括来自所述至少一个第三节点中对所述数据的发送优先级最高的节点的第二控制信息。
具体地，若第二节点对该数据的发送优先级在第一节点的至少两个候选下一跳节点中不是最高的，该第二节点需要确定是否接收到对该数据的发送优先级比第二节点更高的第三节点发送的第二控制信息。该第二控制信息表示第三节点对数据译码正确。可选地，该第二控制信息可以为ACK。应理解，对数据的发送优先级比第二节点高的节点可能为一个，也可能为多个，本申请实施例称为至少一个第三节点。可选地，上述第二控制信息为该至少一个第三节点中的每个第三节点发送的各自的第二控制信息；因此，第二控制信息的数量与第三节点的数量相同。可选地，上述第二控制信息可以携带与其对应的第三节点的第一标识，该第一标识为节点标识，用于表明该第二控制信息的来源。在本实施例中，第三节点的第一标识可以直接在该第三节点发送的第二控制信息中显式携带，也可以通过隐式的方式携带(例如，通过标识信息加扰该第二控制信息等)，本申请实施例对此不作限定。
结合第一方面，在第一方面的某些实现方式中，所述第二节点根据优先级信息，发送所述数据，和/或，发送第一控制信息，包括：所述第二节点发送所述数据和所述第一控制信息，所述第一控制信息包括肯定答复ACK。
应理解，上述第二节点可以根据优先级信息，既发送来自第一节点的数据，又发送第一控制信息，该第一控制信息包括ACK，用于表示第二节点对来自第一节点的数据译码正确。在本实施例中，第二节点在确定了发送来自第一节点的数据(即第二节点为第一节点的下一跳节点)的情况下，发送包括ACK的第一控制信息，是为了便于其他节点获知这一情况，其他节点便可以不再发送来自第一节点的数据。这样，能够降低其他节点的传输负担，降低其他节点的功耗，从而有利于降低***的功耗和运行复杂度。
结合第一方面，在第一方面的某些实现方式中，所述方法还包括：若所述第二节点在 所述至少两个候选下一跳节点中对所述数据的发送优先级不是最高的，所述第二节点确定是否接收到来自第四节点的第三控制信息，所述第四节点为所述至少两个候选下一跳节点中对所述数据的发送优先级比所述第二节点对所述数据的发送优先级高一个优先级的节点，所述第三控制信息用于表示对所述数据译码错误；所述第二节点根据优先级信息，发送所述数据，和/或，发送第一控制信息，包括：若所述第二节点接收到所述第三控制信息，且所述第二节点对所述数据译码正确，所述第二节点发送所述数据。
结合第一方面，在第一方面的某些实现方式中，所述第二节点根据优先级信息，发送所述数据，和/或，发送第一控制信息，包括：若所述第二节点接收到所述第三控制信息，且所述第二节点对所述数据译码错误，所述第二节点发送所述第一控制信息，所述第一控制信息包括否定答复NACK和/或调度请求SR。
结合第一方面，在第一方面的某些实现方式中，所述方法还包括：若所述第二节点未接收到所述第三控制信息，所述第二节点确定是否接收到来自至少一个第五节点的第四控制信息，所述至少一个第五节点为所述至少两个候选下一跳节点中对所述数据的发送优先级比所述第二节点对所述数据的发送优先级高至少两个优先级的节点，所述第四控制信息用于表示对所述数据译码错误；所述第二节点根据优先级信息，发送所述数据，和/或，发送第一控制信息，包括：若所述第二节点接收到所述第四控制信息，所述第二节点发送所述第一控制信息，所述第一控制信息包括来自所述至少一个第五节点中对所述数据的发送优先级最低的一个第五节点的第四控制信息。
具体地，若第二节点对该数据的发送优先级在第一节点的至少两个候选下一跳节点中不是最高的，该第二节点需要确定是否接收到对该数据的发送优先级比第二节点高一个优先级的第四节点发送的第三控制信息。该第三控制信息表示第四节点对来自第一节点的数据译码错误，或者表示第四节点未接收到来自第一节点的数据。该第三控制信息可以为NACK和/或SR。应理解，对数据的发送优先级比第二节点高一个优先级的节点为一个或多个，本申请实施例称为第四节点。对应地，第三控制信息的数量也为一个或多个。可选地，上述第三控制信息可以携带与其对应的第四节点的第一标识，该第一标识为节点标识，用于表明该第三控制信息的来源。第四节点的第一标识可以直接在该第三控制信息中显式携带，也可以通过隐式的方式携带(例如，通过标识信息加扰该第三控制信息等)，本申请实施例对此不作限定。
在一种可能的实现方式中，多个不同节点对来自第一节点的数据可以具有相同的发送优先级，这样，一个优先级可以对应一个节点或多个节点，上述对数据的发送优先级比第二节点高一个优先级的节点可以为一个，也可以为多个。在另一种可能的实现方式中，不同节点对来自第一节点的数据具有不同的优先级，这样一个优先级仅对应一个节点，上述对数据的发送优先级比第二节点高一个优先级的节点为一个节点。应理解，一个优先级对应一个节点还是对应多个节点，可以取决于网络的配置或由节点间通过交互过程(例如同步过程、接入过程、发现过程、或拓扑形成过程中的一种或多种)确定，此处不作限定。
可以理解的是，本申请实施例的“高一个优先级”、“高至少两个优先级”是第一节点的至少两个候选下一跳节点对数据的发送优先级的排序。例如，在一种网络架构中，节点1的候选下一跳节点包括节点2、节点3和节点4，对该数据的发送优先级从高到低排序依次为节点2、节点3、节点4。因此，节点3对数据的发送优先级比节点4对数据的 发送优先级高一个优先级，节点2对数据的发送优先级比节点4对数据的发送优先级高两个优先级。又例如，在另一种网络架构中，节点1的候选下一跳节点还包括节点5等其他节点，对数据的发送优先级从高到低排序依次为节点2、节点3、节点4、节点5，那么节点2对数据的发送优先级就比节点5对数据的发送优先级高三个优先级，即高至少两个优先级。
结合第一方面，在第一方面的某些实现方式中，所述第二节点根据优先级信息，发送所述数据，和/或，发送第一控制信息，包括：若所述第二节点在所述至少两个候选下一跳节点中对所述数据的发送优先级最高，且所述第二节点对所述数据译码错误，所述第二节点发送所述第一控制信息，所述第一控制信息包括NACK和/或SR。可选地，上述第一控制信息可以携带第二节点的第一标识。同理，该第二节点的标识可以直接在该第一控制信息中显式携带，也可以通过隐式的方式携带(例如，通过标识信息加扰该第一控制信息等)，本申请实施例对此不作限定。
结合第一方面，在第一方面的某些实现方式中，第一节点的至少两个候选下一跳节点被划分成了两个节点组：第一节点组和第二节点组。其中，第一节点组中的节点对数据的发送优先级比第二节点组中的节点对数据的发送优先级高。第一节点组中的节点可以在对来自第一节点的数据译码正确的情况下，直接发送该数据，或者，在对来自第一节点的数据译码错误或者未接收到该第一节点的数据时，发送控制信息，该控制信息可以为NACK或SR，该控制信息可以携带发送节点的第一标识。第二节点组中的节点可以在接收到来自第一节点组中的节点发送的控制信息，并且对来自第一节点的数据译码正确的情况下，发送该数据。若第二节点组中的节点未接收到来自第一节点组中的节点发送的控制信息，该第二节点组中的节点可以丢弃或忽略来自第一节点的数据。
在本申请实施例中，第一节点组中的节点的个数和第二节点组中的节点的个数均可以为一个或者多个，这样，通过上述方式有可能选择出一个或多个下一跳节点发送来自第一节点的数据，能够避免网络环境的不稳定性对数据传输造成的影响，有利于提高无线网络的吞吐量，进而提高数据传输性能。进一步地，若通过上述方式选择出多个下一跳节点发送来自第一节点的数据，便可以提高数据传输的可靠性，进而有利于提高数据传输效率。
结合第一方面，在第一方面的某些实现方式中，在所述至少两个候选下一跳节点中，所述第二节点属于所述第一节点组，且所述第二节点为所述第一节点组中对所述数据的发送优先级最低的节点；所述第二节点根据优先级信息，发送所述数据，和/或，发送第一控制信息，包括：若所述第二节点未接收到所述第一节点组中来自其他节点的ACK，且所述第二节点对所述数据译码错误，所述第二节点发送所述第一控制信息，所述第一控制信息包括NACK和/或SR。可选地，上述其他节点为第一节点组中除第二节点之外所有的节点。
具体地，在本申请实施例中，第一节点的至少两个候选下一跳节点被划分成了两个节点组：第一节点组和第二节点组。其中，第一节点组中的节点对数据的发送优先级比第二节点组中的节点对数据的发送优先级高。第二节点为第一节点组中对数据的发送优先级最低的节点。在第一节点组中，对数据的发送优先级最高的节点可以在正确接收到了来自第一节点的数据的情况下直接发送该数据，并发送用于表示正确接收数据的控制信息(例如ACK)。对数据的发送优先级不是最高的节点可以在未接收到比该节点自身对数据的发送 优先级更高的节点发送的用于表示正确接收数据的控制信息(例如ACK)，且该节点对来自第一节点的数据译码正确的情况下，发送该数据。第二节点是第一节点组中对数据的发送优先级最低的节点，若该第二节点未接收到第一节点组中除第二节点以外的其他所有节点发送的用于表示正确接收数据的控制信息(例如ACK)，且该第二节点未接收到来自第一节点的数据或者对该数据译码错误，该第二节点可以发送用于表示未正确接收到来自第一节点的数据的控制信息(例如NACK或SR)，表明第一节点组中的节点均无法发送上述数据，以便触发第二节点组的节点发送上述数据。这里的“无法发送”可以理解为第一节点组中的所有节点都未正确接收到来自第一节点的数据，或者对来自第一节点的数据译码错误。在接收到上述第二节点发送的NACK或SR之后，第二节点组中的节点可以判断对来自第一节点的数据的译码的正确性。其中，译码正确的节点可以发送该数据，译码错误的节点可以发送NACK或SR。
本申请实施例可以优先选择对来自第一节点的数据的发送优先级较高的第一节点组中的一个节点作为第一节点的下一跳节点，若第一节点组中不存在能够发送该数据的节点，那么再从对该数据的发送优先级较低的第二节点组中选择一个或多个节点发送数据。这样，能够避免网络环境的不稳定性对数据传输造成的影响，有利于提高无线网络的吞吐量，进而提高数据传输性能。
应理解，上述第一节点组中对数据的发送优先级最低的节点，是针对第一节点组中包括多个节点而言的。若该第一节点组中仅包括一个节点，那么该节点可以当作上述第一节点组中对数据的发送优先级最低的节点。
结合第一方面，在第一方面的某些实现方式中，所述优先级信息对应第一资源；所述第二节点根据优先级信息，发送所述数据，和/或，发送第一控制信息，包括：所述第二节点在所述第一资源上发送所述第一控制信息。
具体地，本申请实施例中的优先级信息表示第二节点在第一节点的至少两个候选下一跳节点中对数据的发送优先级。第二节点的优先级信息与第一资源对应，因此，第二节点可以在该第一资源上发送第一控制信息。即该第二节点发送的第一控制信息可以承载在与该第二节点的优先级信息对应的第一资源上。接收到该第一控制信息的节点(简称为接收节点)可以根据该第一资源，确定发送该第一控制信息的节点(简称为发送节点)的优先级。
在本申请实施例中，不同候选下一跳节点的优先级信息可以对应不同的资源，发送控制信息的节点可以通过与该节点对数据的发送优先级对应的资源发送该控制信息，对应地，接收该控制信息的节点可以通过发送该控制信息的资源，确定发送该控制信息的节点对数据的发送优先级。这样，针对一个候选下一跳节点而言，该候选下一跳节点只需要维护自身对数据的发送优先级即可，无需维护所有候选下一跳节点的优先级信息，降低了候选下一跳节点的存储负担。
结合第一方面，在第一方面的某些实现方式中，所述数据从源节点传输至目的节点，所述优先级信息是根据所述至少两个候选下一跳节点中候选下一跳节点到所述目的节点的跳数，和/或，所述源节点到所述候选下一跳节点的跳数确定的。
可选地，还可以结合从源节点到候选下一跳节点的每一跳的信道质量和/或候选下一跳节点到目的节点的每一跳的信道质量，更加准确地确定候选下一跳节点的优先级，但本 申请实施例对此不作限定。
第二方面，提供了另一种数据传输方法，包括：第一节点发送数据，所述第一节点具有至少两个候选下一跳节点；所述第一节点接收来自所述至少两个候选下一跳节点中的全部或部分节点的控制信息，所述控制信息为肯定答复ACK、否定答复NACK或者调度请求SR中的任一个；所述第一节点根据所述控制信息，从所述至少两个候选下一跳节点中确定下一跳节点；所述第一节点向所述下一跳节点发送指示信息，所述指示信息用于指示发送所述数据。
结合第二方面，在第二方面的某些实现方式中，所述第一节点根据所述控制信息，从所述至少两个候选下一跳节点中确定下一跳节点，包括：所述第一节点根据所述控制信息，以及优先级信息，从所述至少两个候选下一跳节点中确定所述下一跳节点，所述优先级信息用于表示所述至少两个候选下一跳节点对所述数据的发送优先级。
在本申请实施例中，第一节点可以进一步结合优先级信息确定下一跳节点，该优先级信息可以仅在第一节点中维护，该第一节点的候选下一跳节点无需维护上述优先级信息，仅需要根据接收的数据反馈相应的控制信息即可，这样，能够降低各个候选下一跳节点处的负担。
结合第二方面，在第二方面的某些实现方式中，所述第一节点根据所述控制信息，以及优先级信息，从所述至少两个候选下一跳节点中确定所述下一跳节点，包括：在发送所述ACK的候选下一跳节点中，所述第一节点将对所述数据的发送优先级较高的至少一个节点确定为所述下一跳节点；或，在所述至少两个候选下一跳节点中，除了发送所述NACK或所述SR的候选下一跳节点之外的剩余节点，所述第一节点将对所述数据的发送优先级较高的至少一个节点确定为所述下一跳节点。
结合第二方面，在第二方面的某些实现方式中，所述数据从源节点传输至目的节点，所述优先级信息是根据所述至少两个候选下一跳节点中候选下一跳节点到所述目的节点的跳数，和/或，所述源节点到所述候选下一跳节点的跳数确定的。
第三方面，提供了另一种数据传输方法，包括：第二节点接收来自第一节点的数据，所述第一节点具有至少两个候选下一跳节点，所述至少两个候选下一跳节点包括所述第二节点；所述第二节点根据对所述数据是否译码正确，向所述第一节点发送第一控制信息，所述第一控制信息为肯定答复ACK、否定答复NACK或者调度请求SR中的任意一个；所述第二节点接收所述第一节点发送的指示信息，所述指示信息用于指示发送所述数据；所述第二节点根据所述指示信息，发送所述数据。
第四方面，提供了一种装置，用于执行上述各个方面或各个方面任一种可能的实现方式中的方法。具体地，该装置包括用于执行上述各个方面或各个方面的任一种可能的实现方式中的方法的单元。
第五方面，提供了一种装置，该装置包括：收发器、存储器和处理器。其中，该收发器、该存储器和该处理器通过内部连接通路互相通信，该存储器用于存储指令，该处理器用于执行该存储器存储的指令，以控制接收器接收信号，并控制发送器发送信号，并且当该处理器执行该存储器存储的指令时，该执行使得该处理器执行上述各个方面或各个方面的任一种可能的实现方式中的方法。
第六方面，提供了一种计算机程序产品，所述计算机程序产品包括：计算机程序代码， 当所述计算机程序代码被计算设备运行时，使得所述计算设备执行上述各个方面或各个方面的任一种可能实现方式中的方法。
第七方面，提供了一种计算机可读介质，用于存储计算机程序，该计算机程序包括用于执行上述各个方面或各个方面的任一种可能的实现方式中的方法的指令。
第八方面，提供了一种芯片，包括：处理器，用于从存储器中调用并运行计算机程序，使得安装有所述芯片的装置执行上述各个方面或各个方面的任一种可能的实现方式中的方法。
附图说明
图1示出了本申请实施例的网络架构的示意图；
图2示出了本申请实施例的数据传输方法的示意性流程图；
图3示出了本申请实施例的第一种数据传输方法的示意图；
图4示出了本申请实施例的第二种数据传输方法的示意图；
图5示出了本申请实施例的第三种数据传输方法的示意图；
图6示出了本申请实施例的第四种数据传输方法的示意图；
图7示出了本申请实施例的第五种数据传输方法的示意图；
图8示出了本申请实施例的装置的示意性框图；
图9示出了本申请实施例的另一装置的示意性框图。
具体实施方式
下面将结合附图，对本申请中的技术方案进行描述。
本申请实施例的技术方案可以应用于各种通信***，例如：全球移动通信(global system for mobile communications，GSM)***、码分多址(code division multiple access，CDMA)***、宽带码分多址(wideband code division multiple access，WCDMA)***、通用分组无线业务(general packet radio service，GPRS)、长期演进(long term evolution，LTE)***、LTE频分双工(frequency division duplex，FDD)***、LTE时分双工(time division duplex，TDD)、通用移动通信***(universal mobile telecommunication system，UMTS)、全球互联微波接入(worldwide interoperability for microwave access，WiMAX)通信***、未来的第五代(5th generation，5G)***或新无线(new radio，NR)等。
本申请实施例的技术方案可以应用于各种需要高可靠低时延的应用场景，例如，工业控制场景、机器人协作场景，典型的用户设备(user equipment，UE)协作场景、无线网状(mesh)场景等等。此外，本申请实施例的技术方案不限制上行传输、或者下行传输、或者设备到设备之间的边链路(旁链路)传输。进一步地，本申请实施例的数据传输可以在多种组合形式的节点之间，例如，控制节点(master)和被驱动节点(slaves)、基站和UE、基站和基站、UE和UE等。因此，本文适用的场景为存在多个节点的场景，该节点可以是终端设备、网络设备、master和slaves等等。
上述master和slaves一般是工业控制场景中的说法，例如，针对工业控制的数控机床、机械臂协作等应用场景。master为控制节点，用于发送控制命令；slavers为被驱动节点，除了接收控制命令，也会反馈状态消息等，例如马达等。
上述终端设备可以指用户设备、接入终端、用户单元、用户站、移动站、移动台、远方站、远程终端、移动设备、用户终端、终端、无线通信设备、用户代理或用户装置。终端设备还可以是蜂窝电话、无绳电话、会话启动协议(session initiation protocol，SIP)电话、无线本地环路(wireless local loop，WLL)站、个人数字助理(personal digital assistant，PDA)、具有无线通信功能的手持设备、计算设备或连接到无线调制解调器的其它处理设备、车载设备、可穿戴设备，未来5G网络中的终端设备或者未来演进的公用陆地移动通信网络(public land mobile network，PLMN)中的终端设备等，本申请实施例对此并不限定。
上述网络设备可以是用于与终端设备通信的设备，该网络设备可以是全球移动通信(global system for mobile communications，GSM)***或码分多址(code division multiple access，CDMA)中的基站(base transceiver station，BTS)，也可以是宽带码分多址(wideband code division multiple access，WCDMA)***中的基站(NodeB，NB)，还可以是LTE***中的演进型基站(evolved NodeB，eNB或eNodeB)，还可以是云无线接入网络(cloud radio access network，CRAN)场景下的无线控制器，或者该网络设备可以为中继站、接入点、车载设备、可穿戴设备以及未来5G网络中的网络设备(例如，gNodeB、gNB、或收发点(transmission receiving point/transmission reception point,TRP))、或者未来演进的PLMN网络中的网络设备等，本申请实施例并不限定。
在本申请实施例中，终端设备或网络设备包括硬件层、运行在硬件层之上的操作***层，以及运行在操作***层上的应用层。该硬件层包括中央处理器(central processing unit，CPU)、内存管理单元(memory management unit，MMU)和内存(也称为主存)等硬件。该操作***可以是任意一种或多种通过进程(process)实现业务处理的计算机操作***，例如，Linux操作***、Unix操作***、Android操作***、iOS操作***或windows操作***等。该应用层包含浏览器、通讯录、文字处理软件、即时通信软件等应用。并且，本申请实施例并未对本申请实施例提供的方法的执行主体的具体结构特别限定，只要能够通过运行记录有本申请实施例的提供的方法的代码的程序，以根据本申请实施例提供的方法进行通信即可，例如，本申请实施例提供的方法的执行主体可以是终端设备或网络设备，或者，是终端设备或网络设备中能够调用程序并执行程序的功能模块。
另外，本申请的各个方面或特征可以实现成方法、装置或使用标准编程和/或工程技术的制品。本申请中使用的术语“制品”涵盖可从任何计算机可读器件、载体或介质访问的计算机程序。例如，计算机可读介质可以包括，但不限于：磁存储器件(例如，硬盘、软盘或磁带等)，光盘(例如，压缩盘(compact disc，CD)、数字通用盘(digital versatile disc，DVD)等)，智能卡和闪存器件(例如，可擦写可编程只读存储器(erasable programmable read-only memory，EPROM)、卡、棒或钥匙驱动器等)。另外，本文描述的各种存储介质可代表用于存储信息的一个或多个设备和/或其它机器可读介质。术语“机器可读介质”可包括但不限于，无线信道和能够存储、包含和/或承载指令和/或数据的各种其它介质。
图1是本申请实施例的网络架构100的示意图。该网络架构100包括10个节点，分别为节点1、节点2、节点3、节点4、节点5、节点6、节点7、节点8、节点9和节点10。图1中的节点具有邻居节点，拓扑结构如图1所示。具体地，节点1的邻居节点包括节点2、节点3、节点4、节点8和节点9。节点2的邻居节点包括节点1、节点3、节点 4、节点5、节点6和节点7。其他节点类似，此处不再一一列举。
应理解，图1示例性地示出了10个节点，可选地，该网络架构100可以包括其他数量的节点(节点的数量可以大于10，或者小于10)，且这些节点之间还可以具有其他拓扑结构，本申请实施例对此不作限定。
在图1所示的网络架构中，针对一个源节点和一个目的节点，存在多条候选传输路径。在多条候选传输路径上，除了目的节点之外的其他节点可以分别包括至少一个候选下一跳节点。
对一个特定的节点而言，该节点的邻居节点为该节点的可达节点，例如，可达节点可以是网络拓扑建立的时候通过发现机制、同步机制、拓扑建立机制、或者接入机制中的一种或多种确定的，而该节点的候选下一跳节点属于该节点的邻居节点。一个节点的候选下一跳节点是在已知源节点和目的节点的情况下，根据源节点和目的节点对应的多条候选传输路径确定的。例如，在图1中，源节点为1，目的节点为7，存在的候选传输路径有：1-3-5-7，1-3-2-7，1-2-7，1-4-2-7，1-4-6-7，因此，节点1的候选下一跳节点包括节点3、节点2和节点4。一个节点的候选下一跳节点可以取决于源节点和目的节点，针对不同的源节点和/或目的节点，一个节点的候选下一跳节点可以是不同的。
应理解，一个节点的候选下一跳节点具体包括哪些节点，可以是根据某种规则定义的，也可以是半静态配置的，本申请实施例对此不作限定。具体地，一个节点的候选下一跳节点可以由一个控制节点通过无线资源控制(radio resource control，RRC)信令或媒体访问控制单元(media access control control element，MAC CE)信令配置给该节点和/或该节点的候选下一跳节点。该控制节点可以是源节点，也可以是目的节点，还可以是其他节点，本申请实施例对此不作限定。当网络拓扑发生变化时，需要对该网络架构中的各个节点的候选下一跳节点进行更新，以便获取准确的候选下一跳节点信息，保证数据传输的可靠性。
下面先结合图1对本申请的候选下一跳节点进行详细说明。
例如，节点10需要将数据传输给节点7，则节点10为源节点，节点7为目的节点。在节点10至节点7的传输方向上，节点10的候选下一跳节点包括节点8和节点9，节点8的候选下一跳节点包括节点1和节点3，节点9的候选下一跳节点包括节点1和节点4，节点1的候选下一跳节点包括节点2、节点3和节点4，节点3的候选下一跳节点包括节点2和节点5，节点4的候选下一跳节点包括节点2和节点6，节点5和节点6的候选下一跳节点均包括节点7，节点2的候选下一跳节点包括节点5、节点6和节点7。
又例如，节点7需要将数据传输给节点10，则节点7为源节点，节点10为目的节点。在节点7至节点10的传输方向上，节点7的候选下一跳节点包括节点2、节点5和节点6，节点2的候选下一跳节点包括节点1、节点3和节点4，节点5的候选下一跳节点包括节点2和节点3，节点6的候选下一跳节点包括节点2和节点4，节点3的候选下一跳节点包括节点1和节点8，节点1的候选下一跳节点包括节点8和节点9，节点4的候选下一跳节点包括节点1和节点9，节点8和节点9的候选下一跳节点均包括节点10。
针对特定的源节点和目的节点，即在特定的传输方向上的节点的候选下一跳节点可能有一个，也可能有多个。若一个节点包括多个候选下一跳节点，则该多个候选下一跳节点中的候选下一跳节点可以具有对数据的发送优先级。在数据到达该多个候选下一跳节点时，可以结合上述发送优先级，通过该多个候选下一跳节点之间的信息交互，从该多个候 选下一跳节点中选择出最终用于发送数据的下一跳节点。在本申请中，最终用于发送数据的下一跳节点可以是一个节点，也可以是多个节点。
上述节点对数据的发送优先级还可以称为优先级、发送规则等等，本申请对其名称不作限定。在一种可能的实现方式中，可以通过数值表示上述优先级，例如，数值越小表示优先级越低，数值越大表示优先级越高；或者，数值越小表示优先级越高，数值越大表示优先级越低。在另一种可能的实现方式中，可以通过枚举的方式表示上述优先级，例如，枚举值low表示低优先级，枚举值medium表示中优先级，枚举值high表示高优先级。
例如，对于图1中节点1的候选下一跳节点，若节点2的优先级最高，其次是节点3，节点4的优先级最低。则节点2的优先级可以表示为3，节点3的优先级可以表示为2，节点4的优先级可以表示为1；或者，节点2的优先级可以表示为1，节点3的优先级可以表示为2，节点4的优先级可以表示为3；或者，节点2的优先级可以表示为high，节点3的优先级可以表示为medium，节点4的优先级可以表示为low。
在本申请实施例中，一个节点的多个候选下一跳节点中，候选下一跳节点对数据的发送优先级，可以是预定义的，也可以是半静态配置的，具体可以由一个控制节点通过RRC信令或MAC CE信令配置给这一个节点和/或多个候选下一跳节点。该控制节点可以是源节点，也可以是目的节点，还可以是其他节点，本申请实施例对此不作限定。当网络拓扑发生变化、或者各个节点的候选下一跳节点进行了更新，需要同时对候选下一跳节点对数据的发送优先级进行更新，这样有利于获取准确的优先级信息，保证数据传输的可靠性。
下面将站在一个节点的角度，结合方法200对本申请实施例的数据传输方法进行详细说明。
图2示出了本申请实施例的数据传输方法200的示意性流程图。该方法200可以应用于图1所示的网络架构100，但本申请实施例不限于此。
S210，第二节点接收来自第一节点的数据，所述第二节点为所述第一节点的至少两个候选下一跳节点中的一个；
S220，所述第二节点根据优先级信息，发送所述数据，和/或，发送第一控制信息，所述优先级信息用于表示所述第二节点在所述至少两个候选下一跳节点中对所述数据的发送优先级。
具体地，网络中的第一节点发送数据，由于该第一节点具有至少两个候选下一跳节点，则该至少两个候选下一跳节点中的候选下一跳节点都有可能接收到第一节点发送的数据。应理解，上述数据是从源节点发送至目的节点的，因此，该第一节点可以是上述源节点，也可以是从上述源节点至上述目的节点的传输路径上的任一节点，本申请实施例对此不作限定。
第二节点为该第一节点的其中一个候选下一跳节点，且该第二节点接收到了第一节点发送的数据，这样，该第二节点就可以根据该第二节点在至少两个候选下一跳节点中对该数据的发送优先级，确定是否发送该数据。具体而言，上述第二节点可以根据优先级信息，仅发送来自第一节点的数据，或者仅发送第一控制信息，或者既发送来自第一节点的数据，又发送第一控制信息。可选地，该第一控制信息可以包括肯定答复(acknowledgement，ACK)、否定答复(non-acknowledgement，NACK)或调度请求(scheduling request，SR)中的至少一个。
本申请实施例的数据传输方法，通过为第一节点配置至少两个候选下一跳节点，该至少两个候选下一跳节点中的一个候选下一跳节点可以根据自身的优先级信息，确定是否发送来自第一节点的数据，从而为该第一节点选择出合适的下一跳节点进行数据传输。本申请实施例能够在数据到达候选下一跳节点时，从至少两个候选下一跳节点中实时选择一个或多个下一跳节点继续传输数据，能够避免网络环境的不稳定性对数据传输造成的影响，有利于提高无线网络的吞吐量，进而提高数据传输性能。
作为一个可选的实施例，所述第二节点根据优先级信息，发送所述数据，和/或，发送第一控制信息，包括：若所述第二节点在所述至少两个候选下一跳节点中对所述数据的发送优先级最高，且所述第二节点对所述数据译码正确，所述第二节点发送所述数据。
具体地，在满足下列两个条件的情况下，第二节点可以直接发送来自第一节点的数据：
1、第二节点正确接收到了来自第一节点的数据，即第二节点对该数据译码正确；
2、第二节点在第一节点的至少两个候选下一跳节点中对该数据的发送优先级最高。
例如，在图1中，以源节点为节点10，目的节点为节点7为例，数据已传输至节点1，节点1即为上述第一节点。该节点1的候选下一跳节点包括节点2、节点3和节点4，对该数据的发送优先级从高到低依次为节点2、节点3、节点4。假设节点2为上述第二节点。节点2正确接收到来自节点1的数据，且节点2对该数据的发送优先级最高，该节点2可以直接发送该数据。
在本申请实施例中，候选下一跳节点之间还可以通过交互控制信息(包括第一控制信息、第二控制信息、第三控制信息以及第四控制信息中的至少一种)，结合优先级信息，确定是否发送来自第一节点的数据，进而选择出第一节点的下一跳节点。进一步地，上述控制信息可以承载在物理信道中发送，例如，物理上行控制信道(physical uplink control channel，PUCCH)、物理下行控制信道(physical downlink control channel，PDCCH)、或者物理旁链路共享信道(physical sidelink control channel，PSCCH)等等。在接下来的实施例中，下一跳节点的个数为一个。
下面，以上述控制信息用于表示正确接收到来自第一节点的数据(对来自第一节点的数据译码正确)为例，对本申请进行说明。该控制信息可以为ACK。
作为一个可选的实施例，所述方法还包括：若所述第二节点在所述至少两个候选下一跳节点中对所述数据的发送优先级不是最高的，所述第二节点确定是否接收到来自至少一个第三节点的第二控制信息，所述至少一个第三节点为所述至少两个候选下一跳节点中对所述数据的发送优先级比所述第二节点对所述数据的发送优先级高的节点，所述第二控制信息用于表示对所述数据译码正确；所述第二节点根据优先级信息，发送所述数据，和/或，发送第一控制信息，包括：若所述第二节点未接收到所述第二控制信息，且所述第二节点对所述数据译码正确，所述第二节点发送所述数据。
作为一个可选的实施例，所述第二节点根据优先级信息，发送所述数据，和/或，发送第一控制信息，包括：若所述第二节点接收到所述第二控制信息，所述第二节点发送所述第一控制信息，所述第一控制信息包括来自所述至少一个第三节点中对所述数据的发送优先级最高的节点的第二控制信息。
具体地，若第二节点对该数据的发送优先级在第一节点的至少两个候选下一跳节点中不是最高的，该第二节点需要确定是否接收到对该数据的发送优先级比第二节点更高的第 三节点发送的第二控制信息。该第二控制信息表示第三节点对数据译码正确。可选地，该第二控制信息可以为ACK。应理解，对数据的发送优先级比第二节点高的节点可能为一个，也可能为多个，本申请实施例称为至少一个第三节点。可选地，上述第二控制信息为该至少一个第三节点中的每个第三节点发送的各自的第二控制信息；因此，第二控制信息的数量与第三节点的数量相同。可选地，上述第二控制信息可以携带与其对应的第三节点的第一标识，该第一标识为节点标识，用于表明该第二控制信息的来源。
在本实施例中，节点的第一标识可以直接在该节点发送的控制信息中显式携带，也可以通过隐式的方式携带(例如，通过标识信息加扰该节点发送的控制信息等)，本申请实施例对此不作限定。
针对第二节点是否接收到第三节点发送的第二控制信息，下面分情况进行讨论。
1、第二节点接收到第三节点发送的第二控制信息
这种情况表明存在比第二节点对数据的发送优先级更高的节点能够发送该数据，第二节点可以将接收到的第二控制信息携带在第一控制信息中发送。进一步地，若第二节点接收到了来自多个第三节点发送的第二控制信息，则该第二节点可以选择在该多个第三节点中对数据的发送优先级最高的一个第三节点，仅将对数据的发送优先级最高的第三节点的第二控制信息携带在第一控制信息中发送即可。这样，有利于其他漏检了该第二控制信息的节点及时获取到该第二控制信息，进而确定是否发送数据。
2、第二节点未接收到第三节点发送的第二控制信息
这种情况表明不存在比第二节点对数据的发送优先级更高的节点能够发送该数据，该第二节点可以在译码正确的情况下发送该数据。
例如，在图1中，以源节点为节点10，目的节点为节点7为例，数据已传输至节点1，节点1即为上述第一节点。该节点1的候选下一跳节点包括节点2、节点3和节点4，对该数据的发送优先级从高到低依次为节点2、节点3、节点4。上述第二节点不是节点1的候选下一跳节点中对数据的发送优先级最高的节点，假设第二节点为节点4。若节点4接收到了来自节点2的第二控制信息(例如ACK)和来自节点3的第二控制信息(例如ACK)，由于节点2对数据的发送优先级比节点3高，该节点4可以发送节点2的第二控制信息。在这种情况下，节点4可以无需判断自身是否能够发送数据。若节点4未接收到来自节点2的第二控制信息和来自节点3的第二控制信息，且节点4对来自节点1的数据译码正确，节点4可以直接发送该数据。
作为一个可选的实施例，所述第二节点根据优先级信息，发送所述数据，和/或，发送第一控制信息，包括：所述第二节点发送所述数据和所述第一控制信息，所述第一控制信息包括肯定答复ACK。
应理解，上述第二节点可以根据优先级信息，既发送来自第一节点的数据，又发送第一控制信息，该第一控制信息可以包括ACK，用于表示第二节点对来自第一节点的数据译码正确。在本实施例中，第二节点在确定了发送数据(即第二节点为第一节点的下一跳节点)的情况下，发送包括ACK的第一控制信息，是为了便于其他节点获知这一情况，其他节点便可以不再发送来自第一节点的数据。这样，能够降低其他节点的传输负担，降低其他节点的功耗，从而有利于降低***的功耗和运行复杂度。
例如，在图1中，以源节点为节点10，目的节点为节点7为例，数据已传输至节点1， 节点1即为上述第一节点。该节点1的候选下一跳节点包括节点2、节点3和节点4，对该数据的发送优先级从高到低依次为节点2、节点3、节点4。假设节点2为上述第二节点。节点2正确接收到来自节点1的数据，且节点2对该数据的发送优先级最高，该节点2可以直接发送该数据。此时，节点2还可以发送ACK，节点3和节点4在接收到来自节点2的ACK之后，便可以确定不再发送数据了。
下面，以上述控制信息用于表示未接收到来自第一节点的数据或者对来自第一节点的数据译码错误为例，对本申请进行说明。该控制信息可以为NACK或SR。
作为一个可选的实施例，所述方法还包括：若所述第二节点在所述至少两个候选下一跳节点中对所述数据的发送优先级不是最高的，所述第二节点确定是否接收到来自第四节点的第三控制信息，所述第四节点为所述至少两个候选下一跳节点中对所述数据的发送优先级比所述第二节点对所述数据的发送优先级高一个优先级的节点，所述第三控制信息用于表示所述数据译码错误；所述第二节点根据优先级信息，发送所述数据，和/或，发送第一控制信息，包括：若所述第二节点接收到所述第三控制信息，且所述第二节点对所述数据译码正确，所述第二节点发送所述数据。
作为一个可选的实施例，所述第二节点根据优先级信息，发送所述数据，和/或，发送第一控制信息，包括：若所述第二节点接收到所述第三控制信息，且所述第二节点对所述数据译码错误，所述第二节点发送所述第一控制信息，所述第一控制信息包括否定答复NACK和/或调度请求SR。
作为一个可选的实施例，所述方法还包括：若所述第二节点未接收到所述第三控制信息，所述第二节点确定是否接收到来自至少一个第五节点的第四控制信息，所述至少一个第五节点为所述至少两个候选下一跳节点中对所述数据的发送优先级比所述第二节点对所述数据的发送优先级高至少两个优先级的节点，所述第四控制信息用于表示所述数据译码错误；所述第二节点根据优先级信息，发送所述数据，和/或，发送第一控制信息，包括：若所述第二节点接收到所述第四控制信息，所述第二节点发送所述第一控制信息，所述第一控制信息包括来自所述至少一个第五节点中对所述数据的发送优先级最低的一个第五节点的第四控制信息。
具体地，若第二节点对该数据的发送优先级在第一节点的至少两个候选下一跳节点中不是最高的，该第二节点需要确定是否接收到对该数据的发送优先级比第二节点高一个优先级的第四节点发送的第三控制信息。该第三控制信息表示第四节点对来自第一节点的数据译码错误，或者表示第四节点未接收到来自第一节点的数据。该第三控制信息可以为NACK和/或SR。应理解，对数据的发送优先级比第二节点高一个优先级的节点为一个或多个，本申请实施例称为第四节点。对应地，第三控制信息的数量也为一个或多个。可选地，上述第三控制信息可以携带与其对应的第四节点的第一标识，该第一标识为节点标识，用于表明该第三控制信息的来源。同理，第四节点的第一标识可以直接在该第三控制信息中显式携带，也可以通过隐式的方式携带(例如，通过标识信息加扰该第三控制信息等)，本申请实施例对此不作限定。
在一种可能的实现方式中，多个不同节点对来自第一节点的数据可以具有相同的发送优先级，这样，一个优先级可以对应一个节点或多个节点，上述对数据的发送优先级比第二节点高一个优先级的节点可以为一个，也可以为多个。在另一种可能的实现方式中，不 同节点对来自第一节点的数据具有不同的优先级，这样一个优先级仅对应一个节点，上述对数据的发送优先级比第二节点高一个优先级的节点为一个节点。应理解，一个优先级对应一个节点还是对应多个节点，可以取决于网络的配置或由节点间通过交互过程(例如同步过程、接入过程、发现过程、或拓扑形成过程中的一种或多种)确定，此处不作限定。
针对第二节点是否接收到第四节点发送的第三控制信息，下面分情况进行讨论。
1、第二节点接收到第四节点发送的第三控制信息
这种情况表明不存在比第二节点对数据的发送优先级更高的节点能够发送该数据，该第二节点可以在译码正确的情况下发送该数据。
2、第二节点未接收到第四节点发送的第三控制信息
这种情况表明第二节点还不能直接做出是否要发送数据的决定，该第二节点需要进一步判断是否接收到对该数据的发送优先级比第二节点高至少两个优先级的第五节点发送的第四控制信息。该第四控制信息表示第五节点对来自第一节点的数据译码错误，或者未接收到来自第一节点的数据。同样地，该第四控制信息可以为NACK和/或SR。应理解，对数据的发送优先级比第二节点高至少两个优先级的节点可能为一个，也可能为多个，本申请实施例称为至少一个第五节点。对应地，上述第四控制信息为该至少一个第五节点中的每个第五节点发送的各自的第四控制信息。因此，第四控制信息的数量与第五节点的数量相同。可选地，上述第四控制信息可以携带与其对应的第五节点的第一标识，该第一标识为节点标识，用于表明该信息的来源。
若第二节点接收到第五节点发送的第四控制信息，该第二节点可以将接收到的第四控制信息携带在第一控制信息中发送。进一步地，若第二节点接收到了来自多个第五节点发送的第四控制信息，该第二节点可以选择在该多个第五节点中对数据的发送优先级最低的一个第五节点，仅将优先级最低的第五节点的第四控制信息携带在第一控制信息中发送即可。这样，有利于其他漏检了该第四控制信息的节点及时获取到该第四控制信息，进而确定是否发送数据。若第二节点未接收到第五节点发送的第四控制信息，该第二节点可以将第一节点的数据保存起来。可选地，第二节点可以开启定时器，若定时器超时，第二节点还未接收到上述来自第四节点的第三控制信息，第二节点可以丢弃该第一节点的数据，或者从内存中清除该第一节点的数据。
可以理解的是，本申请实施例的“高一个优先级”、“高至少两个优先级”是第一节点的至少两个候选下一跳节点对数据的发送优先级的排序。例如，在一种网络架构中，节点1的候选下一跳节点包括节点2、节点3和节点4，对该数据的发送优先级从高到低排序依次为节点2、节点3、节点4。因此，节点3对数据的发送优先级比节点4对数据的发送优先级高一个优先级，节点2对数据的发送优先级比节点4对数据的发送优先级高两个优先级。又例如，在另一种网络架构中，节点1的候选下一跳节点还包括节点5等其他节点，对数据的发送优先级从高到低排序依次为节点2、节点3、节点4、节点5，那么节点2对数据的发送优先级就比节点5对数据的发送优先级高三个优先级，即高至少两个优先级。
示例性地，在上述例子中，假设数据传输至节点1，节点1即为上述第一节点。节点1的候选下一跳节点包括节点2、节点3、节点4和节点5，对该数据的发送优先级从高到低依次为节点2、节点3、节点4、节点5。上述第二节点不是节点1的候选下一跳节点中 对数据的发送优先级最高的节点。假设第二节点为节点5，比节点5高一个优先级的节点为节点4，因此，若节点5接收到了节点4的第三控制信息(例如NACK或SR)，且节点5对来自节点1的数据译码正确，节点5可以直接发送该数据。若节点5未接收到节点4的第三控制信息，由于节点2、节点3均比节点5对数据的发送优先级高至少两个优先级，该节点5可以判断是否接收到节点2的第四控制信息(例如NACK或SR)和/或节点3的第四控制信息(例如NACK或SR)。若该节点5接收到了节点2的第四控制信息和节点3的第四控制信息，由于节点3对数据的发送优先级比节点2低，该节点5可以发送节点3的第四控制信息。此时，若节点4遗漏了节点3的第四控制信息，则可以通过节点5获取节点3的第四控制信息，由于节点3是比节点4对数据的发送优先级高一个优先级的节点，该节点4可以在译码正确的情况下，可以直接发送来自节点1的数据。
作为一个可选的实施例，所述第二节点根据优先级信息，发送所述数据，和/或，发送第一控制信息，包括：若所述第二节点在所述至少两个候选下一跳节点中对所述数据的发送优先级最高，且所述第二节点对所述数据译码错误，所述第二节点发送所述第一控制信息，所述第一控制信息包括NACK和/或SR。
具体地，在满足下列两个条件的情况下，第二节点可以直接发送第一控制信息，该第一控制信息表示第二节点未正确接收到来自第一节点的数据：
1、第二节点未正确接收到来自第一节点的数据(包括第二节点未接收到该数据，或者，第二节点对该数据译码错误)；
2、第二节点在第一节点的至少两个候选下一跳节点中对该数据的发送优先级最高。
例如，在图1中，以源节点为节点10，目的节点为节点7为例，数据已传输至节点1，节点1即为上述第一节点。该节点1的候选下一跳节点包括节点2、节点3和节点4，对该数据的发送优先级从高到低依次为节点2、节点3、节点4。假设节点2为上述第二节点。节点2未正确接收到来自节点1的数据，且节点2对该数据的发送优先级最高，该节点2可以直接发送第一控制信息。进一步地，该第一控制信息可以携带节点2的第一标识。
在接下来的实施例中，下一跳节点的个数可以为一个或者多个。
作为一个可选的实施例，第一节点的至少两个候选下一跳节点被划分成了两个节点组：第一节点组和第二节点组。其中，第一节点组中的节点对数据的发送优先级比第二节点组中的节点对数据的发送优先级高。第一节点组中的节点可以在对来自第一节点的数据译码正确的情况下，直接发送该数据，或者，在对来自第一节点的数据译码错误或者未接收到该第一节点的数据时，发送控制信息，该控制信息可以为NACK或SR，该控制信息可以携带发送节点的第一标识。第二节点组中的节点可以在接收到来自第一节点组中的节点发送的控制信息，并且对来自第一节点的数据译码正确的情况下，发送该数据。若第二节点组中的节点未接收到来自第一节点组中的节点发送的控制信息，该第二节点组中的节点可以丢弃或忽略来自第一节点的数据。
在本申请实施例中，第一节点组中的节点的个数和第二节点组中的节点的个数均可以为一个或者多个，这样，通过上述方式有可能选择出一个或多个下一跳节点发送来自第一节点的数据，能够避免网络环境的不稳定性对数据传输造成的影响，有利于提高无线网络的吞吐量，进而提高数据传输性能。进一步地，若通过上述方式选择出多个下一跳节点发送来自第一节点的数据，便可以提高数据传输的可靠性，进而有利于提高数据传输效率。
例如，在图1中，数据已传输至节点1，节点1即为上述第一节点。节点1的候选下一跳节点包括节点2、节点3和节点4，对该数据的发送优先级从高到低排序依次为节点2、节点3、节点4。假设节点2属于第一节点组，节点3和节点4属于第二节点组。若节点2接收到来自节点1的数据并且译码正确，则节点2发送该数据，节点3和节点4未收到控制信息，可以不执行任何操作。若节点2未接收到来自节点1的数据或者对数据译码错误，节点2可以发送用于表示对来自节点1的数据接收错误的控制信息(例如NACK或SR)，节点3和节点4接收来自节点2的控制信息。若节点3和/或节点4对来自节点1的数据译码正确，节点3和/或节点4可以发送该数据，此时，节点1便具有1个或2个下一跳节点。
作为一个可选的实施例，在所述至少两个候选下一跳节点中，所述第二节点属于所述第一节点组，且所述第二节点为所述第一节点组中对所述数据的发送优先级最低的节点；所述第二节点根据优先级信息，发送所述数据，和/或，发送第一控制信息，包括：若所述第二节点未接收到所述第一节点组中来自其他节点的ACK，且所述第二节点对所述数据译码错误，所述第二节点发送所述第一控制信息，所述第一控制信息包括NACK和/或SR。
具体地，在本申请实施例中，第一节点的至少两个候选下一跳节点被划分成了两个节点组：第一节点组和第二节点组。其中，第一节点组中的节点对数据的发送优先级比第二节点组中的节点对数据的发送优先级高。第二节点为第一节点组中对数据的发送优先级最低的节点。
在第一节点组中，对数据的发送优先级最高的节点可以在正确接收到了来自第一节点的数据的情况下直接发送该数据，并发送用于表示正确接收数据的控制信息(例如ACK)。对数据的发送优先级不是最高的节点可以在未接收到比该节点自身对数据的发送优先级更高的节点发送的用于表示正确接收数据的控制信息(例如ACK)，且该节点对来自第一节点的数据译码正确的情况下，发送该数据。第二节点是第一节点组中对数据的发送优先级最低的节点，若该第二节点未接收到其他节点发送的用于表示正确接收数据的控制信息(例如ACK)，且该第二节点未接收到来自第一节点的数据或者对该数据译码错误，该第二节点可以发送用于表示未正确接收到来自第一节点的数据的控制信息(例如NACK或SR)，表明第一节点组中的节点均无法发送上述数据，以便触发第二节点组的节点发送上述数据。这里的“无法发送”可以理解为第一节点组中的所有节点都未正确接收到来自第一节点的数据，或者对来自第一节点的数据译码错误。
在接收到上述第二节点发送的NACK或SR之后，第二节点组中的节点可以分别判断对来自第一节点的数据的译码的正确性。其中，译码正确的节点可以发送该数据，译码错误的节点可以发送NACK或SR。
本申请实施例可以优先选择对来自第一节点的数据的发送优先级较高的第一节点组中的一个节点作为第一节点的下一跳节点，若第一节点组中不存在能够发送该数据的节点，那么再从对该数据的发送优先级较低的第二节点组中选择一个或多个节点发送数据。这样，能够避免网络环境的不稳定性对数据传输造成的影响，有利于提高无线网络的吞吐量，进而提高数据传输性能。
应理解，上述第一节点组中对数据的发送优先级最低的节点，是针对第一节点组中包 括多个节点而言的。若该第一节点组中仅包括一个节点，那么该节点既可以当作上述第一节点组中对数据的发送优先级最高的节点，也可以当作上述第一节点组中对数据的发送优先级最低的节点。
作为一个可选的实施例，所述优先级信息对应第一资源；所述第二节点根据优先级信息，发送所述数据，和/或，发送第一控制信息，包括：所述第二节点在所述第一资源上发送所述第一控制信息。
具体地，本申请实施例中的优先级信息表示第二节点在第一节点的至少两个候选下一跳节点中对数据的发送优先级。第二节点的优先级信息与第一资源对应，因此，第二节点可以在该第一资源上发送第一控制信息。即该第二节点发送的第一控制信息可以承载在与该第二节点的优先级信息对应的第一资源上。接收到该第一控制信息的节点(此处简称为接收节点)可以根据该第一资源，确定发送该第一控制信息的节点(此处简称为发送节点)的优先级。
进一步地，接收节点还可以判断出发送节点与接收节点之间的优先级顺序(例如，发送节点比该接收节点对数据的发送优先级高还是低；又例如，发送节点对数据的发送优先级比该接收节点对数据的发送优先级高多少个优先级)。
同理，上述第一节点的候选下一跳节点可以在与各自的优先级信息对应的资源上发送各自的控制信息。当第二节点接收到其他节点在与该其他节点的发送优先级对应的资源上发送的控制信息时，该第二节点同样可以根据承载该控制信息的资源，确定发送该控制信息的节点在至少两个候选下一跳节点中对数据的发送优先级。
例如，在上述一实施例中，第二节点可能接收到第三节点在第二资源上发送的第二控制信息，第二节点可以根据第二资源确定第三节点对数据的发送优先级，进而确定第三节点对数据的发送优先级比第二节点对数据的发送优先级高。又例如，在上述另一实施例中，第二节点可能接收到第四节点在第三资源上发送的第三控制信息，第二节点可以根据第三资源确定第四节点对数据的发送优先级，进而确定第四节点对数据的发送优先级比第二节点对数据的发送优先级高一个优先级。
在本申请实施例中，不同候选下一跳节点的优先级信息可以对应不同的资源，发送控制信息的节点可以通过与该节点对数据的发送优先级对应的资源发送该控制信息，对应地，接收该控制信息的节点可以通过发送该控制信息的资源，确定发送该控制信息的节点对数据的发送优先级。这样，针对一个候选下一跳节点而言，该候选下一跳节点只需要维护自身对数据的发送优先级即可，无需维护所有候选下一跳节点的优先级信息，降低了候选下一跳节点的存储负担。
应理解，上述至少两个候选下一跳节点中的候选下一跳节点需要维护发送优先级与资源之间的对应关系，以便根据发送控制信息的资源，确定发送该控制信息的节点对数据的发送优先级。该对应关系可以是预定义的，或者是由控制节点配置给上述候选下一跳节点的，本申请实施例对此不作限定。在一种可能的实现方式中，发送优先级与资源之间的对应关系可以通过表格的形式来体现。
作为一个可选的实施例，上述资源(包括第一资源、第二资源以及第三资源)可以包含时域资源、频域资源、空域资源、码域资源、或标识资源中的一种或多种。例如，所述资源所包含的时域资源可以包含至少一个帧、至少一个子帧(sub-frame)、至少一个 时隙(slot)、至少一个微时隙(mini-slot)、或者至少一个时域符号等。例如，所述资源所包含的频域资源可以包含至少一个载波(carrier)、至少一个单元载波(componont carrier，CC)、至少一个带宽部分(bandwidth part，BWP)、至少一个资源块组(resource block group，RBG)、至少一个物理资源块组(physical resource-block group，PRG)、至少一个资源块(resource block，RB)、或至少一个子载波(sub-carrier，SC)等。例如，所述资源所包含的空域资源可以包含至少一个波束、至少一个端口、至少一个天线端口、或者至少一个层/空间层等。例如，所述物理资源所包含的码域资源可以包含至少一个正交覆盖码(orthogonal cover code，OCC)、或者至少一个非正交多址码(non-orthogonal multiple access，NOMA)等。例如，所述资源所包含的标识资源可以包含无线接入网临时标识(radio network temporary identity，RNTI)等。
在一种可能的实现方式中，上述资源可以包含频域资源。不同节点的发送优先级可以对应不同的频域资源。这样，具有不同发送优先级的节点所发送的控制信息可以承载在不同的频域资源上。接收节点只需维护上述发送优先级与频域资源之间的对应关系，接收节点在接收到控制信息之后，即可根据承载该控制信息的频域资源，确定发送该控制信息的发送节点对数据的发送优先级。例如，如表一所示的对应关系，0-11为频域资源的标识，根据表一可知，采用频域资源0、频域资源1、频域资源3和/或频域资源6-9发送控制信息的节点的发送优先级为low，是最低的，采用频域资源2、频域资源5、频域资源10和/或频域资源11发送控制信息的节点的发送优先级为medium，采用频域资源4发送控制信息的节点发送的优先级为high，是最高的。
表一
发送优先级 频域资源
low 0，1，3，6-9
medium 2，5，10，11
high 4
应理解，一个优先级可以对应一个频域资源，也可以对应多个频域资源，本实施例不作限定。
在另一种可能的实现方式中，上述资源可以包含时域资源。不同节点的发送优先级可以对应不同的时域资源。这样，具有不同发送优先级的节点所发送的控制信息可以承载在不同的时域资源上。接收节点只需维护上述发送优先级与时域资源之间的对应关系，接收节点在接收到控制信息之后，即可根据承载该控制信息的时域资源，确定发送该控制信息的发送节点对数据的发送优先级。例如，如表二所示的对应关系，0-13为时域资源的标识，根据表二可知，采用时域资源11发送控制信息的节点的发送优先级为low，是最低的，采用时域资源4、时域资源9和/或时域资源10发送控制信息的节点的发送优先级为medium，采用时域资源0-3和/或时域资源5-8发送控制信息的节点发送的优先级为high，是最高的。
应理解，一个优先级可以对应一个时域资源，也可以对应多个时域资源，本实施例不作限定。
表二
发送优先级 时域资源
low 11
medium 4，9，10
high 0-3，5-8
在另一种可能的实现方式中，上述资源可以为资源控制资源集(control resource set，CORESET)，其中CORESET表示用于承载控制信息的时频资源集合。不同节点的发送优先级可以对应不同的CORESET。这样，具有不同发送优先级的节点所发送的控制信息可以承载在不同的CORESET上。接收节点只需维护上述发送优先级与CORESET之间的对应关系，接收节点在接收到控制信息之后，即可根据承载该控制信息的CORESET，确定发送该控制信息的发送节点对数据的发送优先级。例如，如表三所示的对应关系，1-5为CORESET的标识，根据表三可知，采用CORESET 1发送控制信息的节点的发送优先级为low，是最低的，采用CORESET 2和/或CORESET 3发送控制信息的节点的发送优先级为medium，采用CORESET 4和/或CORESET 5发送控制信息的节点发送的优先级为high，是最高的。
表三
发送优先级 CORESET
low 1
medium 2，3
high 4，5
应理解，一个优先级可以对应一个CORESET，也可以对应多个CORESET，本实施例不作限定。
在另一种可能的实现方式中，上述资源可以包含空域资源。不同节点的发送优先级可以对应不同的空域资源。这样，具有不同发送优先级的节点所发送的控制信息可以承载在不同的空域资源上。接收节点只需维护上述发送优先级与空域资源之间的对应关系，接收节点在接收到控制信息之后，即可根据承载该控制信息的空域资源，确定发送该控制信息的发送节点对数据的发送优先级。
在另一种可能的实现方式中，上述资源可以包含码域资源。不同节点的发送优先级可以对应不同的码域资源。这样，具有不同发送优先级的节点所发送的控制信息可以承载在不同的码域资源上。接收节点只需维护上述发送优先级与码域资源之间的对应关系，接收节点在接收到控制信息之后，即可根据承载该控制信息的码域资源，确定发送该控制信息的发送节点对数据的发送优先级。
在另一种可能的实现方式中，上述资源可以包含标识资源，本文称为第二标识。不同节点的发送优先级可以对应不同的第二标识，该第二标识用于标识发送控制信息的节点的优先级。该第二标识可以携带在控制信息中发送，也可以通过使用该第二标识加扰控制信息的方式发送。接收节点只需维护上述发送优先级与第二标识之间的对应关系，接收节点在接收到控制信息之后，即可根据该第二标识，确定发送该控制信息的发送节点对数据的发送优先级。例如，上述第二标识为无线接入网临时标识(radio network temporary identity，RNTI)，具有不同发送优先级的节点发送的控制信息可以采用不同的RNTI加扰。
此外，上述第二节点的第一控制信息还可以采用组无线接入网临时标识(group radio network temporary identity，Group RNTI)加扰。应理解，若第一节点的候选下一跳节点进行了分组，那么第一节点组的节点发送的控制信息可以采用一个Group RNTI加扰，第二节点组的节点所发送的控制信息可以采用另外的Group RNTI加扰，接收节点在接收到第二节点发送的通过Group RNTI加扰的第一控制信息之后，可以根据该Group RNTI确定出该第二节点属于第一节点组，进一步地，该接收节点可以结合上述资源确定该第二节点对数据的发送优先级。
进一步地，本申请实施例中的控制信息可以通过下述方式中的一种发送：
通过上行传输、下行传输、或者旁链路传输的资源块级别的速率匹配(rate matching)的资源进行发送，发送的信道可以复用现有的上行传输、下行传输或旁链路传输的信道；
通过补充上行链路(supplementary uplink，SUL)或者非补充上行链路non-SUL的空闲资源上进行发送；
通过配置的带宽部分(bandwidth part，BWP)上进行发送；可选地，该BWP被配置用于路由相关的功能；
通过在现有的下行控制信息(downlink control information，DCI)中新增域指示进行发送；
通过新增新的上行控制信息(uplink control information，UCI)进行发送，具体可通过物理上行控制信道(physical uplink control channel，PUCCH)或者物理上行共享信道(physical uplink shared channel，PUSCH)进行发送；
通过在现有的旁链路控制信息(sidelink control information)中新增域指示或新增旁链路控制信息进行发送。具体可通过物理旁链路控制信道(physical sidelink control channel，PSCCH)或者物理旁链路共享信道(physical sidelink shared channel，PSSCH)进行发送。
作为一个可选的实施例，所述数据从源节点传输至目的节点，所述优先级信息是根据所述至少两个候选下一跳节点中候选下一跳节点到所述目的节点的跳数，和/或，所述源节点到所述候选下一跳节点的跳数确定的。
具体地，本申请实施例中的各个节点的对数据的发送优先级，可以根据某种给定的准则来确定。例如，可以根据第一节点的至少两个候选下一跳节点到目的节点的跳数来确定各个候选下一跳节点的优先级，若一个节点到目的节点的跳数越多，则该节点的优先级越低，反之该节点的优先级越高。又例如，可以根据源节点到上述至少两个候选下一跳节点的跳数来确定各个候选下一跳节点的优先级，若源节点到一个节点的跳数越多，则该节点的优先级越低，反之该节点的优先级越高。
进一步地，还可以结合从源节点到候选下一跳节点的信道质量和/或候选下一跳节点到目的节点的信道质量，更加准确地确定候选下一跳节点的优先级，但本申请实施例对此不作限定。
以图1为例，源节点为节点10，目的节点为节点7，节点1的候选下一跳节点为节点2、节点3和节点4。其中，节点2到节点7的跳数为1跳，节点3到节点7的跳数为2跳，节点4到节点7的跳数为2跳。由于节点2到目的节点的跳数最少，因此可以先确定出节点2的优先级是最高的。进一步地，获取节点3到节点7的信道质量以及节点4到节 点7的信道质量，选择节点3和节点4中到节点7的信道质量较高的节点作为优先级排在第二位的节点，剩余的节点即为优先级最低的节点。
本申请实施例还提供了另一种数据传输方法，包括：第一节点发送数据，所述第一节点具有至少两个候选下一跳节点，所述至少两个候选下一跳节点包括第二节点，所述第二节点接收来自第一节点的数据；所述第二节点根据对所述数据是否译码正确，向所述第一节点发送控制信息，所述控制信息为肯定答复ACK、否定答复NACK或者调度请求SR中的任意一个；所述第一节点接收来自所述至少两个候选下一跳节点中的全部或部分节点的控制信息；所述第一节点根据所述控制信息，从所述至少两个候选下一跳节点中确定下一跳节点；所述第一节点向所述下一跳节点发送指示信息，所述指示信息用于指示发送所述数据；所述第二节点接收所述第一节点发送的指示信息，所述指示信息用于指示发送所述数据；所述第二节点根据所述指示信息，发送所述数据。
具体地，第一节点可以作为控制节点，根据多个候选下一跳节点反馈的控制信息(包括第二节点反馈的控制信息)，该第一节点可以从反馈ACK的候选下一跳节点中选择用于发送数据的下一跳节点，并向该下一跳节点发送指示信息，指示该下一跳节点发送数据。
作为一个可选的实施例，所述第一节点根据所述控制信息，从所述至少两个候选下一跳节点中确定下一跳节点，包括：所述第一节点根据所述控制信息，以及优先级信息，从所述至少两个候选下一跳节点中确定所述下一跳节点，所述优先级信息用于表示所述至少两个候选下一跳节点对所述数据的发送优先级。
作为一个可选的实施例，所述第一节点根据所述控制信息，以及优先级信息，从所述至少两个候选下一跳节点中确定所述下一跳节点，包括：在发送所述ACK的候选下一跳节点中，所述第一节点将对所述数据的发送优先级较高的至少一个节点确定为所述下一跳节点；或，在所述至少两个候选下一跳节点中，除了发送所述NACK或所述SR的候选下一跳节点之外的剩余节点，所述第一节点将对所述数据的发送优先级较高的至少一个节点确定为所述下一跳节点。
应理解，“优先级较高的至少一个节点”是指将多个候选下一跳节点按照优先级由高到低进行排序，排在前至少一位的节点。例如，在第一节点的候选下一跳节点中，优先级从高到低依次为第二节点、第三节点、第四节点、第五节点，则优先级较高的1个节点为第二节点，优先级较高的2个节点即为第二节点和第三节点。
在本申请实施例中，第一节点可以进一步结合优先级信息确定下一跳节点，该优先级信息可以仅在第一节点中维护，该第一节点的候选下一跳节点无需维护上述优先级信息，仅需要根据接收的数据反馈相应的控制信息即可，这样，能够降低各个候选下一跳节点处的负担。
应理解，在上述实施例中，一个节点对数据译码错误可以被认为该节点没有接收到信号，一个节点对数据译码正确可以被认为该节点接收到了信号。换句话说，一个节点接收到数据可以表示该节点对数据译码正确，一个节点未接收到数据可以表示该节点对数据译码错误。本申请实施例对上述两种表达方式不作限定。
下面，以源节点为节点10，目的节点为节点7为例，对本申请进行详细说明。数据已传输至节点1，节点1的候选下一跳节点包括节点2、节点3和节点4，对该数据的发送优先级从高到低依次为节点2、节点3、节点4。
示例性地，如图3所示，节点1发送数据，节点2、节点3和节点4均接收到了来自节点1的数据。由于节点2在节点1的候选下一跳节点中对该数据的发送优先级最高，节点2对该数据译码正确，该节点2可以直接发送该数据。进一步地，该节点2还可以发送ACK，表示节点2正确接收到来自节点1的数据。该ACK中可以携带节点2的第一标识，本实施例简称为A2。
节点3在节点1的候选下一跳节点中对该数据的发送优先级不是最高的，该节点3需要判断是否接收到比该节点3对该数据的发送优先级更高的节点发送的ACK。在本实施例中，比节点3对该数据的发送优先级更高的节点为节点2。节点3未接收到来自节点2的A2，且节点3对该数据译码正确，该节点3可以发送ACK，表示节点3正确接收到来自节点1的数据。该ACK中可以携带节点3的第一标识，本实施例简称为A3。这里需要注意的是，由于节点3对该数据的发送优先级不是该节点1的候选下一跳节点中最高的，节点3不能在译码正确之后直接发送该数据。因为可能节点2发送了A2，但是由于节点3未收到A2，为了保证信息的准确性，在本申请实施例中，节点3可以开启定时器，在定时器超时之前，检测是否收到A2，该A2可能是来自其他节点的。
节点4在节点1的候选下一跳节点中对该数据的发送优先级不是最高的，该节点4需要判断是否接收到比该节点4对该数据的发送优先级更高的节点发送的ACK。如图3所示，节点4接收到了来自节点2的A2和来自节点3的A3，由于节点2对该数据的发送优先级比节点3对该数据的发送优先级高，该节点4可以发送A2。
此时，节点3接收到了来自节点4的A2，确认比节点3优先级高的节点可以发送该数据，该节点3便不会再发送该数据。
应理解，在本申请实施例中，节点2可以在确定对数据译码正确(即接收到来自第一节点的数据)之后的任意时间发送该数据，即节点2发送数据的时间可以在节点2发送A2之前，也可以在节点2发送A2之后，还可以同时发送该数据和A2，本申请对其先后顺序不作限定。
经过上述流程，来自节点1的数据将从节点2继续发送，该节点2可以将该数据发送给该节点2的候选下一跳节点。在图1所示的网络架构100中，节点2的候选下一跳节点为节点5、节点6和节点7。由于节点7是目的节点，节点7在这三个节点中的优先级必然是最高的，那么，若节点7接收到来自节点2的数据，节点7可以反馈ACK，则节点5和节点6在收到ACK之后可以不做任何处理。若节点7未接收到来自节点2的数据，反馈NACK或SR，那么节点5和节点6需要进一步根据对数据的发送优先级选择节点发送上述数据给节点7。应理解，上述实施例仅仅针对具体情况进行了举例说明，在实际应用过程中，节点与节点之间进行数据传输的过程中存在多种可能性，本申请实施例对此不作限定。
本申请实施例的数据传输方法，通过候选下一跳节点之间交互ACK，从而选择出节点2作为节点1的下一跳节点传输数据，从多个候选下一跳节点中实时选择下一跳节点传输数据，能够避免网络环境的不稳定性对数据传输造成的影响，有利于提高无线网络的吞吐量，进而提高数据传输性能。
示例性地，如图4所示，节点1发送数据，节点3和节点4接收到了来自节点1的数据。由于节点2在节点1的候选下一跳节点中对该数据的发送优先级最高，节点2并未接 收到来自节点1的数据，该节点2可以直接发送NACK，表示节点2未正确接收到来自节点1的数据。该NACK中可以携带节点2的第一标识，本实施例简称为N2。
节点3在节点1的候选下一跳节点中对该数据的发送优先级不是最高的，该节点3需要判断是否接收到比该节点3对该数据的发送优先级高一个优先级的节点发送的NACK。在本实施例中，比节点3对该数据的发送优先级高一个优先级的节点为节点2。但是，节点3未接收到来自节点2的N2。这里需要注意的是，由于节点3对该数据的发送优先级不是该节点1的候选下一跳节点中最高的，节点3不能确定比该节点3对该数据的发送优先级更高的节点是否正确接收到该数据。因为可能节点2发送了N2，但是由于网络原因，节点3未收到N2，为了保证信息的准确性，在本申请实施例中，节点3可以开启定时器，在定时器超时之前，检测是否收到N2，该N2可能是来自其他节点的。
同样地，节点4在节点1的候选下一跳节点中对该数据的发送优先级不是最高的，该节点4也需要判断是否接收到比该节点4对该数据的发送优先级高一个优先级的节点发送的NACK。在本实施例中，比节点4对该数据的发送优先级高一个优先级的节点为节点3。节点4可以开启定时器，在定时器超时之前，检测是否收到携带节点3的第一标识的NACK，简称为N3。本实施例中的节点4未收到N3，则确定不发送该数据。如图3所示，节点4收到了来自节点2的N2，节点4发送该N2。
节点3在定时器超时之前接收到了来自节点4的N2，并且节点3对该数据译码正确，那么该节点3可以发送该数据。
应理解，与图3所示的实施例不同，在图4所示的实施例中，节点3接收到来自节点1的数据，即使对该数据译码正确，该节点3也必须在接收到节点2的N2之后，才可以发送上述数据。
经过上述流程，来自节点1的数据将从节点3继续发送，该节点3可以将该数据发送给该节点3的候选下一跳节点。在图1所示的网络架构100中，节点3的候选下一跳节点包括节点2和节点5，那么，该节点3可以发送该数据，再由节点2和节点5之间根据实际情况进行信息交互，选择出一个下一跳节点继续将数据发送至节点7。应理解，上述实施例仅仅针对具体情况进行了举例说明，在实际应用过程中，节点与节点之间进行数据传输的过程中存在多种可能性，本申请实施例对此不作限定。
本申请实施例的数据传输方法，通过候选下一跳节点之间交互NACK，从而选择出节点3作为节点1的下一跳节点传输数据，从多个候选下一跳节点中实时选择下一跳节点传输数据，能够避免网络环境的不稳定性对数据传输造成的影响，有利于提高无线网络的吞吐量，进而提高数据传输性能。
如图5所示，节点1发送数据，节点3和节点4接收到了来自节点1的数据。其中，节点1的多个候选下一跳节点被划分成了两个节点组，其中，节点2属于第一节点组，节点3和节点4属于第二节点组。第一节点组对数据的发送优先级高于第二节点组对数据的发送优先级。由于节点2在节点1的候选下一跳节点中对该数据的发送优先级最高，节点2并未接收到来自节点1的数据，该节点2可以直接发送NACK，表示节点2未正确接收到来自节点1的数据。该NACK中可以携带节点2的第一标识，本实施例简称为N2。
节点3和节点4均对上述来自节点1的数据译码正确，且节点3和节点4均收到了来自第一节点组中的节点(即节点2)发送的N2，则如图5所示，节点3和节点4均可以发 送该数据。
应理解，与图3所示的实施例和图4所示的实施例不同的是，本实施例可以通过多个下一跳节点发送数据，这样，能够提高数据传输的可靠性。
经过上述流程，来自节点1的数据将从节点3和节点4继续发送。具体地，该节点3可以将该数据发送给该节点3的候选下一跳节点。在图1所示的网络架构100中，节点3的候选下一跳节点包括节点2和节点5，那么，该节点3可以发送该数据，再由节点2和节点5之间根据实际情况进行信息交互，选择出下一跳节点继续将数据发送至节点7。该节点4可以将该数据发送给该节点4的候选下一跳节点。在图1所示的网络架构100中，节点4的候选下一跳节点包括节点2和节点6，那么，该节点4可以发送该数据，再由节点2和节点6之间根据实际情况进行信息交互，选择出下一跳节点继续将数据发送至节点7。应理解，上述实施例仅仅针对具体情况进行了举例说明，在实际应用过程中，节点与节点之间进行数据传输的过程中存在多种可能性，本申请实施例对此不作限定。
本申请实施例的数据传输方法，通过候选下一跳节点之间交互NACK，从而选择出节点3和节点4作为节点1的下一跳节点传输数据，从多个候选下一跳节点中实时选择下一跳节点传输数据，能够避免网络环境的不稳定性对数据传输造成的影响，有利于提高无线网络的吞吐量，进而提高数据传输性能。
示例性地，如图6所示，节点1发送数据，节点4接收到了来自节点1的数据。其中，节点1的多个候选下一跳节点被划分成了两个节点组，其中，节点2和节点3属于第一节点组，节点4属于第二节点组。第一节点组对数据的发送优先级高于第二节点组对数据的发送优先级。且节点3为第一节点组中对数据的发送优先级最低的节点。节点2未接收到来自节点1的数据，不会发送携带节点2的第一标识的ACK，简称为A2。由于节点3在第一节点组中对数据的发送优先级最低，节点3并未接收到来自节点2的A2，该节点3可以直接发送NACK，表示节点3未正确接收到来自节点1的数据。该NACK中可以携带节点3的第一标识，本实施例简称为N3。
节点4接收到来自节点3的N3，且节点4对数据译码正确，则节点4可以发送该数据。
经过上述流程，来自节点1的数据将从节点4继续发送。具体地，该节点4可以将该数据发送给该节点4的候选下一跳节点。在图1所示的网络架构100中，节点4的候选下一跳节点包括节点2和节点6，那么，该节点4可以发送该数据，再由节点2和节点6之间根据实际情况进行信息交互，选择出下一跳节点继续将数据发送至节点7。应理解，上述实施例仅仅针对具体情况进行了举例说明，在实际应用过程中，节点与节点之间进行数据传输的过程中存在多种可能性，本申请实施例对此不作限定。
本申请实施例的数据传输方法，通过候选下一跳节点之间交互ACK和/或NACK，从而选择出节点4作为节点1的下一跳节点传输数据，从多个候选下一跳节点中实时选择下一跳节点传输数据，能够避免网络环境的不稳定性对数据传输造成的影响，有利于提高无线网络的吞吐量，进而提高数据传输性能。
示例性地，如图7所示，节点1发送数据，节点3和节点4接收到了来自节点1的数据。由于节点2未接收到来自节点1的数据，节点2可以直接发送携带节点2的第一标识的NACK，简称为N2。节点3和节点4均对数据译码正确，该节点3可以发送携带节点 3的第一标识的ACK，简称为A3，该节点4可以发送携带节点4的第一标识的ACK，简称为A4。节点1收到N2、A3和A4，确定节点3和节点4能够发送该数据。该节点1可以根据节点3和节点4对数据的发送优先级，从中选择出一个节点作为下一跳节点。在本实施例中，节点3对数据的发送优先级比节点4对数据的发送优先级要高，该节点1可以向节点3发送指示信息，指示节点3发送该数据。节点3接收到来自节点1的指示信息之后，即可发送该数据。
经过上述流程，来自节点1的数据将从节点3继续发送，该节点3可以将该数据发送给该节点3的候选下一跳节点。在图1所示的网络架构100中，节点3的候选下一跳节点包括节点2和节点5，那么，该节点3可以发送该数据，再由节点2和节点5之间根据实际情况进行信息交互，选择出一个下一跳节点继续将数据发送至节点7。应理解，上述实施例仅仅针对具体情况进行了举例说明，在实际应用过程中，节点与节点之间进行数据传输的过程中存在多种可能性，本申请实施例对此不作限定。
本申请实施例的数据传输方法，通过节点1作为控制节点，根据候选下一跳节点上报的ACK和/或NACK，结合各个节点对数据的发送优先级，选择出节点3作为节点1的下一跳节点传输数据，从多个候选下一跳节点中实时选择下一跳节点传输数据，能够避免网络环境的不稳定性对数据传输造成的影响，有利于提高无线网络的吞吐量，进而提高数据传输性能。
在上述图7所示的实施例中，只需节点1维护各个候选下一跳节点对数据的发送优先级，而其他候选下一跳节点可以无需知道自身对来自节点1的数据的发送优先级。而在前述图3至图6所示的实施例中，由于各个候选下一跳节点是需要根据自身对节点1的数据的发送优先级进行判断的，该各个候选下一跳节点至少要维护自身对节点1的数据的发送优先级，以便执行后续流程。
应理解，上述各过程的序号的大小并不意味着执行顺序的先后，各过程的执行顺序应以其功能和内在逻辑确定，而不应对本申请实施例的实施过程构成任何限定。
上文中结合图1至图7，详细描述了根据本申请实施例的数据传输方法，下面将结合图8至图9，详细描述根据本申请实施例的装置。
图8示出了本申请实施例提供的装置800。该装置对应上述实施例中的第二节点，具体地，该装置800可以是终端设备，也可以为终端设备中的芯片。该装置可以是网络设备，也可以为网络设备中的芯片。该装置800包括：接收单元810和发送单元820。
该接收单元810，用于接收来自第一节点的数据，所述第二节点为所述第一节点的至少两个候选下一跳节点中的一个；
该发送单元820，用于根据优先级信息，发送所述数据，和/或，发送第一控制信息，所述优先级信息用于表示所述装置在所述至少两个候选下一跳节点中对所述数据的发送优先级。
本申请实施例的装置，通过为第一节点配置至少两个候选下一跳节点，该至少两个候选下一跳节点中的候选下一跳节点均可以根据自身的优先级信息，确定是否发送来自第一节点的数据，从而为该第一节点选择出下一跳节点传输数据。本申请实施例能够在数据到达候选下一跳节点时，从至少两个候选下一跳节点中实时选择一个或多个下一跳节点继续传输数据，能够避免网络环境的不稳定性对数据传输造成的影响，有利于提高无线网络的 吞吐量，进而提高数据传输性能。
可选地，该发送单元820具体用于：若所述装置在所述至少两个候选下一跳节点中对所述数据的发送优先级最高，且所述装置对所述数据译码正确，发送所述数据。
可选地，所述装置还包括：第一处理单元，用于若所述装置在所述至少两个候选下一跳节点中对所述数据的发送优先级不是最高的，确定是否接收到来自至少一个第三节点的第二控制信息，所述至少一个第三节点为所述至少两个候选下一跳节点中对所述数据的发送优先级比所述装置对所述数据的发送优先级高的节点，所述第二控制信息用于表示对所述数据译码正确；所述发送单元820具体用于：若所述装置未接收到所述第二控制信息，且所述装置对所述数据译码正确，发送所述数据。
可选地，所述发送单元820具体用于：若所述装置接收到所述第二控制信息，发送所述第一控制信息，所述第一控制信息包括来自所述至少一个第三节点中对所述数据的发送优先级最高的节点的第二控制信息。
可选地，所述发送单元820具体用于：发送所述数据和所述第一控制信息，所述第一控制信息包括肯定答复ACK。
可选地，所述装置还包括：第二处理单元，用于若所述装置在所述至少两个候选下一跳节点中对所述数据的发送优先级不是最高的，确定是否接收到来自第四节点的第三控制信息，所述第四节点为所述至少两个候选下一跳节点中对所述数据的发送优先级比所述装置对所述数据的发送优先级高一个优先级的节点，所述第三控制信息用于表示对所述数据译码错误；所述发送单元820具体用于：若所述装置接收到所述第三控制信息，且所述装置对所述数据译码正确，发送所述数据。
可选地，所述发送单元820具体用于：若所述装置接收到所述第三控制信息，且所述装置对所述数据译码错误，发送所述第一控制信息，所述第一控制信息包括否定答复NACK和/或调度请求SR。
可选地，所述第二处理单元还用于：若所述装置未接收到所述第三控制信息，确定是否接收到来自至少一个第五节点的第四控制信息，所述至少一个第五节点为所述至少两个候选下一跳节点中对所述数据的发送优先级比所述装置对所述数据的发送优先级高至少两个优先级的节点，所述第四控制信息用于表示对所述数据译码错误；所述发送单元820具体用于：若所述装置接收到所述第四控制信息，发送所述第一控制信息，所述第一控制信息包括来自所述至少一个第五节点中对所述数据的发送优先级最低的一个第五节点的第四控制信息。
可选地，所述发送单元820具体用于：若所述装置在所述至少两个候选下一跳节点中对所述数据的发送优先级最高，且所述装置对所述数据译码错误，发送所述第一控制信息，所述第一控制信息包括NACK和/或SR。
可选地，在所述至少两个候选下一跳节点中，所述装置属于所述第一节点组，且所述装置为所述第一节点组中对所述数据的发送优先级最低的节点；所述发送单元820具体用于：若所述装置未接收到所述第一节点组中来自其他节点的ACK，且所述装置对所述数据译码错误，发送所述第一控制信息，所述第一控制信息包括NACK和/或SR。
可选地，所述优先级信息对应第一资源；所述发送单元820具体用于：在所述第一资源上发送所述第一控制信息。
应理解，这里的装置800以功能单元的形式体现。这里的术语“单元”可以指应用特有集成电路(application specific integrated circuit，ASIC)、电子电路、用于执行一个或多个软件或固件程序的处理器(例如共享处理器、专有处理器或组处理器等)和存储器、合并逻辑电路和/或其它支持所描述的功能的合适组件。在一个可选例子中，本领域技术人员可以理解，装置800可以具体为上述实施例中的第二节点，装置800可以用于执行上述方法实施例中与第二节点对应的各个流程和/或步骤，为避免重复，在此不再赘述。
上述各个方案的装置800具有实现上述方法中第二节点执行的相应步骤的功能；所述功能可以通过硬件实现，也可以通过硬件执行相应的软件实现。所述硬件或软件包括一个或多个与上述功能相对应的模块；例如发送单元可以由发射机替代，接收单元810可以由接收机替代，其它单元，如确定单元等可以由处理器替代，分别执行各个方法实施例中的收发操作以及相关的处理操作。
在本申请的实施例，图8中的装置也可以是芯片或者芯片***，例如：片上***(system on chip，SoC)。对应的，接收单元810和发送单元可以是该芯片的收发电路，在此不做限定。
图9示出了本申请实施例提供的另一装置900。该装置900包括处理器910、收发器920和存储器930。其中，处理器910、收发器920和存储器930通过内部连接通路互相通信，该存储器930用于存储指令，该处理器910用于执行该存储器930存储的指令，以控制该收发器920发送信号和/或接收信号。
其中，该处理器910用于：通过该收发器920接收来自第一节点的数据，所述装置为所述第一节点的至少两个候选下一跳节点中的一个；根据优先级信息，通过该收发器920发送所述数据，和/或，发送第一控制信息，所述优先级信息用于表示所述装置在所述至少两个候选下一跳节点中对所述数据的发送优先级。
应理解，装置900可以具体为上述实施例中的第二节点，并且可以用于执行上述方法实施例中与第二节点对应的各个步骤和/或流程。可选地，该存储器930可以包括只读存储器和随机存取存储器，并向处理器提供指令和数据。存储器的一部分还可以包括非易失性随机存取存储器。例如，存储器还可以存储设备类型的信息。该处理器910可以用于执行存储器中存储的指令，并且当该处理器910执行存储器中存储的指令时，该处理器910用于执行上述与该第二节点对应的方法实施例的各个步骤和/或流程。
应理解，在本申请实施例中，上述装置的处理器可以是中央处理单元(central processing unit，CPU)，该处理器还可以是其他通用处理器、数字信号处理器(DSP)、专用集成电路(ASIC)、现场可编程门阵列(FPGA)或者其他可编程逻辑器件、分立门或者晶体管逻辑器件、分立硬件组件等。通用处理器可以是微处理器或者该处理器也可以是任何常规的处理器等。
在一种可能的实现方式中，上述存储器930可以包含在处理器910中。或者，可以理解为处理器910本身就可以执行存储器930的存储指令的功能，本申请实施例对此不作限定。
在实现过程中，上述方法的各步骤可以通过处理器中的硬件的集成逻辑电路或者软件形式的指令完成。结合本申请实施例所公开的方法的步骤可以直接体现为硬件处理器执行完成，或者用处理器中的硬件及软件单元组合执行完成。软件单元可以位于随机存储器， 闪存、只读存储器，可编程只读存储器或者电可擦写可编程存储器、寄存器等本领域成熟的存储介质中。该存储介质位于存储器，处理器执行存储器中的指令，结合其硬件完成上述方法的步骤。为避免重复，这里不再详细描述。
应理解，本文中术语“和/或”，仅仅是一种描述关联对象的关联关系，表示可以存在三种关系，例如，A和/或B，可以表示：单独存在A，同时存在A和B，单独存在B这三种情况。另外，本文中字符“/”，一般表示前后关联对象是一种“或”的关系。
本领域普通技术人员可以意识到，结合本文中所公开的实施例中描述的各方法步骤和单元，能够以电子硬件、计算机软件或者二者的结合来实现，为了清楚地说明硬件和软件的可互换性，在上述说明中已经按照功能一般性地描述了各实施例的步骤及组成。这些功能究竟以硬件还是软件方式来执行，取决于技术方案的特定应用和设计约束条件。本领域普通技术人员可以对每个特定的应用来使用不同方法来实现所描述的功能，但是这种实现不应认为超出本申请的范围。
所属领域的技术人员可以清楚地了解到，为了描述的方便和简洁，上述描述的***、装置和单元的具体工作过程，可以参考前述方法实施例中的对应过程，在此不再赘述。
在本申请所提供的几个实施例中，应该理解到，所揭露的***、装置和方法，可以通过其它的方式实现。例如，以上所描述的装置实施例仅仅是示意性的，例如，所述单元的划分，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式，例如多个单元或组件可以结合或者可以集成到另一个***，或一些特征可以忽略，或不执行。另外，所显示或讨论的相互之间的耦合或直接耦合或通信连接可以是通过一些接口、装置或单元的间接耦合或通信连接，也可以是电的，机械的或其它的形式连接。
所述作为分离部件说明的单元可以是或者也可以不是物理上分开的，作为单元显示的部件可以是或者也可以不是物理单元，即可以位于一个地方，或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部单元来实现本申请实施例方案的目的。
另外，在本申请各个实施例中的各功能单元可以集成在一个处理单元中，也可以是各个单元单独物理存在，也可以是两个或两个以上单元集成在一个单元中。上述集成的单元既可以采用硬件的形式实现，也可以采用软件功能单元的形式实现。
所述集成的单元如果以软件功能单元的形式实现并作为独立的产品销售或使用时，可以存储在一个计算机可读取存储介质中。基于这样的理解，本申请的技术方案本质上或者说对现有技术做出贡献的部分，或者该技术方案的全部或部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质中，包括若干指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)执行本申请各个实施例所述方法的全部或部分步骤。而前述的存储介质包括：U盘、移动硬盘、只读存储器(read-only memory，ROM)、随机存取存储器(random access memory，RAM)、磁碟或者光盘等各种可以存储程序代码的介质。
以上所述，仅为本申请的具体实施方式，但本申请的保护范围并不局限于此，任何熟悉本技术领域的技术人员在本申请揭露的技术范围内，可轻易想到各种等效的修改或替换，这些修改或替换都应涵盖在本申请的保护范围之内。因此，本申请的保护范围应以权利要求的保护范围为准。

Claims (28)

  1. 一种数据传输方法，其特征在于，包括：
    第二节点接收来自第一节点的数据，所述第二节点为所述第一节点的至少两个候选下一跳节点中的一个；
    所述第二节点根据优先级信息，发送所述数据，和/或，发送第一控制信息，所述优先级信息用于表示所述第二节点在所述至少两个候选下一跳节点中对所述数据的发送优先级。
  2. 根据权利要求1所述的方法，其特征在于，所述第二节点根据优先级信息，发送所述数据，和/或，发送第一控制信息，包括：
    若所述第二节点在所述至少两个候选下一跳节点中对所述数据的发送优先级最高，且所述第二节点对所述数据译码正确，所述第二节点发送所述数据。
  3. 根据权利要求1或2所述的方法，其特征在于，所述方法还包括：
    若所述第二节点在所述至少两个候选下一跳节点中对所述数据的发送优先级不是最高的，所述第二节点确定是否接收到来自至少一个第三节点的第二控制信息，所述至少一个第三节点为所述至少两个候选下一跳节点中对所述数据的发送优先级比所述第二节点对所述数据的发送优先级高的节点，所述第二控制信息用于表示对所述数据译码正确；
    所述第二节点根据优先级信息，发送所述数据，和/或，发送第一控制信息，包括：
    若所述第二节点未接收到所述第二控制信息，且所述第二节点对所述数据译码正确，所述第二节点发送所述数据。
  4. 根据权利要求3所述的方法，其特征在于，所述第二节点根据优先级信息，发送所述数据，和/或，发送第一控制信息，包括：
    若所述第二节点接收到所述第二控制信息，所述第二节点发送所述第一控制信息，所述第一控制信息包括所述至少一个第三节点中对所述数据的发送优先级最高的节点的第二控制信息。
  5. 根据权利要求2至4中任一项所述的方法，其特征在于，所述第二节点根据优先级信息，发送所述数据，和/或，发送第一控制信息，包括：
    所述第二节点发送所述第一控制信息，所述第一控制信息包括肯定答复ACK。
  6. 根据权利要求1所述的方法，其特征在于，所述方法还包括：
    若所述第二节点在所述至少两个候选下一跳节点中对所述数据的发送优先级不是最高的，所述第二节点确定是否接收到来自第四节点的第三控制信息，所述第四节点为所述至少两个候选下一跳节点中对所述数据的发送优先级比所述第二节点对所述数据的发送优先级高一个优先级的节点，所述第三控制信息用于表示对所述数据译码错误；
    所述第二节点根据优先级信息，发送所述数据，和/或，发送第一控制信息，包括：
    若所述第二节点接收到所述第三控制信息，且所述第二节点对所述数据译码正确，所述第二节点发送所述数据。
  7. 根据权利要求6所述的方法，其特征在于，所述第二节点根据优先级信息，发送所述数据，和/或，发送第一控制信息，包括：
    若所述第二节点接收到所述第三控制信息，且所述第二节点对所述数据译码错误，所述第二节点发送所述第一控制信息，所述第一控制信息包括否定答复NACK和/或调度请求SR。
  8. 根据权利要求6或7所述的方法，其特征在于，所述方法还包括：
    若所述第二节点未接收到所述第三控制信息，所述第二节点确定是否接收到来自至少一个第五节点的第四控制信息，所述至少一个第五节点为所述至少两个候选下一跳节点中对所述数据的发送优先级比所述第二节点对所述数据的发送优先级高至少两个优先级的节点，所述第四控制信息用于表示对所述数据译码错误；
    所述第二节点根据优先级信息，发送所述数据，和/或，发送第一控制信息，包括：
    若所述第二节点接收到所述第四控制信息，所述第二节点发送所述第一控制信息，所述第一控制信息包括所述至少一个第五节点中对所述数据的发送优先级最低的一个第五节点的第四控制信息。
  9. 根据权利要求1至8中任一项所述的方法，其特征在于，所述第二节点根据优先级信息，发送所述数据，和/或，发送第一控制信息，包括：
    若所述第二节点在所述至少两个候选下一跳节点中对所述数据的发送优先级最高，且所述第二节点对所述数据译码错误，所述第二节点发送所述第一控制信息，所述第一控制信息包括NACK和/或SR。
  10. 根据权利要求1所述的方法，其特征在于，在所述至少两个候选下一跳节点中，所述第二节点属于所述第一节点组，且所述第二节点为所述第一节点组中对所述数据的发送优先级最低的节点；
    所述第二节点根据优先级信息，发送所述数据，和/或，发送第一控制信息，包括：
    若所述第二节点未接收到所述第一节点组中来自其他节点的ACK，且所述第二节点对所述数据译码错误，所述第二节点发送所述第一控制信息，所述第一控制信息包括NACK和/或SR。
  11. 根据权利要求1至10中任一项所述的方法，其特征在于，所述优先级信息对应第一资源；
    所述第二节点根据优先级信息，发送所述数据，和/或，发送第一控制信息，包括：
    所述第二节点在所述第一资源上发送所述第一控制信息。
  12. 一种装置，其特征在于，包括：
    接收单元，用于接收来自第一节点的数据，所述装置为所述第一节点的至少两个候选下一跳节点中的一个；
    发送单元，用于根据优先级信息，发送所述数据，和/或，发送第一控制信息，所述优先级信息用于表示所述装置在所述至少两个候选下一跳节点中对所述数据的发送优先级。
  13. 根据权利要求12所述的装置，其特征在于，所述发送单元具体用于：
    若所述装置在所述至少两个候选下一跳节点中对所述数据的发送优先级最高，且所述装置对所述数据译码正确，发送所述数据。
  14. 根据权利要求12或13所述的装置，其特征在于，所述装置还包括：
    第一处理单元，用于若所述装置在所述至少两个候选下一跳节点中对所述数据的发送 优先级不是最高的，确定是否接收到来自至少一个第三节点的第二控制信息，所述至少一个第三节点为所述至少两个候选下一跳节点中对所述数据的发送优先级比所述装置对所述数据的发送优先级高的节点，所述第二控制信息用于表示对所述数据译码正确；
    所述发送单元具体用于：
    若所述装置未接收到所述第二控制信息，且所述装置对所述数据译码正确，发送所述数据。
  15. 根据权利要求14所述的装置，其特征在于，所述发送单元具体用于：
    若所述装置接收到所述第二控制信息，发送所述第一控制信息，所述第一控制信息包括所述至少一个第三节点中对所述数据的发送优先级最高的节点的第二控制信息。
  16. 根据权利要求13至15中任一项所述的装置，其特征在于，所述发送单元具体用于：
    发送所述第一控制信息，所述第一控制信息包括肯定答复ACK。
  17. 根据权利要求12所述的装置，其特征在于，所述装置还包括：
    第二处理单元，用于若所述装置在所述至少两个候选下一跳节点中对所述数据的发送优先级不是最高的，确定是否接收到来自第四节点的第三控制信息，所述第四节点为所述至少两个候选下一跳节点中对所述数据的发送优先级比所述装置对所述数据的发送优先级高一个优先级的节点，所述第三控制信息用于表示对所述数据译码错误；
    所述发送单元具体用于：
    若所述装置接收到所述第三控制信息，且所述装置对所述数据译码正确，发送所述数据。
  18. 根据权利要求17所述的装置，其特征在于，所述发送单元具体用于：
    若所述装置接收到所述第三控制信息，且所述装置对所述数据译码错误，发送所述第一控制信息，所述第一控制信息包括否定答复NACK和/或调度请求SR。
  19. 根据权利要求17或18所述的装置，其特征在于，所述第二处理单元还用于：
    若所述装置未接收到所述第三控制信息，确定是否接收到来自至少一个第五节点的第四控制信息，所述至少一个第五节点为所述至少两个候选下一跳节点中对所述数据的发送优先级比所述装置对所述数据的发送优先级高至少两个优先级的节点，所述第四控制信息用于表示对所述数据译码错误；
    所述发送单元具体用于：
    若所述装置接收到所述第四控制信息，发送所述第一控制信息，所述第一控制信息包括所述至少一个第五节点中对所述数据的发送优先级最低的一个第五节点的第四控制信息。
  20. 根据权利要求12至19中任一项所述的装置，其特征在于，所述发送单元具体用于：
    若所述装置在所述至少两个候选下一跳节点中对所述数据的发送优先级最高，且所述装置对所述数据译码错误，发送所述第一控制信息，所述第一控制信息包括NACK和/或SR。
  21. 根据权利要求12所述的装置，其特征在于，在所述至少两个候选下一跳节点中，所述装置属于所述第一节点组，且所述装置为所述第一节点组中对所述数据的发送优先级 最低的节点；
    所述发送单元具体用于：
    若所述装置未接收到所述第一节点组中来自其他节点的ACK，且所述装置对所述数据译码错误，发送所述第一控制信息，所述第一控制信息包括NACK和/或SR。
  22. 根据权利要求12至21中任一项所述的装置，其特征在于，所述优先级信息对应第一资源；
    所述发送单元具体用于：
    在所述第一资源上发送所述第一控制信息。
  23. 一种装置，其特征在于，包括：处理器，所述处理器与存储器耦合，所述存储器用于存储程序或指令，当所述程序或指令被所述处理器执行时，使得所述装置执行上述权利要求1至11中任一项所述的方法。
  24. 一种计算机可读介质，用于存储计算机程序或指令，其特征在于，所述计算机程序或指令被执行时使得计算机执行上述权利要求1至11中任一项所述的方法。
  25. 一种计算机程序产品，所述计算机程序产品中包括计算机程序代码，其特征在于，当所述计算机程序代码在计算机上运行时，使得计算机实现上述权利要求1至11中任一项所述的方法。
  26. 一种芯片，其特征在于，包括：处理器，所述处理器与存储器耦合，所述存储器用于存储程序或指令，当所述程序或指令被所述处理器执行时，使得所述芯片实现上述权利要求1至11中任一项所述的方法。
  27. 一种装置，其特征在于，所述装置用于执行权利要求1至11中任一项所述的方法。
  28. 一种通信***，其特征在于，所述通信***包括：第一节点和第二节点；
    所述第一节点用于发送数据；
    所述第二节点用于接收来自所述第一节点的数据，所述第二节点为所述第一节点的至少两个候选下一跳节点中的一个；
    所述第二节点还用于根据优先级信息，发送所述数据，和/或，发送第一控制信息，所述优先级信息用于表示所述第二节点在所述至少两个候选下一跳节点中对所述数据的发送优先级。
PCT/CN2019/122022 2018-12-12 2019-11-29 数据传输方法和装置 WO2020119483A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201811515587.4 2018-12-12
CN201811515587.4A CN111314954B (zh) 2018-12-12 数据传输方法和装置

Publications (1)

Publication Number Publication Date
WO2020119483A1 true WO2020119483A1 (zh) 2020-06-18

Family

ID=71077083

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/122022 WO2020119483A1 (zh) 2018-12-12 2019-11-29 数据传输方法和装置

Country Status (1)

Country Link
WO (1) WO2020119483A1 (zh)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102932866A (zh) * 2012-07-06 2013-02-13 北京邮电大学 一种适用于多射频多信道Ad hoc网络的机会路由机制
US20160381596A1 (en) * 2015-06-25 2016-12-29 The Board Of Trustees Of The University Of Alabama Intelligent multi-beam medium access control in ku-band for mission-oriented mobile mesh networks
CN106304229A (zh) * 2016-08-18 2017-01-04 南京邮电大学 一种基于内容存储的软件定义无线Mesh网络

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102932866A (zh) * 2012-07-06 2013-02-13 北京邮电大学 一种适用于多射频多信道Ad hoc网络的机会路由机制
US20160381596A1 (en) * 2015-06-25 2016-12-29 The Board Of Trustees Of The University Of Alabama Intelligent multi-beam medium access control in ku-band for mission-oriented mobile mesh networks
CN106304229A (zh) * 2016-08-18 2017-01-04 南京邮电大学 一种基于内容存储的软件定义无线Mesh网络

Also Published As

Publication number Publication date
CN111314954A (zh) 2020-06-19

Similar Documents

Publication Publication Date Title
US11128416B2 (en) Feedback information transmission method and apparatus
WO2018054381A1 (zh) 传输反馈信息的方法和装置
TWI530144B (zh) 處理通訊運作的方法及其通訊裝置
TWI725160B (zh) 用於設備間通信的方法和裝置
JP2019536308A (ja) 無線通信システムにおけるダウンリンク制御チャネルの送信および検出のための方法およびデバイス
KR102197441B1 (ko) 다운링크 피드백 정보를 송신하는 방법, 기지국 및 단말 기기
US11129173B2 (en) Method and apparatus for transmitting sidelink feedback information
US20210385142A1 (en) Method and device for data transmission
CN110913481B (zh) 数据传输方法及通信装置
JP2023526813A (ja) 複数のｔｒｐにわたる単一のｃｏｒｅｓｅｔに基づいたｐｄｃｃｈのダイバーシティ
WO2019076207A1 (zh) 数据传输的确认方法及设备
US11463207B2 (en) Data transmission method, receive end device, and non-transitory computer-readable storage medium
US11012997B2 (en) Subframe configuration method and apparatus
JP2020530952A (ja) フィードバック応答情報の伝送方法、装置及びシステム
EP3570607B1 (en) Reducing the transmission delay and improving the reliability of uplink data
WO2017121384A1 (zh) 一种无线帧的传输方法以及无线网络设备
US20230171035A1 (en) Data transmission method and apparatus
WO2017128512A1 (zh) 信息发送方法、信息接收方法、装置及***
US20210376968A1 (en) Feedback method and apparatus
WO2020119483A1 (zh) 数据传输方法和装置
WO2023000338A1 (zh) 载波切换方法、装置、设备及存储介质
WO2022077247A1 (zh) Tci状态的确定方法、装置、设备及存储介质
WO2018201338A1 (zh) 通信方法和设备
CN111314954B (zh) 数据传输方法和装置
CN114846755A (zh) 一种数据的反馈方法及装置

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: 19896963

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: 19896963

Country of ref document: EP

Kind code of ref document: A1