CN111935726A

CN111935726A - Communication processing method, master node, slave node, storage medium and system

Info

Publication number: CN111935726A
Application number: CN202010662367.5A
Authority: CN
Inventors: 宋松伟; 陈加轩
Original assignee: Spreadtrum Semiconductor Chengdu Co Ltd
Current assignee: Spreadtrum Semiconductor Chengdu Co Ltd
Priority date: 2020-07-10
Filing date: 2020-07-10
Publication date: 2020-11-13
Anticipated expiration: 2040-07-10
Also published as: CN111935726B

Abstract

The embodiment of the invention provides a communication processing method, a main node, a slave node, a storage medium and a system, wherein the communication processing method comprises the following steps: receiving a slave node identification message sent from a slave node, the slave node identification message comprising: the slave node generates a random node identifier and a handshake node identifier distributed to the slave node in a handshake flow; based on the handshake node identification, if the slave node identification message is determined to be received for the first time, the random node identification is stored, and if the slave node identification message is determined not to be received for the first time, the stored random node identification corresponding to the handshake node identification is obtained and matched with the random node identification carried by the slave node identification message; and responding to the matching result, and determining whether the handshake node identifications allocated for the slave nodes have conflict. The embodiment of the invention can improve the stability and reliability of communication interaction between the master node and the slave node.

Description

Communication processing method, master node, slave node, storage medium and system

Technical Field

The embodiment of the invention relates to the technical field of communication, in particular to a communication processing method, a master node, a slave node, a storage medium and a system.

Background

In indoor environments such as large buildings, underground shopping malls, underground parking lots and the like, mobile communication signals are weak, blind areas and shadow areas of mobile communication are easily formed, and terminals such as mobile phones and the like using the mobile communication signals cannot be normally used. At present, an indoor distribution system can be used for improving mobile communication signals of an indoor environment, and the mobile communication signals of a signal source (such as a base station) can be uniformly distributed at each corner indoors by using the indoor distribution system, so that ideal signal coverage is ensured under the indoor environment.

The indoor distribution system mainly comprises a main node and a plurality of slave nodes accessed to the main node, wherein the main node is connected with the information source and can send the mobile communication signals of the information source to the slave nodes, and therefore the slave nodes can process the received mobile communication signals and send the processed mobile communication signals to the air interface to complete the coverage of the mobile communication signals in the indoor environment.

In order to identify different slave nodes in the indoor distribution system and realize the identification and management of the master node to the slave nodes, the communication connection between the master node and the slave nodes needs to be realized based on the node identifications (such as node numbers) of the slave nodes. However, in the operation of the indoor distribution system, the master node may not be able to accurately grasp the communication states of all the slaves because a plurality of slave nodes are assigned the same node identifier.

Disclosure of Invention

In view of this, embodiments of the present invention provide a communication processing method, a master node, a slave node, a storage medium, and a system, which can improve stability and reliability of communication interaction between the master node and the slave node.

In order to achieve the above purpose, the embodiments of the present invention provide the following technical solutions:

a communication processing method is applied to a master node, the master node establishes communication connection with a slave node through a handshake process, and the method comprises the following steps:

receiving a slave node identification message sent from a slave node, the slave node identification message comprising: the slave node generates a random node identifier and a handshake node identifier distributed to the slave node in a handshake flow;

based on the handshake node identification, if the slave node identification message is determined to be received for the first time, the random node identification is stored, and if the slave node identification message is determined not to be received for the first time, the stored random node identification corresponding to the handshake node identification is obtained and matched with the random node identification carried by the slave node identification message;

and responding to the matching result, and determining whether the handshake node identifications allocated for the slave nodes have conflict.

The embodiment of the invention also provides another communication processing method which is applied to the slave node, and the method comprises the following steps:

generating a random node identification;

and sending a slave node identification message to a master node so that the master node determines whether the handshake node identifications allocated to the slave nodes in the handshake flow conflict.

An embodiment of the present invention further provides a master node, including:

a master node message receiving module, configured to receive a slave node identification message sent by a slave node, where the slave node identification message includes: the slave node generates a random node identifier and a handshake node identifier distributed to the slave node in a handshake flow;

a receiving state judgment module, configured to determine whether the slave node identification message is received for the first time according to the handshake node identification;

the message storage module is used for storing the random node identification when the slave node identification message is determined to be received for the first time;

a node identification matching module, configured to, when it is determined that the slave node identification message is not received for the first time, obtain a random node identification corresponding to the handshake node identification stored in the message storage module, and match the random node identification carried in the slave node identification message,

and the conflict detection module is used for responding to the matching result of the node identification matching module and determining whether the handshake node identifications distributed for the slave nodes conflict or not.

An embodiment of the present invention further provides a slave node, including:

the random node identifier generating module is used for generating a random node identifier;

a slave node message sending module, configured to send a slave node identification message to a master node, where the slave node identification message includes: and the random node identification is used for enabling the master node to determine whether the handshake node identifications distributed to the slave nodes in the handshake process have conflict.

An embodiment of the present invention further provides a master node, including: a memory storing one or more computer-executable instructions and a processor invoking the one or more computer-executable instructions to perform a communication processing method as described above.

An embodiment of the present invention further provides a slave node, including: a memory storing one or more computer-executable instructions and a processor invoking the one or more computer-executable instructions to perform a communication processing method as described above.

The embodiment of the invention also provides an indoor distribution system, which comprises the master node and a plurality of slave nodes, wherein the master node and the slave nodes establish communication connection through a handshake process.

An embodiment of the present invention further provides a storage medium, where the storage medium stores one or more computer-executable instructions, and the one or more computer-executable instructions are configured to execute the communication processing method described above.

In a communication processing method provided in an embodiment of the present invention, according to a handshake node identifier in a received slave node identifier message, it may be determined whether a master node initially receives a slave node identifier message sent by a slave node corresponding to the handshake node identifier, if so, a random node identifier in the slave node identifier message may be stored, which facilitates subsequent handshake node identifier collision detection, if not, the stored random node identifier corresponding to the handshake node identifier may be obtained and matched with the random node identifier carried in the slave node identifier message, and according to a matching result, it may be determined whether the handshake node identifier has a collision, and a software portion is modified without changing a hardware architecture in an indoor distribution system, which may implement automatic detection of handshake node identifier collision and may be widely applied to various indoor distribution systems, the phenomenon that a plurality of slave nodes are distributed with the same handshake node identification is found in time, the condition of communication chaos can be further avoided, and the stability and reliability of communication interaction between the master node and the slave node are improved.

In another communication processing method provided in the embodiment of the present invention, a slave node may generate a random node identifier, and send a slave node identifier message including the random node identifier to the master node, to cause the master node to determine whether there is a conflict with the handshake node identifications allocated for the slave nodes in the handshake flow, therefore, by actively sending the generated random node identification from the slave node, the master node can automatically perform handshake node identification collision detection through the random node identification received for multiple times, under the condition of not changing the hardware architecture in the indoor distribution system, the software part is modified, the phenomenon that a plurality of slave nodes are distributed with the same handshake node identification can be found in time, and the method can be widely applied to various indoor distribution systems, therefore, the condition of communication disorder can be avoided, and the stability and reliability of communication interaction between the master node and the slave node are improved.

Drawings

In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly introduced below, it is obvious that the drawings in the following description are only embodiments of the present application, and for those skilled in the art, other drawings can be obtained according to the provided drawings without creative efforts.

Fig. 1a is a block diagram of an indoor distribution system provided by an embodiment of the present invention;

fig. 1b is a flowchart of a master-slave node performing handshake according to an embodiment of the present invention;

fig. 2 is a flowchart of a communication processing method of a master node according to an embodiment of the present invention;

fig. 3 is a flowchart of a master node processing handshake node identification collision according to an embodiment of the present invention;

fig. 4 is a flowchart of a master node performing handshake again according to an embodiment of the present invention;

fig. 5 is a flowchart of a communication processing method of a slave node according to an embodiment of the present invention;

fig. 6 is a diagram illustrating a communication status of an indoor distribution system according to an embodiment of the present invention;

fig. 7 is a signaling flowchart of a communication processing method according to an embodiment of the present invention;

fig. 8 is a block diagram of a host node according to an embodiment of the present invention;

fig. 9 is a block diagram of another master node according to an embodiment of the present invention;

fig. 10 is a block diagram of another host node according to an embodiment of the present invention;

fig. 11 is a block diagram of a slave node according to an embodiment of the present invention.

Detailed Description

The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments 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.

Currently, the coverage of a 4G (fourth generation mobile communication technology) network, such as an LTE (Long Term Evolution) network, is relatively perfect. In urban application environments, due to the rapid increase of users and the increase of high-rise buildings, the telephone traffic density and the coverage requirement are continuously increased, and indoor distribution systems for improving mobile communication signals are generally deployed in indoor environments such as large buildings, underground shopping malls, underground parking lots and the like in order to avoid dead zones and shadow zones of mobile communication.

However, with the advance of 5G (fifth generation mobile communication technology) network construction, the wireless signal characteristics of the 5G network itself makes higher demands for coverage of mobile communication signals in indoor environments, and in the 5G network, an indoor distribution system may have more slave nodes and perform more complex wireless communication, so in the field of mobile communication signal improvement of indoor environments, how to fully utilize the existing indoor distribution system, reduce the cost of 5G network construction and maintenance, and improve the coverage of the 5G network in indoor environments becomes a major issue. In this problem, how to find and solve the communication conflict situation is an urgent problem to be solved.

As shown in FIG. 1a, the indoor distribution system may include a master node 10 and a plurality of slave nodes 21-2N, where N is a natural number not less than 1. The master node 10 is connected with the information source, and sends the mobile communication signal of the information source to at least one of the slave nodes 21-2N, and at least one of the slave nodes 21-2N processes the received mobile communication signal and sends the processed signal to the air interface, so that the coverage of the mobile communication signal in the indoor environment is completed.

In order to coordinate the work of the indoor distribution system, a communication connection needs to be established between the master node and the slave node, so that communication interaction can be carried out. In order to identify different slave nodes in the indoor distribution system and realize the identification and management of the master node to the slave nodes, the communication connection between the master node and the slave nodes needs to be realized based on the node identifications (such as node numbers) of the slave nodes.

At present, the node identifier of the slave node is mainly set in a manual allocation mode. The manual distribution mode is mainly that when the slave nodes are installed, a fixed node identifier is manually set for each slave node of the indoor distribution system, and therefore a handshake process is carried out between the master node and the slave nodes based on the fixed node identifiers set in advance by the slave nodes.

The manual setting of the fixed node identification is inefficient, and in an improved indoor distribution system, the slave node may not set the fixed node identification before accessing the master node, but automatically allocates the handshake node identification to the slave node through the master node after initiating a handshake flow.

Specifically, as shown in fig. 1b, for a flow chart of a master-slave node performing handshake applied to fig. 1a, the slave node 21 performs an initialization operation after being powered on, then enters an access state, waits for an access time, and initiates a handshake request to the master node 10, after receiving the handshake request sent by the slave node 21, the master node 10 automatically allocates a handshake node identifier to the slave node 21, and sends an effective handshake node identifier to the slave node 21, after receiving the effective handshake node identifier sent by the master node 10, the slave node 21 determines whether to successfully access the master node 10, and if the allocated handshake node identifier is successfully set as its own handshake node identifier, it determines to successfully access the master node 10.

However, whether the fixed node identifiers are manually allocated or the handshake node identifiers are automatically allocated by the master node to the slave nodes, the phenomenon that a plurality of slave nodes are allocated with the same node identifiers may occur, and a problem of node identifier allocation conflict may occur.

For example, when multiple persons set the fixed node identifiers in different places, the fixed node identifiers set by the other persons cannot be known, so that multiple slave nodes are set with the same fixed node identifiers.

For another example, the master node sends a master handshake message in a broadcast manner during a handshake process, where the master handshake message includes a handshake node identifier allocated to the slave node, and after receiving the master handshake message broadcast by the master node, the slave node requesting handshake performs a subsequent handshake operation, e.g., sets the handshake node identifier allocated to the master node as its own handshake node identifier.

Each slave node may perform a handshake flow with the master node through the same channel, because the communication distances between each slave node and the master node are different, the path loss of each slave node is also different, and the slave node signal at a longer communication distance from the master node is attenuated more after the path loss, whereas the transmission power accuracy of the existing slave node is not high, it is difficult to finely control the transmission power, the slave node signal with more attenuation is covered by the slave node signals with less attenuation, especially when there is a slave node at a very close communication distance around the master node, the slave node signal covers other slave node signals at a far communication distance from the master node, so that the master node can only receive the slave node signal at a very close distance.

In combination with the above phenomenon, if a plurality of slave nodes initiate a handshake flow to the master node at the same time, due to path loss, a slave node signal at a longer communication distance from the master node may be covered by a slave node signal at a shorter communication distance from the master node, so that the master node may receive only a slave node signal at a shorter communication distance, but not a slave node signal at a longer communication distance.

However, when the master node broadcasts the master handshake message and the master handshake message carries the assigned handshake node identifier, the slave node at the closer communication distance and the slave node at the farther communication distance both consider that the master handshake message is sent to the slave node, and therefore subsequent handshake operation is performed, so that a phenomenon that a plurality of slave nodes are assigned the same handshake node identifier exists.

Specifically, if a plurality of slave nodes enter the access state at the same time and perform a handshake procedure with the master node, the master node may assign the same handshake node identifier to the plurality of slave nodes, for example, referring to fig. 1a, the master node 10 stores a plurality of available node identifiers a₁～A_MWherein M is a natural number greater than 1. The

slave nodes

21 and 2N simultaneously perform a handshake with the master node 10, the master node 10 identifying A from the available nodes₁～A_MTo select an available node identity a₆Are assigned to the

slave nodes

21 and 2N as handshake node identifications, and both the

slave nodes

21 and 2N successfully set handshake node identification a₆ Access master node 10, after which both

slave nodes

21 and 2N identify a by means of handshake nodes₆With the master node 10, the

slave nodes

21 and 2N are one slave node (i.e. assigned the handshake node identification a) for the master node₆The slave nodes) cannot distinguish between messages sent from the

nodes

21 and 2N, and cannot send messages to the

slave nodes

21 and 2N, respectively, resulting in communication confusion.

In summary, in the prior art, all the solutions have a problem of node identifier allocation conflict, and a plurality of slave nodes use the same node identifier to perform communication interaction with a master node, so that the master node cannot accurately grasp the communication states of all the slave nodes, and thus system operation is likely to be abnormal.

At present, the solutions that can be adopted are:

1) the equipment is debugged by manual troubleshooting.

2) Modifications to existing indoor distribution systems are made, for example, to add Identity Document (ID) identification devices, to add communication channels, or to use longer length ID sequences.

However, the above solutions all have drawbacks. If the first scheme is adopted, in order not to influence the work of other normal nodes, the communication interaction between the abnormal nodes and the normal nodes cannot be stopped in the process of detecting the distribution conflict of the node identifiers, and a large number of nodes existing in the 5G network environment can improve the complexity of manual troubleshooting, greatly increase the workload, reduce the troubleshooting efficiency and improve the communication risk.

If the second scheme is adopted, the hardware architecture of the indoor distribution system needs to be modified, and for the indoor distribution system with limited communication capacity, the limitations of communication rate, amplitude modulation technology, power-on handshake time and the like often exist, complex operations such as scrambling, spread spectrum and the like cannot be performed, and hardware modification is not convenient to implement.

In order to solve the problem of the handshake node identifier allocation conflict, embodiments of the present invention provide a communication processing scheme, which can automatically detect and resolve the problem of the handshake node identifier allocation conflict during a communication interaction between a master node and a slave node, and timely process a phenomenon that a plurality of slave nodes are allocated with the same handshake node identifier, so that manual troubleshooting is not required, thereby improving troubleshooting efficiency, further avoiding a situation of communication confusion, and effectively ensuring stability and reliability of communication interaction between the master node and the slave node.

In an alternative implementation, as shown in fig. 2, a flowchart of a communication processing method provided in an embodiment of the present invention is applied to a master node, and after the master node establishes a communication connection with a slave node through a handshake process, the following steps may be performed:

step S20, receiving a slave node identification message sent by a slave node, where the slave node identification message includes: the slave node generates a random node identification and a handshake node identification allocated to the slave node in a handshake flow.

In specific implementation, when a slave node accesses a master node through a handshake process, the master node selects an available node identifier for the slave node and sends the node identifier to the slave node as a handshake node identifier, the slave node indicates identity information to the master node through the handshake node identifier in subsequent communication interaction, and the master node can distinguish different sending objects through the handshake node identifier carried in a received slave node message, in other words, can identify which slave node sends the received slave node message according to the handshake node identifier.

It should be noted that, in this embodiment of the present specification, a specific form of the slave node identification message is not limited, and the slave node identification message may include a random node identification generated by the slave node and a handshake node identification allocated to the slave node in a handshake flow.

It is understood that, in order to implement the master-slave node communication interaction, the slave node messages sent by the slave nodes may have multiple types, the slave node identification message is only one type of the slave node messages, in the embodiment of the present invention, the slave nodes may also send other types of slave node messages, and the embodiment of the present invention does not limit the types of the slave node messages.

Step S21, based on the handshake node identification, if it is determined that the slave node identification message is received for the first time, the random node identification is saved, and if it is determined that the slave node identification message is not received for the first time, the saved random node identification corresponding to the handshake node identification is obtained and matched with the random node identification carried by the slave node identification message.

In specific implementation, whether a slave node identification message sent by a slave node corresponding to the handshake node identification is received for the first time after the handshake process can be judged through the handshake node identification.

And step S22, responding to the matching result, and determining whether the handshake node identifications allocated for the slave nodes have conflict.

In specific implementation, if the matching results are consistent, it may be determined that there is no conflict in the handshake node identifiers allocated to the slave nodes, and the slave nodes and the handshake node identifiers correspond to each other one to one; if the matching result is inconsistent, it may be determined that the handshake node identifiers allocated to the slave nodes have conflicts, and before the slave node transmits the slave node identifier message to the master node, another slave node transmits a slave node identifier message carrying the same handshake node identifier to the master node.

Therefore, through the communication processing flow, whether the distributed handshake node identifications have the conflict problem can be automatically detected.

For example, in connection with the example of fig. 1a, the master node 10 assigns a handshake node identification a to the slave node 21 in a handshake flow₆After the handshake process, if the master node receives the slave node identification message M during communication interaction₁And extracting the carried handshake node identification A from the data₆From which the handshake node identification a can be determined₆Corresponding slave node sending node identification message M₁. Then, the main node can determine whether the handshake node identification A is received for the first time according to the message receiving record₆A slave node identification message sent by the corresponding slave node.

If the handshake node identification A is received for the first time₆The corresponding slave node identification message sent by the slave node records the slave node identification message M₁Random node identification S carried in it₁。

If handshake node identification A is not received for the first time₆The corresponding slave node identification message sent by the slave node should identify A at the handshake node₆Corresponding storage area stores the first-time received handshake node identification A₆Random node identification carried by corresponding slave node identification message, e.g. random node identification S₂. And, identify A through the handshake node₆The saved random node identifier S can be obtained₂By matching random node identities S₂And a random node identification S₁The handshake node identification a allocated for the slave node 21 may be determined₆Whether a conflict exists.

In particular, if the random node identifies S₂And a random node identification S₁If they are consistent, the handshake node identification A allocated for the slave node 21 is determined₆No conflict exists, the slave node 21 and the handshake node identification are in one-to-one correspondence; if random node identification S₂And a random node identification S₁If they are not consistent, the handshake node identification A allocated for the slave node 21 is determined₆There is a conflict, and before the slave node 21 sends the slave node identification message to the master node, another slave node sends a slave node identification message carrying the same handshake node identification to the master node.

According to the scheme, whether the master node receives the slave node identification message sent by the slave node corresponding to the handshake node identification for the first time can be determined according to the handshake node identification in the received slave node identification message, if so, the random node identification in the slave node identification message can be stored, so that the subsequent handshake node identification conflict detection is facilitated, if not, the stored random node identification corresponding to the handshake node identification can be obtained and matched with the random node identification carried by the slave node identification message, whether the handshake node identification conflicts or not can be determined according to the matching result, the software part is modified under the condition that the hardware architecture in an indoor distribution system is not changed, the automatic detection of handshake node identification conflict can be realized, and the method can be widely applied to various indoor distribution systems, the phenomenon that a plurality of slave nodes are distributed with the same handshake node identification is found in time, the condition of communication chaos can be further avoided, and the stability and reliability of communication interaction between the master node and the slave node are improved.

In a further optional implementation, the stored random node identifier corresponding to the handshake node identifier is matched with the random node identifier carried in the slave node identifier message, and after an inconsistent matching result is obtained, a handshake node identifier collision processing flow may be triggered, which is described in detail below with specific embodiments.

In one example, the handshake node identification conflict handling flow may include: and for the handshake node identifications with conflicts, sending a master re-handshake message to the slave node corresponding to the slave node identification message which is not received for the first time so as to request the corresponding slave node to initiate the handshake process again.

Specifically, in connection with the embodiment described above with reference to fig. 1a, if the random node id S2 and the random node id S1 are not consistent after matching, it may be determined that the handshake node id a allocated to the slave node 21 is not consistent₆And if the conflict exists, triggering the handshake node to identify the conflict processing flow. The master node 10 may send a master re-handshake message to the slave node 21 to request the slave node 21 to re-initiate the handshake flow.

The master handshake message sent by the master node may include: and for the slave node receiving the master re-handshake message, whether the master re-handshake message is sent to the slave node can be determined by matching the random node identifier carried by the master re-handshake message with the random node identifier generated by the slave node.

By re-initiating the handshake flow, the handshake node identifiers can be re-distributed to the slave nodes corresponding to the slave node identifier messages which are not received for the first time, the problem of handshake node identifier conflict is solved in a targeted manner, the handshake node identifiers distributed to the slave nodes are ensured to be different, the condition of communication confusion can be avoided, and the stability and reliability of communication interaction between the master node and the slave node are improved.

In another example, as shown in fig. 3, the handshake node identification collision processing flow may include:

and step 30, resetting corresponding main handshake information for the handshake node identifications with conflicts.

The master handshake information is some interaction information stored by the master node during the handshake process, and may include handshake node identifiers allocated to the slave nodes in the handshake process.

By resetting the corresponding master handshake information, when the master node selects an available node identifier for other slave nodes, if a handshake node identifier with a conflict before is selected, the handshake node identifier with the conflict before can be used as the handshake node identifier of other slave nodes because the master handshake information is already reset.

For example, referring to the related example of FIG. 1a, the conflicting handshake node is identified as A₆After resetting the master handshake information, the handshake node with the conflict before is identified as A₆Reset to the available state, when the master node handshakes with the newly added slave node 2X, the available node identification A can be selected₆Is assigned to the slave node 2X as a handshake node identification.

And 31, sending a master re-handshake message to the corresponding slave node identified by the conflicting handshake nodes to request the corresponding slave node to re-initiate a handshake flow.

After the slave nodes corresponding to the handshake node identifications with conflicts receive the master re-handshake message, the slave handshake information stored in the slave nodes can be reset, and the slave re-handshake message is sent to the master node to re-initiate a handshake process.

The slave handshake information is some interaction information stored by the slave node during the handshake process, and may include handshake node identifiers allocated in the handshake process.

Optionally, the reset method adopted by the master node and the slave node may be: and deleting the recorded information of the identifiers of the handshake nodes with conflict, or setting the state information of the identifiers of the handshake nodes with conflict as unoccupied.

Specifically, in connection with the embodiment described above in connection with FIG. 1a, if the random node identifier S is used₂And a random node identification S₁If the matching is inconsistent, it may be determined that the handshake node identifier B allocated to the slave node 21 has a conflict, and a handshake node identifier conflict processing procedure is triggered.

Identification A of conflicting handshake nodes₆The master node 10 resets the handshake node identification a₆Corresponding main handshake information, and identify A to the handshake node with conflict₆The corresponding slave node sends a master re-handshake message to request the corresponding slave node to re-initiate the handshake flow. Wherein the handshake node marksThe slave nodes to which B is assigned include

slave nodes

21 and 2N, and possibly other slave nodes to which handshake node identification B is assigned.

By adopting the scheme, the master handshake information is reset and the handshake information is re-sent, the re-handshake process can be sent to the slave nodes which are distributed with the same handshake node identification, the problem of handshake node identification conflict is comprehensively solved, the handshake node identifications distributed by the slave nodes are ensured to be different, the condition of communication confusion can be avoided, and the stability and reliability of communication interaction between the master node and the slave node are improved.

It can be understood that, in order to implement communication interaction between the master node and the slave node, the master node messages sent by the master node may be of various types, and the master re-handshake message is only one type of the master node messages.

Optionally, after the handshake is repeated, in order to facilitate to clearly determine whether the slave node identification message corresponding to the handshake node identification having the conflict before is received for the first time, for the handshake node identification having the conflict, the random node information of the corresponding slave node may also be reset, where the random node information includes: and at least one of an initial reception identifier adapted to characterize whether the slave node identification message is initially received or not, or a random node identifier.

For example, when it is determined that the slave node identification message corresponding to the handshake node identification is received for the first time, the master node may set an initial reception identification, which indicates whether the slave node identification message is received for the first time, to an invalid state, so that when the slave node identification message corresponding to the handshake node identification is received for the next time, it may be determined that the slave node identification message corresponding to the handshake node identification is not received for the first time by the initial reception identification. Therefore, the initial receiving identification mark is reset to be in an effective state, and the random node information resetting is completed.

For another example, when it is determined that the slave node identification message corresponding to the handshake node identification is received for the first time, the master node may store the random node identification in the storage area corresponding to the handshake node identification, and thus, when the slave node identification message corresponding to the handshake node identification is received next time, it is determined that the slave node identification message corresponding to the handshake node identification is not received for the first time by determining that the random node identification is stored in the storage area corresponding to the handshake node identification, the handshake node identification is deleted, and the random node information resetting is completed.

For example, the first-time received identifier or the random node identifier, which characterizes whether the slave node identifier message is received for the first time, may be used in combination to avoid that the random node identifier is not deleted or the first-time received identifier is in an error state.

By adopting the scheme, the random node information corresponding to the handshake node identifications with conflicts is reset, so that subsequent handshake node identification conflict detection is conveniently carried out after the handshake is carried out again.

In a further optional implementation, after receiving the master re-handshake message, the slave re-handshake message may be fed back to the master node to reinitiate the handshake flow and re-access the master node. As shown in fig. 4, the triggered handshake node identification conflict processing flow may further include the following steps:

and step 40, receiving the slave re-handshake message fed back by the slave node responding to the master re-handshake message.

And step 41, selecting an available node identifier for the slave node corresponding to the slave re-handshake message to serve as the handshake node identifier reset by the corresponding slave node.

Step 42, sending a master re-handshake confirmation message to a slave node corresponding to the slave re-handshake message, where the master re-handshake confirmation message includes: the available node identification.

Therefore, the handshake process can be carried out again on the slave nodes which are distributed with the same handshake node identification, new handshake node identification is distributed again, and the problem of handshake node identification conflict is solved.

In an alternative implementation, as shown in fig. 5, a flowchart of another communication processing method provided in an embodiment of the present invention is applied to a slave node, and the method may include the following steps:

and 50, generating a random node identifier.

In specific implementation, a random sequence generation method may be adopted to randomly generate a random sequence with a preset bit number as the random node identifier. The preset number of bits may be greater than the number of bits of the handshake node identifier. The random sequence generation method can select a binary system according to actual conditions, such as a 2-binary system, an 8-binary system, a 16-binary system and the like.

The more the preset bit number is, the wider the value range of the random sequence is, so that the probability of randomly generating the same random sequence can be reduced. For example, the number of bits of the handshake node identifier is 5 to 6 bits (Bit), the preset number of bits may be 32 bits, and any one 32-Bit 16-Bit numerical value sequence between 0x00000000 and 0xFFFFFFFF may be randomly generated by using a 16-Bit random sequence generation method.

Step 51, sending a slave node identification message to the master node, where the slave node identification message includes: and the handshake node identification and the random node identification are distributed in the handshake flow, so that the master node determines whether the handshake node identification distributed to the slave node in the handshake flow conflicts.

After receiving the slave node identification message sent by the slave node, the master node may perform handshake node identification collision detection, which may specifically refer to the related embodiments of the master node part and will not be described herein again.

According to the scheme, the slave nodes can generate random node identifications and send slave node identification messages containing the random node identifications to the master node, so that the master node determines whether the handshake node identifications allocated to the slave nodes in a handshake process conflict or not, therefore, the master node can automatically detect handshake node identification conflict through the random node identifications received for multiple times by actively sending the generated random node identifications, a software part is modified under the condition that a hardware architecture in an indoor distribution system is not changed, the phenomenon that the multiple slave nodes are allocated with the same handshake node identifications is found in time, the method and the device are widely applicable to various indoor distribution systems, the condition of communication confusion can be avoided, and the stability and reliability of communication interaction between the master node and the slave node are improved.

Further, the slave node identification message sent by the slave node may further include message Check information, for example, message Check bits such as CRC (Cyclic Redundancy Check). The master node verifies the slave node identification information through the information verification information carried in the slave node identification information, so that whether the received slave node identification information is complete and accurate is judged, and the safety and the accuracy of communication interaction are ensured.

In an alternative implementation, the generation of the random node identifier may be an independent algorithm process, and has no relation with other processes executed by the slave node or messages received by the slave node, so that the timing of generating the random node identifier by the slave node may be set according to the communication state of the slave node, and a precondition does not need to be set.

For example, the master node and the slave node are in an indoor distribution system, and after the indoor distribution system completes cell search, the communication states of the master node and the slave node may be as illustrated in fig. 6, and may include the following states:

the method comprises the following steps that (Init State), after an indoor distribution system is started and network searching is completed, a master node and a slave node enter an initialization State to complete necessary initialization operation;

the method comprises the following steps that a Master Boot State (Master Boot State) is started after initialization of a Master node is completed, and the Master Boot State is mainly used for broadcasting and informing that the Master node is restarted after some restarting operations of the Master node under the condition that a slave node does not know are processed;

waiting for a downlink heartbeat State (Wait DL Heart State), and entering a downlink heartbeat waiting State after the slave node completes initialization so as to Wait for a heartbeat message of the master node;

the method comprises the following steps that (1) an access State (RACH State) is obtained, and in the State, a slave node requests to access a master node;

a Normal working State (Normal State), in which the master node broadcasts and sends a heartbeat message to the slave node and completes a handshake process; after finishing the handshake process in the access state, the slave node enters a normal working state; and after the master node and the slave node are in a normal working state, the indoor distribution system works normally.

As can be seen from the communication state illustrated in fig. 6, after the slave node receives the heartbeat message of the master node, the slave node enters the access state to perform a handshake process with the master node, and after the slave node succeeds in handshake, the slave node obtains the allocated handshake node identifier and the master node establishes a communication connection with the slave node, the indoor distribution system enters a normal working state.

It should be noted that the heartbeat message of the master node is only an optional message form for triggering the slave node to enter the access state, and the heartbeat message of the master node may also be set to receive a handshake message specific to the master node after the slave node is initialized to enter the access state, where the heartbeat message of the master node is only an optional form of the handshake message sent by the master node, and the embodiments of the present invention do not limit the handshake message of the master node to adopt other forms.

Through the communication state of the indoor distribution system shown in fig. 6, the obtaining of the communication state of the slave node may include: the slave node comprises a starting state, an initialization state, a waiting downlink heartbeat state, an access state and a normal working state, and the slave node performs communication interaction with the master node in the normal working state, so that the slave node can generate the random node identifier when being in the starting state, the initialization state, the waiting downlink heartbeat state, the access state or the normal working state.

In an optional implementation, because the handshake node identifier collision affects the system operation, the slave node identifier message may be sent to the master node as a highest priority sending task, so that the master node preferentially performs handshake node identifier collision detection, and the stability and reliability of communication interaction between the master node and the slave node are ensured.

In an alternative implementation, as can be seen from the communication states illustrated in fig. 6, the master node and the slave node have requirements for sending and receiving messages in different communication states, and therefore, a set of communication timing planning scheme may be designed to determine respective occasions when the master node and the slave node send messages in different communication states.

Based on this, the embodiment of the present invention considers that the hyper frame number is introduced, and the hyper frame number can be used for communication timing planning between the master node and the slave node, that is, the hyper frame number can determine the respective sending time of the message by the master node and the slave node.

In an alternative implementation, the superframe number may be counted in milliseconds as a basic unit, such as adding 1 to 10 milliseconds per interval; in a more specific optional implementation, a communication system may include a system frame number for a specific mobile communication standard, and the embodiment of the present invention may extend a plurality of bit numbers as a superframe number on the basis of the system frame number of the communication system, so as to obtain the superframe number on the basis of the existing system frame number of the multiplexing communication system, and enable the superframe number to cover a longer time range, so that the master node and the slave node may perform communication timing planning within the longer coverage time range.

In an example, in the embodiment of the present invention, a system frame number of 10 bits may be obtained from a MIB (Master Information Block) (an actual MIB is provided with Information of 8 bits, and a physical layer may determine Information of 2 bits lower in the process of reading the MIB to obtain a system frame number of 10 bits in total); because the system frame number of 10 bits is not sufficient for communication timing planning of the indoor distribution system, the embodiment of the invention can expand a plurality of bits on the basis of the system frame number of 10 bits to obtain the hyper frame number (such as obtaining the main hyper frame number of the main node), for example, the embodiment of the invention can expand the information of 6 bits on the basis of the system frame number of 10 bits to obtain the hyper frame number of 16 bits.

Specifically, the slave node may synchronize the superframe number of the master node in the handshake flow, thereby obtaining the superframe number of the slave node, the master node may determine the message sending timing according to the superframe number of the master node, the slave node may determine the message sending timing according to the superframe number of the slave node, and since the superframe number changes with time and the timing frequencies of the master node and the slave node are the same, the change frequencies of the superframe numbers of the master node and the slave node are always the same, the change of the superframe numbers of the master node and the slave node keeps synchronization, and the master node and the slave node may send messages in the same rhythm based on the same superframe number. And the bit number of the hyper-frame number is not less than the bit number of the handshake node identification.

Specifically, because the superframe numbers of the master node and the slave node both have information of a plurality of bits, and the superframe numbers of the master node and the slave node both change along with time, on the basis that the superframe numbers of the master node and the slave node change along with time, the embodiment of the invention can determine whether the current time interval is the master node sending time interval or the slave node sending time interval based on the bit information of the specified position of the superframe number of the master node and the slave node.

For example, the embodiment of the present invention may set bit information of a first position of the hyper-frame number of the master node, and determine whether the current time is the master node transmission time period, and when the bit information of the first position of the hyper-frame number of the master node is a first value, the embodiment of the present invention may determine that the current time period is the master node transmission time period, so that the master node message may be transmitted to the slave node.

In this way, the embodiment of the present invention may set the bit information of the first position of the hyper-frame number of the slave node to determine whether the current time is the slave node transmission time period, and when the bit information of the first position of the hyper-frame number of the slave node is the second value, the embodiment of the present invention may determine that the current time period is the slave node transmission time period, so that the slave node message may be transmitted to the master node. Wherein the second value may be less than the first value.

As an alternative example, the bit positions in the hyper-frame number may be set to sequentially decrease from left to right, the first position may be the lower 5 bit position of the hyper-frame number, and the first value may be 0x10, so that the master node may send the master node message to the slave node when the bit information of the lower 5 bit position of the master hyper-frame number is 0x 10. And the second value instance may be 0x00 so that the slave node may transmit the slave node message to the master node when the bit information of the slave node's hyper frame number lower by 5 bit positions is 0x 00.

By adopting the scheme for carrying out time sequence planning by using the hyper-frame number, the master node can determine the time for sending the message to the slave node based on the hyper-frame number of the master node, and the slave node can determine the time for sending the message to the master node based on the hyper-frame number of the slave node after the hyper-frame number of the slave node is synchronous with the hyper-frame number of the master node, so that the master node and the slave node in an indoor distribution system can better coordinate to work, the communication time sequence planning scheme has lower realization complexity, and the complexity brought by the traditional central equipment for planning the communication time sequence can be reduced.

Further optionally, the slave node may determine whether to be the slave node transmission period of the slave node by acquiring bit information of the second position in the hyper frame number to match with the allocated handshake node identifier. For example, the second position may be at a high bit position of the hyper-frame number of the slave node, and if it is specified to acquire m bits of the high bit, m pieces of bit information are acquired from the left side of the hyper-frame number of the slave node and are matched with the bit information of each bit position in the handshake node identifier, and if the matching is successful, it may be determined as the slave node transmission time period of the slave node.

It can be understood that the matching manner may be set according to an actual situation, for example, m bit information may be subjected to and operation on bit information of each bit position in the handshake node identifier, and if the operation result is 1, the matching is successful. The embodiment of the method is not particularly limited to the matching mode.

In an alternative implementation, the slave node message may further comprise a slave node communication message, and the slave node may further transmit the slave node communication message after transmitting the slave node identification message and determining that the slave node transmission period is still in progress.

Wherein the slave node communication message comprises: at least one of signal quality information of the slave node, signal strength information of the slave node, and a feedback message of the slave node. The feedback message may include: the slave node responds to the master node message of the control type sent by the master node and feeds back the information to the master node.

In an alternative implementation, the slave node may transmit the slave node identification message based on a preset slave node identification message transmission period.

For example, the preset slave node identification message sending period may be a time period T, and after the random node identification is generated, the slave node sends the slave node identification message after determining, by the hyper frame number, the slave node sending period of the slave node from the initial time every T time according to the slave node identification message sending period T.

For another example, the preset slave node identification message sending period may be a sending number period Z, and after the slave node identification message is generated and sent for the first time, the slave node sends the slave node identification message after sending Z other types of slave node information (such as a slave node communication message, a slave handshake message, etc.) and determining the slave node sending period as the slave node of the slave node through the hyper frame number according to the slave node identification message sending period Z.

It will be appreciated that the slave node identification message transmission period may be other quantized periods in addition to a time period or number of periods. The embodiment of the present invention is not limited thereto.

In a further optional implementation, the slave node transmission period may further subdivide a first sub-period during which slave node identification messages are transmitted and a second sub-period during which other slave node messages are transmitted, based on bit information at another specified location of the slave node's hyper-frame number.

As an alternative example, after determining that the period is transmitted by the slave node through the first position of the superframe number of the slave node, the embodiment of the present invention may set bit information of the second position and the third position of the superframe number of the slave node to decide which slave node transmits the slave node message and the type of the transmitted message. For example, when the second position of the hyper-frame number of the slave node is matched with the allocated handshake node identifier and the bit information of the third position is a third value, it is determined that the slave node can send the slave node message, and the current time period is the first sub-time period, the slave node sends the slave node identifier message to the master node; when the second position of the hyper-frame number of the slave node is matched with the distributed handshake node identification and the bit information of the third position is a fourth value, determining that the slave node can send the slave node message, wherein the current time interval is a second sub-time interval, and the slave node sends other slave node messages to the master node; the slave node may not send any slave node message when the second position of the slave node's hyper-frame number does not match the assigned handshake node identification; the slave node may not send any slave node message to the master node when the second position of the slave node's hyper-frame number matches the assigned handshake node identification, but the bit information of the third position is not the third value or the fourth value.

Wherein the third position may overlap with the first position or the second position, or be in a position in the superframe number of the slave node different from both the first position and the second position; the third value may be less than the fourth value.

It can be known from the above that, whether the slave node is the slave node transmission time interval is determined by the first position of the hyper frame number of the slave node, after the slave node is determined as the slave node transmission time interval, which slave node transmits the slave node message and the type of the transmitted message is determined by the bit information of the second position and the third position of the hyper frame number of the slave node, and the communication interaction between each slave node and the master node is realized by circulating.

In practical application, the communication timing of the slave node can be planned by combining the two sub-periods and the slave node identification message sending period.

For example, the preset slave node identification message transmission cycle may be a time cycle T, after generating the random node identification, the slave node may determine, according to the slave node identification message transmission cycle T, whether the slave node transmission cycle is a first sub-cycle or a second sub-cycle from an initial time every T time after determining that the slave node transmission cycle is a slave node transmission cycle of the slave node by the hyper-frame number, and may transmit the slave node identification message to the master node in the first sub-cycle; for a second sub-period, other slave messages may be sent to the master node. If the time interval is not the first sub-time interval or the second sub-time interval, no slave node message can be sent to the master node.

Further optionally, the number of times of sending the slave node identification information may be reduced by setting the number of times of sending other messages and matching the sending number of times period. For example, the preset slave node identification message transmission cycle may be a transmission frequency cycle Z, after the random node identification is generated, and when the superframe number is determined to be the slave node transmission time period of the slave node and to be the first sub-time period, the slave node identification message may be transmitted to the master node, and with this as an initial time, other message transmission frequencies may be set as an initial value, and when the superframe number is determined to be the slave node transmission time period of the slave node and to be the second sub-time period, other slave node messages may be transmitted to the master node, and the other message transmission frequencies are added by 1; when the slave node is determined to be the slave node transmission time period of the slave node through the hyper frame number and is the first sub-time period, if the number of times of other message transmission is determined to be less than the transmission time period Z through matching, the slave node may not transmit the slave node identification message until the number of times of other message transmission is equal to the transmission time period Z, and when the slave node is determined to be the slave node transmission time period of the slave node through the hyper frame number and is the first sub-time period, the slave node may transmit the slave node identification message, and the number of times of other message transmission is reset to an initial value. Thus, after Z other slave node information (e.g., slave node communication messages, slave handshake messages, etc.) is sent, the slave node identification message may be sent again, thereby reducing the number of times the slave node identification message is sent.

In an alternative implementation, the master node may be in communication connection with a large number of slave nodes, and a large number of slave node identification messages are sent to the master node, so that even if the communication timing planning is performed by the hyper frame number, a message reception conflict may occur for the master node, and if the master node receives a large number of slave node identification messages sent by the same slave node in a short time, the slave node identification messages are useless and redundant, and may cause communication interference to the master node. Therefore, in order to reduce message reception collision and communication interference of the master node, the slave node may randomly select transmission or non-transmission of the slave node identification message based on the slave node identification message transmission cycle after determining the slave node transmission period as the slave node by the hyper frame number. When the slave node identification message is selected to be sent, the slave node sends the slave node identification; upon selecting not to send the slave node identification message, the slave node does not send the slave node identification.

In other words, the slave node may randomly choose not to transmit the slave node identification message instead of having to transmit the slave node identification message when it is determined by the hyper frame number that the slave node is in the slave node transmission period of the slave node and the condition for periodically transmitting the slave node identification message is satisfied.

In addition, after the slave node selects not to send the slave node identification message, the slave node may not send other slave node messages in the slave node sending period, so as to further reduce the data volume received by the master node.

In an optional implementation, after determining that the handshake node identifiers have a conflict, the master node may send a master re-handshake message to the slave node corresponding to the handshake node identifiers having the conflict, to request the corresponding slave node to re-initiate the handshake flow, and accordingly, after receiving the master re-handshake message sent by the master node, the slave node resets the slave handshake information in response to the master re-handshake message sent by the master node, and sends the slave re-handshake message to the master node, to re-initiate the handshake flow.

In one example, in conjunction with fig. 6, the slave node enters the access state from the normal operating state in response to the master-handshake message, resets the slave-handshake information, and sends the slave-handshake message to the master node, thereby reinitiating the handshake flow with the master node.

In an optional implementation, after receiving a slave re-handshake message fed back by a slave node in response to the master re-handshake message, the master node re-selects an available node identifier for the slave node in response to the received slave re-handshake message, and if the re-selected available node identifier is not occupied, the re-selected available node identifier may be used as a handshake node identifier allocated to the slave node, so as to send a master re-handshake confirmation message to the slave node corresponding to the slave re-handshake message, where the master re-handshake confirmation message includes: the available node identification.

And the slave node receives a master re-handshake confirmation message sent by the master node in response to the slave re-handshake message, resets the handshake node identification and completes the handshake process.

Therefore, the slave nodes which are allocated with the same handshake node identification can reallocate new handshake node identification by reinitiating the handshake flow, thereby solving the problem of handshake node identification conflict.

It is to be understood that while various embodiments have been described above as being applicable to either a master node or a slave node, the various alternatives described in the various embodiments can be combined, cross-referenced, and so forth without conflict, to extend to the variety of possible embodiments that can be considered disclosed and disclosed herein.

In an embodiment of the present invention, the master node, the slave node 1, and the slave node 2 are respectively powered on to complete a start-up process and an initialization process, the master node respectively performs a handshake process with the slave node 1 and the slave node 2, and the master node 10 stores a plurality of available node identifiers P₁～P_KWherein K is a natural number greater than 1. After completion of the handshake flow, slave node 1 and slave node 2 are assigned the same handshake node identification P₁. The slave node 1 and the slave node 2 respectively generate random node identifiers R₁And R₂. As shown in fig. 7, an optional signaling flow of the communication processing method provided in the embodiment of the present invention may include:

step S70, the slave node 1 sends the slave node identification message GM to the master node₁The slave node identification message GM1 includes: handshake node identification P distributed in handshake flow₁And a generated random node identification R1.

Step S71, the master node determines that the handshake node identification P is received for the first time₁Corresponding node identification information sent from the node, and storing random node identification R₁。

Step S72, from node 2 toThe master node sends a slave node identification message GM₂Said slave node identifying message GM₂The method comprises the following steps: handshake node identification P distributed in handshake flow₁And a generated random node identification R₂

Step S73, the master node determines that the handshake node identification P is not received for the first time₁Corresponding node identification information sent from the node obtains the stored random node identification R₁With random node identity R₂And (6) matching.

Step S74, the matching result is inconsistent, and the handshake node identification P is determined₁Sending a master-handshake message HM to a slave node corresponding to the slave node identification message that was not received for the first time₁To request the corresponding slave node to re-initiate the handshake flow, i.e. to identify as P to the handshake node₁The slave node 2 of (2) sends a master-handshake message HM₁Requesting the slave node 2 to re-initiate the handshake flow.

It is to be understood that the above embodiments are only examples, and may be adaptively combined and/or modified according to other alternatives described above, and the embodiments of the present invention do not limit the communication sequence and the interactive content between the master node and the slave node in practical applications.

The embodiment of the present invention further provides a master node corresponding to the above communication processing method, so that those skilled in the art can better understand and implement the embodiment of the present invention, which is described in detail below with reference to the accompanying drawings by specific embodiments.

Referring to an optional block diagram of a master node in the embodiment of the present invention shown in fig. 8, in this specification, the master node 80 may include:

a master node message receiving module 81, configured to receive a slave node identification message sent by a slave node, where the slave node identification message includes: the slave node generates a random node identifier and a handshake node identifier distributed to the slave node in a handshake flow;

a receiving state judging module 82, configured to determine whether the slave node identifier message is received for the first time according to the handshake node identifier;

a message storage module 83, configured to store the random node identifier when determining that the slave node identifier message is received for the first time;

an identifier matching module 84, configured to, when it is determined that the slave node identifier message is not received for the first time, obtain a random node identifier corresponding to the handshake node identifier and stored in the message storage module 83, and match the random node identifier carried in the slave node identifier message,

a conflict detection module 85, configured to determine whether there is a conflict in the handshake node identifications allocated to the slave node in response to the matching result of the node identification matching module 84.

By adopting the scheme, whether the master node receives the slave node identification message sent by the slave node corresponding to the handshake node identification for the first time can be determined according to the handshake node identification in the received slave node identification message, if so, the random node identification in the slave node identification message can be stored, the subsequent handshake node identification conflict detection is convenient, if not, the stored random node identification corresponding to the handshake node identification can be obtained and matched with the random node identification carried by the slave node identification message, whether the handshake node identification conflicts or not can be determined according to the matching result, the software part is reformed under the condition of not changing the hardware architecture in the indoor distribution system, the automatic detection of the handshake node identification conflict can be realized, and the method can be widely applied to various indoor distribution systems, the phenomenon that a plurality of slave nodes are distributed with the same handshake node identification is found in time, the condition of communication chaos can be further avoided, and the stability and reliability of communication interaction between the master node and the slave node are improved.

In one example, as shown in fig. 8, the master node 80 may further include:

the master node message sending module 86 is configured to send a master re-handshake message to a slave node corresponding to the slave node identification message that is not received for the first time according to the handshake node identification that has the conflict, so as to request the corresponding slave node to initiate a handshake flow again.

Optionally, the master node message receiving module 81 is further configured to receive a slave re-handshake message fed back by a slave node in response to the master re-handshake message.

As shown in fig. 8, the master node 80 may further include: the identifier allocating module 87 is configured to select an available node identifier for the slave node corresponding to the slave re-handshake message, so as to serve as the handshake node identifier reset by the corresponding slave node;

the master node message sending module 86 is further configured to send a master re-handshake confirmation message to a slave node corresponding to the slave re-handshake message, where the master re-handshake confirmation message includes: the available node identification.

By adopting the scheme, the handshake flow is reinitiated, the handshake node identifiers can be redistributed to the slave nodes corresponding to the slave node identifier messages which are not received for the first time, the problem of handshake node identifier conflict is solved in a targeted manner, the handshake node identifiers distributed to the slave nodes are different, the condition of communication confusion can be avoided, and the stability and reliability of communication interaction between the master node and the slave node are improved.

In another example, as shown in fig. 9, the master node 80 may further include:

a master information resetting module 91, configured to reset corresponding master handshake information according to a handshake node identifier that has a conflict, where the master handshake information includes: a handshake node identifier allocated to the slave node in a handshake flow;

and a master node message sending module 92, configured to send a master re-handshake message to the slave node that identifies the corresponding slave node that has the conflict, so as to request the corresponding slave node to re-initiate a handshake flow.

As shown in fig. 9, the master node 80 may further include: an identifier allocating module 93, configured to select an available node identifier for the slave node corresponding to the slave re-handshake message, so as to serve as a handshake node identifier reset by the corresponding slave node;

the master node message sending module 92 is further configured to send a master re-handshake confirmation message to a slave node corresponding to the slave re-handshake message, where the master re-handshake confirmation message includes: the available node identification.

Optionally, as shown in fig. 9, the master information resetting module 91 is further configured to reset random node information of a corresponding slave node according to a handshake node identifier having a conflict, where the random node information includes: and at least one of an initial reception identifier adapted to characterize whether the slave node identification message is initially received or not, or a random node identifier.

By adopting the scheme, the random node information corresponding to the handshake node identifications with conflicts is reset, so that subsequent handshake node identification conflict detection can be conveniently carried out after re-handshaking.

In practical applications, each module included in the master node may be implemented by using a corresponding hardware circuit, a corresponding device, a corresponding module, or the like. For example, the master node message sending module and the master node message receiving module may be implemented by corresponding buses, communication lines, transceiver devices, and the like; the main information resetting module, the identification distributing module, the identification setting module and the like can be executed by data processing chips such as a single chip microcomputer and an FPGA; the conflict detection module can be realized by a corresponding detection circuit, a detection device or a detection chip and the like; the message storage module can adopt hardware with storage function such as a memory to realize read-write function. The modules may be controlled by the same processing device, or may be executed by different processing devices, and the different processors may be distributed on the same hardware device, or may be distributed on different hardware devices.

In an optional implementation, fig. 10 shows an optional block diagram of the master node provided in the embodiment of the present invention, and as shown in fig. 10, the master node may include: a processor 1, a communication interface 2, a memory 3 and a communication bus 4.

In the embodiment of the present invention, the number of the processor 1, the communication interface 2, the memory 3, and the communication bus 4 is at least one, and the processor 1, the communication interface 2, and the memory 3 complete mutual communication through the communication bus 4.

Optionally, the communication interface 2 may be an interface of a communication module for performing network communication;

alternatively, the processor 1 may be a CPU (central processing unit), a GPU (Graphics processing unit), an NPU (embedded neural network processor), an FPGA (Field programmable gate Array), a TPU (tensor processing unit), an AI chip, an asic (application Specific Integrated circuit), a baseband chip, or one or more Integrated circuits configured to implement the embodiments of the present invention.

The memory 3 may comprise a high-speed RAM memory and may also comprise a non-volatile memory, such as at least one disk memory.

The memory 3 stores one or more computer-executable instructions, and the processor 1 calls the one or more computer-executable instructions to execute the master node-angle communication processing method provided by the embodiment of the present invention.

The embodiment of the present invention further provides a storage medium, where the storage medium may store one or more computer-executable instructions, and the one or more computer-executable instructions may be used to execute the method for processing communication at a master node angle provided in the embodiment of the present invention. Specifically, reference may be made to the foregoing embodiments, which are not described herein again.

The embodiments of the present invention further provide a slave node corresponding to the communication processing method, so that those skilled in the art can better understand and implement the embodiments of the present invention, which will be described in detail below with reference to the accompanying drawings.

Referring to an alternative block diagram of a slave node in the embodiment of the present invention shown in fig. 11, in this specification, the slave node 110 may include:

a random node identifier generating module 111, configured to generate a random node identifier;

a slave node message sending module 112, configured to send a slave node identification message to the master node, so that the master node determines whether there is a conflict in the handshake node identifications allocated to the slave nodes in the handshake flow.

Optionally, the random generation module 111 is configured to generate the random node identifier when the node is in a start state, an initialization state, a wait for downlink heartbeat state, an access state, or a normal working state.

Further optionally, the random generating module 111 is configured to randomly generate a random sequence of preset bit numbers as the random node identifier, where the preset bit numbers are greater than the bit numbers of the handshake node identifier.

Optionally, the slave node message sending module 112 is configured to send the slave node identification message to the master node as a highest priority sending task.

Optionally, the slave node message sending module 112 is configured to send the slave node identification message based on a preset slave node identification message sending period.

Further optionally, the slave node message sending module 112 randomly selects to send the slave node identification message according to the slave node identification message sending period.

Optionally, the slave node message sending module 112 is configured to determine that the slave node is in the slave node sending time period according to the hyper frame number synchronized in the handshake flow, and send the slave node identification message to the master node.

Optionally, the slave node message sending module 112 is further configured to determine, after sending the slave node identification message, that the slave node is still in the slave node sending period, and send a slave node communication message, where the slave node communication message includes: at least one of signal quality information of the slave node, signal strength information of the slave node, and a feedback message of the slave node.

Optionally, as shown in fig. 11, the slave node 110 further includes:

a slave node message receiving module 113, configured to receive a master re-handshake message sent by the master node;

a slave information resetting module 114 for resetting slave handshake information in response to the master re-handshake message;

the slave node message sending module 112 is further configured to send a slave re-handshake message to the master node to re-initiate a handshake flow.

An optional slave node message receiving module 113, further configured to receive a master re-handshake confirmation message sent by the master node in response to the slave re-handshake message;

as shown in fig. 11, the slave node 110 further includes: an identifier setting module 115, configured to reset the handshake node identifier, and complete the handshake flow, where the master handshake confirmation message includes: an available node identification assigned by the master node.

In practical applications, each module included in the slave node may be implemented by using a corresponding hardware circuit, device, module, or the like. For example, the slave node message transmitting module and the slave node message receiving module, etc. may be implemented by respective buses, communication lines, transceiver devices, etc.; the random node identification generation module, the slave information resetting module, the identification setting module and the like can be executed through data processing chips such as a single chip microcomputer and an FPGA. The modules may be controlled by the same processing device, or may be executed by different processing devices, and the different processors may be distributed on the same hardware device, or may be distributed on different hardware devices.

Embodiments of the present invention also provide a slave node, and in an alternative implementation, an alternative block diagram of the slave node may be shown in fig. 10, where the slave node includes a memory and a processor, the memory stores one or more computer-executable instructions, and the processor calls the one or more computer-executable instructions to execute the communication processing method from the perspective of the slave node provided by the embodiments of the present invention.

Embodiments of the present invention also provide a storage medium, which may store one or more computer-executable instructions, where the one or more computer-executable instructions may be configured to execute the method for processing communication from a node perspective provided in the foregoing embodiments of the present invention. Specifically, reference may be made to the foregoing embodiments, which are not described herein again.

The embodiment of the invention also provides an indoor distribution system, which comprises the master node and a plurality of slave nodes. And the master node and each slave node establish communication connection through a handshake process. The specific communication processing method and the structures of the master node and the slave node can be described with reference to the foregoing embodiments, and are not described herein again.

Although the embodiments of the present invention have been disclosed, the present invention is not limited thereto. Various changes and modifications may be effected therein by one skilled in the art without departing from the spirit and scope of the invention as defined in the appended claims.

Claims

1. A communication processing method is applied to a master node, the master node establishes communication connection with a slave node through a handshake process, and the method comprises the following steps:

2. The communication processing method according to claim 1, further comprising:

and for the handshake node identifications with conflicts, sending a master re-handshake message to the slave node corresponding to the slave node identification message which is not received for the first time so as to request the corresponding slave node to initiate the handshake process again.

3. The communication processing method according to claim 1, further comprising:

for the handshake node identifications with conflicts, resetting corresponding main handshake information, wherein the main handshake information comprises: a handshake node identifier allocated to the slave node in a handshake flow;

and sending a master re-handshake message to the corresponding slave node identified by the conflicting handshake nodes to request the corresponding slave node to re-initiate a handshake flow.

4. The communication processing method according to claim 3, further comprising:

for the handshake node identifications with conflict, resetting the random node information of the corresponding slave node, wherein the random node information comprises: and at least one of an initial reception identifier adapted to characterize whether the slave node identification message is initially received or not, or a random node identifier.

5. The communication processing method according to any one of claims 2 to 4, further comprising:

receiving a slave re-handshake message fed back by a slave node in response to the master re-handshake message;

distributing available node identifications to the slave nodes corresponding to the slave re-handshake messages to serve as handshake node identifications reset by the corresponding slave nodes;

sending a master re-handshake confirmation message to a slave node corresponding to the slave re-handshake message, the master re-handshake confirmation message including: the available node identification.

6. A communication processing method applied to a slave node, the method comprising:

generating a random node identification;

7. The communication processing method according to claim 6, wherein the sending the slave node identification message to the master node comprises:

and sending the slave node identification message based on a preset slave node identification message sending period.

8. The communication processing method according to claim 7, wherein the sending the slave node identification message based on a preset slave node identification message sending period includes:

and randomly selecting to send or not to send the slave node identification message based on the slave node identification message sending period, and sending the slave node identification when selecting to send the slave node identification message.

9. The communication processing method according to any of claims 6 to 8, wherein the generating a random node identifier comprises:

and generating the random node identifier when the mobile terminal is in a starting state, an initialization state, a downlink heartbeat waiting state, an access state or a normal working state.

10. The communication processing method according to any one of claims 6 to 8, wherein the sending the slave node identification message to the master node comprises:

and sending the slave node identification message to the master node as a highest-priority sending task.

11. The communication processing method according to any one of claims 6 to 8, further comprising, before the sending of the slave node identification message to the master node:

determining that the slave node is in a slave node transmission period based on the hyper-frame number synchronized in the handshake flow.

12. The communication processing method according to claim 11, further comprising:

determining, after transmitting the slave node identification message, that a slave node communication message is still transmitted for the slave node transmission period, the slave node communication message comprising: at least one of signal quality information of the slave node, signal strength information of the slave node, and a feedback message of the slave node.

13. The communication processing method according to any one of claims 6 to 8, wherein the generating a random node identifier comprises:

and randomly generating a random sequence of preset bit numbers as the random node identification, wherein the preset bit numbers are greater than the bit numbers of the handshake node identification.

14. The communication processing method according to any one of claims 6 to 8, further comprising:

resetting slave handshake information in response to a master re-handshake message sent by the master node;

and sending a slave re-handshake message to the master node to re-initiate a handshake flow.

15. The communication processing method according to claim 14, further comprising:

receiving a master re-handshake confirmation message sent by the master node in response to the slave re-handshake message, resetting a handshake node identifier, and completing a handshake flow, where the master re-handshake confirmation message includes: an available node identification assigned by the master node.

16. A master node, comprising:

17. A slave node, comprising:

18. A master node comprising to a memory storing one or more computer-executable instructions and a processor invoking the one or more computer-executable instructions to perform the communication processing method of any of claims 1-5.

19. A slave node comprising a memory storing one or more computer-executable instructions and a processor invoking the one or more computer-executable instructions to perform the communication processing method of any of claims 6-15.

20. An indoor distribution system comprising a master node according to claim 16 and a plurality of slave nodes according to claim 17, the master node and each slave node establishing a communication connection via a handshake procedure.

21. A storage medium storing one or more computer-executable instructions for performing the communication processing method of any one of claims 1-5 or any one of claims 6-15.