CN108924843A - Communication device in communication means and cluster in cluster - Google Patents
Communication device in communication means and cluster in cluster Download PDFInfo
- Publication number
- CN108924843A CN108924843A CN201810649499.7A CN201810649499A CN108924843A CN 108924843 A CN108924843 A CN 108924843A CN 201810649499 A CN201810649499 A CN 201810649499A CN 108924843 A CN108924843 A CN 108924843A
- Authority
- CN
- China
- Prior art keywords
- token
- node
- function
- token number
- member node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000004891 communication Methods 0.000 title claims abstract description 117
- 241000854291 Dianthus carthusianorum Species 0.000 claims description 46
- 238000000034 method Methods 0.000 claims description 26
- 238000012545 processing Methods 0.000 claims description 10
- 238000012795 verification Methods 0.000 description 10
- 230000005540 biological transmission Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 239000000284 extract Substances 0.000 description 1
- 239000000126 substance Substances 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W12/00—Security arrangements; Authentication; Protecting privacy or anonymity
- H04W12/12—Detection or prevention of fraud
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/215—Flow control; Congestion control using token-bucket
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/32—Flow control; Congestion control by discarding or delaying data units, e.g. packets or frames
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/0294—Traffic management, e.g. flow control or congestion control forcing collision
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/08—Non-scheduled access, e.g. ALOHA
- H04W74/0808—Non-scheduled access, e.g. ALOHA using carrier sensing, e.g. carrier sense multiple access [CSMA]
- H04W74/0825—Non-scheduled access, e.g. ALOHA using carrier sensing, e.g. carrier sense multiple access [CSMA] with collision detection
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention provides communication means in a kind of cluster, applied to include leader cluster node and member node cluster in, communication means includes in the cluster：Time slot is distributed for each member node, and issues token function to each member node, so that each member node calculates according to the token function token number of this each comfortable communication cycle；Token function is the relation function of this communication cycle and a preceding communication cycle token number, and same member node is different in the token number in different communication period；Receive member node token number calculated；According to the first corresponding relationship between the token number and time slot prestored, determination receives token number corresponding to the time slot of member node token number calculated；Judge whether received token number and the token number determined according to the first corresponding relationship are identical；If so, making member node busy channel；Otherwise, member node is intercepted.The present invention can prevent malicious node from capturing channel, to prevent malicious node from influencing communication in normal cluster.
Description
Technical Field
The present invention relates to the field of communications, and in particular, to an intra-cluster communication method and an intra-cluster communication apparatus.
Background
After a stable cluster topology is formed, generally, one cluster includes a cluster head node and member nodes, the cluster head node and the member nodes perform normal data packet transmission, and the member nodes send data packets to the cluster head node, so that the cluster head node forwards the data packets. The data packet includes a sending node identifier (i.e., a member node identifier), a receiving node identifier (i.e., a cluster head node identifier), and a data payload (i.e., data content).
Under the condition that a malicious node exists, the malicious node intercepts a data packet and extracts node identification information in the data packet, then the data packet is sent by pretending the node to occupy a channel (time slot), and the intra-cluster communication generally completes data transmission through a time division multiplexing channel. After stealing the header field, some malicious nodes can send data packets in a single channel with the cluster member nodes, which causes sending conflict, and if the malicious nodes pretend to be a large number of cluster nodes to send the data packets, the malicious nodes can occupy the channel for a long time and disturb normal cluster communication.
Therefore, how to prevent a malicious node from occupying a channel to prevent the malicious node from affecting communication in a cluster is an urgent technical problem to be solved.
Disclosure of Invention
The invention aims to at least solve one of the technical problems in the prior art, and provides an intra-cluster communication method and an intra-cluster communication device, so as to prevent a malicious node from occupying a channel, and further prevent the malicious node from influencing normal intra-cluster communication.
In order to achieve the above object, the present invention provides an intra-cluster communication method applied in a cluster including a cluster head node and a member node, the intra-cluster communication method including:
distributing time slots for each member node, and issuing a token function to each member node so that each member node can calculate the token number of each member node in the current communication cycle according to the token function; the token function is a relation function of the token numbers of the current communication cycle and the previous communication cycle, and the token numbers of the same member node in different communication cycles are different;
receiving the token number calculated by the member node;
determining a token number corresponding to the time slot for receiving the token number calculated by the member node according to a first corresponding relation between pre-stored token numbers and time slots;
judging whether the received token number is the same as the token number determined according to the first corresponding relation; if so, enabling the member node to occupy the channel; otherwise, intercepting the member node.
Preferably, in the step of allocating time slots to each member node and issuing a token function to each member node, a node identification function is also issued to each member node, so that the member nodes calculate function values according to the node identification function;
after the step of determining whether the received token number is the same as the token number determined according to the first correspondence, the method further includes:
receiving a data packet sent by the member node;
determining a token number corresponding to the time slot of the received data packet according to the first corresponding relation; determining a function value of the node identification function corresponding to the time slot of the received data packet according to a second corresponding relation among the prestored node identification, the function value of the node identification function and the time slot;
analyzing the data packet to obtain a function value and a token number which are carried in a packet header of the data packet and calculated by the member node;
and judging whether the function value obtained from the data packet is consistent with the function value determined according to the second corresponding relation or not, judging whether the token number obtained from the data packet is consistent with the token number determined according to the first corresponding relation or not, and if at least one of the token numbers is inconsistent, discarding the data packet.
Preferably, the token function is: n is a radical ofi＝mod[(Ni-1+1)/NGeneral assembly]+ 1; wherein i > 1, NiIs the token number of the current communication cycle, Ni-1Is the token number of the last communication cycle, NGeneral assemblyIs the total number of token numbers; order in first communication cycleNumber plate N1＝mod[(T1+1)/NGeneral assembly]+1，T1Is the slot number in the first communication cycle.
Preferably, the node identification comprises a multi-bit value, and the node identification function is a summation of the bit values of the node identification.
Preferably, the intra-cluster communication method further includes: and updating the token function and/or the node identification function according to a preset updating period.
Correspondingly, the invention also provides an intra-cluster communication device, which comprises a cluster head node and a token verification unit,
the cluster head node includes:
the distribution module is used for distributing time slots for all the member nodes;
the sending module is used for issuing a token function for each member node so that each member node can calculate the token number of each member node in the current communication period according to the token function; the token function is a relation function of the token numbers of the current communication cycle and the previous communication cycle, and the token numbers of the same member node in different communication cycles are different;
the token verifying unit includes;
the first receiving module is used for receiving the token number calculated by the member node;
the first storage module is used for storing a first corresponding relation between the token number and the time slot;
a first determining module, configured to determine, according to the first correspondence, a token number corresponding to a time slot in which the token number calculated by the member node is received;
the first judging module is used for judging whether the token number received by the first receiving module is the same as the token number determined by the first determining module;
a first processing module, configured to enable the member node to occupy a channel if a determination result of the first determining module is yes; and intercepting the member node when the judgment result of the first judgment module is negative.
Preferably, the sending module is further configured to issue a node identification function to each member node, so that the member node calculates a function value according to the node identification function;
the cluster head node further includes:
the second receiving module is used for receiving the data packet sent by the member node;
a second storage module, configured to store the first corresponding relationship and a second corresponding relationship among the node identifier, a function value of the node identifier function, and a time slot;
a second determining module, configured to determine, according to the first correspondence, a token number corresponding to a time slot in which the data packet is received; determining a function value of a node identification function corresponding to the time slot of the received data packet according to the second corresponding relation;
the analysis module is used for analyzing the data packet to obtain a function value and a token number which are carried in the packet header of the data packet and calculated by the member node;
the second judgment module is used for judging whether the function value obtained by the analysis module is consistent with the function value determined by the second determination module and judging whether the token number obtained by the analysis module is consistent with the token number determined by the second determination module;
and the second processing module is used for discarding the data packet when at least one judgment result of the second judgment module is negative.
Preferably, the token function is: n is a radical ofi＝mod[(Ni-1+1)/NGeneral assembly]+ 1; wherein i > 1, NiIs the token number of the current communication cycle, Ni-1Is the token number of the last communication cycle, NGeneral assemblyIs the total number of token numbers; token number N in first communication cycle1＝mod[(T1+1)/NGeneral assembly]+1，T1Is the slot number in the first communication cycle.
Preferably, the node identification comprises a multi-bit value, and the node identification function is a summation of the bit values of the node identification.
Preferably, the cluster head node further includes:
and the updating module is used for updating the token function and/or the node identification function according to a preset updating period.
In the invention, the cluster head node issues a token function for each member node, the member nodes can calculate a token number according to the token function, and when the communication is carried out, if the token number calculated by a certain member node is incorrect (namely, different from the token number determined according to the first corresponding relation), the cluster head node is disguised as a malicious node, so that the node is intercepted. In the communication method by sending the token function and verifying the token number, when a malicious node exists, the malicious node does not know the token function, so that a correct token number cannot be provided; even if a malicious node forges a correct token number, the token function is a relation function of the token number of the current communication cycle and the token number of the previous communication cycle, so that the token numbers of the same member node in different communication cycles can be adjusted, and therefore, in the next communication cycle, if the malicious node shows the token number of the previous communication cycle, the malicious node is also intercepted and cannot occupy a channel, the condition that the malicious node occupies the channel for a long time is reduced, and normal intra-cluster communication is ensured.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the description serve to explain the principles of the invention and not to limit the invention. In the drawings:
fig. 1 is a flowchart of an intra-cluster communication method according to an embodiment of the present invention;
fig. 2 is a flowchart of an intra-cluster communication method according to a second embodiment of the present invention;
fig. 3 is a schematic diagram of a cluster topology in the intra-cluster communication method according to the second embodiment of the present invention;
fig. 4 is a schematic structural diagram of an intra-cluster communication apparatus according to a third embodiment of the present invention.
Wherein the reference numerals are:
10. cluster head nodes; 101. a distribution module; 102. a sending module; 103. a second receiving module; 104. a second storage module; 105. a second determination module; 106. an analysis module; 107. a second judgment module; 108. a second processing module; 109. an update module; 20. a token verification unit; 201. a first receiving module; 202. a first storage module; 203. a first determination module; 204. a first judgment module; 205. a first processing module; 30. and (4) member nodes.
Detailed Description
The following detailed description of embodiments of the invention refers to the accompanying drawings. It should be understood that the detailed description and specific examples, while indicating the present invention, are given by way of illustration and explanation only, not limitation.
Example one
Fig. 1 is a flowchart of an intra-cluster communication method according to an embodiment of the present invention, where the intra-cluster communication method is applied in a cluster including a cluster head node and a member node. As shown in fig. 1, the intra-cluster communication method includes:
s11, distributing time slots for each member node, and issuing a token function to each member node, so that each member node can calculate the token number of each member node in the current communication cycle according to the token function; the token function is a relation function of the token numbers of the current communication period and the previous communication period, and the token numbers of the same member node in different communication periods are different. Step S11 is performed by the cluster head node.
And S12, receiving the token number calculated by the member node, wherein the token number is marked as a first token number.
S13, according to the first corresponding relation between the pre-stored token number and the time slot, determining the token number (the token number is marked as the second token number) corresponding to the time slot receiving the token number (namely, the first token number) calculated by the member node. The first corresponding relation between the token number and the time slot can be preset by the cluster head node and sent to the token verification unit, and the token verification unit determines the second token number according to the first corresponding relation. The first corresponding relationship may be a comparison table of time slots and token numbers, and table 1 is a first corresponding relationship in a specific example.
TABLE 1
| Time slot number | Token number |
| 1 | 3 |
| 2 | 1 |
| 3 | 2 |
| 4 | 2 |
| 5 | 3 |
| 6 | 1 |
| 7 | 1 |
| 8 | 2 |
| 9 | 3 |
S14, judging whether the received token number (namely, the first token number) is the same as the token number (namely, the second token number) determined according to the first corresponding relation; if so, enabling the member node to occupy the channel; otherwise, intercepting the member node.
As can be seen from the foregoing steps S11-S14, in this embodiment, the cluster head node issues a token function for each member node, and the member nodes can calculate a token number according to the token function, and when performing communication, if the token number calculated by a certain member node is incorrect (i.e., different from the token number determined according to the first corresponding relationship), it indicates that the cluster head node is disguised as a malicious node, so as to intercept the node. In the communication method by sending the token function and verifying the token number, when a malicious node exists, the malicious node does not know the token function, so that a correct token number cannot be provided; even if a malicious node forges a correct token number, the token function is a relation function of the token number of the current communication cycle and the token number of the previous communication cycle, so that the token numbers of the same member node in different communication cycles can be adjusted, and therefore, in the next communication cycle, if the malicious node shows the token number of the previous communication cycle, the malicious node is also intercepted and cannot occupy a channel, the condition that the malicious node occupies the channel for a long time is reduced, and normal intra-cluster communication is ensured.
Example two
Fig. 2 is a flowchart of an intra-cluster communication method according to a second embodiment of the present invention. In the second embodiment, a first corresponding relationship between the token and the time slot may be stored in the cluster head node, and a second corresponding relationship between the node identifier ID, the function value hash (ID) of the node identifier function, and the time slot may also be stored in the cluster head node. The node identifications of the cluster head node and the member nodes comprise multi-bit numerical values; the node identification function is a function related to the node identification ID, and the node identification function may be a hash function hash, specifically, a sum of each numerical value of the node identification is obtained, and the obtained function value is a sum of each numerical value. The first correspondence may be the same or similar to the look-up table of table 1 above; table 2 shows a second correspondence relationship in an embodiment.
TABLE 2
| Node identification ID | Function value of node identification function Hash (ID) | Time slot |
| 1567 | 19 | 1,4,7 |
| 1678 | 22 | 2,5,8 |
| 1247 | 14 | 3,6,9 |
As shown in fig. 2, the intra-cluster communication method includes:
s21, distributing time slots for each member node; and issuing a token function and a node identification function to each member node so that each member node can calculate the token number of each member node in the current communication period according to the token function and calculate a function value according to the node identification function. The token function is a relation function of the token number of the current communication period and the previous communication period. This step S21 is performed by the cluster head node.
Specifically, the token function is:
Ni＝mod[(Ni-1+1)/Ngeneral assembly]+1 (1)
Wherein i > 1, NiIs the token number of the current communication cycle, Ni-1Is the token number of the last communication cycle, NGeneral assemblyIs the total number of token numbers. And in the first communication cycle, the token number N1Is composed of
N1＝mod[(T1+1)/NGeneral assembly]+1 (2)
Wherein, T1Is the slot number in the first communication cycle.
And S22, receiving the token number calculated by the member node, wherein the token number is marked as a first token number.
S23, according to the first corresponding relation between the pre-stored token number and the time slot, determining the token number corresponding to the time slot receiving the token number calculated by the member node, and marking the token number as the second token number.
S24, judging whether the received first token number is the same as the determined second token number, if so, enabling the member node to occupy the channel; otherwise, judging the member node as a malicious node and intercepting the malicious node.
Wherein, the steps S23 and S24 may be performed by a token verifying unit provided on the channel. And then, the member nodes which are not intercepted send data packets to the cluster head nodes for communication. In order to further improve the security of communication, step S24 is followed by the following steps:
and S25, receiving the data packet sent by the member node. The data packet structure is as follows:
wherein the function value hash (id) of the transmitting node is a function value of a node identification function associated with the identity of the transmitting node, the function value being a sum of values of bits of the node identity of the transmitting node, and the function value hash (id) of the receiving node is a function value of a node identification function associated with the node identity of the receiving node, the function value being a sum of values of bits of the node identity of the receiving node. The sending node is a member node for sending the data packet, and the receiving node is marked as a cluster head node. Both function values in the data structure are calculated by the member nodes, the function value of the sending node is recorded as a first function value, and the function value of the receiving node is recorded as a second function value.
S26, determining the token number (namely the second token number) corresponding to the time slot of the received data packet according to the first corresponding relation; and determining the function value of the node identification function corresponding to the time slot of the received data packet according to the second corresponding relation among the pre-stored node identification, the function value of the node identification function and the time slot. This step S26 is performed by the cluster head node.
The structure of the data packet includes a function value of the sending node and a function value of the receiving node, and correspondingly, the function value determined according to the second corresponding relationship also includes: a function value corresponding to the transmitting node determined based on the second correspondence relationship (denoted as a third function value) and a function value corresponding to the receiving node determined based on the second correspondence relationship (denoted as a fourth function value).
And S27, analyzing the data packet to obtain the function value and the token number which are carried in the packet header and calculated by the member node.
S28, determining whether the function value obtained from the data packet is consistent with the function value determined according to the second corresponding relationship, and determining whether the token number obtained from the data packet is consistent with the token number determined according to the first corresponding relationship, and if at least one of the token numbers is inconsistent, discarding the data packet; and if the two are consistent, receiving the data content in the data packet.
As described above, the packet header carries the first function value and the second function value, and the third function value and the fourth function value are determined in step S26, in this case, step S28 "determine whether the function value obtained from the packet matches the function value determined according to the second correspondence" i.e., determine whether the first function value matches the third function value, and whether the second function value matches the fourth function value, and when both of them match, determine that the function value obtained from the packet matches the function value determined according to the second correspondence.
In the intra-cluster communication method according to the second embodiment, in addition to the judgment and verification of the token number at the start of communication, after the data packet is received, the token number in the data packet and the node identification function calculated by the member node are simultaneously verified, and when the function value of the node identification function in the data packet is inconsistent with the function value determined according to the second correspondence, and/or when the token number in the data packet is inconsistent with the token number determined according to the first correspondence, the member node is judged to be a malicious node, so that the data packet is discarded, and the security of communication is further ensured.
It should be noted that, in order to further improve the security and prevent the node identification function and/or the token function from being illegally acquired, the cluster head node may further update the token function and/or the node identification function according to a preset update period. The update cycle may be a plurality of communication cycles, and the update cycles of the node identification function and the token function may be the same or different.
The intra-cluster communication method of the present invention will be described with reference to examples. In the cluster topology shown in fig. 3, the cluster topology includes a cluster head node 10, a token verification unit 20 and three member nodes 30, and the node identification of the cluster head node 10 is 1253; the node identifications of the three member nodes 30 are 1567, 1678, and 1247, respectively. The cluster head node 10 issues a hash function and a token function to each member node, and issues a first corresponding relationship to the token verification unit 20, where the first corresponding relationship is a relationship table in table 1 above.
The cluster head node 10 allocates time slots to the three member nodes, specifically, allocates time slots of 1, 4, and 7 to the member node 30 identified as 1567, allocates time slots of 2, 5, and 8 to the member node 30 identified as 1678, and allocates time slots of 3, 6, and 9 to the member node 30 identified as 1247. And, the cluster head node 10 determines the token number of each member node in each time slot according to the token function of the above formulas (1) and (2), so as to generate a first corresponding relationship and a second corresponding relationship, which may be associated to form a relationship table as shown in table 3. The Hash function value is the sum of the values of the bits of the node identifier, and the token function refers to the above equations (1) and (2).
TABLE 3
| Node identification | Hash function value | Token number | Time slot |
| 1567 | 19 | 3，2，1 | 1，4，7 |
| 1678 | 22 | 1，3，2 | 2，5，8 |
| 1247 | 14 | 2，1，3 | 3，6，9 |
When communication is prepared, each member node 30 firstly calculates its own token number (i.e. a first token number) according to a token function, when the token verification unit 20 receives the first token number sent by the member node 30, a second token number corresponding to a time slot in which the first token number is received is determined according to table 3, and if the first token number is the same as the second token number, the member node occupies a channel of the time slot through verification; otherwise, intercepting the member nodes.
After the verified member node 30 sends a data packet to the cluster head node 10, the cluster head node 10 determines a time slot for receiving the data packet after receiving the data packet sent by the member node 30 in the cluster, and determines a function value of the member node 30, a function value of the cluster head node 10 and a token number according to the time slot lookup table 3. The cluster head node 10 parses the data packet to obtain the function value of the member node, the function value of the cluster head node, and the token number carried in the packet header. And comparing the function value of the member node obtained by the lookup table 3 with the function value of the member node obtained from the data packet, comparing the function value of the cluster head node obtained by the lookup table 3 with the function value of the cluster head node obtained from the data packet, comparing the token number obtained by the lookup table 3 with the token number obtained from the data packet, if at least one of the two is different, determining that the member node sending the data packet is a disguised intra-cluster node, and discarding the data packet.
EXAMPLE III
A third embodiment of the present invention provides an intra-cluster communication apparatus, which is shown in fig. 3 and 4, and includes a cluster head node 10 and a token verification unit 20. The cluster head node 10 comprises a distribution module 101 and a sending module 102; the token verifying unit 30 includes a first receiving module 201, a first storing module 202, a first determining module 203, a first judging module 204, and a first processing module 205. Wherein,
an allocating module 101, configured to allocate time slots for each member node 30.
A sending module 102, configured to issue a time slot and a token function for each member node 30, so that each member node 30 calculates a token number of each member node in the current communication cycle according to the token function; the token function is a relation function of the token numbers of the current communication period and the previous communication period, and the token numbers of the same member node in different communication periods are different.
A first receiving module 201, configured to receive the token number calculated by the member node 30.
A first storage module 202, configured to store a first correspondence between a token number and a time slot. The first corresponding relationship may be sent by the sending module 102 to the first storing module 202.
A first determining module 203, configured to determine, according to the first corresponding relationship, a token number corresponding to a time slot in which the token number calculated by the member node 30 is received.
A first judging module 204, configured to judge whether the token number received by the first receiving module 201 is the same as the token number determined by the first determining module 203.
A first processing module 205, configured to enable the member node 30 to occupy the channel when the determination result of the first determining module 204 is yes; and when the judgment result of the first judgment module 204 is negative, intercepting the member node 30.
Further, the sending module 102 is further configured to issue a node identification function to each member node 30, so that the member node 30 calculates a function value according to the node identification function. The node identification comprises a multi-bit value, and the node identification function is a summation of the bit values of the node identification.
The cluster head node 10 further includes a second receiving module 103, a second storing module 104, a second determining module 105, a parsing module 106, a second judging module 107, a second processing module 108, and an updating module 109, wherein:
a second receiving module 103, configured to receive the data packet sent by the member node 30.
A second storage module 104, configured to store the first corresponding relationship and a second corresponding relationship among the node identifier, the function value of the node identifier function, and the time slot.
A second determining module 105, configured to determine, according to the first corresponding relationship, a token number corresponding to the time slot in which the data packet is received; and determining a function value of the node identification function corresponding to the time slot of the received data packet according to the second corresponding relation.
And the analyzing module 106 is configured to analyze the data packet to obtain a function value and a token number, which are carried in the packet header and calculated by the member node.
The second judging module 107 is configured to judge whether the function value obtained by the parsing module 106 is consistent with the function value determined by the second determining module 105, and judge whether the token number obtained by the parsing module 106 is consistent with the token number determined by the second determining module 105.
A second processing module 108, configured to discard the data packet if at least one determination result of the second determining module 107 is negative.
An updating module 109, configured to update the token function and/or the node identifier function according to a preset updating period.
Wherein the token function is:
Ni＝mod[(Ni-1+1)/Ngeneral assembly]+1 (1)
Wherein i > 1, NiIs the token number of the current communication cycle, Ni-1Is the token number of the last communication cycle, NGeneral assemblyIs the total number of token numbers. And in the first communication cycle, the token number N1Is composed of
N1＝mod[(T1+1)/NGeneral assembly]+1 (2)
Wherein, T1Is the slot number in the first communication cycle.
It will be understood that the above embodiments are merely exemplary embodiments taken to illustrate the principles of the present invention, which is not limited thereto. It will be apparent to those skilled in the art that various modifications and improvements can be made without departing from the spirit and substance of the invention, and these modifications and improvements are also considered to be within the scope of the invention.
Claims (10)
1. An intra-cluster communication method applied to a cluster including a cluster head node and member nodes, the intra-cluster communication method comprising:
distributing time slots for each member node, and issuing a token function to each member node so that each member node can calculate the token number of each member node in the current communication cycle according to the token function; the token function is a relation function of the token numbers of the current communication cycle and the previous communication cycle, and the token numbers of the same member node in different communication cycles are different;
receiving the token number calculated by the member node;
determining a token number corresponding to the time slot for receiving the token number calculated by the member node according to a first corresponding relation between pre-stored token numbers and time slots;
judging whether the received token number is the same as the token number determined according to the first corresponding relation; if so, enabling the member node to occupy the channel; otherwise, intercepting the member node.
2. The intra-cluster communication method according to claim 1, wherein in the step of allocating time slots to each member node and issuing a token function to each member node, a node identification function is also issued to each member node, so that the member node calculates a function value according to the node identification function;
after the step of determining whether the received token number is the same as the token number determined according to the first correspondence, the method further includes:
receiving a data packet sent by the member node;
determining a token number corresponding to the time slot of the received data packet according to the first corresponding relation; determining a function value of the node identification function corresponding to the time slot of the received data packet according to a second corresponding relation among the prestored node identification, the function value of the node identification function and the time slot;
analyzing the data packet to obtain a function value and a token number which are carried in a packet header of the data packet and calculated by the member node;
and judging whether the function value obtained from the data packet is consistent with the function value determined according to the second corresponding relation or not, judging whether the token number obtained from the data packet is consistent with the token number determined according to the first corresponding relation or not, and if at least one of the token numbers is inconsistent, discarding the data packet.
3. The method of claim 1, wherein the token function is: n is a radical ofi＝mod[(Ni-1+1)/NGeneral assembly]+ 1; wherein i > 1, NiIs the token number of the current communication cycle, Ni-1Is the token number of the last communication cycle, NGeneral assemblyIs the total number of token numbers; token number N in first communication cycle1＝mod[(T1+1)/NGeneral assembly]+1，T1Is the slot number in the first communication cycle.
4. The method of claim 2, wherein the node identification comprises a multi-bit value, and wherein the node identification function is a summation of the bit values of the node identification.
5. The intra-cluster communication method according to claims 2 to 4, further comprising: and updating the token function and/or the node identification function according to a preset updating period.
6. An intra-cluster communication apparatus includes a cluster head node and a token verifying unit,
the cluster head node includes:
the distribution module is used for distributing time slots for all the member nodes;
the sending module is used for issuing a token function for each member node so that each member node can calculate the token number of each member node in the current communication period according to the token function; the token function is a relation function of the token numbers of the current communication cycle and the previous communication cycle, and the token numbers of the same member node in different communication cycles are different;
the token verifying unit includes;
the first receiving module is used for receiving the token number calculated by the member node;
the first storage module is used for storing a first corresponding relation between the token number and the time slot;
a first determining module, configured to determine, according to the first correspondence, a token number corresponding to a time slot in which the token number calculated by the member node is received;
the first judging module is used for judging whether the token number received by the first receiving module is the same as the token number determined by the first determining module;
a first processing module, configured to enable the member node to occupy a channel if a determination result of the first determining module is yes; and intercepting the member node when the judgment result of the first judgment module is negative.
7. The in-cluster communication device according to claim 6, wherein the sending module is further configured to issue a node identification function to each member node, so that the member node calculates a function value according to the node identification function;
the cluster head node further includes:
the second receiving module is used for receiving the data packet sent by the member node;
a second storage module, configured to store the first corresponding relationship and a second corresponding relationship among the node identifier, a function value of the node identifier function, and a time slot;
a second determining module, configured to determine, according to the first correspondence, a token number corresponding to a time slot in which the data packet is received; determining a function value of a node identification function corresponding to the time slot of the received data packet according to the second corresponding relation;
the analysis module is used for analyzing the data packet to obtain a function value and a token number which are carried in the packet header of the data packet and calculated by the member node;
the second judgment module is used for judging whether the function value obtained by the analysis module is consistent with the function value determined by the second determination module and judging whether the token number obtained by the analysis module is consistent with the token number determined by the second determination module;
and the second processing module is used for discarding the data packet when at least one judgment result of the second judgment module is negative.
8.The in-cluster communication apparatus according to claim 6, wherein the token function is: n is a radical ofi＝mod[(Ni-1+1)/NGeneral assembly]+ 1; wherein i > 1, NiIs the token number of the current communication cycle, Ni-1Is the token number of the last communication cycle, NGeneral assemblyIs the total number of token numbers; token number N in first communication cycle1＝mod[(T1+1)/NGeneral assembly]+1，T1Is the slot number in the first communication cycle.
9. The apparatus of claim 7, wherein the node identification comprises a multi-bit value, and wherein the node identification function sums the bit values of the node identification.
10. An intra-cluster communication device according to any of claims 7 to 9, wherein the cluster head node further comprises:
and the updating module is used for updating the token function and/or the node identification function according to a preset updating period.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810649499.7A CN108924843B (en) | 2018-06-22 | 2018-06-22 | Intra-cluster communication method and intra-cluster communication device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810649499.7A CN108924843B (en) | 2018-06-22 | 2018-06-22 | Intra-cluster communication method and intra-cluster communication device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108924843A true CN108924843A (en) | 2018-11-30 |
| CN108924843B CN108924843B (en) | 2021-05-11 |
Family
ID=64420807
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810649499.7A Active CN108924843B (en) | 2018-06-22 | 2018-06-22 | Intra-cluster communication method and intra-cluster communication device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108924843B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111402560A (en) * | 2020-03-09 | 2020-07-10 | 上海密尔克卫化工储存有限公司 | L ora wireless technology-based dangerous goods warehouse sensor monitoring system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1206526A (en) * | 1995-12-28 | 1999-01-27 | 德纳克公司 | Method and arrangement for network resource administration |
| CN103618605A (en) * | 2013-11-26 | 2014-03-05 | 中国联合网络通信集团有限公司 | Time varying access token generation method and server |
| US9594922B1 (en) * | 2015-06-30 | 2017-03-14 | EMC IP Holding Company LLC | Non-persistent shared authentication tokens in a cluster of nodes |
-
2018
- 2018-06-22 CN CN201810649499.7A patent/CN108924843B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1206526A (en) * | 1995-12-28 | 1999-01-27 | 德纳克公司 | Method and arrangement for network resource administration |
| CN103618605A (en) * | 2013-11-26 | 2014-03-05 | 中国联合网络通信集团有限公司 | Time varying access token generation method and server |
| US9594922B1 (en) * | 2015-06-30 | 2017-03-14 | EMC IP Holding Company LLC | Non-persistent shared authentication tokens in a cluster of nodes |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111402560A (en) * | 2020-03-09 | 2020-07-10 | 上海密尔克卫化工储存有限公司 | L ora wireless technology-based dangerous goods warehouse sensor monitoring system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108924843B (en) | 2021-05-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US6233687B1 (en) | Method and apparatus for providing configuration information in a network | |
| KR20220165727A (en) | Fronthaul interface for advanced split-radio access network (RAN) systems | |
| US10355971B2 (en) | System and method for data path validation and verification | |
| US20160191408A1 (en) | Communication control apparatus and communication control method | |
| KR20100065150A (en) | Method and system of communication using extended sequence number | |
| US9774529B2 (en) | Method and apparatus for transmitting data frame | |
| US20080072043A1 (en) | Device management system and method of controlling the same | |
| CN109495594B (en) | Data transmission method, PNF SDN controller, VNF SDN controller and system | |
| CN109040140B (en) | Slow attack detection method and device | |
| WO2018205148A1 (en) | Data packet checking method and device | |
| WO2022144007A1 (en) | Control frame processing method, control frame generating method, station, access point, and storage medium | |
| CN106817352A (en) | Broadcasting packet encryption method and device | |
| WO2020224341A1 (en) | Method and apparatus for identifying tls encrypted traffic | |
| WO2021003615A1 (en) | Method, apparatus, device, and system for determining sidelink feedback channel, and storage medium | |
| CN114520751A (en) | Tunnel transmission method and device based on software defined wide area network | |
| CN108924843B (en) | Intra-cluster communication method and intra-cluster communication device | |
| CN113507434B (en) | Data security transmission method, node and system in communication network | |
| CN109067625B (en) | Method, device and system for detecting performance of service channel | |
| US11089472B2 (en) | Transmitter for emitting signals and receiver for receiving signals | |
| US20210195418A1 (en) | A technique for authenticating data transmitted over a cellular network | |
| CN101616005A (en) | Endorsement method, device and signature verification method, device and system | |
| EP3661243A1 (en) | Secure beacons | |
| CN108769040B (en) | Method and device for identifying nodes in disguised cluster | |
| US20240276220A1 (en) | Wireless Device and Network Node for Verification of a Device Category as Well as Corresponding Methods in a Wireless Communication System | |
| CN114039749B (en) | Attack detection method, device, equipment and storage medium |
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 |