Wireless communication device, wireless communication method and wireless communication system

By introducing a collaborative relay mechanism into the wireless grid network, multiple nodes cooperate to send data frames and receive completed frames, the problem of throughput decline caused by low communication quality is solved, and the effect of improving network performance is achieved.

CN115053568BInactive Publication Date: 2024-11-22PANASONIC INTELLECTUAL PROPERTY MANAGEMENT CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202080095762.8
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Priority Date
2020-02-10
Filing Date
2020-11-20
Publication Date
2024-11-22
Estimated Expiration
Not applicable · inactive patent

AI Technical Summary

Technical Problem

The low communication quality links in existing wireless grid networks lead to a decrease in throughput and frequent data retransmission, affecting network performance.

Method used

By introducing a collaborative relay mechanism in the wireless network, multiple nodes cooperate to send data frames and receive completion frames, improving communication quality on the receiving side, reducing data retransmission, and improving throughput.

Benefits of technology

It effectively improves the throughput of wireless grid network, reduces data retransmission, and enhances the stability and performance of the network.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN115053568B_ABST
    Figure CN115053568B_ABST
Patent Text Reader

Abstract

The wireless communication device includes: a receiving circuit, which receives a first frame sent by a first node in a wireless mesh network; and a control circuit, which, when the first frame contains first information indicating a third node that transmits in coordination with a second node, and the third node contained in the first information represents the wireless communication device, sets second information indicating a node that is a relay destination for the third node to send the first frame as follows, that is, sets the second information to a node that is a relay destination for the second node to send the first frame, and the second node is a node that sends a wireless signal to a wireless link in the wireless mesh network whose communication quality is lower than a threshold.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to a wireless communication device, a wireless communication method and a wireless communication system. Background Art

[0002] Various studies have been conducted on a "wireless mesh network", which is a mesh-like wireless network formed by multiple wireless communication devices (or, also called "nodes", "wireless nodes", "wireless machines" or "wireless communication terminals") communicating with each other (for example, refer to Patent Document 1).

[0003] Prior art literature

[0004] Patent Literature

[0005] Patent Document 1: Japanese Patent Application No. 2008-541603 Summary of the invention

[0006] However, there is still room for research on methods to improve throughput in wireless mesh networks.

[0007] Non-limiting embodiments of the present invention help provide a wireless communication device, a wireless communication method, and a wireless communication system that can improve the throughput in a wireless mesh network.

[0008] A wireless communication device according to an embodiment of the present invention includes: a receiving circuit, which receives a first frame sent by a first node in a wireless mesh network; and a control circuit, which, when the first frame includes first information indicating a third node that transmits in coordination with a second node, and the third node contained in the first information represents the wireless communication device, sets second information indicating a node that is a relay destination for the third node to send the first frame as follows, i.e., sets the second information to a node that is a relay destination for the second node to send the first frame, the second node being a node that sends a wireless signal to a wireless link in the wireless mesh network whose communication quality is lower than a threshold.

[0009] It should be noted that these general or specific aspects may be implemented by a system, an apparatus, a method, an integrated circuit, a computer program or a recording medium, or may be implemented by any combination of systems, apparatuses, methods, integrated circuits, computer programs and recording media.

[0010] According to an embodiment of the present invention, the throughput in a wireless mesh network can be improved.

[0011] More advantages and effects of an embodiment of the present invention will be explained through the description and drawings. These advantages and / or effects are provided by several embodiments, and the features described in the description and drawings, but not necessarily all of them need to be provided in order to obtain one or more of the same features. BRIEF DESCRIPTION OF THE DRAWINGS

[0012] Figure 1 This is a diagram showing an example of a wireless network configuration.

[0013] Figure 2 This is a sequence diagram showing an operation example of a wireless network.

[0014] Figure 3 This is a block diagram showing a configuration example of a wireless communication device.

[0015] Figure 4 This is a diagram showing an example of a frame.

[0016] Figure 5 This is a sequence diagram showing an operation example of a wireless network.

[0017] Figure 6 This is a flowchart showing an example of the operation of the wireless communication device.

[0018] Figure 7 This is a flowchart showing an example of the operation of the wireless communication device. DETAILED DESCRIPTION

[0019] Hereinafter, an embodiment of the present invention will be described in detail with reference to the drawings. In addition, the embodiment described below is an example, and the present invention is not limited to the following embodiment.

[0020] Wireless mesh networks have advantages such as being independent of infrastructure, high scalability, high energy efficiency in communication, and high robustness due to redundancy. For example, Patent Document 1 discloses a technique for effectively utilizing the redundancy of a wireless mesh network composed of a plurality of mesh points (e.g., equivalent to nodes) to control the timing of mesh point transmission.

[0021] Figure 1 It is a diagram showing a configuration example of a wireless network. Figure 1 The wireless network 10 shown is, for example, a wireless mesh network including a source node (in other words, a transmission source node), nodes 1 to 6 , and a sink node (in other words, a destination node).

[0022] For example, wireless network 10 may be a system that autonomously communicates based on the content of signals (eg, frames) received by each node. In other words, wireless network 10 may not be a centralized system where specific nodes instruct other nodes to control communications.

[0023] For example, Figure 1 The nodes connected by lines in represent nodes that can communicate (in other words, nodes that are located at a communicable distance). Figure 1 The thickness of the line in represents the communication quality between nodes (eg, signal to noise ratio (SNR)).

[0024] exist Figure 1 For example, the distance between the source node (first node) and nodes 1 to 3 is closer than the distance between node 1 (second node) and node 4, so the source node (first node) and nodes 1 to 3 can communicate in an environment with high communication quality. Figure 1 For example, the distance between the sink node and nodes 4 to 6 is closer than the distance between node 1 and node 4, so the sink node and nodes 4 to 6 can communicate in an environment with high communication quality. Figure 1 In the example, although nodes 1 and 4 are within a communicable distance, the distance between the nodes is far compared to the source node and nodes 1 to 3 (or the sink node and nodes 4 to 6), and the communication quality may be low.

[0025] Here, the higher the communication quality (e.g., SNR), the more stable or faster the communication can be. On the other hand, the lower the communication quality, the higher the bit error rate (BER: Bit Error Rate) of wireless communication, the higher the probability of data loss, and thus, for example, the throughput in a wireless mesh network is reduced.

[0026] For example, Figure 1 In the wireless network 10 shown, the communication quality between node 1 and node 4 is likely to be low compared to the communication between other nodes, and the probability of data loss will increase. In this case, data retransmission is likely to occur in the communication between node 1 and node 4, and the throughput of the wireless network 10 will decrease.

[0027] Hereinafter, an example in which data retransmission occurs in communication between nodes (for example, between node 1 and node 4) will be described.

[0028] [premise]

[0029] For example, assume that in wireless network 10, each node retains the following information.

[0030] (a) Information related to the next relay node (in other words, the next relay destination) for forwarding the data frame to the destination node (e.g., source node or sink node). Figure 1The following states are described in , that is, the source node retains information that node 1 is the next relay destination, node 1 retains information that node 4 is the next relay destination, and node 4 retains information that the sink node is the next relay destination. Figure 1 In the example, the source node may be relayed to the node 1 via other nodes, and the node 4 may be relayed to the sink node via other nodes. For example, each node may refer to a routing table that records at least the next relay destination toward the destination to determine the next relay destination.

[0031] (b) Information about other nodes that can communicate with each node, and the quality of communication between each node and other nodes that can communicate with each node (e.g., RSSI: Received Signal Strength Indicator)

[0032] (c) Information related to the time of synchronization between nodes (in other words, timing, time step or reference time)

[0033] [Packet transmission example]

[0034] Figure 2 Yes means Figure 1 The timing diagram of the transmission example of the wireless signal (or, also called "packet" or "frame") in the wireless network 10 shown in FIG. Figure 2 The horizontal axis shown is an example of an operation at each time step (hereinafter referred to as "t").

[0035] At t1 , for example, the source node transmits a transmission reservation frame (also referred to as a “transmission reservation signal”) for performing data communication destined for the sink node to the node 1 .

[0036] At t2, for example, node 1, and nodes 2 and 3 located around node 1 receive a sending reservation frame from the source node. For example, node 1 determines that the relay node of the signal (here, the sending reservation frame) sent from the source node to the aggregation node is node 1, and thus forwards the sending reservation frame to node 4. In other words, for example, node 2 and node 3 determine that the relay node of the signal (here, the sending reservation frame) sent from the source node to the aggregation node is node 1, and thus do not forward (for example, discard) the sending reservation frame. Afterwards, it may be that when the received signal is not sent to its own node and its own node is not the relay destination, each node does not forward (for example, discard) the received signal.

[0037] At t3, for example, node 4 receives the sending reservation frame from node 1. Then, node 4 may forward the sending reservation frame to the sink node.

[0038] At t4, the sink node, and nodes 1, 5, and 6 that can communicate with node 4 receive the send reservation frame. The sink node may determine (in other words, identify) that the received send reservation frame is sent to the sink node, and thus send a send permission frame (e.g., also called a "send permission signal") with the destination being the source node to node 4.

[0039] At t5, node 4, and nodes 5 and 6 located around node 4 receive the sending permission frame from the sink node. For example, node 4 determines that the relay node of the signal (here, the sending permission frame) sent from the sink node to the source node is node 4, and thus forwards the sending permission frame to node 1.

[0040] At t6, node 1 receives a sending permission frame from node 4. Next, node 1 may forward the sending permission frame to the source node.

[0041] At t7, the source node, and nodes 2, 3, and 4 that can communicate with node 1 receive the transmission permission frame. Alternatively, the source node determines that the received transmission permission frame is sent to the source node, and thus sends a data frame (e.g., also referred to as "data" or "data signal") destined for the sink node to node 1.

[0042] At t8, node 1, and nodes 2 and 3 that can communicate with node 1 receive data frames from the source node. For example, node 1 determines that the relay node of the signal (here, data frame) sent from the source node to the sink node is node 1, and thus forwards the data frame to node 4.

[0043] At t9, for example, the source node, node 2, and node 3 that can communicate with node 1 receive the data frame from node 1. On the other hand, for example, in node 4, the data frame from node 1 is not received (in other words, the data is lost). Here, the possibility that the size of the data frame is larger than the size of other frames such as a transmission reservation frame or a transmission permission frame is high. Therefore, for example, Figure 2 As shown, in the communication between the node 1 and the node 4, which has a lower communication quality than that between other nodes, even if the transmission reservation frame or the transmission permission frame can be transmitted and received, the transmission and reception of the data frame may fail.

[0044] At t15, for example, it may be that since a prescribed value (for example, called "Retransmission Time Out (RTO)") related to the period from sending a data frame (for example, t7) to receiving a reception completion frame (for example, also called a "reception completion signal") for the data frame has passed but the reception completion frame has not been received, the source node sends (in other words, retransmits) a data frame whose destination is the aggregation node to node 1.

[0045] At t16, node 1, and nodes 2 and 3 that can communicate with node 1 receive the data frame. For example, node 1 determines that the relay node of the signal sent from the source node to the sink node is node 1, and thus forwards the data frame to node 4. At t17, for example, similarly to t9, the source node, node 2, and node 3 that can communicate with node 1 receive the data frame. On the other hand, similarly to t9, in node 4, for example, the data frame from node 1 is not received (in other words, the data frame is lost).

[0046] Afterwards, for example, the source node may repeatedly retransmit the data frame according to the RTO. For example, the length of the RTO may be set longer (for example, set to twice) each time the data is retransmitted.

[0047] In this way, Figure 2 In the example, due to the communication failure between the node 1 and the node 4, the data frame is repeatedly retransmitted, which may hinder the communication of other nodes, and thus the throughput of the wireless network 10 may decrease.

[0048] Therefore, in one embodiment of the present invention, an example of a method for improving throughput in the wireless network 10 is described.

[0049] For example, in a wireless network 10 of one embodiment of the present invention, nodes 1 to 3 that can communicate with a source node may perform collaborative relaying (e.g., also referred to as "simultaneous transmission," "collaborative transmission," or "coordinated transmission") of wireless signals (e.g., data frames) sent to a sink node. Similarly, for example, nodes 4 to 6 that can communicate with a sink node may perform collaborative relaying of wireless signals (e.g., reception completion frames) sent to a source node. By utilizing collaborative relaying of multiple nodes, the receiving power (in other words, communication quality) in the node on the receiving side can be improved, and retransmission of wireless signals can be suppressed, thereby improving the throughput of the wireless network 10.

[0050] In addition, a group of nodes that may perform collaborative relaying is referred to as a "Collabo node (or relay group)" below. Figure 1 In the example, the group including node 1, node 2 and node 3 is called "Collabo node 1", and the group including node 4, node 5 and node 6 is called "Collabo node 2". It can be that at least two nodes in each Collabo node cooperate with other Collabo nodes to relay wireless signals. In addition, "Collabo" is the abbreviation of "Collaboration".

[0051] Figure 3 is a block diagram showing a configuration example of a node (e.g., corresponding to a wireless communication device) according to an embodiment of the present invention. Figure 2 The source node, nodes 1 to 6, and sink nodes shown each have, for example Figure 3 The structure of the node 100 is shown.

[0052] Figure 3 The node 100 shown may include, for example, a transceiver unit 111 and a control unit 112 .

[0053] The transceiver unit 111 performs at least one of wireless transmission and wireless reception of a wireless signal (for example, the transmission reservation frame, transmission permission frame, data frame, or reception completion frame) under the control of the control unit 112 .

[0054] For example, the transceiver 111 may receive a wireless signal addressed to the node 100 or a wireless signal addressed to another node. Also, for example, the transceiver 111 may send or forward (in other words, relay) a wireless signal addressed to another node.

[0055] In addition, the wireless communication method in the transceiver unit 111 can be, for example, a method using a wireless local area network (LAN: Local Area Network), Bluetooth (registered trademark), LPWA (Low Power Wide Area network) or a millimeter wave frequency band (for example, WiGig (registered trademark)), or other wireless communication methods.

[0056] The control unit 112 controls, for example, transmission, reception, or transfer of wireless signals.

[0057] For example, the control unit 112 may retain information related to the next relay node that forwards the wireless signal, information related to other nodes that can communicate with the node 100, information about the reception quality (for example, RSSI) between other nodes and the node 100, or information related to the synchronization time as described above.

[0058] The control unit 112 may, for example, control forwarding to the next relay node when a wireless signal is input or when a wireless signal is received from another node. For example, the control unit 112 may determine whether to relay the wireless signal (in other words, cooperative relay) when the node 100 is not a relay node (in other words, a relay) of the wireless signal based on information related to cooperative relay contained in the wireless signal when receiving a wireless signal (for example, a data frame or a reception completion frame) from another node.

[0059] In addition, the control unit 112 may include information related to the collaborative relay in the wireless signal based on the wireless signal received from other nodes (for example, sending a reservation frame or sending a permission frame). The information related to the collaborative relay may include, for example, information related to a relay node that performs relaying in collaboration with other nodes among the relay nodes of the wireless signal (hereinafter referred to as a "bottleneck node (second node)"), or information related to a node that performs transmission (collaborative relay) together with the relay node (hereinafter referred to as a "simultaneous transmission node (third node)").

[0060] [Frame structure example]

[0061] An example of a frame structure (or frame format) in the wireless network 10 described above will be described.

[0062] Figure 4 This is a diagram showing an example of the structure of a frame.

[0063] In the wireless network 10, for example, Figure 4 As shown in the frame, when in data communication from the source node (first node) to the sink node, the source node sends a "send reservation frame" to the sink node, and the source node receives a "receive completion frame" of data from the sink node, each node 100 can, for example, act based on the following four frames.

[0064] <(a) Sending reservation frame>

[0065] The transmission reservation frame is, for example, a frame used when reserving data transmission from a source node to a sink node.

[0066] exist Figure 4 The transmission reservation frame shown may include, for example, a field indicating a frame type (eg, "transmission reservation"), and fields indicating a transmission source node, a destination node, and a next relay node.

[0067] In addition, Figure 4 The transmission reservation frame shown may include, for example, a field indicating a node (e.g., a bottleneck node) among relay nodes between the transmission source node and the destination node that will become unable to communicate. The bottleneck node may be, for example, a relay node whose reception quality (e.g., RSSI) with a communication object (e.g., one of the nodes that can communicate with the node 100) is lower than a threshold. In the field indicating the bottleneck node, for example, the source node side (e.g., Figure 1 The bottleneck node of Collaboration node 1) shown in FIG. 1 and the aggregation node side (eg, Figure 1 The bottleneck node of Collabo node 2) shown.

[0068] In addition, Figure 4The transmission reservation frame shown may include, for example, a field indicating RSSI (in other words, RSSI threshold) as a criterion for determining a bottleneck node. In addition, if the criterion for determining a bottleneck node is a criterion other than RSSI, the criterion may also be recorded in this field (RSSI field).

[0069] For example, receiving Figure 4 The relay node (eg, Figure 1 Node 1), when the RSSI measured when the relay node receives the sending reservation frame is compared with the RSSI recorded in the sending reservation frame and it is determined that the relay node itself is a bottleneck node, information identifying the relay node itself (for example, node ID) can be added to the bottleneck node field of the sending reservation frame, and the sending reservation frame is sent to the next forwarding destination.

[0070] <(b) Sending permission frame>

[0071] The transmission permission frame is a frame used when permitting a reservation for data transmission from a sink node to a source node, for example.

[0072] exist Figure 4 The transmission permission frame shown may include, for example, a field indicating a frame type (eg, "transmission permission"), and fields indicating a destination node and a next relay node.

[0073] In addition, Figure 4 The transmission permission frame shown may include, for example, a field indicating a bottleneck node (e.g., source node side and sink node side). The information related to the bottleneck node contained in the transmission permission frame may be the same as the information related to the bottleneck node contained in the transmission reservation frame received by the sink node.

[0074] In addition, Figure 4 The transmission permission frame shown in the figure may include, for example, a field indicating a node (e.g., a simultaneous transmission node) that performs cooperative relaying of wireless signals with the bottleneck node (hereinafter, for convenience, referred to as "simultaneous transmission"). In the field indicating the simultaneous transmission node, for example, the simultaneous transmission node on the source node side (e.g., Figure 1 Node 2 and Node 3 of Collabo Node 1 shown), and the simultaneous sending nodes on the aggregation node side (for example, Figure 1 Node 5 and Node 6 of Collabo Node 2 shown).

[0075] For example, receiving Figure 4 The relay node (eg, Figure 1In the case where the relay node is a bottleneck node, the node 1 of Collabo node 1 shown in FIG. 1 may add information identifying the transmitting node while performing collaborative relay with the relay node in the transmitting permission frame (for example, Figure 1 The node IDs of node 2 and node 3 of Collabo node 1 shown are received, and a transmission permission frame is sent to the next forwarding destination.

[0076] For example, in Figure 1 When node 4 of Collabo node 2 shown in the figure is a bottleneck node as a relay node, in the sending permission frame, a new Figure 1 The node IDs of nodes 5 and 6 of Collaborative node 2 are shown as information for identifying the nodes that transmit the relay in collaboration with the relay node. Figure 1 When node 1 of Collabo node 1 shown in the figure is a relay node and is a bottleneck node, in the sending permission frame, add Figure 1 The node IDs of node 2 and node 3 of Collabo node 1 are shown as information for identifying the sending node while performing collaborative relay with the relay node.

[0077] <(c) Data frame>

[0078] The data frame is, for example, a frame used when sending data from a source node to a sink node.

[0079] exist Figure 4 The data frame shown may include, for example, a field indicating a frame type (eg, "data"), fields indicating a destination node and a next relay node, and a field indicating a payload (in other words, a data portion).

[0080] In addition, Figure 4 The data frame shown may include, for example, a field indicating simultaneous transmission nodes (e.g., source node side and sink node side). The information related to the simultaneous transmission nodes included in the data frame may be the same as the information related to the simultaneous transmission nodes included in the transmission permission frame received by the source node. In addition, the information on the sink node side may be omitted in the field indicating the simultaneous transmission nodes.

[0081] For example, when the node 100 is a simultaneous transmitting node, even if the node 100 is not a relay node, the received Figure 4 The node 100 of the data frame shown also forwards the data frame. Thus, the data frame is sent simultaneously by the relay node and the simultaneous sending node.

[0082] <(d) Receiving completion frame>

[0083] The reception completion frame is, for example, a frame used by the sink node to notify the source node that data reception has been completed.

[0084] exist Figure 4 The reception completion frame shown may include, for example, a field indicating a frame type (eg, "reception completion"), and fields indicating a destination node and a next relay node.

[0085] In addition, Figure 4 The reception completion frame shown may include, for example, a field indicating a simultaneous transmission node (e.g., a sink node side). The information related to the simultaneous transmission node contained in the reception completion frame may also be the same as the information related to the simultaneous transmission node on the sink node side contained in the data frame received by the sink node. In addition, since the information related to the simultaneous transmission node contained in the data frame may also be directly copied in the reception completion frame, the reception completion frame may also include information on both the source node side and the sink node side.

[0086] For example, when the node 100 is a simultaneous transmitting node, even if the node 100 is not a relay node, the received Figure 4 The node 100 that receives the completion frame also forwards the completion frame. Thus, the completion frame is transmitted simultaneously by the relay node and the simultaneous transmission node.

[0087] In addition, Figure 4 In the frame shown, the simultaneously sending node is referred to as the first information, the destination and the next relay are referred to as the second information, and the bottleneck node is referred to as the third information.

[0088] In addition, Figure 4 In the frame shown in FIG. 1 , the transmission permission frame, data frame, and reception completion frame containing the nodes transmitting at the same time are called the first frame. Figure 4 In the frame shown, the transmission permission frame including the bottleneck node and the simultaneous transmission node is called the second frame. Figure 4 Among the frames shown, the data frame including the simultaneous sending node and the reception completion frame is referred to as the third frame.

[0089] The above describes an example of a frame structure. Figure 4 The frame structure shown is an example, and the structure of each frame is not limited to Figure 4 Example shown.

[0090] Next, an operation example of the wireless network 10 will be described.

[0091] Figure 5 is a wireless network 10 (eg, Figure 1 ) is a timing diagram of an operation example. Figure 5 The horizontal axis shown is an example of an operation at each time step (hereinafter referred to as "t").

[0092] For example, at t1, the source node sends a transmission reservation frame to node 1 for data communication with the destination being the sink node. The transmission reservation frame may include, for example, information indicating the RSSI (in other words, the threshold) for determining the bottleneck node, the transmission source node (for example, the ID of the source node), the destination node (for example, the ID of the sink node), and the next relay node (for example, the ID of node 1). In addition, at t1, the transmission reservation frame sent from the source node may not include information related to the bottleneck node. However, if the bottleneck node is known when the source node sends the transmission reservation frame, the source node may include the bottleneck node in the transmission reservation frame for transmission.

[0093] At t2, for example, node 1, and nodes 2 and 3 located around node 1 receive a transmission reservation frame from the source node. For example, node 1 determines that the relay node of the signal sent from the source node to the sink node is node 1, and thus forwards the transmission reservation frame to node 4. For example, at t2, information indicating the next relay node (for example, the ID of node 4) may be added to the transmission reservation frame sent from relay node 1.

[0094] At t3, for example, node 4 receives a sending reservation frame from node 1. At this time, for example, in node 4, the reception quality (for example, RSSI) of the signal received from node 1 is lower than a threshold. In this case, it may be that node 4 adds (in other words, supplements or sets) node 1 as a bottleneck node on the source node side in the sending reservation frame, and adds node 4 as a bottleneck node on the aggregation node side. Then, node 4 may forward the sending reservation frame to the aggregation node. In other words, it may be that node 4 sends information indicating a bottleneck node to the receiving destination node of the sending reservation frame, and the bottleneck node is a node that sends a wireless signal to a wireless link (hereinafter, also referred to as a "bottleneck link") whose communication quality is lower than a threshold.

[0095] At t4, the sink node, and nodes 1, 5, and 6 that can communicate with node 4 receive the send reservation frame. It may be that the sink node determines that the received send reservation frame is sent to the sink node. Then, for example, the sink node copies the bottleneck node (for example, source node side: node 1, sink node side: node 4) contained in the send reservation frame to the send permission frame. In addition, the sink node may set the destination node as the source node and the next relay node as node 4 in the send permission frame. Next, it may be that the sink node sends a send permission frame to node 4.

[0096] At t5, node 4, and nodes 5 and 6 located around node 4 receive the transmission permission frame from the sink node. For example, node 4 determines that the relay node of the signal sent from the sink node to the source node is node 4.

[0097] In addition, for example, when the information related to the bottleneck node is included in the transmission permission frame and the information related to the bottleneck node indicates node 4, node 4 determines that node 4 is the bottleneck node on the aggregation node side. Therefore, node 4 sets a simultaneous transmission node on the aggregation node side (in other words, a node that transmits together with node 4). For example, node 4 can determine a node whose reception quality (for example, RSSI) with node 4 is above a threshold as a simultaneous transmission node. Figure 5 In the example shown, it is possible that node 4 determines node 5 and node 6 as simultaneous transmitting nodes.

[0098] For example, the node 4 may add (in other words, append or set) the node 5 and the node 6 as simultaneous transmission nodes on the sink node side in the transmission permission frame. In addition, the node 4 may set the next relay node to be the node 1, for example.

[0099] Then, node 4 may forward the sending permission frame to node 1.

[0100] At t6 , node 1 receives a transmission permission frame from node 4 .

[0101] In addition, for example, when the information related to the bottleneck node is included in the transmission permission frame and the information related to the bottleneck node indicates node 1, node 1 determines that node 1 is the bottleneck node on the source node side. Thus, for example, node 1 determines the simultaneous transmission node on the source node side (in other words, the node that transmits together with node 1). For example, node 1 can determine a node whose reception quality (for example, RSSI) with node 1 is above a threshold as a simultaneous transmission node. Figure 5 In the example shown, it is possible that node 1 determines node 2 and node 3 as simultaneous transmitting nodes.

[0102] For example, node 1 may add node 2 and node 3 as simultaneous sending nodes on the source node side in a sending permission frame.

[0103] Next, node 1 forwards the sending permission frame to the source node.

[0104] At t7, the source node, and nodes 2, 3, and 4 that can communicate with node 1 receive the transmission permission frame. The source node determines that the received transmission permission frame is sent to the source node.

[0105] At t7, the source node may copy the simultaneous transmission nodes (e.g., source node side: nodes 2 and 3, sink node side: nodes 5 and 6) contained in the transmission permission frame into the data frame. In addition, the source node sets the destination node as the sink node and the next relay node as node 1 in the data frame. Then, the sink node sends the data frame to node 1.

[0106] Thus, in the process of sending a transmission reservation frame from the source node to the sink node, a bottleneck node in the transmission path between the source node and the sink node is determined. In addition, by sending a transmission permission frame from the sink node to the source node, a simultaneous transmission node in the bottleneck node is determined.

[0107] In this way, the source node, for example, generates a data frame that contains information related to the simultaneously sending nodes in addition to information representing the node sending the data frame to the bottleneck link (for example, information representing the relay node), and sends the generated data frame to the node within Collabo node 1.

[0108] At t8, the node 1, and the nodes 2 and 3 that can communicate with the node 1 receive the data frame from the source node.

[0109] Node 1, for example, determines that the relay node of the signal sent from the source node to the sink node is node 1. Then, node 1 sets the next relay node to node 4, for example, and forwards the data frame to node 4.

[0110] In addition, node 2 and node 3 determine that the relay node of the data frame is node 4. In addition, for example, when the information related to the simultaneous transmission node contained in the received data frame indicates node 2 and node 3 respectively, node 2 and node 3 determine that node 2 and node 3 are simultaneous transmission nodes on the source node side. Therefore, node 2 and node 3, for example, set the transmission destination of the data frame received from the source node, that is, the next relay node, to node 4 (in other words, the reception destination node of the bottleneck link), and transmit the data frame received from the source node to node 4.

[0111] pass Figure 5 In the transmission processing of each of nodes 1 to 3 at t8 shown, data frames are transmitted simultaneously from nodes 1, 2, and 3. By transmitting data simultaneously, the reception power or reception quality (e.g., SNR) of the data frame is improved in node 4, and therefore, the possibility that node 4 can normally receive the data frame increases. In other words, for example, even if node 4 on the receiving side cannot receive data when transmitting using a single node (e.g., node 1), if multiple nodes (e.g., nodes 1 to 3) are used to transmit simultaneously, the possibility that node 4 on the receiving side can receive data increases.

[0112] In addition, Figure 5 In the example, nodes 2 and 3 send data to node 4, but nodes 2 and 3 can also send data to nodes 5 and 6, or nodes 5 and 6 can be set to forward the received data frames to the aggregation node.

[0113] At t9, for example, node 4 receives data frames from nodes 1 to 3. Then, node 4 forwards the data frames to the sink node.

[0114] At t10, the sink node, and nodes 5 and 6 that can communicate with node 4 receive the data frame. The sink node determines that the received data frame is sent to the sink node. Then, the sink node, for example, copies the simultaneous sending nodes on the sink node side (for example, node 5 and node 6) contained in the data frame into the reception completion frame. In addition, the sink node sets the destination node as the source node and sets the next relay node as node 4 in the reception completion frame. Then, the sink node sends a reception completion frame to node 4.

[0115] In this way, the aggregation node, for example, generates a reception completion frame that includes information related to the simultaneously sending nodes in addition to information indicating the node that sends the reception completion frame to the bottleneck link (for example, information indicating the relay node), and sends the generated reception completion frame to the nodes within Collabo node 2.

[0116] At t11, the node 4, and the nodes 5 and 6 that can communicate with the node 4 receive the reception completion frame from the sink node.

[0117] Node 4, for example, determines that the relay node of the signal sent from the sink node to the source node is node 4. Then, node 4 sets the next relay node to node 1, for example, and forwards the reception completion frame to node 1.

[0118] In addition, the node 5 and the node 6, for example, determine that the relay node of the received reception completion frame is the node 4. In addition, for example, when the information related to the simultaneous transmission node contained in the reception completion frame indicates the node 5 and the node 6 respectively, the node 5 and the node 6 determine that the node 5 and the node 6 are the simultaneous transmission nodes on the sink node side. Therefore, the node 5 and the node 6, for example, set the transmission destination of the reception completion frame received from the sink node, that is, the next relay node, to the node 1 (in other words, the reception destination node of the bottleneck link), and transmit the reception completion frame received from the sink node to the node 1.

[0119] pass Figure 5 In the transmission processing of each of nodes 4 to 6 at t11 ​​shown, reception completion frames are transmitted simultaneously from nodes 4, 5, and 6. By transmitting reception completion frames simultaneously, the reception power or reception quality (e.g., SNR) of the reception completion frames in node 1 is improved, and therefore, the possibility that node 1 can normally receive the reception completion frames increases. In other words, for example, even if node 1 on the receiving side cannot receive data when transmitting using a single node (e.g., node 4), if multiple nodes (e.g., nodes 4 to 6) are used to transmit simultaneously, the possibility that node 1 on the receiving side can receive data increases.

[0120] At t12, node 1 receives the reception completion frame. Then, node 1 determines that the relay node of the reception completion frame is node 1, and thus forwards the reception completion frame to the source node.

[0121] At t13, the source node, and nodes 2 and 3 that can communicate with node 1 receive the reception completion frame. The source node determines that the received reception completion frame is sent to the source node, and thus ends the process of sending data from the source node to the sink node.

[0122] In this way, in a link (e.g., called a "bottleneck link") where the communication quality (e.g., SNR) of the wireless network 10 may be lower than a threshold, by utilizing simultaneous transmission of multiple nodes 100, packet loss in the bottleneck link can be reduced and data retransmission can be suppressed. By suppressing data retransmission, the throughput in the wireless network 10 can be improved.

[0123] In addition, each node 100 can individually (in other words, autonomously) decide whether to relay (in other words, simultaneously send) a data frame or a reception completion frame to other nodes based on the information related to the simultaneously sending node contained in the data frame or the reception completion frame when the node 100 is not a relay node for the data frame or the reception completion frame.

[0124] [Node operation example]

[0125] Next, an operation example of each node (for example, the node 100 ) in the wireless network 10 will be described.

[0126] An example of the operation of a source node that triggers communication and an example of the operation of other nodes (for example, a relay node or a destination node (sink node)) are described below.

[0127] <Operation example of source node>

[0128] Figure 6 This is a flowchart showing an example of the operation of a source node (for example, node 100 ).

[0129] exist Figure 6 In the example, the source node generates a transmission reservation frame and transmits it to the relay node (S11). The transmission reservation frame transmitted from the source node may include information related to the destination node (e.g., sink node), the transmission source node (e.g., source node) and the next relay node (e.g., information indicating the node ID), and information related to RSSI (e.g., threshold value). In other words, the node may not be shown in the field indicating the bottleneck node of the transmission reservation frame transmitted from the source node.

[0130] After sending a transmission reservation frame, the source node enters a state of waiting for reception of a transmission permission frame.

[0131] The source node determines whether the transmission permission frame has been received (S12). If the transmission permission frame has not been received (S12: No), the source node may wait for a certain period of time (S13), return to the process of S11, and retransmit the transmission reservation frame.

[0132] On the other hand, when the source node receives the transmission permission frame (S12: Yes), it generates a data frame and transmits it to the relay node (S14). The data frame transmitted from the source node may include, for example, information related to the destination node (e.g., sink node), the next relay node (e.g., information indicating the node ID), information related to the simultaneous transmission node, and data (payload). For example, the source node may copy the information related to the "simultaneous transmission node" recorded in the received transmission permission frame into the data frame.

[0133] After sending a data frame, the source node enters a state of waiting to receive a reception completion frame.

[0134] The source node determines whether the reception completion frame has been received (S15). If the reception completion frame has not been received (S15: No), the source node returns to the process of S14 after waiting for a certain period of time (for example, RTO) (S16) and retransmits the data frame. On the other hand, if the source node has received the reception completion frame (S15: Yes), the transmission process is terminated.

[0135] <Operation examples of relay nodes and aggregation nodes>

[0136] Figure 7 The flowchart is a flowchart showing an example of the operation of a sink node, a relay node or a simultaneous transmission node (e.g., the node 100). For example, when the node 100 receives a wireless signal (e.g., a transmission reservation frame, a transmission permission frame, a data frame, and a reception completion frame), it starts Figure 7 Processing shown.

[0137] exist Figure 7 In the embodiment, the node 100 determines whether the node 100 is a destination node (e.g., a sink node) based on the received frame (e.g., information related to the destination node) (S101). If the node 100 is a destination node (S101: Yes), the node 100 performs processing related to the destination node (e.g., sink node) (e.g., S301 to S304 described later).

[0138] [Processing related to relay nodes]

[0139] When the node 100 is not a destination node ( S101 : No), the node 100 determines whether the node 100 is a relay node based on the received frame (for example, information related to the relay node) ( S102 ).

[0140] When the node 100 is a relay node ( S102 : Yes), the node 100 determines whether the received frame is a transmission reservation frame ( S103 ).

[0141] When the frame is a transmission reservation frame (S103: Yes), the node 100 determines, for example, whether the reception quality (e.g., RSSI) is above a threshold value (S104). In other words, the node 100 determines whether the RSSI is sufficient for data communication using the node 100. When the RSSI is lower than the threshold value (S104: No), the node 100 sets, for example, in the transmission reservation frame, the ID of the transmission source node of the transmission reservation frame as the bottleneck node on the source node side, and sets the ID of the node 100 as the bottleneck node on the sink node side (S105).

[0142] After the process of S105 or when the RSSI is equal to or greater than the threshold (S104: Yes), the node 100 sets the next relay node in the frame (here, the transmission reservation frame) and transmits the frame to the next relay node (S106).

[0143] When Figure 7 In S103 shown, when the frame is not a transmission reservation frame (S103: No), the node 100 determines whether the received frame is a transmission permission frame (S107).

[0144] When the frame is a transmission permission frame (S107: Yes), the node 100 determines whether the node 100 is a bottleneck node, for example, based on the information related to the bottleneck node contained in the received transmission permission frame (S108). When the node 100 is a bottleneck node (S108: Yes), the node 100 sets a simultaneous transmission node (for example, a node ID) in the transmission permission frame, for example (S109). At this time, the node 100 can set a relay destination in the transmission permission frame, for example.

[0145] For example, the node 100 may determine (in other words, set or select) a node whose RSSI with the node 100 is above a threshold value among the nodes that can communicate with the node 100 as a simultaneous transmission node. In addition, the node 100 may set a simultaneous transmission node on the source node side when the node 100 is a bottleneck node on the source node side, and may set a simultaneous transmission node on the sink node side when the node 100 is a bottleneck node on the sink node side.

[0146] After the process of S109 or when the node 100 is not a bottleneck node (S108: No), the node 100 sets the next relay node in the frame (here, the transmission permission frame) and transmits the frame to the next relay node (S106).

[0147] When the frame is not a transmission permission frame in S107 (S107: No), the node 100 determines whether the received frame is a data frame (S110). When the frame is a data frame (S110: Yes), the node 100 sets the next relay node in the frame (here, the data frame) and sends the frame to the next relay node (S106).

[0148] On the other hand, when the frame is not a data frame (S110: No), the node 100 determines whether the received frame is a reception completion frame (S111). When the frame is a reception completion frame (S111: Yes), the node 100 sets the next relay node in the frame (here, the reception completion frame) and sends the frame to the next relay node (S106).

[0149] [Processing related to simultaneous sending nodes]

[0150] When the node 100 is not a relay node in S102 ( S102 : No), the node 100 determines whether the received frame is a data frame ( S201 ), for example.

[0151] When the received frame is a data frame (S201: Yes), the node 100 determines whether the node 100 is a simultaneous transmission node on the source side (S202). When the node 100 is a simultaneous transmission node on the source side (S202: Yes), the node 100 sets the next relay node in the frame (here, the data frame) and transmits the frame to the next relay node (S106). On the other hand, when the node 100 is not a simultaneous transmission node on the source side (S202: No), the node 100 ends the Figure 7 Processing shown.

[0152] In addition, when the frame received by the node 100 is not a data frame in S201 (S201: No), the node 100 determines whether the received frame is a reception completed frame (S203), for example.

[0153] When the received frame is a reception completion frame (S203: Yes), the node 100 determines whether the node 100 is a simultaneous transmission node on the aggregation side (S204). When the node 100 is a simultaneous transmission node on the aggregation side (S204: Yes), the node 100 sets the next relay node in the frame (here, the reception completion frame) and transmits the frame to the next relay node (S106). On the other hand, when the frame is not a reception completion frame (S204: No), the node 100 ends the transmission. Figure 7 Processing shown.

[0154] [Processing related to the sink node]

[0155] When the node 100 is a destination node (for example, a sink node) in S101 ( S101 : Yes), the node 100 determines whether the received frame is a transmission reservation frame ( S301 ).

[0156] When the frame is a transmission reservation frame (S301: Yes), the node 100 generates a transmission permission frame and transmits it to the relay node (S302). For example, when the bottleneck node (e.g., node ID) on the source node side and the sink node side is included in the transmission reservation frame, the node 100 may copy the bottleneck node into the transmission permission frame. In addition, the transmission permission frame may include, for example, a destination node (e.g., source node) and a next relay node. After sending the transmission permission frame, the node 100, for example, becomes in a state of waiting to receive a data frame from the source node (in other words, ends the reception process).

[0157] On the other hand, when the frame is not a transmission reservation frame ( S301 : No), the node 100 determines whether the received frame is a data frame ( S303 ).

[0158] When the frame is a data frame (S303: Yes), the node 100 generates a reception completion frame and sends it to the relay node (S304). For example, the node 100 may copy the simultaneous transmission node (e.g., node ID) on the sink node side contained in the data frame to the reception completion frame. In addition, the reception completion frame may include, for example, a destination node (e.g., source node) and a next relay node. The node 100 may end the reception process, for example, when the frame is not a data frame (S303: No) or after the process of S304.

[0159] An example of operation in the wireless network 10 has been described above.

[0160] In this embodiment, when the following information in the wireless signal (e.g., data frame or reception completion frame) indicates the node 100, the node 100 sets the transmission destination of the received wireless signal to the reception destination node of the bottleneck link, and the information is information indicating a node that transmits together with a node that transmits a wireless signal to a wireless link (e.g., bottleneck link) whose communication quality is lower than a threshold value (e.g., information related to a simultaneous transmission node). Then, the node 100 transmits (in other words, cooperatively transmits) the wireless signal to the above-mentioned reception destination node.

[0161] By utilizing collaborative relaying of multiple nodes (e.g., simultaneous transmission), for example, the reception quality in a link where the reception quality is below a threshold (in other words, a bottleneck link where the possibility of data loss is high) can be improved, and the retransmission of wireless signals (e.g., data frames) can be reduced, thereby improving the throughput in the wireless network 10.

[0162] In addition, each of the multiple nodes 100 in the wireless network 10 controls simultaneous transmission based on the information included in the forwarded frame. Therefore, according to this embodiment, in the wireless network 10, each node 100 autonomously controls simultaneous transmission, thereby suppressing the increase in complexity of the wireless network 10.

[0163] As described above, according to the present embodiment, the throughput in the wireless mesh network can be improved.

[0164] In the above, one embodiment of the present invention has been described.

[0165] In addition, for example, the RSSI threshold contained in the sending reservation frame can be determined based on at least one of the information such as the size of the sent data, the location information of the node, the moving direction of the node, the orientation of the node, and the hardware information of the node (for example, the antenna structure, etc.).

[0166] In addition, in the above embodiment, the case where RSSI is used as the criterion for determining the bottleneck node (in other words, the bottleneck link) is described, but the criterion for determining the bottleneck node is not limited to RSSI, and other information may also be used. For example, the bottleneck node may be determined based on at least one of the information such as the location information of the node, the moving direction of the node, the orientation of the node, the communication history, or the hardware information of the node (for example, the antenna structure, etc.).

[0167] In addition, in the above-mentioned embodiment, it is described that, for example, a simultaneous sending node is a node whose RSSI between nodes is above a threshold. The threshold value may also change according to, for example, the RSSI between the bottleneck node on the source node side and the bottleneck node on the aggregation node side. For example, the lower the RSSI between the bottleneck node on the source node side and the bottleneck node on the aggregation node side, the lower the RSSI threshold value of the RSSI used for determining the simultaneous sending node. By setting the threshold value in this way, for example, the lower the RSSI between the bottleneck node on the source node side and the bottleneck node on the aggregation node side, the more simultaneous sending nodes for the bottleneck node can be set, thereby further improving the reception quality based on simultaneous sending.

[0168] In addition, for example, the number of nodes set as simultaneous transmission nodes may be determined based on the communication quality (e.g., RSSI) of the relay node that is the bottleneck node. For example, the lower the communication quality of the relay node, the greater the number of nodes set as simultaneous transmission nodes. By determining the number of simultaneous transmission nodes in this way, the node receiving the frame can receive the frame in a state where the reception quality based on simultaneous transmission is not too high or too low.

[0169] In addition, in the present embodiment, the node 100 may also repeatedly transmit and receive frames in the bottleneck link, and determine the simultaneous sending nodes participating in the transmission in the bottleneck link based on the multiple transmission and reception of frames. In this case, for example, after receiving the data frame, the bottleneck node on the sink node side may send information related to the request for adding a simultaneous sending node to the bottleneck node on the source node side. Alternatively, before sending the reception completion frame, the sink node may send a frame containing information related to the request for adding a simultaneous sending node to the source node, and each node corresponding to the transmission path of the frame may control the simultaneous sending action based on the frame requesting the addition of a simultaneous sending node.

[0170] In addition, in the above-mentioned embodiment, the case where RSSI is used as the criterion for determining the simultaneous transmission nodes is described, but the criterion for determining the simultaneous transmission nodes is not limited to RSSI, and may also be other information. For example, the simultaneous transmission nodes may also be determined based on at least one of the information such as the location information of the node, the moving direction of the node, the orientation of the node, the communication history, or the hardware information of the node (for example, the antenna structure, etc.).

[0171] In addition, the structure of the wireless network 10 described in the above embodiment is an example, and the wireless network 10 is not limited thereto. For example, at least one of the number of nodes in the wireless network 10, the number of Collaboration nodes (in other words, groups), the number of nodes in the Collaboration nodes, and the communication environment (in other words, connection relationship) between the nodes may also be different. Figure 1 The examples shown are different.

[0172] In addition, in the above-mentioned embodiment, for example, information related to the bottleneck node and information related to the simultaneous transmission node are not limited to being included in Figure 4 As for the cases of the frames shown, this information may also be included in other frames.

[0173] In addition, each node participating in the communication may also store and use the information of the bottleneck link or the simultaneous sending node. For example, each node may use the bottleneck link or the information of the simultaneous sending node in the communication when the data frame is large and multiple data frames are connected, or in other communications after a certain period of time.

[0174] In addition, the reception quality is not limited to RSSI, and may be information related to the quality of the received signal, such as SNR, signal to interference and noise ratio (SINR), or bit error rate (or packet error rate).

[0175] Furthermore, in the above-mentioned embodiment, simultaneous transmission using a plurality of nodes is described, but the transmission process using a plurality of nodes is not limited to simultaneous transmission, and for example, beamforming using a single node or a plurality of nodes may also be applied.

[0176] In addition, a node related to the transmission of a data frame may also enter a state of waiting to receive a frame after determining that it is related to the transmission of a data frame, without transmitting for communication with other nodes. For example, a node that relays a transmission reservation frame may enter a state of waiting to receive a frame after relaying the transmission reservation frame. In addition, a simultaneous transmission node may also enter a state of waiting for data to be transmitted simultaneously after confirming that it has received a transmission permission frame and has been added as a simultaneous transmission node in the transmission permission frame.

[0177] In addition, in the above-mentioned embodiment, as an example, Figure 5 As shown in the figure, the case where simultaneous transmission is applied to data frames and reception completion frames is explained, but the frames to which simultaneous transmission is applied are not limited to data frames and reception completion frames. For example, simultaneous transmission may be applied to at least one of a transmission reservation frame, a transmission permission frame, a data frame, and a reception completion frame. For example, by applying simultaneous transmission to frames such as data frames whose frame size is larger than other frames, it is possible to suppress retransmission of packets and improve throughput. In addition, for example, by applying simultaneous transmission to frames such as reception completion frames whose importance is higher than other frames, it is possible to improve the possibility of completing the transmission and reception of frames (in other words, the reliability of the link).

[0178] Various embodiments have been described above with reference to the accompanying drawings, but the present invention is certainly not limited to these examples. Those skilled in the art can obviously think of various variations or modifications within the scope of the protection scope of this application, and it should be understood that these variations or modifications also belong to the technical scope of the present invention. In addition, the various constituent elements in the above-mentioned embodiments can also be arbitrarily combined within the scope of the invention.

[0179] In the above-mentioned embodiments, examples in which the present invention is configured using hardware have been described. However, the present invention can also be implemented by software in cooperation with hardware.

[0180] In addition, each functional block used in the description of each of the above embodiments can be typically implemented as an LSI (Large Scale Integration) as an integrated circuit. The integrated circuit can also control each functional block used in the description of the above embodiments, and has input and output. These can be implemented as a single chip separately, or they can be implemented as a single chip in a manner that includes a part of the structure or all of the structure. It is called LSI here, but depending on the degree of integration, it is sometimes also called IC (Integrated Circuit), SSI (Small Scale Integration), MSI (Middle Scale Integration), System LSI (System LSI), Super LSI (Super LSI), VLSI (Very Large Scale Integration), and Ultra LSI (Ultra LSI).

[0181] In addition, the integrated circuit method is not limited to LSI, and can also be implemented using a dedicated circuit or a general-purpose processor. It is also possible to use an FPGA (Field Programmable Gate Array) that can be programmed after LSI manufacturing, or a reconfigurable processor that can reconfigure the connection or setting of the circuit blocks inside the LSI.

[0182] In addition, if integrated circuit technology that replaces LSI emerges as semiconductor technology advances or other technologies are derived, it is of course possible to use this technology to achieve integration of functional blocks. There is also the possibility of applying biotechnology, etc.

[0183] The present invention can be implemented in all kinds of devices, equipment, and systems (collectively referred to as "communication devices") with communication functions. Non-limiting examples of communication devices include: phones (mobile phones, smart phones, etc.), tablets, personal computers (PCs) (laptops, desktops, notebook computers, etc.), cameras (digital cameras, digital video cameras, etc.), digital players (digital audio / video players, etc.), wearable devices (wearable cameras, smart watches, tracking devices, etc.), game consoles, e-book readers, telehealth / telemedicine (telehealth / medical prescription) devices, vehicles or transportation vehicles with communication functions (cars, airplanes, ships, etc.), and combinations of the above devices.

[0184] Communication devices are not limited to portable or mobile devices, but also include all kinds of devices, equipment, and systems that cannot be carried or fixed. For example, they include: smart home devices (home appliances, lighting equipment, smart meters or meters, control panels, etc.), vending machines, and all other "things" that can exist on the IoT (Internet of Things) network.

[0185] In addition to data communication via cellular systems, wireless LAN (Local Area Network) systems, communication satellite systems, etc., communication also includes data communication via a combination of these systems. In addition, the communication device also includes devices such as controllers or sensors connected or linked to the communication device that performs the communication function described in the present invention. For example, it includes a controller or sensor that generates a control signal or data signal used by the communication device that performs the communication function of the communication device.

[0186] In addition, the communication device includes infrastructure equipment that communicates with the above-mentioned non-limiting various devices or controls the above-mentioned various devices, such as base stations, access points, and all other devices, equipment, and systems.

[0187] In the above description, the expression “…part” used in each component may also be replaced by other expressions such as “…circuitry”, “…component”, “…device”, “…unit” or “…module”.

[0188] (Summary of Implementation Methods)

[0189] A wireless communication device according to an embodiment of the present invention includes: a receiving circuit, which receives a first frame sent by a first node in a wireless mesh network; and a control circuit, which, when the first frame includes first information indicating a third node that transmits in coordination with a second node, and the third node contained in the first information represents the wireless communication device, sets second information indicating a node that is a relay destination for the third node to send the first frame as follows, i.e., sets the second information to a node that is a relay destination for the second node to send the first frame, the second node being a node that sends a wireless signal to a wireless link in the wireless mesh network whose communication quality is lower than a threshold.

[0190] In one embodiment of the present invention, the first frame is a signal indicating transmission permission, a data signal, or completion of receiving the data.

[0191] A wireless communication device according to an embodiment of the present invention includes: a receiving circuit, which receives a second frame in a wireless mesh network; a control circuit, which sets, in the second frame, first information representing a third node that transmits a wireless signal in coordination with the wireless communication device, when the second frame includes third information representing a second node that transmits a wireless signal to a wireless link in the wireless mesh network whose communication quality is lower than a threshold, and the third information represents the wireless communication device; and a transmitting circuit, which transmits the second frame to a node at a relay destination.

[0192] In one embodiment of the present invention, the second frame is a signal indicating permission to transmit.

[0193] A wireless communication device according to one embodiment of the present invention includes: a control circuit that generates a third frame, wherein the third frame includes third information indicating a second node that sends a wireless signal to a wireless link in a wireless mesh network whose communication quality is lower than a threshold, and first information indicating a third node that sends the signal in coordination with the first node; and a sending circuit that sends the third frame to the second node and the third node.

[0194] In one embodiment of the present invention, the third frame is a permission to send message.

[0195] In a wireless communication method of one embodiment of the present invention, a wireless communication device performs the following steps: in a wireless mesh network, receiving a first frame sent by a first node; and when the first frame includes first information indicating a third node that transmits in coordination with a second node, and the third node contained in the first information represents the wireless communication device, setting second information indicating a node that is a relay destination for the third node to transmit the first frame as follows, that is, setting the second information to a node that is a relay destination for the second node to transmit the first frame, the second node being a node that transmits a wireless signal to a wireless link in the wireless mesh network whose communication quality is lower than a threshold.

[0196] A wireless communication system of one embodiment of the present invention includes: a first node, which sends a first frame in a wireless mesh network; a second node, which sends the first frame sent by the first node to a wireless link whose communication quality is lower than a threshold; and a third node, which receives the first frame sent by the first node, and when the first frame received from the first node contains first information indicating a node that sends in coordination with the second node, and the first information indicates the third node, the third node sets second information indicating a relay destination node for sending the first frame by the third node as follows, that is, sets the second information to the node of the relay destination for sending the first frame by the second node.

[0197] The disclosures of the specification, drawings, and abstract contained in Japanese patent application No. 2020-020579 filed on February 10, 2020 are incorporated herein by reference in their entirety.

[0198] Industrial Applicability

[0199] The present invention can be applied to wireless communication systems.

[0200] Description of Reference Numerals

[0201] 10. Wireless Network

[0202] 100 nodes

[0203] 111 Transceiver Department

[0204] 112 Control Department

Claims

1. A wireless communication device, include: A receiving circuit, in the wireless mesh network, receives a first frame sent by a first node; as well as A control circuit, when the first frame includes first information indicating a third node that transmits together with the second node, and the third node contained in the first information indicates the wireless communication device, sets second information indicating a node that is a relay destination for the third node to transmit the first frame as follows, that is, sets the second information to a node that is a relay destination for the second node to transmit the first frame, and the second node is a node that transmits a wireless signal to a wireless link in the wireless mesh network whose communication quality is lower than a threshold.

2. The wireless communication device according to claim 1, in, The first frame is a signal indicating permission to transmit, a data signal, or completion of reception of the data signal.

3. A wireless communication device, include: The receiving circuit receives the second frame in the wireless mesh network; a control circuit that, when the second frame includes third information indicating a second node that transmits a wireless signal to a wireless link having a communication quality lower than a threshold in the wireless mesh network, and the third information indicates the wireless communication device, sets, in the second frame, first information indicating a third node that transmits together with the wireless communication device; and The sending circuit sends the second frame to a node at a relay destination.

4. The wireless communication device according to claim 3, in, The second frame is a signal indicating permission to transmit.

5. A wireless communication method, in, The wireless communication device performs the following steps: In a wireless mesh network, receiving a first frame sent by a first node; and When the first frame includes first information representing a third node that transmits together with the second node, and the third node contained in the first information represents the wireless communication device, second information representing a node that is a relay destination for the third node to transmit the first frame is set as follows, that is, the second information is set to a node that is a relay destination for the second node to transmit the first frame, and the second node is a node that sends a wireless signal to a wireless link in the wireless mesh network whose communication quality is lower than a threshold.

6. A wireless communication system, include: A first node, in a wireless mesh network, sends a first frame; a second node, sending the first frame sent by the first node to a wireless link whose communication quality is lower than a threshold; as well as The third node, The third node receives the first frame sent by the first node, When the first frame received from the first node includes first information indicating a node that sends together with the second node, and the first information indicates the third node, the third node sets second information indicating a relay destination node to which the third node sends the first frame as follows, i.e., sets the second information to the node that is the relay destination to which the second node sends the first frame.