CN114916089B - Node data transmission method, wireless transmission system and storage medium - Google Patents
Node data transmission method, wireless transmission system and storage medium Download PDFInfo
- Publication number
- CN114916089B CN114916089B CN202210510672.1A CN202210510672A CN114916089B CN 114916089 B CN114916089 B CN 114916089B CN 202210510672 A CN202210510672 A CN 202210510672A CN 114916089 B CN114916089 B CN 114916089B
- Authority
- CN
- China
- Prior art keywords
- random
- node data
- check
- gateway
- code
- 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.)
- Active
Links
- 230000005540 biological transmission Effects 0.000 title claims abstract description 57
- 238000000034 method Methods 0.000 title claims abstract description 41
- 238000004891 communication Methods 0.000 claims abstract description 82
- 238000012795 verification Methods 0.000 claims description 16
- 238000012544 monitoring process Methods 0.000 claims description 9
- 238000010586 diagram Methods 0.000 description 8
- 238000004590 computer program Methods 0.000 description 7
- 230000008901 benefit Effects 0.000 description 6
- 230000008569 process Effects 0.000 description 5
- 230000006870 function Effects 0.000 description 4
- 238000012545 processing Methods 0.000 description 4
- 230000009471 action Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 230000002035 prolonged effect Effects 0.000 description 2
- 230000004075 alteration Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 230000001172 regenerating effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/08—Non-scheduled access, e.g. ALOHA
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
- H04W12/04—Key management, e.g. using generic bootstrapping architecture [GBA]
- H04W12/041—Key generation or derivation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
- H04W12/06—Authentication
- H04W12/068—Authentication using credential vaults, e.g. password manager applications or one time password [OTP] applications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/002—Transmission of channel access control information
- H04W74/006—Transmission of channel access control information in the downlink, i.e. towards the terminal
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a node data transmission method, a node data transmission device, electronic equipment and a storage medium, which are used for solving the technical problems of low fairness of node channel competition and low overall efficiency of data transmission caused by unordered competition in the existing node data transmission mode. The method comprises the following steps: the gateway generates a random check code and sends the random check code to a plurality of communication nodes; the communication node searches candidate additional codes through a preset searching strategy and acquires corresponding node data; the communication node generates a first check value by adopting the candidate additional code and the node data, and checks the first check value by adopting the random check code; the communication node continuously monitors whether a wireless channel of the gateway is in an idle state or not before checking and passing, if so, node data and candidate additional codes are sent to the gateway; the gateway generates a second check value by adopting the node data and the candidate additional codes, and checks the second check value by adopting the random check code so as to judge whether the node data is successfully received.
Description
Technical Field
The present invention relates to the field of wireless transmission technologies, and in particular, to a method and apparatus for transmitting node data, an electronic device, and a storage medium.
Background
With the popularization of the internet of things and wireless sensor networks, a large number of sensors or terminals of the internet of things need to send collected data to a gateway, and data transmission is generally performed in a wireless mode. Because of the nature of the wireless channel, the same channel allows only one node to transmit data at a time, otherwise collisions will occur. To avoid channel collisions, the usage of the channels is allocated between the terminal and the gateway by means of a communication protocol. In a classical channel contention protocol, each node continuously listens to a channel, once the channel is idle, each node randomly sets a back-off time, after the back-off time arrives, if the channel is still idle, the node starts to send data to the channel, and the node which is sent first obtains the usage right of the channel. If the channel is occupied before the back-off time arrives, waiting for the next channel to be idle and re-competing. The back-off time of each node is a random value from 0to T, ideally the longest back-off time T of each node is equal, and the randomness of the random number generator should be balanced, i.e. the probability of generating any number between 0-T is equal.
However, with the development of marketization, the nodes such as the sensor or the terminal of the internet of things may belong to different benefit groups, the gateway calculates the workload according to the condition acquaintanceship of the collected data of each node, and more timely data are crossed, more benefits or incentives can be obtained. In classical protocols, since the back-off time is determined by each node itself, in order to increase the probability of acquiring a channel in order to obtain greater benefit, a certain population of interest may privately decrease the value of the longest back-off time T or modify the randomness of the random number generator so that the probability of generating a small number of values is greater. Reducing the randomness of the T or modifying the random number generator increases the channel collision probability, and all data is retransmitted once collisions occur. The problem of low fairness of node channel competition and the possibility of reducing the overall efficiency of data transmission exists in the scheme because the benefit group cannot be guaranteed not to reduce T or modify the randomness of the random number generator.
Disclosure of Invention
The invention provides a node data transmission method, a node data transmission device, electronic equipment and a storage medium, which are used for solving the technical problems that node channel competition is low in fairness and the overall efficiency of data transmission is possibly reduced in the existing node data transmission mode.
The invention provides a node data transmission method which is applied to a wireless transmission system, wherein the wireless transmission system comprises a gateway and a plurality of communication nodes; the method comprises the following steps:
The gateway generates a random check code and sends the random check code to a plurality of communication nodes;
The communication node searches candidate additional codes through a preset searching strategy and acquires corresponding node data; the preset searching strategy comprises random searching, sequential searching and binary searching;
the communication node generates a first check value by adopting a candidate additional code and the node data, and checks the first check value by adopting the random check code; if the verification is not passed, returning to the step of searching candidate additional codes by the communication node through a preset searching strategy;
The communication node continuously monitors whether a wireless channel of the gateway is in an idle state or not before checking, if not, the communication node stops searching the candidate additional codes, and if so, the communication node sends the node data and the candidate additional codes to the gateway;
And the gateway generates a second check value by adopting the node data and the candidate additional codes, and checks the second check value by adopting the random check code so as to judge whether the node data is successfully received.
Optionally, the step of verifying the first verification value by using the random verification code includes:
Judging whether the random check code is the same as the first check value or not;
and if the first check values are the same, judging that the first check values pass the check.
Optionally, the step of generating a second check value by the gateway using the node data and the candidate additional code, and checking the second check value by using the random check code to determine whether the node data is successfully received includes:
the gateway generates a second check value by adopting the node data and the candidate additional codes, and judges whether the random check code is equal to the second check value or not;
If not, discarding the node data and the candidate additional codes, returning to the gateway to generate random check codes, and respectively transmitting the random check codes to a plurality of communication nodes;
If yes, judging that the node data is successfully received, returning to the gateway to generate a random check code, and respectively sending the random check code to a plurality of communication nodes.
Optionally, the method further comprises:
the gateway continuously monitors whether the wireless channel triggers a conflict state or not;
when the conflict state of the wireless channel accumulated triggering preset times is monitored within the preset time, the length of the random check code is increased;
And reducing the length of the random check code when the continuous preset times do not trigger the conflict state to complete channel competition.
The invention also provides a node data transmission device which is applied to a wireless transmission system, wherein the wireless transmission system comprises a gateway and a plurality of communication nodes; the gateway comprises:
The random check code generation module is used for generating a random check code and transmitting the random check code to a plurality of communication nodes;
The communication node includes:
The candidate additional code generation module is used for searching the candidate additional codes through a preset searching strategy and acquiring corresponding node data; the preset searching strategy comprises random searching, sequential searching and binary searching;
the first check value checking module is used for generating a first check value by adopting the candidate additional codes and the node data, and checking the first check value by adopting the random check codes; if the verification is not passed, returning to the step of searching candidate additional codes by the communication node through a preset searching strategy;
The data sending module is used for continuously monitoring whether the wireless channel of the gateway is in an idle state or not before checking is passed, if not, stopping searching the candidate additional codes, and if so, sending the node data and the candidate additional codes to the gateway;
The gateway further comprises:
and the second check value checking module is used for generating a second check value by adopting the node data and the candidate additional codes, and checking the second check value by adopting the random check code so as to judge whether the node data is successfully received.
Optionally, the first check value checking module includes:
the first judging submodule is used for judging whether the random check code is the same as the first check value or not;
And the first judging submodule is used for judging that the first check value passes the check if the first check value passes the check.
Optionally, the second check value checking module includes:
A second judging sub-module, configured to generate a second check value by using the node data and the candidate additional code, and judge whether the random check code is equal to the second check value;
a return sub-module, configured to discard the node data and the candidate additional codes if not, return to the gateway to generate a random check code, and send the random check code to a plurality of communication nodes respectively;
And the second judging submodule is used for judging that the node data is successfully received if yes, returning to the step of generating random check codes by the gateway and respectively transmitting the random check codes to a plurality of communication nodes.
Optionally, the gateway further comprises:
the monitoring module is used for continuously monitoring whether the wireless channel triggers a conflict state or not;
the random check code adjusting module is used for increasing the length of the random check code when the conflict state of the wireless channel accumulated triggering preset times is monitored within preset time;
And reducing the length of the random check code when the continuous preset times do not trigger the conflict state to complete channel competition.
The invention also provides an electronic device comprising a processor and a memory:
The memory is used for storing program codes and transmitting the program codes to the processor;
the processor is configured to perform the node data transmission method according to any of the above claims according to instructions in the program code.
The present invention also provides a computer readable storage medium for storing program code for performing a node data transmission method as claimed in any one of the above.
From the above technical scheme, the invention has the following advantages: in the invention, the gateway can send random check codes by a plurality of communication nodes, the communication nodes can generate candidate additional codes after receiving the random check codes, and the candidate additional codes and node data are adopted to generate a first check value; the communication node whose first check value is checked by the random check code may transmit node data to the gateway through the wireless channel. Because the random check code is generated by the gateway, each communication node can not adjust the generation probability of the candidate additional code meeting the requirement, thereby ensuring the fairness of node channel competition and improving the overall efficiency of data transmission.
Drawings
In order to more clearly illustrate the embodiments of the invention or the technical solutions of the prior art, the drawings which are used in the description of the embodiments or the prior art will be briefly described, it being obvious that the drawings in the description below are only some embodiments of the invention, and that other drawings can be obtained from these drawings without inventive faculty for a person skilled in the art.
Fig. 1 is a flowchart of steps of a method for transmitting node data according to an embodiment of the present invention;
fig. 2 is a flow chart of a method for transmitting node data according to an embodiment of the present invention;
fig. 3 is a schematic structural diagram of a node data transmission device according to an embodiment of the present invention.
Detailed Description
The embodiment of the invention provides a node data transmission method, a device, electronic equipment and a storage medium, which are used for solving the technical problems that node channel competition fairness is low and the overall efficiency of data transmission is possibly reduced in the existing node data transmission mode.
In order to make the objects, features and advantages of the present invention more comprehensible, the technical solutions in the embodiments of the present invention are described in detail below with reference to the accompanying drawings, and it is apparent that the embodiments described below are only some embodiments of the present invention, but not all embodiments of the present invention. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
Referring to fig. 1, fig. 1 is a flowchart illustrating steps of a method for transmitting node data according to an embodiment of the present invention.
The invention provides a node data transmission method, which is applied to a wireless transmission system, wherein the wireless transmission system comprises a gateway and a plurality of communication nodes; the method specifically comprises the following steps:
step 101, a gateway generates a random check code and sends the random check code to a plurality of communication nodes;
in the embodiment of the invention, when the wireless channel of the gateway is in an idle state, the gateway can randomly generate the random check code with a specific length and broadcast the random check code to each communication node to start channel competition.
Step 102, the communication node searches candidate additional codes through a preset searching strategy and acquires corresponding node data; the preset searching strategy comprises random searching, sequential searching and binary searching;
Step 103, the communication node generates a first check value by adopting the candidate additional code and the node data, and checks the first check value by adopting the random check code; if the verification is not passed, returning to the step of searching candidate additional codes by the communication node through a preset searching strategy;
After each communication node receives the random check code, the candidate additional code is repeatedly searched according to the node data which is required to be sent, and the first check value of the node data and the candidate additional code is calculated. And the random check code is adopted to check the first check value. To screen the passing nodes meeting the node data transmission requirement.
In one example, the first check value may be calculated by the following formula:
H'＝right(hash(D,A),len(H))
Wherein H' is a first check value, D is node data, A is a candidate additional code, and H is a random check code.
The generation of the candidate additional codes may be random generation, sequential generation, interval generation, or the like, and each node may freely select a generation method of the candidate additional codes according to needs, which is not particularly limited in the embodiment of the present invention.
In one example, the step of verifying the first verification value using a random verification code may include the sub-steps of:
s31, judging whether the random check code is the same as the first check value;
S32, if the first check value passes the check, judging that the first check value passes the check.
In a specific implementation, whether the first check value passes the check may be determined by whether the random check code and the first check value are the same. If a certain communication node first finds out a candidate additional code meeting the requirement, the communication node competes for the use right of the wireless channel of the gateway.
104, The communication node continuously monitors whether a wireless channel of the gateway is in an idle state before checking, if not, the communication node stops searching candidate additional codes, and if so, node data and the candidate additional codes are sent to the gateway;
After a communication node passes the verification of the random verification code, whether the wireless channel of the gateway is in an idle state currently can be monitored, if yes, node data and candidate additional codes enabling the first verification value to pass the verification are sent to the gateway through the wireless channel, and the candidate additional codes are used for verifying the transmission integrity and the compliance of the node data. The compliance of node data transmission refers to the condition that node data needs to meet the data transmission through a wireless channel after the first check value passes the check of the random check code.
When the communication node monitors that the wireless channel is not in the idle state, the communication node characterizes that the wireless channel is occupied by a certain communication node, and if the communication node fails in the channel competition of the round, the candidate additional code is stopped to be searched, and the next round of channel competition is waited to start.
In addition, if two communication nodes simultaneously calculate candidate additional codes satisfying the node data transmission conditions and transmit the node data, channel collision occurs, and the data transmission is invalid in this round. In order to reduce the influence of the collision condition on the data transmission, each communication node and the gateway can monitor the wireless channel continuously, when the occurrence of the collision is monitored, the communication node which generates the collision can immediately pause the node data transmission, and the gateway can restart the channel competition after the wireless channel is recovered to be idle.
And 105, the gateway generates a second check value by adopting the node data and the candidate additional codes, and checks the second check value by adopting the random check code so as to judge whether the node data is successfully received.
The gateway receives the node data and the candidate additional codes, generates a second check value by adopting the node data and the candidate additional codes, checks the second check value by adopting the random check code, and if the check is passed, the gateway indicates that the data transmission is successful.
In one example, the step of the gateway generating the second check value using the node data and the candidate additional code and checking the second check value using the random check code to determine whether the node data was received successfully may include the sub-steps of:
S51, the gateway generates a second check value by adopting the node data and the candidate additional codes, and judges whether the random check code is equal to the second check value;
s52, if not, discarding the node data and the candidate additional codes, returning to the gateway to generate random check codes, and respectively transmitting the random check codes to a plurality of communication nodes;
And S53, if yes, judging that the node data is successfully received, returning to the step of generating random check codes by the gateway, and respectively transmitting the random check codes to a plurality of communication nodes.
In the embodiment of the invention, if the second check value is the same as the random check code, the node data is represented to be successfully received, and the next round of wireless channel competition can be entered. If the second check value is different from the random check code, the candidate additional code is not qualified or the node data transmission of the communication node is incomplete, and the node data should be discarded. And re-transmitting the random check code to the communication node, and starting wireless channel competition.
In the embodiment of the invention, the method can further comprise the following steps: the gateway continuously monitors whether the wireless channel triggers a conflict state or not; when a conflict state of the wireless channel accumulated triggering preset times is monitored within preset time, increasing the length of the random check code; and when the continuous preset times do not trigger the conflict state to complete channel competition, reducing the length of the random check code.
In a specific implementation, the length of the random check code can influence the channel utilization rate and the collision probability, when the length of the random check code is prolonged, the difficulty of searching candidate additional codes by each communication node can be increased, the average searching time is prolonged, and the channel utilization rate is reduced; when the length of the random check code is shortened, the difficulty of searching for the random additional code by each communication node is reduced, the average searching time is shortened, and the probability of collision is increased. Therefore, the embodiment of the invention can adaptively adjust the length of the check code through the channel competition condition. When the conflict of the preset times occurs in the preset time, the number of the current competitors is more, the competition is more intense, the competition difficulty is increased, the conflict probability is reduced, and the gateway can increase the length of the random check code. When the channel competition is completed for the preset times in continuous collision-free mode, the number of the current competitors is small, the competition is stable, the competition difficulty can be reduced, the channel competition efficiency is improved, and the gateway can reduce the length of the random check code.
In the invention, the gateway can send random check codes to a plurality of communication nodes, and after receiving the random check codes, the communication nodes can search candidate additional codes through a preset strategy and generate a first check value by adopting the candidate additional codes and node data; the communication node whose first check value is checked by the random check code may transmit node data to the gateway through the wireless channel. Because the random check code is generated by the gateway, each communication node can not adjust the generation probability of the candidate additional code meeting the requirement, thereby ensuring the fairness of node channel competition and improving the overall efficiency of data transmission.
For ease of understanding, embodiments of the present invention are described below by way of specific examples:
Referring to fig. 2, fig. 2 is a flow chart of a method for transmitting node data according to an embodiment of the present invention.
As shown in fig. 2, the gateway communicates with the communication nodes 1-N via wireless channels. When the gateway monitors that the wireless channel is in an idle state, the gateway randomly generates a random check code H with the length of L and respectively sends the random check code H to the communication nodes 1-N.
Taking the communication node 1 as an example, after receiving the random check code H, the communication node 1 determines the node data D to be transmitted, generates the candidate additional code a, calculates a first check value H ' by adopting the node data D and the candidate additional code a, compares the first check value H ' with the random check code H, and if the first check value H ' is the same with the random check code H, transmits the node data D and the candidate additional code to the gateway through an idle wireless channel. If not, monitoring whether the wireless channel is idle, if so, continuously regenerating candidate additional codes and continuously performing channel competition. If the wireless channel is not idle, the other communication nodes are characterized to obtain the use right of the wireless channel.
After receiving the node data D and the candidate additional codes A sent by the communication node, the gateway calculates a second check value H by adopting the node data D and the candidate additional codes A, compares the random check code H with the second check value H, and if the random check code H and the second check value H are the same, represents successful node data reception and enters the next round of wireless channel competition. If the data is different, the node data is represented to be failed to be received, and the next round of wireless channel competition is entered.
In the wireless channel competition process, the gateway monitors the wireless channel continuously. And when the channel competition times of continuous collision-free completion reach the preset times, reducing the generation length L of the random check code H. And when the number of times of accumulated channel conflict reaches the preset number of times, increasing the generation length L of the random check code H.
Referring to fig. 3, fig. 3 is a schematic structural diagram of a node data transmission device according to an embodiment of the present invention.
The embodiment of the invention provides a node data transmission device which is characterized by being applied to a wireless transmission system, wherein the wireless transmission system comprises a gateway and a plurality of communication nodes; the gateway comprises:
a random check code generating module 301, configured to generate a random check code, and send the random check code to a plurality of communication nodes;
the communication node includes:
The candidate additional code generating module 302 is configured to search for candidate additional codes through a preset searching policy, and obtain corresponding node data; the preset searching strategy comprises random searching, sequential searching and binary searching;
The first check value checking module 303 is configured to generate a first check value by using the candidate additional code and the node data, and check the first check value by using a random check code; if the verification is not passed, returning to the step of searching candidate additional codes by the communication node through a preset searching strategy;
the data sending module 304 is configured to continuously monitor whether a wireless channel of the gateway is in an idle state before checking, if not, stop searching for the candidate additional code, and if yes, send node data and the candidate additional code to the gateway;
The gateway further comprises:
the second check value checking module 305 is configured to generate a second check value by using the node data and the candidate additional code, and check the second check value by using the random check code, so as to determine whether the node data is successfully received.
In the embodiment of the present invention, the first check value checking module 303 includes:
The first judging submodule is used for judging whether the random check code is the same as the first check value or not;
And the first judging sub-module is used for judging that the first check value passes the check if the first check value passes the check.
In an embodiment of the present invention, the second check value checking module 305 includes:
the second judging submodule is used for generating a second check value by adopting the node data and the candidate additional codes and judging whether the random check code is equal to the second check value or not;
Returning to the sub-module, if not, discarding the node data and the candidate additional codes, returning to the gateway to generate random check codes, and respectively transmitting the random check codes to the plurality of communication nodes;
and the second judging submodule is used for judging that the node data is successfully received if yes, returning to the gateway to generate random check codes, and respectively transmitting the random check codes to a plurality of communication nodes.
In an embodiment of the present invention, the gateway further includes:
The monitoring module is used for continuously monitoring whether the wireless channel triggers a conflict state or not;
the random check code adjusting module is used for increasing the length of the random check code when the conflict state of the wireless channel accumulated triggering preset times is monitored in the preset time;
and when the continuous preset times do not trigger the conflict state to complete channel competition, reducing the length of the random check code.
The embodiment of the invention also provides electronic equipment, which comprises a processor and a memory:
The memory is used for storing the program codes and transmitting the program codes to the processor;
The processor is configured to execute the node data transmission method according to the embodiment of the present invention according to the instructions in the program code.
The embodiment of the invention also provides a computer readable storage medium, which is used for storing program codes, and the program codes are used for executing the node data transmission method of the embodiment of the invention.
It will be clear to those skilled in the art that, for convenience and brevity of description, specific working procedures of the above-described systems, apparatuses and units may refer to corresponding procedures in the foregoing method embodiments, which are not repeated herein.
In this specification, each embodiment is described in a progressive manner, and each embodiment is mainly described by differences from other embodiments, and identical and similar parts between the embodiments are all enough to be referred to each other.
It will be apparent to those skilled in the art that embodiments of the present invention may be provided as a method, apparatus, or computer program product. Accordingly, embodiments of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, embodiments of the invention may take the form of a computer program product on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) having computer-usable program code embodied therein.
Embodiments of the present invention are described with reference to flowchart illustrations and/or block diagrams of methods, terminal devices (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing terminal device to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing terminal device, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
While preferred embodiments of the present invention have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. It is therefore intended that the following claims be interpreted as including the preferred embodiment and all such alterations and modifications as fall within the scope of the embodiments of the invention.
Finally, it is further noted that relational terms such as first and second, and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Moreover, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or terminal that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or terminal. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article, or terminal device that comprises the element.
The above embodiments are only for illustrating the technical solution of the present invention, and not for limiting the same; although the invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the present invention.
Claims (9)
1. A node data transmission method, characterized by being applied to a wireless transmission system, the wireless transmission system comprising a gateway and a plurality of communication nodes; the method comprises the following steps:
The gateway generates a random check code and sends the random check code to a plurality of communication nodes;
The communication node searches candidate additional codes through a preset searching strategy and acquires corresponding node data; the preset searching strategy comprises random searching, sequential searching and binary searching;
the communication node generates a first check value by adopting a candidate additional code and the node data, and checks the first check value by adopting the random check code; if the verification is not passed, returning to the step of searching candidate additional codes by the communication node through a preset searching strategy;
The communication node continuously monitors whether a wireless channel of the gateway is in an idle state or not before checking, if not, the communication node stops searching the candidate additional codes, and if so, the communication node sends the node data and the candidate additional codes to the gateway;
And the gateway generates a second check value by adopting the node data and the candidate additional codes, and checks the second check value by adopting the random check code so as to judge whether the node data is successfully received.
2. The method of claim 1, wherein the step of verifying the first verification value using the random verification code comprises:
Judging whether the random check code is the same as the first check value or not;
and if the first check values are the same, judging that the first check values pass the check.
3. The method of claim 1, wherein the step of the gateway generating a second check value using the node data and the candidate additional code and checking the second check value using the random check code to determine whether the node data was received successfully comprises:
the gateway generates a second check value by adopting the node data and the candidate additional codes, and judges whether the random check code is equal to the second check value or not;
If not, discarding the node data and the candidate additional codes, returning to the gateway to generate random check codes, and respectively transmitting the random check codes to a plurality of communication nodes;
If yes, judging that the node data is successfully received, returning to the gateway to generate a random check code, and respectively sending the random check code to a plurality of communication nodes.
4. The method as recited in claim 1, further comprising:
the gateway continuously monitors whether the wireless channel triggers a conflict state or not;
when the conflict state of the wireless channel accumulated triggering preset times is monitored within the preset time, the length of the random check code is increased;
And reducing the length of the random check code when the continuous preset times do not trigger the conflict state to complete channel competition.
5. A wireless transmission system, the wireless transmission system comprising a gateway and a plurality of communication nodes; the gateway comprises:
The random check code generation module is used for generating a random check code and transmitting the random check code to a plurality of communication nodes;
The communication node includes:
The candidate additional code generation module is used for searching the candidate additional codes through a preset searching strategy and acquiring corresponding node data; the preset searching strategy comprises random searching, sequential searching and binary searching;
the first check value checking module is used for generating a first check value by adopting the candidate additional codes and the node data, and checking the first check value by adopting the random check codes; if the verification is not passed, returning to the step of searching candidate additional codes by the communication node through a preset searching strategy;
The data sending module is used for continuously monitoring whether the wireless channel of the gateway is in an idle state or not before checking is passed, if not, stopping searching the candidate additional codes, and if so, sending the node data and the candidate additional codes to the gateway;
The gateway further comprises:
and the second check value checking module is used for generating a second check value by adopting the node data and the candidate additional codes, and checking the second check value by adopting the random check code so as to judge whether the node data is successfully received.
6. The wireless transmission system of claim 5, wherein the first check value checking module comprises:
the first judging submodule is used for judging whether the random check code is the same as the first check value or not;
And the first judging submodule is used for judging that the first check value passes the check if the first check value passes the check.
7. The wireless transmission system of claim 5, wherein the second check value checking module comprises:
A second judging sub-module, configured to generate a second check value by using the node data and the candidate additional code, and judge whether the random check code is equal to the second check value;
a return sub-module, configured to discard the node data and the candidate additional codes if not, return to the gateway to generate a random check code, and send the random check code to a plurality of communication nodes respectively;
And the second judging submodule is used for judging that the node data is successfully received if yes, returning to the step of generating random check codes by the gateway and respectively transmitting the random check codes to a plurality of communication nodes.
8. The wireless transmission system of claim 5, wherein the gateway further comprises:
the monitoring module is used for continuously monitoring whether the wireless channel triggers a conflict state or not;
the random check code adjusting module is used for increasing the length of the random check code when the conflict state of the wireless channel accumulated triggering preset times is monitored within preset time;
And reducing the length of the random check code when the continuous preset times do not trigger the conflict state to complete channel competition.
9. A computer readable storage medium for storing program code for performing the node data transmission method of any one of claims 1-4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210510672.1A CN114916089B (en) | 2022-05-11 | 2022-05-11 | Node data transmission method, wireless transmission system and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210510672.1A CN114916089B (en) | 2022-05-11 | 2022-05-11 | Node data transmission method, wireless transmission system and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114916089A CN114916089A (en) | 2022-08-16 |
| CN114916089B true CN114916089B (en) | 2024-05-28 |
Family
ID=82767273
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210510672.1A Active CN114916089B (en) | 2022-05-11 | 2022-05-11 | Node data transmission method, wireless transmission system and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114916089B (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101083588A (en) * | 2007-06-22 | 2007-12-05 | 清华大学 | Reinforced distribution channel accessing accommodation controlling means based on channel temporal classification |
| CN103096327A (en) * | 2013-01-08 | 2013-05-08 | 河南工业大学 | Vehicle-mounted ad hoc network self-adaptive time slot distributing method based on a time division multiple address (TDMA) |
| KR20130137540A (en) * | 2012-06-07 | 2013-12-17 | 주식회사 케이티 | Method for connecting wireless channel and apparatus for performing the method |
| CN105592564A (en) * | 2015-08-12 | 2016-05-18 | 中山大学 | Self-adaptive access mechanism based on active node estimation in wireless Mesh network |
| CN105850078A (en) * | 2014-03-28 | 2016-08-10 | 华为技术有限公司 | Channel access control method and apparatus, and related device |
| CN106507496A (en) * | 2016-11-01 | 2017-03-15 | 北京邮电大学 | Based on MAC protocol implementation method and device that energy state adjusts competition probability |
| WO2020146726A1 (en) * | 2019-01-10 | 2020-07-16 | Apple Inc. | Fallback procedure for 2-step rach |
| CN113543359A (en) * | 2020-12-21 | 2021-10-22 | 南方电网数字电网研究院有限公司 | Data transmission method, device, system and storage medium based on channel competition |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP4421459B2 (en) * | 2004-11-30 | 2010-02-24 | 株式会社東芝 | Wireless communication apparatus and wireless communication method |
| US7801104B2 (en) * | 2006-10-26 | 2010-09-21 | Hitachi, Ltd. | System and method for reducing packet collisions in wireless local area networks |
-
2022
- 2022-05-11 CN CN202210510672.1A patent/CN114916089B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101083588A (en) * | 2007-06-22 | 2007-12-05 | 清华大学 | Reinforced distribution channel accessing accommodation controlling means based on channel temporal classification |
| KR20130137540A (en) * | 2012-06-07 | 2013-12-17 | 주식회사 케이티 | Method for connecting wireless channel and apparatus for performing the method |
| CN103096327A (en) * | 2013-01-08 | 2013-05-08 | 河南工业大学 | Vehicle-mounted ad hoc network self-adaptive time slot distributing method based on a time division multiple address (TDMA) |
| CN105850078A (en) * | 2014-03-28 | 2016-08-10 | 华为技术有限公司 | Channel access control method and apparatus, and related device |
| CN105592564A (en) * | 2015-08-12 | 2016-05-18 | 中山大学 | Self-adaptive access mechanism based on active node estimation in wireless Mesh network |
| CN106507496A (en) * | 2016-11-01 | 2017-03-15 | 北京邮电大学 | Based on MAC protocol implementation method and device that energy state adjusts competition probability |
| WO2020146726A1 (en) * | 2019-01-10 | 2020-07-16 | Apple Inc. | Fallback procedure for 2-step rach |
| CN113543359A (en) * | 2020-12-21 | 2021-10-22 | 南方电网数字电网研究院有限公司 | Data transmission method, device, system and storage medium based on channel competition |
Non-Patent Citations (3)
| Title |
|---|
| IEEE802.11 DCF退避机制公平性分析与改进;裴冬冬;《通信与网络》;20110516;全文 * |
| Qos-Based Adaptive Contention/Reservation Medium Access Control Protocols for wireless Local Area Networks;Jia-Shi Lin;《IEEE Transactions on Mobile Computing》;20221024;全文 * |
| 无线Mesh网络多信道MAC机制的研究;罗正正;《CNKI硕士论文电子期刊》;20110415;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114916089A (en) | 2022-08-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103858510B (en) | For making multiple equipment can the method and apparatus of shared data transmission period | |
| AU2012292689B2 (en) | Data transmission method and device for uplink short-latency communication | |
| KR102134417B1 (en) | Communication method of an access point and a terminal for retransmission of multicast packet in a network including access point and a plurality of terminals | |
| CN103856578B (en) | The automatic acquisition station address approach of Modbus RTU slave stations and slave station | |
| JP2015534360A5 (en) | ||
| US20230030664A1 (en) | Communication method and apparatus | |
| WO2016184219A1 (en) | Method and device for sharing unauthorized frequency spectrum | |
| CN113692060B (en) | Method for configuring and updating random access resources in multi-antenna MIMO scene | |
| CN114916089B (en) | Node data transmission method, wireless transmission system and storage medium | |
| CN113613345A (en) | Zigbee star networking-based safety condition informatization monitoring method | |
| CN103595552B (en) | Analysis method and analysis system for cluster storage network parallel load | |
| Chen et al. | A delayed random access speed-up scheme for group paging in machine-type communications | |
| CN106550481B (en) | wireless network medium access control layer access method and system based on competition | |
| WO2004084493A1 (en) | Technique for optimizing backoff for a shared resource | |
| US20130205012A1 (en) | Apparatus and method for transmitting node discovery messages | |
| CN111093291B (en) | TDMA ad hoc network, construction method thereof, node and storage medium | |
| CN111586644B (en) | Multi-node anti-collision method and device based on narrow-band communication of Internet of things | |
| CN107926061B (en) | Back-off method, message transmission method and device | |
| US11924882B2 (en) | Method and apparatus for providing non-scheduled network access | |
| CN107371216B (en) | Token subnet site access method and device | |
| CN114079543B (en) | Feedback method, system and terminal for hybrid automatic repeat request | |
| CN113597012B (en) | Anti-collision method for transceiving intensive narrowband wireless long-distance communication | |
| CN110996392B (en) | Channel access control method and device and electronic equipment | |
| CN112261703B (en) | Cross-protocol opportunistic routing method and device, electronic equipment and storage medium | |
| CN114143300B (en) | Transaction request sending 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 |