CN114916089A - Node data transmission method and device, electronic equipment and storage medium - Google Patents

Node data transmission method and device, electronic equipment and storage medium Download PDF

Info

Publication number
CN114916089A
CN114916089A CN202210510672.1A CN202210510672A CN114916089A CN 114916089 A CN114916089 A CN 114916089A CN 202210510672 A CN202210510672 A CN 202210510672A CN 114916089 A CN114916089 A CN 114916089A
Authority
CN
China
Prior art keywords
code
check
node data
random
gateway
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
Application number
CN202210510672.1A
Other languages
Chinese (zh)
Other versions
CN114916089B (en
Inventor
洪超
匡晓云
许爱东
陈立明
蒋屹新
杨祎巍
张宇南
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China South Power Grid International Co ltd
China Southern Power Grid Co Ltd
Original Assignee
China South Power Grid International Co ltd
China Southern Power Grid Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by China South Power Grid International Co ltd, China Southern Power Grid Co Ltd filed Critical China South Power Grid International Co ltd
Priority to CN202210510672.1A priority Critical patent/CN114916089B/en
Publication of CN114916089A publication Critical patent/CN114916089A/en
Application granted granted Critical
Publication of CN114916089B publication Critical patent/CN114916089B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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 data transmission efficiency caused by disordered competition in the conventional 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 for the candidate additional codes through a preset search 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 a random check code; the communication node continuously monitors whether a wireless channel of the gateway is in an idle state before the communication node passes the verification, and if so, the communication node sends node data and a candidate additional code to the gateway; and the gateway generates a second check value by adopting the node data and the candidate additional code, and checks the second check value by adopting the random check code so as to judge whether the node data is successfully received.

Description

Node data transmission method and device, electronic equipment and storage medium
Technical Field
The present invention relates to the field of wireless transmission technologies, and in particular, to a node data transmission method and apparatus, 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 acquired data to a gateway, and data transmission is generally performed in a wireless manner. Due to the nature of the wireless channel, the same channel only allows one node to transmit data at the same time, otherwise collisions will occur. In order to avoid channel collisions, the use of the channels is allocated between the terminals and the gateways by means of a communication protocol. In the classical channel competition protocol, each node continuously monitors a channel, each node randomly sets a back-off time once the channel is idle, after the back-off time is up, if the channel is still idle, the node starts to send data to the channel, and the node which sends the data firstly obtains the use right of the channel. And if the channel is occupied before the back-off time is up, waiting for the next time that the channel is free and then carrying out re-competition. The back-off time of each node is a random value from 0 to 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, nodes such as sensors or internet of things terminals may belong to different interest groups, the gateway calculates the workload according to the data collection of each node, and more timely data collection is carried out, so that more benefits or more incentives can be obtained. In the classical protocol, since the back-off time is determined by each node, in order to improve the probability of obtaining a channel so as to obtain a greater benefit, a certain benefit group may privately reduce 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 is greater. Reducing T or modifying the randomness of the random number generator increases the probability of channel collisions, and once a collision occurs, all data is retransmitted. The above scheme has the problems of low fairness of node channel competition and possibly reducing the overall efficiency of data transmission because it cannot be guaranteed that the interest group does not reduce the randomness of the T or modify 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 the fairness of node channel competition is low and the overall efficiency of data transmission is possibly reduced in the conventional 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 the plurality of communication nodes;
the communication node searches candidate additional codes through a preset search strategy and acquires corresponding node data; the preset search strategy comprises random search, sequential search and binary search;
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 that the communication node searches the candidate additional codes through a preset searching strategy;
the communication node continuously monitors whether a wireless channel of the gateway is in an idle state before the check is passed, if not, the communication node stops searching for the candidate additional code, and if so, the communication node sends the node data and the candidate additional code to the gateway;
and the gateway generates a second check value by adopting the node data and the candidate additional code, 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 check value by using the random check code includes:
judging whether the random check code is the same as the first check value;
and if the first check value is the same as the second check value, judging that the first check value passes the check.
Optionally, the step of generating, by the gateway, a second check value by 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 code, and judges whether the random check code is equal to the second check value;
if not, discarding the node data and the candidate additional codes, returning to the gateway to generate random check codes, and respectively sending the random check codes to the plurality of communication nodes;
and if so, 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 the plurality of communication nodes.
Optionally, the method further comprises:
the gateway continuously monitors whether the wireless channel triggers a conflict state;
when a conflict state of the wireless channel which is triggered by accumulating for a preset number of times is monitored in a preset time, increasing the length of the random check code;
and when the continuous preset times do not trigger the conflict state to complete the channel competition, reducing the length of the random check code.
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 includes:
the random check code generating module is used for generating a random check code and sending the random check code to the plurality of communication nodes;
the communication node comprises:
the candidate additional code generation module is used for searching candidate additional codes through a preset searching strategy and acquiring corresponding node data; the preset search strategy comprises random search, sequential search and binary search;
the first check value checking module is used for generating a first check value by adopting a candidate additional code and the node data and checking the first check value by adopting the random check code; if the verification fails, returning to the step that the communication node searches the candidate additional codes through a preset searching strategy;
the data sending module is used for continuously monitoring whether a wireless channel of the gateway is in an idle state before the check is passed, if not, stopping searching the candidate additional code, and if so, sending the node data and the candidate additional code to the gateway;
the gateway further comprises:
and the second check value check module is used for generating a second check value by adopting the node data and the candidate additional code, 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 judgment submodule is used for judging whether the random check code is the same as the first check value or not;
and the first judgment submodule is used for judging that the first check value passes the check if the first check value is the same as the first check value.
Optionally, the second check value checking module includes:
a second judgment 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 code if the node data and the candidate additional code are not received, return to the gateway to generate a random check code, and send the random check code to the plurality of communication nodes, respectively;
and the second judging submodule is used for judging that the node data is successfully received if the node data is successfully received, returning to the gateway to generate random check codes and respectively sending the random check codes to the communication nodes.
Optionally, the gateway further comprises:
the monitoring module is used for continuously monitoring whether the wireless channel triggers a conflict state;
the random check code adjusting module is used for increasing the length of the random check code when a conflict state of the wireless channel accumulated triggering preset times is monitored in preset time;
and when the continuous preset times do not trigger the conflict state to complete the channel competition, reducing the length of the random check code.
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 execute the node data transmission method according to any one of the above instructions in the program code.
The present invention also provides a computer-readable storage medium for storing a program code for executing the node data transmission method as described in any one of the above.
According to the technical scheme, the invention has the following advantages: in the invention, the gateway can send the random check code by a plurality of communication nodes, the communication nodes can generate candidate additional codes after receiving the random check code, and the candidate additional codes and the 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 the 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 requirements, 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 present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to these drawings without inventive exercise.
Fig. 1 is a flowchart illustrating steps of a node data transmission method according to an embodiment of the present invention;
fig. 2 is a schematic flowchart of a node data transmission method according to an embodiment of the present invention;
fig. 3 is a schematic structural diagram of a node data transmission apparatus according to an embodiment of the present invention.
Detailed Description
Embodiments of the present invention provide a node data transmission method, an apparatus, an electronic device, and a storage medium, which are used to solve the technical problems that an existing node data transmission method has low fairness of node channel competition and may reduce overall efficiency of data transmission.
In order to make the objects, features and advantages of the present invention more obvious and understandable, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention, and it is obvious that the embodiments described below are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Referring to fig. 1, fig. 1 is a flowchart illustrating 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 may specifically comprise the steps of:
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, broadcast the random check code to each communication node and start channel competition.
Step 102, a communication node searches for candidate additional codes through a preset search strategy and acquires corresponding node data; the preset search strategy comprises random search, sequential search and binary search;
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 a random check code; if the verification fails, returning to the step that the communication node searches the candidate additional codes through a preset searching strategy;
after each communication node receives the random check code, the communication node continuously and repeatedly searches for the candidate additional code according to the node data needing to be sent, and calculates the node data and the first check value of the candidate additional code. And the first check value is checked by adopting a random check code. So as to screen the passing nodes meeting the data transmission requirements of the nodes.
In one example, the first check value may be calculated by the following formula:
H'＝right(hash(D,A),len(H))
wherein, H' is the first check value, D is the node data, A is the candidate additional code, H is the random check code.
The candidate additional codes may be generated randomly, sequentially, or at intervals, and each node may freely select a generation method of the candidate additional codes as needed, which is not specifically limited in the embodiment of the present invention.
In one example, the step of checking the first check value with a random check code may include the following sub-steps:
s31, judging whether the random check code is the same as the first check value;
and S32, if the first check value is the same, 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 communication node first finds a candidate additional code meeting the requirement, the communication node competes to obtain the use right of the wireless channel of the gateway.
Step 104, the communication node continuously monitors whether a wireless channel of the gateway is in an idle state before the communication node passes the verification, if not, the communication node stops searching for the candidate additional code, and if so, the communication node sends node data and the candidate additional code to the gateway;
after a communication node passes the check of the random check code, whether a wireless channel of the gateway is in an idle state at present can be monitored, if so, the node data and the candidate additional code which enables the first check value to pass the check are sent to the gateway through the wireless channel, and the candidate additional code is used for checking the transmission integrity and the compliance of the node data. The compliance of node data transmission refers to the condition that the node data needs to meet the condition that the first check value is checked by the random check code before data transmission is carried out through a wireless channel.
It should be noted that, when the communication node monitors that the wireless channel is not in the idle state, it indicates that the wireless channel is occupied by a certain communication node, and the communication node fails in the current round of channel contention, the communication node stops searching for the candidate additional code and waits for the next round of channel contention to be started.
In addition, if two communication nodes simultaneously calculate candidate additional codes meeting the node data transmission condition and send node data, channel collision occurs, and the data transmission in the current round is invalid. In order to reduce the influence of the conflict situation on data transmission, each communication node and the gateway can continuously monitor the wireless channel, when the conflict is monitored to be generated, the communication node which generates the conflict can immediately suspend the data transmission of the node, and the gateway can restart the channel competition after the wireless channel is restored to be idle.
And 105, the gateway generates a second check value by adopting the node data and the candidate additional code, and checks the second check value by adopting a random check code to judge whether the node data is successfully received.
And after receiving the node data and the candidate additional codes, the gateway can generate a second check value by adopting the node data and the candidate additional codes, check the second check value by adopting the random check code, and if the check is passed, represent that the data transmission is successful.
In one example, the step of generating, by the gateway, a second check value by 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 may include the following sub-steps:
s51, the gateway generates a second check value by adopting the node data and the candidate additional code, 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 sending 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 gateway to generate random check codes, and respectively sending the random check codes to the plurality of communication nodes.
In the embodiment of the present invention, if the second check value is the same as the random check code, the data reception of the characterization node is successful, and then the next round of wireless channel contention can be entered. If the second check value is different from the random check code, the characterization candidate additional code is not satisfactory or the node data transmission of the communication node is incomplete, and the node data should be discarded. And the random check code is sent to the communication node again, and the wireless channel competition is started.
In the embodiment of the present invention, the method may further include the following steps: the gateway continuously monitors whether the wireless channel triggers a conflict state; when a conflict state of the wireless channel which triggers the wireless channel for a preset number of times is monitored in a preset time, the length of the random check code is increased; and when the continuous preset times do not trigger the conflict state to complete the channel competition, reducing the length of the random check code.
In the specific implementation, the length of the random check code affects the channel utilization rate and the collision probability, when the length of the random check code is increased, the difficulty of searching candidate additional codes by each communication node is increased, the average searching time is increased, and the channel utilization rate is reduced; when the length of the random check code is shortened, the difficulty of searching 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 preset times of conflicts are accumulated within the preset time, the gateway represents that the number of current competitors is large, the competition is violent, the competition difficulty needs to be increased, the conflict probability is reduced, and the length of the random check code can be increased. When the channel competition of the preset times is finished continuously without conflict, the number of current competitors is small, the competition is stable, the competition difficulty can be reduced, the channel competition efficiency is improved, and the length of the random check code can be reduced by the gateway.
In the invention, the gateway can send the random check code to a plurality of communication nodes, after receiving the random check code, the communication nodes can search for 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 the 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 requirements, 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 flowchart illustrating a node data transmission method according to an embodiment of the present invention.
As shown in fig. 2, the gateway communicates with the correspondent nodes 1-N over a wireless channel. When monitoring 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 node data D to be sent, generates a candidate additional code a, calculates a first check value H 'by using the node data D and the candidate additional code a, compares the first check value H' with the random check code H, and sends the node data D and the candidate additional code to the gateway through an idle wireless channel if the first check value H 'is the same as the first check value H'. If not, monitoring whether the wireless channel is idle, if so, continuously regenerating the candidate additional code and continuously carrying out channel competition. If the wireless channel is not idle, the other communication nodes are characterized to obtain the use right of the wireless channel.
And after receiving the node data D and the candidate additional code A sent by the communication node, the gateway calculates a second check value H by adopting the node data D and the candidate additional code 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, indicates that the node data is successfully received and enters the next round of wireless channel competition. If the difference is not the same, the data reception of the characterization node fails, and the next round of wireless channel competition is entered.
In the competition process of the wireless channel, the gateway continuously monitors the wireless channel. And when the number of continuous conflict-free channel competition completion times reaches a preset number, reducing the generation length L of the random check code H. And when the accumulated times of channel collision reaches the preset 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 apparatus 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 includes:
a random check code generating module 301, configured to generate a random check code, and send the random check code to multiple communication nodes;
the communication node includes:
a candidate additional code generation module 302, configured to search for a candidate additional code through a preset search policy, and obtain corresponding node data; the preset search strategy comprises random search, sequential search and binary search;
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 fails, returning to the step that the communication node searches the candidate additional codes through a preset searching strategy;
a data sending module 304, configured to continuously monitor whether a wireless channel of the gateway is in an idle state before the check passes, if not, stop searching for the candidate additional code, and if so, send node data and the candidate additional code to the gateway;
the gateway further comprises:
and a second check value checking module 305, 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 to determine whether the node data is successfully received.
In this embodiment of the present invention, the first check value verifying module 303 includes:
the first judgment submodule is used for judging whether the random check code is the same as the first check value or not;
and the first judgment submodule is used for judging that the first check value passes the check if the first check value is the same as the first check value.
In this embodiment of the present invention, the second check value checking module 305 includes:
the second judgment 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;
a return sub-module, which is used for discarding the node data and the candidate additional code if the node data and the candidate additional code are not the same, returning to the gateway to generate the random check code, and respectively sending the random check code to a plurality of communication nodes;
and the second judging submodule is used for judging that the node data is successfully received if the node data is successfully received, returning to the gateway to generate random check codes and respectively sending the random check codes to the plurality of communication nodes.
In this 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;
the random check code adjusting module is used for increasing the length of a random check code when a conflict state of the wireless channel which is triggered by the accumulated preset times is monitored in the preset time;
and when the continuous preset times do not trigger the conflict state to complete the channel competition, reducing the length of the random check code.
An embodiment of the present invention further provides an electronic device, where the device includes 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 used for executing the node data transmission method according to the embodiment of the invention according to the instructions in the program codes.
The embodiment of the invention also provides a computer-readable storage medium, which is used for storing the program code, and the program code is used for executing the node data transmission method of the embodiment of the invention.
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.
The embodiments in the present specification are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments are referred to each other.
As will be appreciated by one skilled in the art, 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 present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) 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 flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams 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 to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing terminal, 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 terminal 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 terminal to cause a series of operational steps to be performed on the computer or other programmable terminal to produce a computer implemented process such that the instructions which execute on the computer or other programmable terminal 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 of these embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all such alterations and modifications as fall within the scope of the embodiments of the invention.
Finally, it should also be noted that, herein, relational terms such as first and second, and the like may be 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. Also, the terms "include", "including" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, article, or terminal device including a series of elements includes not only those elements but also other elements not explicitly listed or inherent to such process, method, article, or terminal device. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or terminal that comprises the element.
The above embodiments are only used to illustrate the technical solution of the present invention, and not to limit the same; although the present 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 solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.

Claims (10)

1. A node data transmission method 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 the plurality of communication nodes;
the communication node searches candidate additional codes through a preset search strategy and acquires corresponding node data; the preset search strategy comprises random search, sequential search and binary search;
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 fails, returning to the step that the communication node searches the candidate additional codes through a preset searching strategy;
the communication node continuously monitors whether a wireless channel of the gateway is in an idle state before the check is passed, if not, the communication node stops searching for the candidate additional code, and if so, the communication node sends the node data and the candidate additional code to the gateway;
and the gateway generates a second check value by adopting the node data and the candidate additional code, 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 checking the first check value with the random check code comprises:
judging whether the random check code is the same as the first check value;
and if the first check value is the same as the second check value, judging that the first check value passes the check.
3. The method as claimed in 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 is successfully received comprises:
the gateway generates a second check value by adopting the node data and the candidate additional code, and judges whether the random check code is equal to the second check value;
if not, discarding the node data and the candidate additional codes, returning to the gateway to generate random check codes, and respectively sending the random check codes to the plurality of communication nodes;
if yes, judging that the node data is successfully received, returning to the gateway to generate random check codes, and respectively sending the random check codes to the communication nodes.
4. The method of claim 1, further comprising:
the gateway continuously monitors whether the wireless channel triggers a conflict state;
when a conflict state of the wireless channel which is triggered by accumulating for a preset number of times is monitored in a preset time, increasing the length of the random check code;
and when the continuous preset times do not trigger the conflict state to complete the channel competition, reducing the length of the random check code.
5. A node data transmission device is applied to a wireless transmission system, wherein the wireless transmission system comprises a gateway and a plurality of communication nodes; the gateway includes:
the random check code generating module is used for generating a random check code and sending the random check code to the plurality of communication nodes;
the communication node comprises:
the candidate additional code generation module is used for searching candidate additional codes through a preset searching strategy and acquiring corresponding node data; the preset search strategy comprises random search, sequential search and binary search;
the first check value checking module is used for generating a first check value by adopting a candidate additional code and the node data and checking the first check value by adopting the random check code; if the verification fails, returning to the step that the communication node searches the candidate additional codes through a preset searching strategy;
the data sending module is used for continuously monitoring whether a wireless channel of the gateway is in an idle state before the check is passed, if not, stopping searching the candidate additional code, and if so, sending the node data and the candidate additional code to the gateway;
the gateway further comprises:
and the second check value check module is used for generating a second check value by adopting the node data and the candidate additional code, 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 apparatus of claim 5, wherein the first check value checking module comprises:
the first judgment submodule is used for judging whether the random check code is the same as the first check value or not;
and the first judgment submodule is used for judging that the first check value passes the check if the first check value is the same as the first check value.
7. The apparatus of claim 5, wherein the second parity check 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 submodule, configured to discard the node data and the candidate additional code if the node data and the candidate additional code are not received, return to the gateway to generate a random check code, and send the random check code to the plurality of communication nodes, respectively;
and the second judging submodule is used for judging that the node data is successfully received if the node data is successfully received, returning to the gateway to generate random check codes and respectively sending the random check codes to the communication nodes.
8. The apparatus of claim 5, wherein the gateway further comprises:
the monitoring module is used for continuously monitoring whether the wireless channel triggers a conflict state;
the random check code adjusting module is used for increasing the length of the random check code when a conflict state of the wireless channel accumulated triggering preset times is monitored in preset time;
and when the continuous preset times do not trigger the conflict state to complete the channel competition, reducing the length of the random check code.
9. 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 execute the node data transmission method according to any one of claims 1 to 4 according to instructions in the program code.
10. A computer-readable storage medium characterized in that the computer-readable storage medium is configured to store a program code for executing the node data transmission method according to any one of claims 1 to 4.
CN202210510672.1A 2022-05-11 2022-05-11 Node data transmission method, wireless transmission system and storage medium Active CN114916089B (en)

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 true CN114916089A (en) 2022-08-16
CN114916089B 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 (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060114928A1 (en) * 2004-11-30 2006-06-01 Yoriko Utsunomiya Wireless communication apparatus and wireless communication method
CN101083588A (en) * 2007-06-22 2007-12-05 清华大学 Reinforced distribution channel accessing accommodation controlling means based on channel temporal classification
US20080101308A1 (en) * 2006-10-26 2008-05-01 Hitachi, Ltd. System and method for reducing packet collisions in wireless local area networks
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

Patent Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060114928A1 (en) * 2004-11-30 2006-06-01 Yoriko Utsunomiya Wireless communication apparatus and wireless communication method
US20080101308A1 (en) * 2006-10-26 2008-05-01 Hitachi, Ltd. System and method for reducing packet collisions in wireless local area networks
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)

* Cited by examiner, † Cited by third party
Title
JIA-SHI LIN: "Qos-Based Adaptive Contention/Reservation Medium Access Control Protocols for wireless Local Area Networks", 《IEEE TRANSACTIONS ON MOBILE COMPUTING》, 24 October 2022 (2022-10-24) *
罗正正: "无线Mesh网络多信道MAC机制的研究", 《CNKI硕士论文电子期刊》, 15 April 2011 (2011-04-15) *
裴冬冬: "IEEE802.11 DCF退避机制公平性分析与改进", 《通信与网络》, 16 May 2011 (2011-05-16) *

Also Published As

Publication number Publication date
CN114916089B (en) 2024-05-28

Similar Documents

Publication Publication Date Title
CN103858510B (en) For making multiple equipment can the method and apparatus of shared data transmission period
WO2019242762A1 (en) Random access method, terminal, base station, storage medium, and electronic device
JP5688148B2 (en) Mechanism for accessing wide channels in overlapping networks
Bender et al. How to scale exponential backoff: Constant throughput, polylog access attempts, and robustness
WO2017076219A1 (en) Contention access method, apparatus and system for multiple carriers
CN110381601B (en) Communication method, communication device, computer readable medium and electronic equipment
CN111654348B (en) Internet of things data transmission method and device, computer equipment and storage medium
EP2622935A1 (en) Channel randomization for backoff efficiency improvement
CN111836370A (en) Resource reservation method and equipment based on competition
Soares et al. Throughput analytical modeling of IEEE 802.11 ah wireless networks
JP2020537373A (en) Carrier selection method, terminal device, and computer storage medium
CN108668377B (en) Channel access method and device
CN114916089A (en) Node data transmission method and device, electronic equipment and storage medium
CN106550481B (en) wireless network medium access control layer access method and system based on competition
CN111093291B (en) TDMA ad hoc network, construction method thereof, node and storage medium
WO2004084493A1 (en) Technique for optimizing backoff for a shared resource
US20130205012A1 (en) Apparatus and method for transmitting node discovery messages
WO2013068925A2 (en) Method and apparatus for controlling wireless devices
CN111586644B (en) Multi-node anti-collision method and device based on narrow-band communication of Internet of things
CN111669789B (en) Communication method and device suitable for satellite-ground link
US11606816B2 (en) Method, node, and system for reducing collisions in a time-synchronized channel hopping network
CN107371216B (en) Token subnet site access method and device
CN111107661B (en) Random access resource acquisition method and device
Weerasinghe et al. Preamble transmission prediction for mmtc bursty traffic: A machine learning based approach
Shi et al. Efficient information exchange in single-hop multi-channel radio networks

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