WO2018019056A1

WO2018019056A1 - Data transmission method and relay node

Info

Publication number: WO2018019056A1
Application number: PCT/CN2017/089272
Authority: WO
Inventors: 郭宇宸; 贾嘉; 李云波
Original assignee: 华为技术有限公司
Priority date: 2016-07-27
Filing date: 2017-06-21
Publication date: 2018-02-01
Also published as: CN107666686A; CN107666686B

Abstract

Disclosed in an embodiment of the present application is a data transmission method, applied to a wireless network comprising a root access node and at least two relay nodes. The method comprises: a first relay node in at least two relay nodes obtains a mapping relationship between at least one second relay node and at least one station, each second relay node being corresponding to at least one station; the first relay node receives a data packet, the data packet carrying indication information, and the indication information being used for indicating a destination station to which the data packet is transmitted; and when it is determined that the destination station exists in the mapping relationship, the first relay node sends the data packet to the second relay node corresponding to the destination station, so that the second relay node sends the data packet to the destination station.

Description

Method of transmitting data and relay node

The present application claims priority to Chinese Patent Application, filed on Jul. 27, 2016, the entire disclosure of which is hereby incorporated by reference. in.

Technical field

The present application relates to the field of data transmission and, more particularly, to a method of transmitting data and a relay node.

Background technique

In many application scenarios of wireless communication, long-distance transmission of up to 1 to 2 kilometers between nodes is required, for example, smart grid, highway traffic monitoring, and the like. However, due to regulatory restrictions and uncertainty of wireless channel conditions, long-distance transmission between nodes is not possible.

In order to solve the above problems, a relay technique has been proposed in the prior art. The relay technology adds one or more relay nodes between two nodes that need to transmit data to perform one or more forwarding of data that needs to be transmitted. By adding a relay node, after multi-hop transmission, the purpose of transmitting data over a long distance is achieved. In the topology of the relay transmission, there are three types of nodes, namely, a root access point (AP), a relay node (Relay), and a station (Station, STA). Based on such a topology, if one site (hereinafter referred to as Site 1 for ease of differentiation) needs to forward data to another site (for ease of distinction, hereinafter referred to as Site 2), Site 1 first forwards the packet to its associated Relay node 1, after receiving the data packet, the relay node 1 transmits the data packet to the relay node 2 associated therewith. And so on, until the packet is sent to the root access point. After receiving the data packet, the root access point forwards the data packet to the relay node 3 associated with the station 2, and finally sends the data packet to the station 2 by the relay node 3 to complete the data transmission. .

In the above transmission process, the problem that data can be transmitted over a long distance is solved. However, since all data packets need to be forwarded through the root access point, the burden on the root access point to transmit data is increased.

Summary of the invention

The present application provides a method and a relay node for transmitting data, which can reduce the burden of transmitting data by a root access point.

In a first aspect, the present application provides a method for transmitting data, which is applied to a wireless network including a root access point and at least two relay nodes, the method comprising: a first relay of the at least two relay nodes The node acquires a mapping relationship between the at least one second relay node and the at least one station, where each second relay node corresponds to at least one station; the first relay node receives a data packet, and the data packet carries indication information, the indication The information is used to indicate the destination station to which the data packet needs to be transmitted; when the first relay node determines that the destination station exists in the mapping relationship, the data packet is sent to the destination second relay node corresponding to the destination station, For this purpose, the second relay node sends the data packet to the destination site.

In a possible implementation manner, the first relay node acquires a mapping relationship between the at least one second relay node and the at least one site, where the first relay node determines the at least one second relay node; Establishing a device-to-device D2D connection between the first relay node and the at least one second relay node; the first relay node acquiring at least one site information of the at least one second relay node, the at least one site information and The at least one second relay node is in one-to-one correspondence, each site information is used to indicate one or more sites, and each site passes the corresponding second relay The node sends or receives data; the first relay node establishes a mapping relationship between the at least one second relay node and the at least one station according to the at least one site information.

In a possible implementation manner, the first relay node determines the at least one second relay node, including: the first relay node sends a discovery request frame, where the discovery request frame carries response condition information, and the response The condition information is used to indicate a condition that the device responding to the discovery request frame needs to satisfy; the first relay node receives the at least one response frame that is sent when the at least one second relay node determines that the response condition is met; the first relay The node determines the at least one second relay node according to the at least one response frame.

In a possible implementation manner, the response condition further includes at least one of the following conditions: the device is a relay node, the device supports a D2D connection, the device has a routing function, and the device and the first relay node The link rate between the device is equal to or higher than the preset rate threshold, and the transmission delay between the device and the first relay node is equal to or lower than a preset delay threshold.

In a possible implementation manner, the first relay node determines the at least one second relay node, including: the first relay node receives a D2D connection suggestion frame sent by a root access point, and the D2D connection suggestion frame The first identifier information and the at least one second identifier information are used to identify the first relay node, where the at least one second identifier information is in one-to-one correspondence with the at least one second relay node, where the D2D connection proposal is The frame is sent to the first relay node when the root access point determines that the first relay node and the at least one second relay node satisfy the D2D connection condition; the first relay node is according to the at least one The second identification information determines the at least one second relay node.

In a possible implementation manner, the first relay node determines the at least one second relay node, including: the first relay node receives at least one D2D connection suggestion frame, and the at least one D2D connection suggestion frame and the The at least one second relay node is in one-to-one correspondence, and each D2D connection suggestion frame carries first identifier information for identifying the first relay node and second identifier information for identifying the corresponding second relay node. Each D2D connection suggestion frame is sent by the parent node of the corresponding second relay node to the first relay node when determining that the second relay node and the first relay node satisfy the D2D connection condition. The first relay node determines the at least one second relay node according to the second identifier information carried in the at least one D2D connection suggestion frame.

In a possible implementation manner, the first relay node acquires site information of the at least one second relay node, where the first relay node sends a site information request frame to the at least one second relay node. The site information request frame is used to request to acquire a site corresponding to each second relay node; the first relay node receives site information sent by the at least one second relay node.

In a possible implementation, after the first relay node determines the at least one second relay node, the method further includes: the first relay node sending the first medium to the at least one second relay node Following the site information of the node, the site information of the first relay node is used to indicate one or more sites corresponding to the first relay node, so that the at least one second relay node is configured according to the first relay node. The station information forwards the data packet to the first relay node.

In a possible implementation, after the first relay node sends the data packet to the destination second relay node, the method further includes: the first relay node receiving the destination second relay node sending An error report, where the error report carries the indication information of the destination station, where the error report is used to indicate that the destination station does not exist in the site corresponding to the second relay node of the destination; the first relay node reports according to the error, The mapping relationship is updated, and information about the destination site of the destination second relay node recorded in the mapping relationship is deleted.

In a possible implementation manner, the method further includes: when the first relay node determines that the destination station does not exist in the mapping relationship, the first relay node sends the data packet to the root access point, In order for the root access point to send the data packet to the destination site.

In a possible implementation manner, after the first relay node acquires the mapping relationship between the at least one second relay node and the at least one site, the method further includes: the first relay node receives the destination second And following the first prompt information or the second prompt information sent by the node, the first prompt information is sent to the first relay node when the site corresponding to the second relay node of the destination is increased, and the first prompt information carries a new one. The indication information of the added site is sent to the first relay node when the site corresponding to the second relay node of the destination is reduced, and the second prompt information carries the indication information of the reduced site; The first relay node creates, according to the first prompt information, information about the newly added site of the destination second relay node in the mapping relationship, or the first relay node deletes according to the second prompt information. The information of the site that should be reduced by the second relay node of the destination recorded in the mapping relationship.

In a second aspect, the present application provides a method for transmitting data, which is applied to a wireless network including a root access point and at least two relay nodes, where the method includes: a second of the at least two relay nodes Receiving, by the node, a data packet sent by the first relay node, where the data packet carries indication information, where the indication information is used to indicate a destination station to which the data packet needs to be transmitted, where the data packet is obtained by the first relay node according to at least Transmitting a mapping relationship between the second relay node and the at least one site to the destination second relay node, where the destination second relay node is one of the at least one second relay node, each second The relay node corresponds to at least one station; the destination second relay node determines that the destination station exists in the corresponding station, and sends the data packet to the destination station.

In a possible implementation manner, the method further includes: receiving, by the second relay node, the discovery request frame sent by the first relay node, where the discovery request frame carries response condition information, where the response condition information is used Determining a condition that the device responding to the discovery request frame needs to satisfy; when the destination second relay node determines that the response condition is met, sending a response frame to the first relay node, so that the first relay node finds the destination The second relay node establishes a D2D connection with the destination second relay node.

In a possible implementation, the response condition includes at least one of the following conditions: the device is a relay node, the device supports device-to-device D2D connection, the device has a routing function, and the device is in the first The transmission delay between the device and the first relay node is equal to or lower than a preset delay threshold, and the link rate between the nodes is equal to or higher than a preset rate threshold.

In a possible implementation manner, the method further includes: receiving, by the second relay node, the D2D connection suggestion frame sent by the root access point, where the D2D connection suggestion frame carries the first identifier that identifies the first relay node Identifying information and identifying second identification information of the second relay node of the destination, where the D2D connection suggestion frame is sent when the root access point determines that the first relay node and the destination second relay node satisfy the D2D connection condition Giving the second relay node and the first relay node to the destination; the destination second relay node receives the D2D connection request frame sent by the first relay node based on the D2D connection suggestion frame, and the first relay The node establishes a D2D connection.

In a possible implementation manner, the method further includes: receiving, by the second relay node, the D2D connection suggestion frame sent by the parent node of the destination second relay node, where the D2D connection suggestion frame carries the identifier a first identification information of the relay node and a second identification information identifying the second relay node of the destination, the D2D connection suggestion frame is a parent node of the second relay node of the destination, determining the first relay node and the destination Sending to the second relay node and the first relay node when the D2D connection condition is met between the two relay nodes; the destination second relay node receives the first relay node and sends the frame according to the D2D connection suggestion frame The D2D connects to the request frame and establishes a D2D connection with the first relay node.

In a possible implementation, before the destination second relay node receives the data packet sent by the first relay node, the method further includes: the destination second relay node receives the site sent by the first relay node Information request frame, The site information request frame is used to request to acquire a site corresponding to the second relay node of the destination; the destination second relay node sends site information to the first relay node, where the site information is used to indicate one or more sites, Each station sends or receives data through the destination second relay node, so that the first relay node establishes a mapping relationship between the destination second relay node and the one or more sites.

In a possible implementation manner, the method further includes: the destination second relay node receives and saves the site information of the first relay node sent by the first relay node, so as to facilitate the destination second relay node. When receiving the data packet, determining, according to the site information of the first relay node, whether to forward the data packet to the first relay node, where the site information of the first relay node is used to indicate one or more sites, Each station transmits or receives data through the first relay node.

In a possible implementation manner, after the destination second relay node receives the data packet sent by the first relay node, the method further includes: determining, by the second relay node, that the destination does not exist in the corresponding site. At the time of the site, an error report is sent to the first relay node, where the error report carries the indication information of the destination station, so that the first relay node updates the mapping relationship according to the error report.

In a possible implementation manner, after the destination second relay node sends the site information to the first relay node, the method further includes: when the destination corresponding to the second relay node increases, the destination The second relay node sends the first prompt information to the first relay node, where the first prompt information carries the indication information of the newly added station, so that the first relay node creates the new destination in the mapping relationship. The information that the second relay node corresponds to the newly added station; or, when the destination corresponding to the second relay node of the destination is decreased, the second relay node of the destination sends the second prompt information to the first relay node, where The second prompt information carries the indication information of the reduced station, so that the first relay node deletes information about the site corresponding to the destination second relay node in the mapping relationship.

In a third aspect, the present application provides a relay node for performing the method of the first aspect or any possible implementation of the first aspect. In particular, the relay node comprises means for performing the method of the first aspect or any of the possible implementations of the first aspect.

In a fourth aspect, the present application provides a relay node for performing the method in any of the possible implementations of the second aspect or the second aspect. In particular, the relay node comprises means for performing the method of any of the second aspect or any of the possible implementations of the second aspect.

In a fifth aspect, the application provides a relay node, where the relay node includes a receiver, a transmitter, a processor, and a memory. The memory is used to store instructions, and the processor is configured to execute instructions stored in the memory to control the receiver to receive signals or to control the transmitter to transmit signals. The processor performs the method of the first aspect or any of the possible implementations of the first aspect when the instructions stored in the memory are executed.

In a sixth aspect, the application provides a relay node, where the relay node includes a receiver, a transmitter, a processor, and a memory. The memory is used to store instructions, and the processor is configured to execute instructions stored in the memory to control the receiver to receive signals or to control the transmitter to transmit signals. The processor performs the method of any of the possible implementations of the second aspect or the second aspect when the instructions stored in the memory are executed.

Alternatively, the memories in the above fifth and sixth aspects may be independent or integrated with the processor. When the processor is implemented by hardware, for example, it may be a logic circuit or an integrated circuit, and is connected to other hardware through an interface, and no memory may be needed at this time.

In a seventh aspect, the application provides a computer readable medium for storing a computer program, the computer program comprising instructions for performing the method of the first aspect or any of the possible implementations of the first aspect.

In an eighth aspect, the application provides a computer readable medium for storing a computer program, the computer program Instructions are included for performing the method of the second aspect or any of the possible implementations of the second aspect.

According to the method for transmitting data according to the embodiment of the present application, the first relay node obtains a mapping relationship between the at least one second relay node and the at least one site, so that when the data packet to be forwarded is received, if it is determined that the mapping relationship exists The destination station to which the data packet needs to be forwarded, and the first relay node sends the data packet to the destination second relay node corresponding to the destination station according to the mapping relationship, so that the destination second relay node forwards the data packet to the destination site. . Therefore, the data packet no longer needs to be forwarded through the root access point, which can reduce the burden on the root access point.

DRAWINGS

1 is a schematic diagram of a topology of a prior art relay transmission technology.

2 is a schematic flowchart of a method of transmitting data according to an embodiment of the present application.

FIG. 3 is a schematic diagram of a plurality of second relay nodes that satisfy a response condition and send a response frame according to an embodiment of the present application.

FIG. 4 shows one possible form of the D2D connection suggestion frame of the embodiment of the present application.

FIG. 5 illustrates a schematic scenario of a method of transmitting data in accordance with an embodiment of the present application.

FIG. 6 shows a schematic block diagram of a relay node in accordance with an embodiment of the present application.

FIG. 7 shows a schematic block diagram of a relay node in accordance with another embodiment of the present application.

FIG. 8 shows a schematic structural diagram of a relay node according to an embodiment of the present application.

FIG. 9 shows a schematic structural diagram of a relay node according to another embodiment of the present application.

detailed description

The technical solutions provided by the present application are described in detail below with reference to the accompanying drawings.

It should be understood that, in the embodiment of the present application, the numbers "first" and "second" are only used to distinguish different objects. For example, in order to distinguish different relay nodes or information, the protection scope of the embodiment of the present application should not be Unnecessary restrictions.

In the traditional 802.11 standard, an access point (AP) and a plurality of stations (Stations, STAs) associated with the access point form a basic service set (BSS). Service data can be forwarded by adding relay access points (Relays) while increasing coverage or increasing system throughput. The relay access point device includes two logical entities, namely, a relay-station (Relay STA) and a relay-access point (Relay AP). In order to distinguish from non-relay access points, non-relay access points are referred to as root access points (Root APs). When the relay communicates with the Root AP, the Relay STA entity associates with the Root AP and communicates with each other. It can also be said that the Relay STA and the Root AP belong to the same BSS. When the Relay communicates with the normal site, the Relay AP entity associates with the site and communicates, that is, the Relay AP and the site belong to the same BSS.

Figure 1 shows a schematic diagram of the topology of a prior art relay network. As shown in Figure 1, in a topology, there are three types of nodes, namely, a root access point (Root Access Point), a relay node (relay), and a station (Station, STA). Some of the sites are directly associated with the root access point, and some sites are associated with the relay node. In addition, the relay node can also be associated with the relay node to form a multi-layer relay. For a relay node, it internally includes three parts, which are a relay STA, a relay function, and a relay AP. The relay STA communicates with the node in the upper BSS as the root access point or the relay of the upper level. The relay AP acts as a node of the lower BSS and communicates with its associated relay node or station. The function of the relay function is to bridge the STA and the relay AP, and connect to the logical link layer to implement the relay function.

As shown in FIG. 1, the STA2 transmits data to the STA6 as an example. When relay transmission is used, STA2 first transmits the data packet to the relay node 1 associated with STA2. Relay node 1 then sends the packet to the root access point. After receiving the data packet, the root access point sends the data packet to the relay node 2 according to the association between the relay node and the station. The relay node 2 then transmits the data packet to the relay node 3 and finally transmits the data packet to the STA 6. Through the forwarding process of the foregoing data packet, it can be seen that the forwarding of the data packet by the relay node can solve the problem in the prior art that STA2 cannot be directly transmitted due to the long transmission distance between STA2 and STA6 and the limitation of the transmission power. The problem of sending a packet to STA6.

However, the above process has another problem, that is, all data packets are forwarded through the root access point, resulting in a large burden on the root access point to transmit data.

The method for transmitting data in the embodiment of the present application will be described in detail below with reference to FIG. 2 to FIG. 5.

FIG. 2 shows a schematic flow chart of a method of transmitting data according to an embodiment of the present application. As shown in FIG. 2, the method includes steps 110 through 130.

110. The first relay node acquires a mapping relationship between the at least one second relay node and the at least one site, where the mapping relationship is used to record at least one site corresponding to each second relay node.

It should be noted that, in the embodiment of the present application, the first relay node refers to a relay node associated with the root access point. The second relay node refers to a relay node associated with a site. The second relay node may be associated with the root access point, or one or more relay nodes may exist between the second relay node and the root access point, which is not specifically limited in this embodiment. .

For the sake of understanding, the topology relationship shown in FIG. 1 is taken as an example to describe the topological relationship between the nodes involved in the embodiment of the present application.

In the above-mentioned topology shown in FIG. 1, the first relay node in the embodiment of the present application may be the relay node 1, and the second relay node may be the relay node 2, and the relay node 2 is associated with the relay node 2 at this time. There is STA4. Alternatively, the second relay node may also be the relay node 3. At this time, the relay node 3 is connected to the root access point through the parent node (ie, the relay node 2 shown in FIG. 1), and is relayed. Node 3 is associated with STA5 and STA6.

In the embodiment of the present application, one relay node corresponds to one site, and includes two cases. In one case, the relay node is associated with the site, and the station directly receives data or transmits data through the relay node. In another case, there is one or more relay nodes between the relay node and the station, and the station indirectly receives or transmits data through the relay node.

Therefore, the mapping relationship in the embodiment of the present application can be understood as recording a site associated with each of the one or more second relay nodes, or a site that can communicate indirectly through other relay nodes.

Optionally, as an embodiment, the first relay node acquires a mapping relationship between the at least one second relay node and the at least one site, including:

The first relay node determines the at least one second relay node;

Establishing a device-to-device D2D connection between the first relay node and the at least one second relay node;

The first relay node acquires at least one site information of the at least one second relay node, the at least one site information is in one-to-one correspondence with the at least one second relay node, and each site information is used to indicate one or more a site, each station transmitting or receiving data through a corresponding second relay node;

And the first relay node establishes a mapping relationship between the at least one second relay node and the at least one site according to the at least one site information.

In the embodiment of the present application, the first relay node performs D2D device discovery, and determines at least one second relay node. There are two ways, namely, mode 1 and mode 2.

Mode 1

Optionally, the first relay node determines the at least one second relay node, including:

The first relay node sends a discovery request frame, where the discovery request frame carries response condition information, where the response condition information is used to indicate a condition that the device responding to the discovery request frame needs to meet;

Receiving, by the first relay node, the at least one response frame that is sent when the at least one second relay node determines that the response condition is met;

The first relay node determines the at least one second relay node according to the at least one response frame.

Specifically, the first relay node sends a discovery request frame, and the discovery request frame carries a response condition. If the neighboring node of the first relay node receives the discovery request frame, it determines whether the response condition is met by itself. If so, the neighbor node sends a response frame to the first relay node. The first relay node receives the response frame, learns one or more neighbor nodes in the neighbor node that satisfy the response condition, and determines the one or more neighbor nodes as the second relay node.

It should be understood that the neighbor node that receives the discovery request frame does not reply to the discovery request frame if it finds that it does not satisfy the response condition.

In the embodiment of the present application, the response condition may include at least one of the following conditions:

The device (or node) that replies to the discovery request frame is a relay node, the device supports a D2D connection, the device has a routing function, and the link rate between the device and the first relay node is equal to or higher than a preset. The rate threshold, the transmission delay between the device and the first relay node is equal to or lower than a preset delay threshold.

Specifically, the device replying to the discovery request frame should be a relay device, and the device replying to the discovery request frame should support the D2D connection. The device replying to the discovery request frame should have the computing power of routing and should have access to the routing table. The link rate between the device and the first relay node may not be lower than a predetermined preset rate threshold. In this case, the preset rate threshold may be carried in the request frame. The delay between the device and the first relay node must not exceed the preset delay threshold.

It should be understood that the first relay node may carry the conditions of the link rate and the transmission delay in the response condition according to the requirements of the data transmission. When the response condition carries the requirements of the lowest link rate and the maximum transmission delay, the node that replies to the discovery request frame may carry the actual response frame in the response frame if it satisfies the requirement of the link rate and the transmission delay of the first relay node. Link rate or actual transmission delay.

It should also be understood that if there are multiple second relay nodes that meet the minimum link requirement or the maximum transmission delay requirement, and the actual frame rate or actuality is carried in the response frame sent to the first relay node. Transmission delay. The first relay node may select one or a part of the second relay nodes that have a higher actual transmission rate or a smaller actual transmission delay from among the plurality of second relay nodes that satisfy the condition to establish a D2D connection.

Optionally, the response condition may include a minimum value of the number of sites associated with the node that replies to the discovery request frame, or the response condition carries a target site list.

It should be understood that when the number of sites associated with one relay node is very small, or no site is associated, even if all the conditions of the above response conditions are met, it is not necessary for the first relay node to establish a D2D connection with the relay node. . Therefore, the first relay node can avoid establishing a D2D connection with a relay node that has few or even no associated sites by carrying the minimum number of associated sites in the response condition.

The condition of the maximum transmission delay is based on the reason similar to the lowest link rate, that is, the first relay node can further select the relay node that meets the delay requirement from the relay nodes that satisfy the other multiple conditions. In other words, the actual chain The path rate and the actual transmission delay can be used as a reference for the first relay node to perform D2D connection.

In the embodiment of the present application, the target site list in the response condition is used for the case where the first relay node purposefully searches for certain sites. For example, the list of target sites carried in the discovery request frame is STA1, STA2, and STA3. Then, a relay node can send a response frame to the first relay node only when at least one of STA1, STA2, and STA3 is associated. Optionally, the relay node that sends the response frame carries the identification information of the associated site in the response frame.

In the embodiment of the present application, the first relay node may send the discovery request frame to the other neighboring node in the form of a broadcast, or may be sent to a specific neighbor node in a unicast manner. This example is not particularly limited. In the latter case, it can generally be applied to the first relay node to know the existence of a certain neighbor node, but it is not known whether the neighbor node satisfies the response condition. Therefore, the first relay node sends a discovery request frame to the neighbor node, and if the neighbor node replies with the response frame, the first relay node initiates establishment of a D2D connection with the neighbor node.

It should be noted that at least one second relay node that replies to the discovery request frame may contend for the channel when transmitting the response frame to the first relay node. The response frame is sent again when the channel access opportunity is acquired.

FIG. 3 shows a schematic diagram of a plurality of second relay nodes that satisfy a response condition transmitting a response frame. As shown in FIG. 3, the relay node 1 transmits a discovery request frame to find a relay node that is satisfied. The discovery request carries a response condition. If the relay node 2, the relay node 3, and the relay node 4 that have received the discovery request frame satisfy the response condition, the relay node 2, the relay node 3, and the relay node 4 respectively acquire the channel through the contention channel. An access frame is sent to the first relay node when the opportunity is accessed.

Mode 2

The first relay node receives at least one D2D connection suggestion frame, and the at least one D2D connection suggestion frame is in one-to-one correspondence with the at least one second relay node, and each D2D connection suggestion frame carries a identifier for identifying the first relay node. First identification information and second identification information for identifying the corresponding second relay node, each D2D connection suggestion frame is a parent node of the corresponding second relay node in determining the second relay node Sending to the first relay node when the first relay node satisfies the D2D connection condition;

The first relay node determines the at least one second relay node according to the second identifier information carried in the at least one D2D connection suggestion frame.

Specifically, in the embodiment of the present application, if a parent node of a relay node finds its own associated relay node (referred to as a relay node 1 for convenience of distinction) and another relay node (for the purpose of distinguishing, The D2D connection condition is satisfied between the relay nodes 2), for example, there is frequent frame exchange between the relay node 1 and the relay node 2, or the distance between the relay node 1 and the relay node 2 is relatively close. In this case, the parent node of the relay node 1 may transmit a D2D connection suggestion frame to the relay node 1 and the relay node 2 to instruct the relay node 1 and the relay node 2 to establish a D2D connection.

Optionally, as an embodiment, the first relay node receives the D2D connection suggestion frame that is also sent by the root access point, where the D2D connection suggestion frame carries the first identifier information that identifies the first relay node and at least a second identification information, the at least one second identification information is in one-to-one correspondence with the at least one second relay node, wherein the D2D connection suggestion frame is a root access point determining the first relay node and the at least one Sending to the first relay node when the two relay nodes satisfy the D2D connection condition;

The first relay node determines the at least one second relay node according to the at least one second identification information.

It should be understood that, unlike the parent node of the second relay node described above, the root access point can learn the communication situation between all relay nodes in the wireless network. It is therefore possible to determine a plurality of second relay nodes that satisfy the D2D connection condition with the first relay node. Therefore, the D2D connection suggestion frame sent by the root access point to the first relay node may carry the identifier information of the plurality of second relay nodes that satisfy the D2D connection condition.

Optionally, as an embodiment, the first relay node may further receive the D2D connection suggestion frame sent by the parent node of the first relay node, and determine, according to the at least one second identifier information carried in the D2D connection suggestion frame. The at least one second relay node.

If one or more relay nodes exist between the first relay node and the root access point, the parent node of the first relay node may also learn multiple seconds that have frequent frame exchange with the first relay node. The relay node, therefore, the parent node of the first relay node may also send a D2D connection suggestion frame to the first relay node. Moreover, the D2D connection suggestion frame may carry identifier information of multiple second relay nodes that have frequent frame exchange with the first relay node.

It can be understood that in a relay topology, the upper layer node directly associated with a node is called the parent node of the node. Taking the topology shown in FIG. 1 as an example, the relay node 1 is the parent node of STA2 and STA3, and the relay node 2 is the parent node of the relay node 3 and STA4.

Specifically, in the embodiment of the present application, the root access point and each relay node may determine, according to preset D2D connection conditions, which nodes in the wireless network are suitable for establishing a D2D connection, and determine that the nodes satisfy D2D. When the condition is connected, a D2D connection suggestion frame is sent to at least two nodes that satisfy the condition to indicate that the at least two nodes establish a D2D connection. Among them, the D2D connection condition can be preset. For example, there is frequent frame exchange between two relay nodes. For another example, the distance between two relay nodes of communication is relatively close, or other conditions, and the like. The parent node of the root access point or a certain relay node learns the process of frequent frame exchange or distance between the two relay nodes, which can be implemented by the prior art, and will not be described in detail herein.

Figure 4 shows one possible form of a D2D connection suggestion frame. As shown in FIG. 4, the D2D connection suggestion frame includes at least two pieces of identification information, and the at least two pieces of identification information are in one-to-one correspondence with at least two relay nodes, and each of the identification information is used to uniquely identify the corresponding relay node.

Optionally, the identifier information may be an Association ID (AID), a Media Access Control (MAC) address, or the like.

Optionally, the D2D connection suggestion frame may also carry a Basic Service Set Identifier (BSSID) of the AP, suggesting the reason for establishing the D2D connection, and the beneficial effects of the recommended D2D connection.

Further, the D2D connection suggestion frame may further carry information indicating an initiator that establishes a D2D connection to indicate which relay node is the initiator of the D2D connection establishment. Alternatively, the information indicating the originator of the D2D connection may not be carried, and the location of the information is implicitly indicated in the order of the information. For example, the relay node corresponding to the first identification information in the D2D connection suggestion frame is defaulted to the initiator of the D2D connection establishment.

It should be noted that, in FIG. 4, only two identification information carried in the D2D connection suggestion frame is taken as an example for description. The D2D connection suggestion frame may carry more identification information to indicate that a D2D connection is established between the initiator of the D2D connection and the multiple relay nodes.

Through the above two methods, the first relay node finds a relay node in the surrounding neighbor nodes that is consistent with establishing a D2D connection. Next, the first relay node can establish a D2D connection with the relay nodes (ie, the second relay node) that meet the D2D connection conditions.

In the embodiment of the present application, the establishment of the D2D connection may be performed by using the prior art. The main process of establishing the D2D connection includes the following steps: the first relay node is sent as the initiator of the D2D connection to the destination second relay node. The D2D connection establishes a request frame. After receiving the D2D connection establishment request frame, the second relay node sends a D2D connection suggestion response frame to the first relay node. Finally, the first relay node sends a D2D connection establishment confirmation frame to the destination second relay node. The foregoing steps are the processes of the Tunneled Direct Link Setup (TDLS) in the prior art, and are not described in detail herein.

After the first relay node establishes a D2D connection with the at least one second relay node, the site information of each second relay node may be acquired.

Optionally, the first relay node acquires site information of the at least one second relay node, including:

The first relay node sends a site information request frame to the at least one second relay node, where the site information request frame is used to request to acquire a site corresponding to each second relay node;

The first relay node receives the site information sent by the at least one second relay node.

Specifically, the first relay node may acquire the site information of the second relay node by sending the site information request frame to the second relay node. After receiving the site information request frame, the second relay node sends its own site information to the first relay node.

It should be noted that, in the embodiment of the present application, the site information of one relay node is used to indicate one or more sites that receive or transmit data through the relay node. In the embodiment of the present application, the specific form of the site information is not particularly limited. For example, the relay node can store its own site information in the form of a routing table. Alternatively, other forms that are readily apparent to those skilled in the art may also be employed.

For the sake of easy understanding and explanation, the following describes the site information by taking the topology shown in FIG. 5 as an example.

FIG. 5 illustrates a schematic scenario of a method of transmitting data in accordance with an embodiment of the present application. As shown in FIG. 5, the relay node 1 is associated with STA1. And, through the relay node 3, the relay node 1 can also be connected to STA2 and STA3. Therefore, the site information of the relay node 1 can be as shown in Table 1.

Table 1

It should be noted that, in Table 1, in addition to the plurality of sites corresponding to the relay node 1, the depth information of each site is also recorded. It can be understood that the depth information of each station refers to the number of hops required to connect from the relay node 1 to each STA.

Similarly, the station information of the relay node 2 and the relay node 3 can be as shown in Tables 2 and 3 below, respectively.

Table 2

table 3

If the relay node 1 establishes a D2D connection with the relay node 2 (as indicated by a broken line in FIG. 5), as described above, the relay node 1 transmits a site information request frame to the relay node 2, requesting acquisition of the relay node 2 Site information. After receiving the site information of the relay node 2, the relay node 1 can establish a mapping relationship between the relay node 2 and the relay node 3 and a plurality of sites.

Optionally, as an embodiment, a routing table is stored on the first relay node, where the routing table is used to store the mapping relationship.

Taking the topology shown in FIG. 5 as an example, after the relay node 1 acquires the relay node 2, the routing table established is shown in Table 4.

Table 4

It can be understood that, after the relay node 1 establishes and stores the mapping relationship between multiple relay nodes and multiple sites, when the data packet is received, the mapping relationship can be queried. If the destination station is recorded in the mapping relationship, the relay node 1 may send the data packet to the relay node corresponding to the destination station recorded in the mapping relationship, and the relay node sends the data packet to the destination station. Compared to the prior art, the relay node does not need to send it to its associated parent node, and eventually sends the data packet to the root access point. The root access point then sends the packet to the destination site. Thereby, the burden on the root access point to forward data can be alleviated.

It should be noted that the depth information of each site carried in the site information may be used for path selection when the first relay node forwards the data packet.

For example, a D2D connection is established between the relay node 2 and the relay node 3 (shown by a broken line in FIG. 5). Thus, the relay node 2 can connect to STA2 and STA3 through the relay node 3. In this case, the station information transmitted by the relay node 2 to the relay node 1 can be as shown in Table 5.

table 5

On the other hand, the mapping relationship established by the relay node 1 is as shown in Table 6.

Table 6

After the mapping relationship shown in Table 6 is established, if the relay node 1 receives a data packet, the destination station indicated by the indication information carried by the data packet is STA 2. The relay node 1 can forward the data packet to the STA 2 by querying the routing table. That is, the relay node 2 (Relay 2) and the relay node 3 (Relay 3) are respectively passed. At this time, the relay node 1 can select to transmit the data packet to the relay node 3, and the relay node 3 forwards the data packet to the STA2. This way, the packet is transmitted with fewer hops. Can improve the efficiency of transmission.

In addition, the relay node 1 stores multiple paths of the same destination node, and when one of the paths fails, another path is selected for data transmission, thereby improving the reliability of data transmission.

Therefore, in the method for transmitting data in the embodiment of the present application, the first relay node establishes a D2D connection with the second relay node by determining the second relay node, and stores a mapping relationship between the second relay node and the site, thereby being capable of When a packet is received, the destination site is queried in the query mapping relationship. If the destination station exists in the mapping relationship, the first relay node directly sends the data packet to the destination second relay node corresponding to the destination station, so that the destination second relay node sends the data packet to the destination station. On the one hand, the burden on the root access point is alleviated. On the other hand, the number of hops transmitted is also reduced, and the transmission efficiency is improved.

Optionally, after the first relay node determines the at least one second relay node, the method further includes:

The first relay node sends the site information of the first relay node to the at least one second relay node, where the site information of the first relay node is used to indicate one or more sites corresponding to the first relay node. So that the at least one second relay node forwards the data packet to the first relay node according to the site information of the first relay node.

In the embodiment of the present application, the first relay node may further send its own site information to at least one second relay node that establishes a D2D connection with the first relay node. It can be understood that, after any one of the second relay nodes receives and stores the site information of the first relay node, the site associated with the first relay node and the first medium can be known. A station to which the node can connect, so that when the data packet is received, if it is determined that the destination station indicated by the indication information carried by the data packet exists in the site information of the first relay node, the data packet may be directly sent to the The first relay node is sent by the first relay node to the destination station to alleviate the burden of the root access point.

Specifically, the first relay node sends its own site information to the at least one second relay node, which may be in the form of a broadcast or a unicast form. Taking FIG. 4 as an example, if it is in the form of broadcast, the relay node 1 can broadcast the information recorded in Table 1. After receiving the broadcast information of the relay node 1, the relay node 2 and the relay node 3 can know that the relay information is available. Node 1 can be connected to STA 1, STA 2 and STA 3. If it is in the form of unicast, the relay node 1 can also transmit the information recorded in Table 1 to a specific second relay node, for example, only to the relay node 2 or the relay node 3. The relay node 1 acquires the site information of the relay node 2 and the relay node 3, and broadcasts its own site information to the relay node 2 and the relay node 3, so that the relay nodes establishing the D2D connection are mutually saved. The site information of the other party is such that, when the data packet is received, the data packet can be sent to the relay node corresponding to the destination site based on the site information.

120. The first relay node receives a data packet, where the data packet carries indication information, where the indication information is used to indicate a destination site to which the data packet needs to be transmitted.

In the embodiment of the present application, the indication information carried by the data packet may include multiple forms. For example, it may be a device identifier of the destination site, a Media Access Control (MAC) address of the destination site, and the like. It can be understood that as long as the indication information can uniquely indicate a site. Therefore, the specific form of the indication information is not specifically limited in the embodiment of the present application.

130. The first relay node determines that the destination station exists in the mapping relationship, and sends the data packet to the destination second relay node corresponding to the destination station.

According to the above step 110, a D2D connection is established between the first relay node and the at least one second relay node, and the site information of the at least one second relay node is acquired, and a mapping relationship is established. Therefore, when the data packet is received, the mapping relationship is searched. When it is determined that the destination station exists in the mapping relationship, the data packet is sent to the destination second relay node corresponding to the destination station.

Optionally, the method further includes:

When the first relay node determines that the destination station does not exist in the mapping relationship, the first relay node sends the data packet to the root access point, so that the root access point sends the data packet to the destination site. .

It should be understood that if there is no destination site in the mapping relationship, the first relay node needs to send the received data packet to the root access point in order to send the data packet to the destination site according to the root access point.

It should be noted that, the first relay node in the embodiment of the present application sends the data packet to the root access point, and may include that the first relay node is associated with the root access point, or the first relay node passes The multi-level relay node sends the packet to the root access point. Similarly, the root access point sends the data packet to the destination site, and may also include the destination site associated with the root access point, and the root access point directly sends the data packet to the destination site. Alternatively, the root node sends the packet to the destination site through the multi-level relay node. Specifically, the process in which the root access point sends the data packet to the destination site is the same as the prior art, and is not described herein.

Optionally, after the first relay node acquires the mapping relationship between the at least one second relay node and the at least one site, the method further includes:

The first relay node receives the first prompt information or the second prompt information sent by the second relay node of the destination, where the first prompt information is sent to the first middle when the site corresponding to the second relay node of the destination is increased. Following the node, the first prompt information carries the indication information of the newly added station, and the second prompt information is the second relay node pair of the destination. The second prompt information is sent to the first relay node when the site is reduced, and the second prompt information carries the indication information of the reduced site;

The first relay node newly creates, according to the first prompt information, information about the newly added site of the destination second relay node in the mapping relationship, or

The first relay node deletes, according to the second prompt information, information about the site corresponding to the destination second relay node recorded in the mapping relationship.

Specifically, the first relay node acquires the site information of the second relay node, and after the mapping relationship is established, if the site information of the second relay node changes, the second relay node needs to go to the first relay node. Sending a prompt message to instruct the first relay node to update the mapping relationship.

For example, if a new site is associated with a second relay node, or a relay node associated with the second relay node is associated with a new site. Alternatively, when the site associated with the second relay node or the site to which the second relay node is connected leaves the network, the second relay node sends the prompt information to the first relay node. In order to facilitate the distinguishing, in the embodiment of the present application, the prompt information of the newly added site in the network is recorded as the first prompt information, and the information that the site leaves the network is recorded as the second prompt information. The indication information of the newly added station may be carried in the first prompt information, for example, the MAC address or AID of the newly added station may be carried. In this way, after receiving the first prompt information, the first relay node updates the information of the site corresponding to the second relay node recorded in the mapping relationship. For example, according to the first prompt information, the first relay node adds information of the newly added station corresponding to the second relay node in the mapping relationship. Similarly, the indication information of the station leaving the network may be carried in the second prompt information. In this way, after receiving the second prompt information, the first relay node deletes, according to the second prompt information, the information of the second relay node recorded in the mapping relationship corresponding to the station that should leave the network.

Optionally, the second relay node sends the first prompt information or the second prompt information to the first relay node, and may send the wireless frame to the first relay node, where the wireless frame carries the first prompt information or the second Prompt message. After receiving the radio frame, the first relay node updates the mapping relationship. Specifically, if the mapping relationship is in the form of a routing table, the first relay node updates the routing table.

Optionally, after the first relay node sends the data packet to the destination second relay node, the method further includes:

The first relay node receives an error report sent by the destination second relay node, where the error report carries indication information of the destination station, where the error report is used to indicate that the destination corresponding to the second relay node does not exist in the site The destination site;

The first relay node updates the mapping relationship according to the error report, and deletes information about the destination site of the destination second relay node recorded in the mapping relationship.

It should be understood that if the first relay node establishes the mapping relationship, the site information of the destination second relay node is changed, and before the destination second relay node sends the prompt information to the first relay node, if the first After the node receives a data packet, the relay node corresponding to the destination station indicated by the indication information carried by the data packet is the destination second relay node. The first relay node sends the data packet to the destination second relay node. Since the site information of the destination second relay node has changed, for example, the destination site has left the network, the destination site is not present in the site information stored by the second relay node. At this point, the second relay node considers this to be an abnormal reception. The second relay node sends the data packet to the root access point.

Moreover, when the abnormal reception occurs, the destination second relay node sends an error report to the first relay node to indicate that the first relay node cannot forward the data packet to the destination station through the destination second relay node.

Optionally, the destination second relay node may broadcast the error report to the neighbor node in order to receive the error. The reported neighbor node updates the mapping relationship between the saved destination second relay node and the destination site.

According to the method for transmitting data according to the embodiment of the present application, the first relay node obtains a mapping relationship between the at least one second relay node and the at least one site, so that when the data packet to be forwarded is received, if it is determined that the mapping relationship exists The destination station to which the data packet needs to be forwarded, and the first relay node sends the data packet to the destination second relay node corresponding to the destination station according to the mapping relationship. Therefore, the data packet no longer needs to be forwarded through the root access point, which can reduce the burden on the root access point.

The method of transmitting data according to an embodiment of the present application is described in detail above with reference to FIGS. 2 through 5. Hereinafter, a relay node according to an embodiment of the present application will be described with reference to FIGS. 6 and 7.

FIG. 6 shows a schematic block diagram of a relay node 300 in accordance with an embodiment of the present application. As shown in FIG. 6, the relay node 300 includes:

The processing unit 310 is configured to acquire a mapping relationship between the at least one second relay node and the at least one site, where the mapping relationship is used to record at least one site corresponding to each second relay node;

The receiving unit 320 is configured to receive a data packet, where the data packet carries indication information, where the indication information is used to indicate a destination site to which the data packet needs to be transmitted;

The processing unit 310 is further configured to determine whether the destination station exists in the mapping relationship;

The sending unit 330 is configured to: when the processing unit 310 determines that the destination station exists in the mapping relationship, send the data packet to a destination second relay node corresponding to the destination station, so as to facilitate the destination second relay node. Send the packet to the destination site.

The respective units in the relay node 300 and the other operations or functions described above according to the embodiments of the present application are respectively configured to implement the corresponding processes performed by the first relay node in the embodiments of the present application. For the sake of brevity, it will not be repeated here.

According to the method for transmitting data according to the embodiment of the present application, the first relay node obtains a mapping relationship between the at least one second relay node and the at least one site, so that when the data packet to be forwarded is received, if it is determined that the mapping relationship exists The data packet needs to be forwarded to the destination station, and the first relay node sends the data packet to the destination second relay node corresponding to the destination station according to the mapping relationship, so that the destination second relay node sends the data packet to the destination station. Therefore, the data packet no longer needs to be forwarded through the root access point, which can reduce the burden on the root access point.

FIG. 7 shows a schematic block diagram of a relay node 400 in accordance with another embodiment of the present application. As shown in FIG. 7, the relay node 400 includes:

The receiving unit 410 is configured to receive a data packet sent by the first relay node, where the data packet carries indication information, where the indication information is used to indicate a destination station to which the data packet needs to be transmitted, where the data packet is the first relay node Transmitting to the relay node according to the obtained mapping relationship between the at least one second relay node and the at least one site, where the mapping relationship is used to record at least one site corresponding to each second relay node, where the relay node Is one of the at least one second relay node;

The processing unit 420 is configured to determine whether a destination station exists in the site corresponding to the relay node;

The sending unit 430 is configured to send the data packet to the destination site when the processing unit 420 determines that the destination site exists in the corresponding site.

The respective units in the relay node 400 according to the embodiment of the present application and the other operations or functions described above are respectively implemented in order to implement the corresponding processes performed by the destination second relay node in the embodiments of the present application. For the sake of brevity, it will not be repeated here.

According to the method for transmitting data according to the embodiment of the present application, the first relay node obtains a mapping relationship between the at least one second relay node and the at least one site, so that when the data packet to be forwarded is received, if it is determined that the mapping relationship exists The destination station to which the data packet needs to be forwarded, and the first relay node sends the data packet to the destination according to the mapping relationship. The site corresponds to the destination second relay node, so that the destination second relay node sends the data packet to the destination site. Therefore, the data packet no longer needs to be forwarded through the root access point, which can reduce the burden on the root access point.

The method for transmitting data according to the embodiment of the present application is described in detail above with reference to FIG. 2 to FIG. 5. Hereinafter, a relay node according to an embodiment of the present application will be described with reference to FIG. 8 and FIG.

FIG. 8 shows a schematic structural diagram of a relay node 500 according to an embodiment of the present application. As shown in FIG. 8, the relay node 500 includes a receiver 510, a transmitter 520, a processor 530, and a memory 540. The memory 540 is configured to store instructions, and the processor 530 is configured to execute instructions stored in the memory 540 to control the receiver 510 to receive signals and control the transmitter 520 to send signals.

The processor 530 is configured to acquire a mapping relationship between the at least one second relay node and the at least one site, where the mapping relationship is used to record at least one site corresponding to each second relay node;

The receiver 510 is configured to receive a data packet, where the data packet carries indication information, where the indication information is used to indicate a destination site to which the data packet needs to be transmitted;

The processor 530 is further configured to determine whether the destination station exists in the mapping relationship;

The transmitter 520 is configured to: when the processor 530 determines that the destination station exists in the mapping relationship, send the data packet to a destination second relay node corresponding to the destination station, to facilitate the destination second relay node. Send the packet to the destination site.

It should be understood that, in the embodiment of the present application, the processor 530 may be a central processing unit (CPU), and the processor 530 may also be another general-purpose processor, a digital signal processor (DSP). , Application-Specific Integrated Circuit (ASIC), Field Programmable Gate Array (FPGA) or other programmable logic device, discrete gate or transistor logic device, discrete hardware component, etc. The general purpose processor may be a microprocessor or the processor or any conventional processor or the like.

The memory 540 can include read only memory and random access memory and provides instructions and data to the processor 530. A portion of the memory 540 may also include a non-volatile random access memory. For example, the memory 540 can also store information of the device type.

Alternatively, memory 540 may be separate or may be integrated with processor 530. When the processor 530 is implemented by hardware, for example, it may be a logic circuit or an integrated circuit, and is connected to other hardware through an interface, and the memory 540 may not be needed at this time.

In the implementation process, each step of the foregoing method may be completed by an integrated logic circuit of hardware in the processor 530 or an instruction in a form of software. The steps of the method for transmitting information disclosed in the embodiments of the present application may be directly implemented by the hardware processor, or may be performed by a combination of hardware and software modules in the processor. The software module can be located in a conventional storage medium such as random access memory, flash memory, read only memory, programmable read only memory or electrically erasable programmable memory, registers, and the like. The storage medium is located in the memory 540, and the processor 530 reads the information in the memory 540 and performs the steps of the above method in combination with its hardware. To avoid repetition, it will not be described in detail here.

The units in the relay node 500 and the other operations or functions described above according to embodiments of the present application are respectively configured to perform respective processes performed by the first relay node in the respective embodiments. For the sake of brevity, it will not be repeated here.

FIG. 9 shows a schematic structural diagram of a relay node 600 according to another embodiment of the present application. As shown in FIG. 9, the relay node 600 includes a receiver 610, a transmitter 620, a processor 630, and a memory 640. The memory 640 is configured to store instructions, and the processor 630 is configured to execute instructions stored in the memory 640 to control the receiver 610 to receive signals and control the transmitter 620 to send signals.

The receiver 610 is configured to receive a data packet sent by the first relay node, where the data packet carries indication information, where the indication information is used to indicate a destination station to which the data packet needs to be transmitted, where the data packet is the first relay node. Transmitting to the relay node according to the obtained mapping relationship between the at least one second relay node and the at least one site, where the mapping relationship is used to record at least one site corresponding to each second relay node, where the relay node Is one of the at least one second relay node;

The processor 630 is configured to determine whether the destination station exists in the site corresponding to the relay node;

The transmitter 620 is configured to send the data packet to the destination site when the processor 630 determines that the destination site exists in the site corresponding to the relay node.

The respective units in the relay node 600 and the other operations or functions described above according to the embodiments of the present application are respectively configured to implement the corresponding processes performed by the destination second relay node in the embodiments of the present application. For the sake of brevity, it will not be repeated here.

Alternatively, the memory 640 can be separate or integrated with the processor 630. When the processor 630 is implemented by hardware, for example, it may be a logic circuit or an integrated circuit, and is connected to other hardware through an interface, and the memory 640 may not be needed at this time.

It should be understood that, in the various embodiments of the present application, the size of the sequence numbers of the foregoing processes does not mean the order of execution sequence, and the order of execution of each process should be determined by its function and internal logic, and should not be applied to the embodiment of the present application. The implementation process constitutes any limitation.

Those of ordinary skill in the art will appreciate that the elements and algorithm steps of the various examples described in connection with the embodiments disclosed herein can be implemented in electronic hardware or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the solution. A person skilled in the art can use different methods to implement the described functions for each particular application, but such implementation should not be considered to be beyond the scope of the present application.

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

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

The unit described as a separate component may or may not be physically separated as a unit display The components may or may not be physical units, ie may be located in one place, or may be distributed over multiple network elements. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of the embodiment.

In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

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

The foregoing is only a specific embodiment of the present application, but the scope of protection of the present application is not limited thereto, and any person skilled in the art can easily think of changes or substitutions within the technical scope disclosed in the present application. It should be covered by the scope of protection of this application. Therefore, the scope of protection of the present application should be determined by the scope of the claims.

Claims

A method for transmitting data, characterized by being applied to a wireless network including a root access point and at least two relay nodes, the method comprising:

The first relay node of the at least two relay nodes acquires a mapping relationship between the at least one second relay node and the at least one site, where the mapping relationship is used to record at least one site corresponding to each second relay node. ;

Receiving, by the first relay node, a data packet, where the data packet carries indication information, where the indication information is used to indicate a destination site to which the data packet needs to be transmitted;

When the first relay node determines that the destination station exists in the mapping relationship, the data packet is sent to a destination second relay node corresponding to the destination station, so as to facilitate the destination second relay. The node sends the data packet to the destination site.
The method according to claim 1, wherein the first relay node acquires a mapping relationship between the at least one second relay node and the at least one site, including:

Determining, by the first relay node, the at least one second relay node;

Establishing a device-to-device D2D connection between the first relay node and the at least one second relay node;

The first relay node acquires at least one site information of the at least one second relay node, where the at least one site information is in one-to-one correspondence with the at least one second relay node, and each site information is used to indicate One or more sites, each of which transmits or receives data through a corresponding second relay node;

And the first relay node establishes a mapping relationship between the at least one second relay node and the at least one site according to the at least one site information.
The method according to claim 2, wherein the determining, by the first relay node, the at least one second relay node comprises:

The first relay node sends a discovery request frame, where the discovery request frame carries response condition information, where the response condition information is used to indicate a condition that the device responding to the discovery request frame needs to meet;

The first relay node receives at least one response frame that is sent when the at least one second relay node determines that the response condition is met;

The first relay node determines the at least one second relay node according to the at least one response frame.
The method according to claim 3, wherein the response condition further comprises at least one of the following conditions: the device is a relay device, the device supports a D2D connection, the device has a routing function, The link rate between the device and the first relay node is equal to or higher than a preset rate threshold, and the transmission delay between the device and the first relay node is equal to or lower than a preset delay. Threshold.
The method according to claim 2, wherein the determining, by the first relay node, the at least one second relay node comprises:

The first relay node receives at least one D2D connection suggestion frame, and the at least one D2D connection suggestion frame is in one-to-one correspondence with the at least one second relay node, and each D2D connection suggestion frame carries First identification information of the first relay node and second identification information for identifying the corresponding second relay node, each D2D connection suggestion frame is a parent node of the corresponding second relay node, Transmitting to the first relay node when the second relay node and the first relay node satisfy the D2D connection condition;

The first relay node determines the at least one second relay node according to the second identifier information carried in the at least one D2D connection suggestion frame.
A method of transmitting data, characterized by being applied to a root access point and at least two relay nodes In a wireless network, the method includes:

And the destination second relay node of the at least two relay nodes receives the data packet sent by the first relay node, where the data packet carries indication information, where the indication information is used to indicate that the data packet needs to be transmitted to a destination station, where the data packet is sent by the first relay node to the destination second relay node according to the obtained mapping relationship between the at least one second relay node and the at least one site, where the mapping relationship is used. Recording at least one site corresponding to each second relay node, wherein the destination second relay node is one of the at least one second relay node;

The destination second relay node determines that the data packet is sent to the destination site when the destination site exists in the corresponding site.
The method of claim 6 wherein the method further comprises:

The destination second relay node receives the discovery request frame sent by the first relay node, where the discovery request frame carries response condition information, where the response condition information is used to indicate that the device responding to the discovery request frame needs Condition of satisfaction;

And determining, by the second relay node, that the response condition is met, sending a response frame to the first relay node, so that the first relay node discovers the destination second relay node, and The second relay node is described to establish a device-to-device D2D connection.
The method according to claim 7, wherein the response condition comprises at least one of the following conditions: the device is a relay device, the device supports a D2D connection, the device has a routing function, the The link rate between the device and the first relay node is equal to or higher than a preset rate threshold, and the transmission delay between the device and the first relay node is equal to or lower than a preset delay threshold. .
The method according to any one of claims 6 to 8, wherein the method further comprises:

The destination second relay node receives the D2D connection suggestion frame sent by the parent node of the destination second relay node, where the D2D connection suggestion frame carries the first identifier information used to identify the first relay node. And second identifier information for identifying the second relay node of the destination, the D2D connection suggestion frame is a parent node of the destination second relay node, determining the first relay node and the destination Transmitting to the destination second relay node and the first relay node when the two relay nodes satisfy the D2D connection condition;

The destination second relay node receives the D2D connection request frame sent by the first relay node based on the D2D connection suggestion frame, and establishes a D2D connection with the first relay node.
A relay node, characterized in that the relay node comprises:

a processing unit, configured to acquire a mapping relationship between the at least one second relay node and the at least one site, where the mapping relationship is used to record at least one site corresponding to each second relay node;

a receiving unit, configured to receive a data packet, where the data packet carries indication information, where the indication information is used to indicate a destination site to which the data packet needs to be transmitted;

And the processing unit is further configured to determine whether the destination station exists in the mapping relationship;

a sending unit, configured to: when the processing unit determines that the destination station exists in the mapping relationship, send the data packet to a destination second relay node corresponding to the destination site, to facilitate the destination The two relay nodes send the data packet to the destination site.
The relay node according to claim 10, wherein the processing unit is specifically configured to:

Determining the at least one second relay node, and establishing a device-to-device D2D connection with the at least one second relay node;

Obtaining at least one site information of the at least one second relay node, the at least one site information and location The at least one second relay node is in one-to-one correspondence, each site information is used to indicate one or more sites, and each site sends or receives data through a corresponding second relay node;

And establishing, according to the at least one site information, a mapping relationship between the at least one second relay node and the at least one site.
The relay node according to claim 11, wherein the sending unit is specifically configured to send a discovery request frame, where the discovery request frame carries response condition information, where the response condition information is used to indicate response to the discovery The condition that the device requesting the frame needs to meet;

And the receiving unit is specifically configured to receive, by the at least one second relay node, at least one response frame that is sent when the response condition is met;

And the processing unit is specifically configured to determine the at least one second relay node according to the at least one response frame.
The relay node according to claim 12, wherein the response condition further comprises at least one of the following conditions: the device is a relay node, the device supports a D2D connection, and the device has a routing function. The link rate between the device and the first relay node is equal to or higher than a preset rate threshold, and the transmission delay between the device and the first relay node is equal to or lower than a preset. Delay threshold.
The relay node according to any one of claims 10 to 13, wherein the receiving unit is further configured to receive at least one D2D connection suggestion frame, the at least one D2D connection suggestion frame and the at least one The second relay node has a one-to-one correspondence, and each D2D connection suggestion frame carries first identification information for identifying the first relay node and second identification information for identifying the corresponding second relay node, Each D2D connection suggestion frame is sent by the parent node of the corresponding second relay node to the relay node when determining that the D2D connection condition is satisfied between the second relay node and the first relay node. ;

And the processing unit is configured to determine the at least one second relay node according to the second identifier information carried in the at least one D2D connection suggestion frame.
A relay node, characterized in that the relay node comprises:

a receiving unit, configured to receive a data packet sent by the first relay node, where the data packet carries indication information, where the indication information is used to indicate a destination station to which the data packet needs to be transmitted, where the data packet is the first a relay node is sent to the relay node according to the obtained mapping relationship between the at least one second relay node and the at least one site, where the mapping relationship is used to record at least one site corresponding to each second relay node, The relay node is one of the at least one second relay node;

a processing unit, configured to determine whether the destination station exists in a site corresponding to the relay node;

And a sending unit, configured to send the data packet to the destination station when the processing unit determines that the destination station exists in a site corresponding to the relay node.
The relay node according to claim 15, wherein the receiving unit is configured to receive a discovery request frame sent by the first relay node, where the discovery request frame carries response condition information, and the response condition information Means for indicating a condition that the device responding to the discovery request frame needs to satisfy;

And the processing unit is specifically configured to determine whether the relay node meets the response condition;

And the sending unit is specifically configured to: when the processing unit determines that the relay node meets the response condition, send a response frame to the first relay node, so that the first relay node and the The relay node establishes a device-to-device D2D connection.
The relay node according to claim 16, wherein said response condition includes the following conditions At least one of: the device is a relay node, the device supports a D2D connection, the device has a routing function, and a link rate between the device and the first relay node is equal to or higher than a preset The rate threshold, the transmission delay between the device and the first relay node is equal to or lower than a preset delay threshold.
The relay node according to any one of claims 15 to 17, wherein the receiving unit is specifically configured to:

Receiving a D2D connection suggestion frame sent by the parent node of the relay node, where the D2D connection suggestion frame carries first identifier information for identifying the first relay node and a number for identifying the relay node Two identification information, the D2D connection suggestion frame is sent to the relay node and the parent node of the relay node when determining that the D2D connection condition is satisfied between the first relay node and the relay node Said first relay node;

Receiving a D2D connection request frame sent by the first relay node based on the D2D connection suggestion frame;

And the processing unit is specifically configured to establish a D2D connection with the first relay node.