CN112752296A - Data transmission method and device and electronic equipment - Google Patents
Data transmission method and device and electronic equipment Download PDFInfo
- Publication number
- CN112752296A CN112752296A CN201911044653.9A CN201911044653A CN112752296A CN 112752296 A CN112752296 A CN 112752296A CN 201911044653 A CN201911044653 A CN 201911044653A CN 112752296 A CN112752296 A CN 112752296A
- Authority
- CN
- China
- Prior art keywords
- node
- sending
- receiving
- message
- data
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 230000005540 biological transmission Effects 0.000 title claims abstract description 133
- 238000000034 method Methods 0.000 title claims abstract description 77
- 239000000523 sample Substances 0.000 claims abstract description 28
- 230000015654 memory Effects 0.000 claims description 32
- 238000004590 computer program Methods 0.000 claims description 25
- 238000001514 detection method Methods 0.000 claims description 5
- 230000008569 process Effects 0.000 description 19
- 101710097688 Probable sphingosine-1-phosphate lyase Proteins 0.000 description 17
- 101710105985 Sphingosine-1-phosphate lyase Proteins 0.000 description 17
- 101710122496 Sphingosine-1-phosphate lyase 1 Proteins 0.000 description 17
- 238000004891 communication Methods 0.000 description 11
- 230000001360 synchronised effect Effects 0.000 description 10
- 238000010586 diagram Methods 0.000 description 8
- 230000007246 mechanism Effects 0.000 description 6
- 230000006870 function Effects 0.000 description 5
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 230000003068 static effect Effects 0.000 description 3
- 238000000263 scanning probe lithography Methods 0.000 description 2
- 230000009977 dual effect Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000000284 extract Substances 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/0294—Traffic management, e.g. flow control or congestion control forcing collision
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/08—Non-scheduled access, e.g. ALOHA
- H04W74/0833—Random access procedures, e.g. with 4-step access
- H04W74/0841—Random access procedures, e.g. with 4-step access with collision treatment
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W76/00—Connection management
- H04W76/20—Manipulation of established connections
- H04W76/28—Discontinuous transmission [DTX]; Discontinuous reception [DRX]
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The application discloses a data transmission method, a data transmission device and electronic equipment, wherein the data transmission method comprises the following steps: sending a probe message to a plurality of second nodes, wherein the probe message is used for informing the second nodes whether a plan for sending a request exists; receiving a plan message sent by at least one of the plurality of second nodes; establishing a receiving schedule according to the received at least one scheduling message, wherein the receiving schedule is used for indicating the sending waiting time of the at least one second node; sending the reception schedule to the at least one second node. According to the technical scheme, the first node and the second nodes can be simultaneously handshake when the number of the second nodes is large, the handshake waiting time of the first node and the second nodes is reduced, the second nodes can send data to the first node in order according to a plan, and data collision caused by the fact that the second nodes send target data to the first node in the same time period is avoided.
Description
Technical Field
The present application relates to the field of communications technologies, and in particular, to a data transmission method and apparatus, and an electronic device.
Background
When a node is within the communication range of a receiving node but outside the communication range of a transmitting node, the node is called a hidden terminal of the transmitting node. For example, in a multi-hop wireless network, because the hidden terminal and the sending node cannot mutually sense the existence of each other, when the hidden terminal and the sending node both send data to the receiving node, data collision may be caused, so that the receiving node cannot correctly receive the data, and loss of effective data of the sending node and waste of a large amount of time are caused. When the nodes are densely distributed, the existence of the hidden terminal can greatly increase the probability of data collision, and the throughput, capacity and data transmission delay of the network are seriously influenced.
Disclosure of Invention
In order to solve the technical problem, embodiments of the present invention provide a data transmission method, an apparatus, and an electronic device.
The data transmission method provided by the embodiment of the application is applied to a first node and comprises the following steps:
sending a probe message to a plurality of second nodes, wherein the probe message is used for informing the second nodes whether a plan for sending a request exists;
receiving a plan message sent by at least one of the plurality of second nodes;
establishing a receiving schedule according to the received at least one scheduling message, wherein the receiving schedule is used for indicating the sending waiting time of the at least one second node;
sending the reception schedule to the at least one second node.
In an optional embodiment of the present application, for a planning message sent by each of the at least one second node, the planning message includes: a transmission status identifier and a length of transmission data; wherein the transmission status identifier is used for characterizing whether the second transmitting node has a data transmission request.
In an optional embodiment of the present application, the creating a receiving schedule according to the received at least one scheduling message includes:
determining a transmission priority of the at least one second node according to a reception time of the at least one scheduled message;
determining the data transmission duration of the at least one second node according to the content of the at least one plan message;
determining the sending waiting time of the at least one second node according to the sending priority of the at least one second node and the data sending duration of the at least one second node;
and establishing a receiving schedule according to the sending waiting time of the at least one second node.
In an optional embodiment of the present application, the receiving schedule includes a correspondence between at least one of the following information of the at least one second node and a transmission waiting time: node identification, sending priority.
The data transmission method provided by the embodiment of the application is applied to a second node and comprises the following steps:
receiving a detection message sent by a first node, wherein the detection message is used for informing a second node whether a plan for sending a request exists or not;
sending a plan message to the first node, the plan message being used for the first node to establish a receiving schedule;
receiving a receiving schedule sent by the first node, wherein the receiving schedule is used for indicating the sending waiting time of at least one second node;
and determining target sending waiting time according to the receiving schedule, and sending target data to the first node when the target sending waiting time arrives.
In an optional embodiment of the present application, the sending a plan message to the first node includes:
in the case of scheduled data transmission, a scheduling message is transmitted to the first node.
In an optional embodiment of the present application, the sending of the scheduling message includes: a transmission status identifier and a length of transmission data; wherein the transmission status identifier is used for characterizing whether the second transmitting node has a data transmission request.
In an optional embodiment of the present application, the method further comprises:
and entering a data receiving state after the target data is sent to the first node.
An embodiment of the present application further provides a data transmission apparatus, which is applied to a first node, and the apparatus includes:
a first sending unit, configured to send a probe message to a plurality of second nodes, where the probe message is used to notify the second nodes whether there is a schedule for sending a request;
a receiving unit, configured to receive a planning message sent by at least one second node in the plurality of second nodes;
the system comprises an establishing unit, a receiving unit and a sending unit, wherein the establishing unit is used for establishing a receiving schedule according to at least one received scheduling message, and the receiving schedule is used for indicating the sending waiting time of at least one second node;
a second sending unit, configured to send the receiving schedule to the at least one second node.
In an optional embodiment of the present application, the planning message includes: a transmission status identifier and a length of transmission data; wherein the transmission status identifier is used for characterizing whether the second transmitting node has a data transmission request.
In an optional embodiment of the present application, the establishing unit is specifically configured to: determining a transmission priority of the at least one second node according to a reception time of the at least one scheduled message; determining the data transmission duration of the at least one second node according to the content of the at least one plan message; determining the sending waiting time of the at least one second node according to the sending priority of the at least one second node and the data sending duration of the at least one second node; and establishing a receiving schedule according to the sending waiting time of the at least one second node.
An embodiment of the present application further provides a data transmission apparatus, which is applied to a second node, and the apparatus includes:
a first receiving unit, configured to receive a probe message sent by a first node, where the probe message is used to notify a second node whether there is a schedule for sending a request;
a first sending unit, configured to send a scheduling message to the first node, where the scheduling message is used for the first node to establish a receiving schedule;
a second receiving unit, configured to receive a receiving schedule sent by the first node, where the receiving schedule is used to indicate a sending waiting time of at least one second node;
and the second sending unit is used for determining target sending waiting time according to the receiving schedule and sending target data to the first node when the target sending waiting time arrives.
An embodiment of the present application provides an electronic device, including: the data transmission system comprises a processor and a memory, wherein the memory is used for storing a computer program, and the processor is used for calling and running the computer program stored in the memory to execute the data transmission method.
An embodiment of the present application provides a computer-readable storage medium, which is configured to store a computer program, where the computer program enables a computer to execute the data transmission method.
In the technical scheme of the embodiment of the application, a first node informs a plurality of second nodes whether a plan for sending a request exists or not by sending a detection message to the plurality of second nodes; receiving a plan message sent by at least one of the plurality of second nodes; establishing a receiving schedule according to the received at least one scheduling message, wherein the receiving schedule is used for indicating the sending waiting time of the at least one second node; sending the reception schedule to the at least one second node. Therefore, the whole data transmission process can be initiated and finished by the first node, the first node can handshake with the plurality of second nodes simultaneously, the time of handshake waiting can be greatly reduced when the number of the second nodes is large, the data transmission efficiency is improved, each second node in the plurality of second nodes can be guaranteed to transmit data according to a plan, and data frame collision is avoided.
Drawings
Fig. 1 is a schematic view of communication ranges of a plurality of nodes according to an embodiment of the present disclosure;
fig. 2 is a first flowchart illustrating a data transmission method according to an embodiment of the present application;
fig. 3 is a schematic flowchart illustrating a second data transmission method according to an embodiment of the present application;
fig. 4 is a first schematic diagram of a data transmission apparatus according to an embodiment of the present application;
fig. 5 is a second schematic diagram of a data transmission apparatus according to an embodiment of the present application;
fig. 6 is a schematic structural diagram of an electronic device according to an embodiment of the present application;
fig. 7 is a schematic structural diagram of a chip according to an embodiment of the present application.
Detailed Description
So that the manner in which the features and aspects of the present invention can be understood in detail, a more particular description of the invention, briefly summarized above, may be had by reference to embodiments, some of which are illustrated in the appended drawings.
When a node is within the communication range of a receiving node but outside the communication range of a transmitting node, the node is called a hidden terminal of the transmitting node. As shown in FIG. 1, R is a receiving node, S1 is a transmitting node, S2 is in the communication range of the receiving node R but out of the communication range of S1, and S2 is called a hidden terminal.
The problem of hiding the terminal is generally solved by starting from the receiving node, so that the neighbor node of the receiving node knows that the receiving node can not transmit data at the moment. For example, considering from the perspective of the sending node, the neighboring nodes of the receiving node are not informed to send a message when the sending node needs to send a message. Because the receiving node can not determine when the sending node will send the message, the receiving node informs the neighbor node that the time is consumed in the process of not receiving the message, the channel resource is occupied, and the performance of the network is reduced.
In one embodiment, a Request-To-Send (RTS)/Clear-To-Send (CTS) handshake mechanism is used To reduce collisions caused by hidden terminal problems, and the RTS/CTS handshake mechanism is a collision resolution mechanism based on three-way handshake adopted by the Media Access Control (MAC) protocol of the 802.11 wireless network, and the basic idea is as follows:
1. after a sending node competes for the channel use right, RTS is broadcasted before a message is sent, and a receiving node receives the RTS, wherein the process is called as first handshake.
2. After receiving the RTS, the receiving node broadcasts a CTS to the sending node to inform the sending node that the sending node is ready to receive data, and the sending node receives the CTS, which is called a second handshake. At this time, the hidden terminal can receive the CTS sent by the receiving node, and when the hidden terminal receives the CTS, it suspends sending data to the receiving node.
3. After receiving the CTS, the sending node sends data to the receiving node, and the receiving node receives the data, which is called a third handshake.
Through three-way handshake, the hidden terminal can be ensured not to send data to the receiving node in the time slot of sending data by the sending node, so that the problem of data collision caused by the existence of the hidden terminal is solved.
The RTS/CTS handshake mechanism is widely used to solve the hidden terminal problem in wireless networks, but when nodes are in a dense distribution state and require data to be sent quickly, the RTS/CTS handshake mechanism can cause serious data collision and access delay problems. Firstly, in the handshake process of the receiving node and the sending node, the consumed time is too long, so that the utilization rate of a channel is reduced; secondly, the nodes need to remain powered on in the standby state, resulting in inefficient node energy utilization. Finally, the RTS and the CTS are used as data with small data frames, and conflict can occur due to the existence of hidden terminals, particularly when the nodes are distributed densely and the RTS and CTS data are very active, the probability of conflict is very high, and the problem of hidden terminals cannot be solved well.
Some improvements are made on the basis of the RTS/CTS handshake mechanism, for example, in one embodiment, by reducing handshake time, dividing different time slots to reduce the probability of collision between RTS and CTS, etc.; in another embodiment, a method based on dual channels, busy tone channels and multiple channels is proposed, but the design algorithm of the embodiment is complex, and the utilization rate of the channels is also greatly reduced. The improved implementation mode does not fundamentally solve the problem of data collision caused by hidden terminals, and the performance of the network cannot be further improved.
Based on an analysis of the above-described embodiments, various examples of the present application are presented.
The embodiment of the application provides a hidden terminal solution based on a receiving schedule. The receiving schedule is established, the receiving schedule information is stored in the receiving schedule, then the receiving node sends the receiving information of the receiving schedule to the neighbor nodes, and the neighbor nodes send messages to the receiving node in a planned way by receiving the receiving information in the schedule, so that the problem of hidden terminals caused by the existence of the hidden terminals is solved.
Fig. 2 is a first schematic flow chart of a data transmission method according to an embodiment of the present application, and as shown in fig. 2, the method includes the following steps:
step 201: and sending a probe message to a plurality of second nodes, wherein the probe message is used for informing whether the second nodes have a plan for sending the request.
Here, the probe message may be implemented by a probe packet (DP). Specifically, the first node transmits the DP to a plurality of second nodes, wherein the plurality of second nodes may be neighbor nodes around the first node. The DP sent by the first node is small, and is mainly used to inform the second node whether there is a plan to send a request.
In an alternative embodiment, the probe message contains simple identifier information (IF, Is Flag) that informs the second node whether there Is a schedule to send the request.
Step 202: receiving a planning message sent by at least one of the plurality of second nodes.
In an optional embodiment of the present application, for a planning message sent by each of the at least one second node, the planning message includes: a transmission status identifier and a length of transmission data; wherein the transmission status identifier is used for characterizing whether the second transmitting node has a data transmission request.
Here, the Plan message may be implemented by a Plan Package (SPD). Specifically, after a plurality of second nodes receive a DP sent by a first node, if at least one of the plurality of second nodes has a schedule for sending data, the at least one second node having the schedule for sending replies an SPD to the first node, where the SPD mainly includes two parameters, i.e., a Sending Status Flag (SSF) of the second node and a length of the sending data, where the sending Status Flag SSF is 1, which indicates that the second node has the schedule for sending data, and the second nodes that do not Send the schedule do not process the received DP, and do not reply any message to the first node.
In another optional implementation, after receiving a DP sent by a first node, each second node in the plurality of second nodes replies an SPD to the first node, where the SPD mainly includes two parameters, namely an SSF of the second node and a length of sending data, and in the SPD replied by the second node with a sending plan, the SSF is 1, and the length of the sending data is the length of data that the SPD itself plans to send to the first node; in the SPD replied by the second node without the transmission plan, SSF is 0, and the length of the transmission data is zero.
Step 203: and establishing a receiving schedule according to the received at least one scheduling message, wherein the receiving schedule is used for indicating the sending waiting time of the at least one second node.
In an optional embodiment of the present application, the creating a receiving schedule according to at least one received scheduling message includes:
determining a transmission priority of the at least one second node according to a reception time of the at least one scheduled message;
determining the data transmission duration of the at least one second node according to the content of the at least one plan message;
determining the sending waiting time of the at least one second node according to the sending priority of the at least one second node and the data sending duration of the at least one second node;
and establishing a receiving schedule according to the sending waiting time of the at least one second node.
Specifically, after a second node having a transmission plan among the plurality of second nodes replies an SPD to the first node, the receiving node determines a transmission Priority (SPL, Send Priority Level) of each node in the second node having the transmission plan according to the receiving time of the received SPD, where the first node sets the SPL of the second node corresponding to the SPD received at the first time to 1, sets the SPL of the second node corresponding to the SPD received at the second time (later than the first time) to 2, sets the SPL of the second node corresponding to the SPD received at the third time (later than the second time) to 3, and so on, sequentially establishes the priorities of the second nodes having the transmission plans among the plurality of second nodes according to the above order.
In another optional implementation, each node in the plurality of second nodes replies an SPD to the first node regardless of whether there is data to send, and after the first node receives the SPD sent by each second node, an SPL is established only for the second node corresponding to the SPD carrying the SSF ═ 1, and for the SPLs of different nodes, the SPLs are determined according to the received time sequence of the SPD carrying the SSF ═ 1, and the second node corresponding to the SPD carrying the SSF ═ 0 is not processed.
In the embodiment of the application, besides the SPL, the first node may also read length information of the transmission data in the SPD received by the first node, and determine a data transmission duration of the data scheduled to be transmitted by the second node corresponding to each SPD. And finally, the first node determines the sending waiting time of each second node with the sending plan according to the determined SPL and the data sending duration of each second node with the sending plan, and establishes a receiving plan table according to the waiting time.
It should be noted that, in an optional embodiment of the present application, the receiving schedule includes a correspondence between at least one of the following information of the at least one second node and the sending latency: node identification, sending priority. Each second node with the transmission plan can determine the waiting time of transmitting data to the first node corresponding to the second node according to the node identification, the transmission priority and the transmission waiting time in the receiving plan table.
Step 204: sending the reception schedule to the at least one second node.
In this embodiment of the present application, the receiving schedule includes receiving schedule information of the at least one second node, where the receiving schedule information specifically refers to a correspondence between a node identifier and/or a sending priority of the second node and a sending waiting time.
Specifically, the first node packages the reception schedule information in the reception schedule table created by the first node into a Notification Packet (NP), and then transmits the NP to the plurality of second nodes. After a second node with a transmission plan receives the NP, the second node with the transmission plan determines the transmission waiting time of transmitting data to the first node by reading the receiving plan information in the NP, and starts to transmit the data to the first node when the corresponding waiting time comes. It should be noted that, the first receiving node sets the information receiving time according to the transmission waiting time of at least one of the plurality of second nodes in the receiving schedule, where the information receiving time and the transmission waiting time are in a synchronous state.
It should be noted that the first node in the above-mentioned scheme is a node that receives data, and the second node in the above-mentioned scheme is a node that transmits data. Optionally, the first node in the above scheme may be a hidden terminal.
Fig. 3 is a schematic flowchart of a second data transmission method according to an embodiment of the present application, where as shown in fig. 3, the method includes the following steps:
step 301: and receiving a probe message sent by the first node, wherein the probe message is used for informing the second node whether a plan for sending the request exists.
Here, the probe message may be implemented by the DP. Specifically, for any one of the plurality of second nodes, the second node receives a DP sent by the first node, where the DP is used to notify the second node whether there is a schedule for sending a request.
Step 302: and sending a plan message to the first node, wherein the plan message is used for establishing a receiving schedule by the first node.
In an optional embodiment of the present application, the sending a plan message to the first node includes: in the case of scheduled data transmission, a scheduling message is transmitted to the first node.
Specifically, after the second node receives the DP sent by the first node, if the second node has a plan to send data to the first node, the SPD is sent to the first node. Optionally, if the second node does not have a plan for sending data to the first node, an SPD indicating no sending plan may also be replied to the first node.
In this embodiment, the number of the second nodes sending the plan message to the first node may be 1 or more. At least one second node sends SPDs to the first node, so that the first node can determine the SPL and the data sending duration of at least one second node according to the received SPDs replied by at least one second node, then determine the sending waiting time of at least one second node according to the SPL and the data sending duration of at least one second node, and finally establish a receiving schedule according to the sending waiting time of at least one second node.
In an optional embodiment of the present application, the sending the scheduling message includes: a transmission status identifier and a length of transmission data; wherein the transmission status identifier is used for characterizing whether the second transmitting node has a data transmission request.
Specifically, when the second node sends a schedule of sending data to the first node and sends an SPD to the first node, the SPD may include an SSF and send data length information, where the SSF is used to characterize whether the second sending node has a data sending request, and if the second node sends data in the schedule, the SSF in the SPD replied to the first node is equal to 1. Optionally, if the second node does not plan to send data, the SSF in the SPD replied to the first node is 0.
Step 303: and receiving a receiving schedule sent by the first node, wherein the receiving schedule is used for indicating the sending waiting time of at least one second node.
Step 304: and determining target sending waiting time according to the receiving schedule, and sending target data to the first node when the target sending waiting time arrives.
Specifically, the receiving schedule sent by the first node and received by the second node includes a node identifier, a sending priority and a sending waiting time corresponding to the second node. The second node can determine the transmission waiting time required by the second node to transmit data to the first node by reading the received receiving schedule message, and then the second node starts to transmit the data to the first node when the transmission waiting time arrives according to the corresponding transmission waiting time. It should be noted that, the first receiving node sets the information receiving time according to the transmission waiting time of at least one second node in the receiving schedule, where the information receiving time and the transmission waiting time are in a synchronous state.
And the second node enters a data receiving state after sending the target data to the first node. Specifically, after the second node finishes sending the target data to the first node, the second node does not send data to the first node any more, and at this time, the second node may receive data sent by other nodes.
The technical solution of the embodiments of the present application is described below with reference to specific examples. This example may include two phases, a handshake phase and an information transmission phase. The handshake phase comprises the following procedures:
1. node a is in an idle state, ready to establish a reception plan. Node a sends a DP setup handshake request to surrounding neighbor nodes.
2. After the neighbor nodes B and C of the node A receive the DP, if the neighbor nodes B and C have no data transmission plan, the processing is not carried out. If nodes B and C have data to send, nodes B and C reply to a SPD to node A, and the SPD records SSF as 1 and records the length of data to be sent by the node.
3. After the node A receives the SPD of the node B, the SPL of the node A is set to be 1, the data transmission time length of the node A is determined to be t1 according to the length of the transmission data recorded in the SPD, and the SPL and the data transmission time length t1 are stored in a receiving schedule. Secondly, the node A receives the SPD of the node C, sets the SPL of the node C to be 2, determines the data transmission time length of the node B to be t2 according to the length of the transmission data recorded in the SPD, and stores the SPL and the data transmission time length t2 into a receiving schedule.
4. The node a extracts reception schedule information from the reception schedule, and sets a transmission waiting time based on the reception schedule information. For node B, if SPL is 1, the transmission latency of node B is T1, where T1 is Short Interframe Space (SIFS); for node C, the SPL is 2, the transmission latency is T2-T1 + T1, and T1 is the data transmission duration of node B. The transmission waiting times of the nodes B and C are stored in the NP and transmitted to the nodes B and C. In the communication range of the node A, after receiving the NP, other nodes except the nodes B and C back off in the sending time and do not send messages.
The information sending phase comprises the following processes:
1. after the NP is sent out by the node A, the node A enters a data receiving state after waiting for the SIFS time.
2. After receiving the NP, the node B reads the reception schedule information, and enters a data transmission state after a waiting time period T1 according to the transmission waiting time in the reception schedule information. After the data transmission is completed, the node B can only receive the data and can not transmit the data to the node A in the next transmission time.
After receiving the NP, the node C reads the reception schedule information, enters a data transmission state after a waiting time period T2 according to the transmission waiting time in the reception schedule information, and terminates the entire transmission time after the data transmission is completed.
3. And after the node A receives the data sent by the node C, the whole receiving time is cut off. And the node A clears the information in the receiving schedule, and sends DP establishment handshake requests to the surrounding neighbor nodes again after SIFS.
In the technical solution of the embodiment of the present application, in a handshake process between a first node and a second node, the first node first actively broadcasts a probe message to a plurality of second nodes, after at least one of the plurality of second nodes receives the probe message, a plan message is replied to the first node, after the first node receives the plan message replied by at least one of the plurality of second nodes, a sending priority and a sending waiting time of the at least one of the plurality of second nodes are recorded, a receiving plan table is established, and by sending information of the receiving plan table established by the first node to the at least one of the plurality of second nodes, the at least one of the plurality of second nodes sends data to the first node according to the waiting time corresponding to each second node in the receiving plan table. The first receiving node sets the information receiving time according to the sending waiting time of at least one second node in the plurality of second nodes in the receiving schedule, wherein the information receiving time and the sending waiting time are in a synchronous state. The whole process is initiated and finished by the first node, so that the first node can handshake with a plurality of second nodes at the same time, when the number of the second nodes is large, the handshake waiting time of each node can be greatly reduced, the data sending efficiency is improved, meanwhile, the plurality of second nodes send target data to the first node in sequence according to the waiting time of each node set in the receiving schedule established by the first node, and the data collision generated when the plurality of second nodes send data to the first node in the same time period is avoided.
Fig. 4 is a first schematic diagram of a data transmission device according to an embodiment of the present application, and as shown in fig. 4, the data transmission device includes:
a first sending unit 410, configured to send a probe message to a plurality of second nodes, where the probe message is used to notify the second nodes whether there is a schedule for sending a request;
a receiving unit 411, configured to receive a plan message sent by at least one second node in the plurality of second nodes;
a creating unit 412, configured to create a receiving schedule according to the received at least one scheduling message, where the receiving schedule is used to indicate the transmission waiting time of the at least one second node;
a second sending unit 413, configured to send the receiving schedule to the at least one second node.
In an optional embodiment of the present application, the planning message includes: a transmission status identifier and a length of transmission data; wherein the transmission status identifier is used for characterizing whether the second transmitting node has a data transmission request.
In an optional embodiment of the present application, the establishing unit 412 is specifically configured to: determining a transmission priority of the at least one second node according to a reception time of the at least one scheduled message; determining the data transmission duration of the at least one second node according to the content of the at least one plan message; determining the sending waiting time of the at least one second node according to the sending priority of the at least one second node and the data sending duration of the at least one second node; and establishing a receiving schedule according to the sending waiting time of the at least one second node.
In an optional embodiment of the present application, the receiving schedule created by the creating unit 412 includes a correspondence between at least one of the following information of the at least one second node and the sending waiting time: node identification, sending priority.
Those skilled in the art will understand that the functions implemented by the units in the data transmission device shown in fig. 4 can be understood by referring to the related description of the data transmission method. The functions of the units in the apparatus shown in fig. 4 may be implemented by a program running on a processor, or may be implemented by specific logic circuits.
Fig. 5 is a second schematic diagram of a data transmission device according to an embodiment of the present application, and as shown in fig. 5, the data transmission device includes:
a first receiving unit 510, configured to receive a probe message sent by a first node, where the probe message is used to notify a second node whether there is a schedule for sending a request;
a first sending unit 511, configured to send a scheduling message to the first node, where the scheduling message is used for the first node to establish a receiving schedule;
a second receiving unit 512, configured to receive a receiving schedule sent by the first node, where the receiving schedule is used to indicate a sending waiting time of at least one second node;
a second sending unit 513, configured to determine a target sending waiting time according to the receiving schedule, and send target data to the first node when the target sending waiting time arrives.
In an optional embodiment of the present application, the first sending unit 511 is specifically configured to send a scheduling message to the first node in a case of scheduling to send data.
In an optional embodiment of the present application, the schedule message sent by the first sending unit 511 is specifically used for sending a status identifier and a length of sending data; wherein the transmission status identifier is used for characterizing whether the second transmitting node has a data transmission request.
In an optional embodiment of the present application, the apparatus is further configured to enter a data receiving state after the target data is sent to the first node.
Those skilled in the art will understand that the functions implemented by the units in the data transmission device shown in fig. 5 can be understood by referring to the related description of the data transmission method. The functions of the units in the apparatus shown in fig. 5 may be implemented by a program running on a processor, or may be implemented by specific logic circuits.
Fig. 6 is a schematic structural diagram of an electronic device according to an embodiment of the present application. The electronic device may be a server, the electronic device includes the data processing apparatus shown in fig. 5, the electronic device 600 shown in fig. 6 includes a processor 610, and the processor 610 may call and execute a computer program from a memory to implement the method in the embodiment of the present application.
Optionally, as shown in fig. 6, the electronic device 600 may further include a memory 620. From the memory 620, the processor 610 may call and run a computer program to implement the method in the embodiment of the present application.
The memory 620 may be a separate device from the processor 610, or may be integrated into the processor 610.
Optionally, as shown in fig. 6, the electronic device 600 may further include a transceiver 630, and the processor 610 may control the transceiver 630 to communicate with other devices, and specifically, may transmit information or data to the other devices or receive information or data transmitted by the other devices.
The transceiver 630 may include a transmitter and a receiver, among others. The transceiver 630 may further include one or more antennas.
Optionally, the electronic device 600 may specifically be a network device in the embodiment of the present application, and the electronic device 600 may implement a corresponding process implemented by the network device in each method in the embodiment of the present application, which is not described herein again for brevity.
Optionally, the electronic device 600 may specifically be a mobile terminal/terminal device according to this embodiment, and the electronic device 600 may implement a corresponding process implemented by the mobile terminal/terminal device in each method according to this embodiment, which is not described herein again for brevity.
Fig. 7 is a schematic structural diagram of a chip of an embodiment of the present application. The chip 700 shown in fig. 7 includes a processor 710, and the processor 710 can call and run a computer program from a memory to implement the method in the embodiment of the present application.
Optionally, as shown in fig. 7, the chip 700 may further include a memory 720. From the memory 720, the processor 710 can call and run a computer program to implement the method in the embodiment of the present application.
The memory 720 may be a separate device from the processor 710, or may be integrated into the processor 710.
Optionally, the chip 700 may further include an input interface 730. The processor 710 may control the input interface 730 to communicate with other devices or chips, and in particular, may obtain information or data transmitted by other devices or chips.
Optionally, the chip 700 may further include an output interface 740. The processor 710 may control the output interface 740 to communicate with other devices or chips, and in particular, may output information or data to the other devices or chips.
Optionally, the chip may be applied to the network device in the embodiment of the present application, and the chip may implement the corresponding process implemented by the network device in each method in the embodiment of the present application, and for brevity, details are not described here again.
Optionally, the chip may be applied to the mobile terminal/terminal device in the embodiment of the present application, and the chip may implement the corresponding process implemented by the mobile terminal/terminal device in each method in the embodiment of the present application, and for brevity, no further description is given here.
It should be understood that the chips mentioned in the embodiments of the present application may also be referred to as a system-on-chip, a system-on-chip or a system-on-chip, etc.
It should be understood that the processor of the embodiments of the present application may be an integrated circuit chip having signal processing capabilities. In implementation, the steps of the above method embodiments may be performed by integrated logic circuits of hardware in a processor or instructions in the form of software. The Processor may be a general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), an off-the-shelf Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic device, or discrete hardware components. The various methods, steps, and logic blocks disclosed in the embodiments of the present application may be implemented or performed. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of the method disclosed in connection with the embodiments of the present application may be directly implemented by a hardware decoding processor, or implemented by a combination of hardware and software modules in the decoding processor. The software module may be located in ram, flash memory, rom, prom, or eprom, registers, etc. storage media as is well known in the art. The storage medium is located in a memory, and a processor reads information in the memory and completes the steps of the method in combination with hardware of the processor.
It will be appreciated that the memory in the embodiments of the subject application can be either volatile memory or nonvolatile memory, or can include both volatile and nonvolatile memory. The non-volatile Memory may be a Read-Only Memory (ROM), a Programmable ROM (PROM), an Erasable PROM (EPROM), an Electrically Erasable PROM (EEPROM), or a flash Memory. Volatile Memory can be Random Access Memory (RAM), which acts as external cache Memory. By way of example, but not limitation, many forms of RAM are available, such as Static random access memory (Static RAM, SRAM), Dynamic Random Access Memory (DRAM), Synchronous Dynamic random access memory (Synchronous DRAM, SDRAM), Double Data Rate Synchronous Dynamic random access memory (DDR SDRAM), Enhanced Synchronous SDRAM (ESDRAM), Synchronous link SDRAM (SLDRAM), and Direct Rambus RAM (DR RAM). It should be noted that the memory of the systems and methods described herein is intended to comprise, without being limited to, these and any other suitable types of memory.
It should be understood that the above memories are exemplary but not limiting illustrations, for example, the memories in the embodiments of the present application may also be Static Random Access Memory (SRAM), dynamic random access memory (dynamic RAM, DRAM), Synchronous Dynamic Random Access Memory (SDRAM), double data rate SDRAM (DDR SDRAM), enhanced SDRAM (enhanced SDRAM, ESDRAM), Synchronous Link DRAM (SLDRAM), Direct Rambus RAM (DR RAM), and the like. That is, the memory in the embodiments of the present application is intended to comprise, without being limited to, these and any other suitable types of memory.
The embodiment of the application also provides a computer readable storage medium for storing the computer program.
Optionally, the computer-readable storage medium may be applied to the network device in the embodiment of the present application, and the computer program enables the computer to execute the corresponding process implemented by the network device in each method in the embodiment of the present application, which is not described herein again for brevity.
Optionally, the computer-readable storage medium may be applied to the mobile terminal/terminal device in the embodiment of the present application, and the computer program enables the computer to execute the corresponding process implemented by the mobile terminal/terminal device in each method in the embodiment of the present application, which is not described herein again for brevity.
Embodiments of the present application also provide a computer program product comprising computer program instructions.
Optionally, the computer program product may be applied to the network device in the embodiment of the present application, and the computer program instructions enable the computer to execute corresponding processes implemented by the network device in the methods in the embodiment of the present application, which are not described herein again for brevity.
Optionally, the computer program product may be applied to the mobile terminal/terminal device in the embodiment of the present application, and the computer program instructions enable the computer to execute the corresponding processes implemented by the mobile terminal/terminal device in the methods in the embodiment of the present application, which are not described herein again for brevity.
The embodiment of the application also provides a computer program.
Optionally, the computer program may be applied to the network device in the embodiment of the present application, and when the computer program runs on a computer, the computer is enabled to execute the corresponding process implemented by the network device in each method in the embodiment of the present application, and for brevity, details are not described here again.
Optionally, the computer program may be applied to the mobile terminal/terminal device in the embodiment of the present application, and when the computer program runs on a computer, the computer is enabled to execute the corresponding process implemented by the mobile terminal/terminal device in each method in the embodiment of the present application, which is not described herein again for brevity.
Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application or portions thereof that substantially contribute to the prior art may be embodied in the form of a software product stored in a storage medium and including instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
The above description is only for the specific embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present application, and shall be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (14)
1. A data transmission method applied to a first node, the method comprising:
sending a probe message to a plurality of second nodes, wherein the probe message is used for informing the second nodes whether a plan for sending a request exists;
receiving a plan message sent by at least one of the plurality of second nodes;
establishing a receiving schedule according to the received at least one scheduling message, wherein the receiving schedule is used for indicating the sending waiting time of the at least one second node;
sending the reception schedule to the at least one second node.
2. The method of claim 1, wherein for a planning message sent by each of the at least one second node, the planning message comprises: a transmission status identifier and a length of transmission data; wherein the transmission status identifier is used for characterizing whether the second transmitting node has a data transmission request.
3. The method of claim 2, wherein the building a reception schedule from the received at least one scheduling message comprises:
determining a transmission priority of the at least one second node according to a reception time of the at least one scheduled message;
determining the data transmission duration of the at least one second node according to the content of the at least one plan message;
determining the sending waiting time of the at least one second node according to the sending priority of the at least one second node and the data sending duration of the at least one second node;
and establishing a receiving schedule according to the sending waiting time of the at least one second node.
4. The method of claim 3, wherein the reception schedule comprises a correspondence between at least one of the following information of the at least one second node and a transmission latency: node identification, sending priority.
5. A data transmission method applied to a second node, the method comprising:
receiving a detection message sent by a first node, wherein the detection message is used for informing a second node whether a plan for sending a request exists or not;
sending a plan message to the first node, the plan message being used for the first node to establish a receiving schedule;
receiving a receiving schedule sent by the first node, wherein the receiving schedule is used for indicating the sending waiting time of at least one second node;
and determining target sending waiting time according to the receiving schedule, and sending target data to the first node when the target sending waiting time arrives.
6. The method of claim 5, wherein said sending a plan message to the first node comprises:
in the case of scheduled data transmission, a scheduling message is transmitted to the first node.
7. The method of claim 6, wherein the sending the plan message comprises: a transmission status identifier and a length of transmission data; wherein the transmission status identifier is used for characterizing whether the second transmitting node has a data transmission request.
8. The method of any of claims 5 to 7, wherein the method further comprises:
and entering a data receiving state after the target data is sent to the first node.
9. A data transmission apparatus, for use in a first node, the apparatus comprising:
a first sending unit, configured to send a probe message to a plurality of second nodes, where the probe message is used to notify the second nodes whether there is a schedule for sending a request;
a receiving unit, configured to receive a planning message sent by at least one second node in the plurality of second nodes;
the system comprises an establishing unit, a receiving unit and a sending unit, wherein the establishing unit is used for establishing a receiving schedule according to at least one received scheduling message, and the receiving schedule is used for indicating the sending waiting time of at least one second node;
a second sending unit, configured to send the receiving schedule to the at least one second node.
10. The apparatus of claim 9, wherein the scheduling message comprises: a transmission status identifier and a length of transmission data; wherein the transmission status identifier is used for characterizing whether the second transmitting node has a data transmission request.
11. The apparatus according to claim 10, wherein the establishing unit is specifically configured to: determining a transmission priority of the at least one second node according to a reception time of the at least one scheduled message; determining the data transmission duration of the at least one second node according to the content of the at least one plan message; determining the sending waiting time of the at least one second node according to the sending priority of the at least one second node and the data sending duration of the at least one second node; and establishing a receiving schedule according to the sending waiting time of the at least one second node.
12. A data transmission apparatus, for use in a second node, the apparatus comprising:
a first receiving unit, configured to receive a probe message sent by a first node, where the probe message is used to notify a second node whether there is a schedule for sending a request;
a first sending unit, configured to send a scheduling message to the first node, where the scheduling message is used for the first node to establish a receiving schedule;
a second receiving unit, configured to receive a receiving schedule sent by the first node, where the receiving schedule is used to indicate a sending waiting time of at least one second node;
and the second sending unit is used for determining target sending waiting time according to the receiving schedule and sending target data to the first node when the target sending waiting time arrives.
13. An electronic device, comprising: a processor and a memory for storing a computer program, the processor being configured to invoke and execute the computer program stored in the memory, to perform the method of any of claims 1 to 4, or to perform the method of any of claims 5 to 8.
14. A computer-readable storage medium for storing a computer program which causes a computer to perform the method of any one of claims 1 to 4, or the method of any one of claims 5 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911044653.9A CN112752296B (en) | 2019-10-30 | 2019-10-30 | Data transmission method and device and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911044653.9A CN112752296B (en) | 2019-10-30 | 2019-10-30 | Data transmission method and device and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112752296A true CN112752296A (en) | 2021-05-04 |
| CN112752296B CN112752296B (en) | 2022-06-10 |
Family
ID=75640559
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911044653.9A Active CN112752296B (en) | 2019-10-30 | 2019-10-30 | Data transmission method and device and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112752296B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115604741A (en) * | 2022-12-13 | 2023-01-13 | 石家庄科林电气股份有限公司（Cn） | Fault indicator communication self-adjusting method, fault indicator and readable storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2017113240A1 (en) * | 2015-12-30 | 2017-07-06 | 华为技术有限公司 | Method, apparatus and system for processing keepalive probe packet |
| CN107707628A (en) * | 2017-09-06 | 2018-02-16 | 华为技术有限公司 | Method and apparatus for transmitting data processing request |
| CN107948271A (en) * | 2017-11-17 | 2018-04-20 | 亚信科技（中国）有限公司 | It is a kind of to determine to treat the method for PUSH message, server and calculate node |
-
2019
- 2019-10-30 CN CN201911044653.9A patent/CN112752296B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2017113240A1 (en) * | 2015-12-30 | 2017-07-06 | 华为技术有限公司 | Method, apparatus and system for processing keepalive probe packet |
| CN107707628A (en) * | 2017-09-06 | 2018-02-16 | 华为技术有限公司 | Method and apparatus for transmitting data processing request |
| CN107948271A (en) * | 2017-11-17 | 2018-04-20 | 亚信科技（中国）有限公司 | It is a kind of to determine to treat the method for PUSH message, server and calculate node |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115604741A (en) * | 2022-12-13 | 2023-01-13 | 石家庄科林电气股份有限公司（Cn） | Fault indicator communication self-adjusting method, fault indicator and readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112752296B (en) | 2022-06-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20220070918A1 (en) | Communication Method And Device | |
| US11638252B2 (en) | Fast wireless local area network communication method and apparatus using multiple transfer rate partitioning and cooperative transmission | |
| JP6856300B2 (en) | Random access methods, network devices, and user equipment | |
| US11638226B2 (en) | Method and device for processing synchronization signal block information and communication device | |
| CN109600854B (en) | Data transmission method and related equipment | |
| US20210068154A1 (en) | Channel sensing method, related device, and system | |
| US11297655B2 (en) | Method and device for random access | |
| CN113647182A (en) | Method and apparatus for wireless communication | |
| US20220240231A1 (en) | Method for pdcch detection, method for pdcch transmission, and devices | |
| JP6911120B2 (en) | Methods and devices for random access | |
| WO2022151908A1 (en) | Resource allocation method, resource selection method, device, and storage medium | |
| US20210385799A1 (en) | Resource indicating method, apparatus, access network device, terminal and system | |
| CN112752296B (en) | Data transmission method and device and electronic equipment | |
| WO2021197029A1 (en) | Listen before talk (lbt) failure indicating method and apparatus | |
| CN113647171A (en) | Method and apparatus for wireless communication | |
| CN112087799A (en) | Feedback resource configuration method and terminal device | |
| WO2023207784A1 (en) | Resource indication method and communication apparatus | |
| CN113365325B (en) | Data transmission method and device, storage medium and electronic equipment | |
| WO2021142580A1 (en) | Wireless communication method, terminal device and network device | |
| US20230018952A1 (en) | Physical channel monitoring method, terminal device, and non-transitory computer-readable storage medium | |
| KR20120092044A (en) | Method for controlling random access, base station and terminal in mobile communication system | |
| CN116347511A (en) | Data communication method and related equipment | |
| CN114666903A (en) | Uplink transmission control method and device, electronic device and video monitoring system | |
| CN118019084A (en) | Communication method and device | |
| CN117979456A (en) | Random access method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |