CN111757335B - Access and access control method, device, system, node and storage medium - Google Patents

Access and access control method, device, system, node and storage medium Download PDF

Info

Publication number
CN111757335B
CN111757335B CN202010662353.3A CN202010662353A CN111757335B CN 111757335 B CN111757335 B CN 111757335B CN 202010662353 A CN202010662353 A CN 202010662353A CN 111757335 B CN111757335 B CN 111757335B
Authority
CN
China
Prior art keywords
node
slave
access
identification
slave node
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202010662353.3A
Other languages
Chinese (zh)
Other versions
CN111757335A (en
Inventor
宋松伟
陈加轩
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Spreadtrum Semiconductor Chengdu Co Ltd
Original Assignee
Spreadtrum Semiconductor Chengdu Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Spreadtrum Semiconductor Chengdu Co Ltd filed Critical Spreadtrum Semiconductor Chengdu Co Ltd
Priority to CN202010662353.3A priority Critical patent/CN111757335B/en
Publication of CN111757335A publication Critical patent/CN111757335A/en
Application granted granted Critical
Publication of CN111757335B publication Critical patent/CN111757335B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/18—Network planning tools
    • H04W16/20—Network planning tools for indoor coverage or short range network deployment
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W48/00—Access restriction; Network selection; Access point selection
    • H04W48/08—Access restriction or access information delivery, e.g. discovery data delivery

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The embodiment of the invention provides an access and an access control method, a device, a system, a node and a storage medium, wherein the access control method comprises the following steps: receiving an access request message from a slave node; distributing node identifications to the slave nodes according to a preset rule; returning an access confirmation message to the slave node, the access confirmation message comprising: the node identification assigned to the slave node. By adopting the scheme of the embodiment of the invention, the automatic allocation of the node identifiers of the slave nodes in the indoor distribution system can be realized, and the effective identification and management of the slave nodes by the master node can be ensured without manual installation, setting and debugging.

Description

Access and access control method, device, system, node and storage medium
Technical Field
The embodiments of the present invention relate to the field of communications technologies, and in particular, to an access method, an access control device, an access system, a node, and a storage medium.
Background
In an urban application environment, due to the rapid increase of mobile users and the increase of high-rise buildings, the telephone traffic density and the coverage requirement are continuously increased, and under indoor environments such as large buildings, underground shopping malls, underground parking lots and the like, mobile communication signals are weak, so that 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 realize the identification and management of the slave nodes by the master node, a unique node identification (such as a node number) needs to be set for each slave node in the application. It is currently the practice to set a non-conflicting fixed node identification for each slave node of an indoor distribution system when installing the slave nodes. In the process, terminal equipment such as a mobile phone or a notebook computer and the like is required to be connected with the slave nodes for setting and debugging, so that the equipment installation complexity is greatly increased, and the workload for setting node identifications and debugging is greatly increased along with the increase of the slave nodes of the indoor distribution system, so that the requirements on installers and the training cost are further increased.
Disclosure of Invention
In view of this, embodiments of the present invention provide an access and access control method, apparatus, system, node, and storage medium, which can implement automatic allocation of node identifiers of slave nodes in an indoor distribution system, and can ensure effective identification and management of the slave nodes by a master node without manual installation, setting, and debugging.
In order to achieve the above purpose, the embodiments of the present invention provide the following technical solutions:
an access control method is applied to a main node, and comprises the following steps:
receiving an access request message from a slave node;
distributing node identifications to the slave nodes according to a preset rule;
returning an access confirmation message to the slave node, the access confirmation message comprising: the node identification assigned to the slave node.
An access method is applied to a slave node, and comprises the following steps:
sending an access request message to a main node;
receiving an access confirmation message returned by the master node, wherein the access confirmation message comprises: and the master node distributes the node identification for the slave node according to a preset rule based on the node identification requested by the slave node in advance.
A host node, the host node comprising:
a first message receiving module, adapted to receive an access request message from a node;
the node identifier distribution module is suitable for distributing node identifiers for the slave nodes according to a preset rule after receiving the access request message of the slave nodes;
a first message sending module, configured to return an access confirmation message to the slave node, where the access confirmation message includes: the node identification assigned to the slave node.
A slave node, the slave node comprising:
the second message sending module is suitable for sending an access request message to the main node;
a second message receiving module, adapted to receive an access confirmation message returned by the master node, where the access confirmation message includes: and the master node distributes node identifications for the slave nodes according to a preset rule.
An embodiment of the present invention further provides another master node, including: at least one memory storing one or more computer-executable instructions and at least one processor invoking the one or more computer-executable instructions to perform the access control method of the foregoing embodiments.
The embodiment of the invention also provides another slave node, which comprises: at least one memory storing one or more computer-executable instructions and at least one processor invoking the one or more computer-executable instructions to perform the access method of the foregoing embodiments.
Embodiments of the present specification also provide a storage medium storing one or more computer-executable instructions for performing the access control method described in the foregoing embodiments or performing the access method described in the foregoing embodiments.
On one hand, by adopting the access control method provided by the embodiment of the invention, the master node allocates the node identifier to the slave node according to the preset rule based on the node identifier pre-requested by the slave node carried in the access request message from the slave node, and returns the node identifier allocated to the slave node through the access confirmation message, so that the automatic allocation of the node identifier in the access process of the slave node in the indoor distribution system can be realized, the effective identification and management of the master node to the slave node can be ensured without manual installation setting and debugging, the equipment installation complexity can be reduced, and the allocation efficiency of the slave node identifier can be improved.
On the other hand, with the access scheme in the embodiment of the present invention, after sending an access request message to a master node, a slave node may receive an access confirmation message returned by the master node, where the access confirmation message includes: the master node allocates the node identification to the slave node according to the preset rule based on the node identification requested by the slave node, so that the slave node can obtain the node identification allocated to the slave node by the master node through the access flow, the automatic allocation of the node identification in the access process of the slave node in an indoor distribution system can be realized, the effective identification and management of the slave node by the master node can be ensured without manual installation, setting and debugging, the equipment installation complexity can be reduced, and the allocation efficiency of the slave node identification can be 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. 1 is a block diagram of an indoor distribution system according to an embodiment of the present invention;
fig. 2 is a flowchart of an access control method according to an embodiment of the present invention;
fig. 3 is a diagram illustrating a communication status of an indoor distribution system according to an embodiment of the present invention;
fig. 4 is a flowchart of an access method according to an embodiment of the present invention;
FIG. 5 is a signaling flow diagram of a handshaking method in an embodiment of the present invention;
figure 6 is a block diagram of a handshake offer message in an embodiment of the invention;
FIG. 7 is a block diagram of a handshake request message according to an embodiment of the present invention;
fig. 8 is a block diagram of a handshake confirmation message according to an embodiment of the present invention;
FIG. 9 is a signaling flow diagram of another handshaking method in an embodiment of the present invention;
fig. 10 is a structural diagram of another handshake request message in the embodiment of the present invention;
FIG. 11 is a block diagram of a host node in an embodiment of the invention;
FIG. 12 is a block diagram of a slave node in an embodiment of the present invention;
fig. 13 is a schematic structural diagram of a master node according to an embodiment of the present invention.
Detailed Description
At present, the coverage of a 4G (fourth generation mobile communication technology) network, such as an LTE (Long Term Evolution) network, is relatively perfect, 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, but with the advance of 5G (fifth generation mobile communication technology) network construction, a 5G network puts higher requirements on the coverage of mobile communication signals in the indoor environment, and under a 5G network, the indoor distribution systems may have more slave nodes, so that how to fully utilize the existing indoor distribution systems for mobile communication signals in the indoor environment, the construction and maintenance costs of the 5G network are reduced, and the improvement of the coverage of the 5G network in the indoor environment becomes a significant subject. In the problem, how to realize the identification and management of the slave nodes by the master node in the indoor distribution system is an urgent problem to be solved.
As shown in fig. 1, the indoor distribution system 1A mainly includes a master node 10 and a plurality of slave nodes 11 to 1N, the master node 10 is connected to the information source 01, and transmits a mobile communication signal of the information source 01 to the slave nodes 11 to 1N, and the slave nodes 11 to 1N process the received mobile communication signal and transmit the processed mobile communication signal to an air interface, thereby completing coverage of the mobile communication signal in an indoor environment.
In order to identify different slave nodes in the indoor distribution system and realize the identification and management of the slave nodes by the master node, the handshake needs to be realized based on the node identifications (such as node numbers) of the slave nodes. At present, when the slave nodes are installed, a non-conflicting fixed node identifier is set for each slave node of the indoor distribution system. In the process, terminal equipment such as a mobile phone or a notebook computer is required to be connected with the slave node to set the fixed node identifier, so that the master node and the slave node perform communication interaction based on the fixed node identifier set in advance by the slave node.
In the process, when the slave nodes are installed, a non-conflicting fixed node identifier is set for each slave node of the indoor distribution system in advance, so that the installation complexity of the slave nodes is undoubtedly greatly increased, and under the 5G network environment, the workload for setting the node identifiers is greatly increased due to the fact that the slave nodes with a large number of indoor distribution systems are arranged, and the requirements for installation personnel and the training cost are further increased.
In order to solve the above problem, embodiments of the present invention provide an improved access control scheme between a master node and a slave node, so that in a process of accessing a slave node to a master node in an indoor distribution system, the master node automatically allocates a node identifier to the slave node, thereby reducing the complexity of setting the node identifier for the slave node, and effectively ensuring the identification and management of the master node to the slave node.
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.
Referring to the flowchart of the access control method shown in fig. 2, as an alternative implementation, the access control method may be applied to a master node, and in a process of accessing a slave node to an indoor distribution system master node, the master node may perform the following steps:
step S20, an access request message from the slave node is received.
As an alternative implementation, the access request message may be a handshake request message from a slave node.
In a specific implementation, the access request message may include a node identifier requested in advance as the node identifier recommended by the slave node. As an alternative implementation, the node identifier of the pre-request may be any one of the following:
1) a history node identification of the slave node;
2) a randomly generated node identification.
As an optional implementation, the access request message may further comprise a historical node identification information indicator adapted to indicate a type of node identification pre-requested by the slave node. When the historical node identification information indicator indicates that the node identification type pre-requested by the slave node is historical node identification, the node identification pre-requested by the slave node is the historical node identification of the slave node; when the historical node identification information indicator indicates that the node identification type pre-requested by the slave node is non-historical node identification, the node identification pre-requested by the slave node is the randomly generated node identification.
As an optional implementation, the access request message may further include random information adapted to characterize a source of the access request message, where the random information may be randomly generated by the slave node or generated by a third party in communication with the slave node and sent to the slave node, and the slave node may carry the random information when accessing the indoor distribution system without allocating a node identifier, and then may determine, by the master node of the random information, which slave node the access request message comes from.
And step S21, distributing node identification for the slave node according to a preset rule.
In a specific implementation, the master node may allocate a node identifier to the slave node according to a preset rule. For example, available node identifiers may be selected from a preset node identifier set as the node identifiers allocated to the slave nodes, and as a specific implementation, one node identifier may be randomly selected as an available node identifier and allocated to the slave nodes in a certain order (for example, from small to large, or from large to small).
In a specific implementation, if the access request message includes a node identifier of a pre-request, a node identifier may be allocated to the slave node according to a preset rule based on the node identifier of the pre-request.
Specifically, the slave node may be assigned a node identification by: determining whether the node identification pre-requested by the slave node is occupied; when the node identification requested by the slave node in advance is not occupied, the node identification requested by the slave node in advance is allocated to the slave node; when the node identifier pre-requested by the slave node is occupied, an unoccupied node identifier is searched and allocated to the slave node.
When the node identifier pre-requested by the slave node is occupied, an unoccupied node identifier can be found in various ways and assigned to the slave node. As an alternative implementation, an unoccupied node identifier may be searched in a descending order and allocated to the slave node; as an alternative implementation, an unoccupied node identity may be randomly found and assigned to the slave node.
With the above embodiment, when the node identifier pre-requested by the slave node is not occupied, the node identifier pre-requested by the slave node is allocated to the slave node; when the node identifier pre-requested by the slave node is occupied, an unoccupied node identifier is searched and allocated to the slave node, so that the node identifier of the slave node can be adaptively allocated without manual debugging, and the flexibility of the node identifier allocation of the slave node is improved.
Corresponding to step S20, if the access request message includes a history node identifier information indicator, determining whether the history node identifier is occupied when the history node identifier information indicator indicates that the node identifier type pre-requested by the slave node is a history node identifier, and allocating the history node identifier to the slave node when the history node identifier is not occupied; when the historical node identifier is occupied, searching an unoccupied node identifier and distributing the unoccupied node identifier to the slave node; when the historical node identification information indicator indicates that the node identification type pre-requested by the slave node is non-historical node identification, determining whether the randomly generated node identification is occupied, and when the randomly generated node identification is not occupied, allocating the randomly generated node identification to the slave node; and when the randomly generated node identifier is occupied, searching an unoccupied node identifier and distributing the unoccupied node identifier to the slave node. Through the node identification distribution process, the self-adaptive distribution of the node identification can be realized, and the node identification pre-requested by the slave node, especially the historical node identification of the slave node, is preferentially used, so that the available node identification resources are fully utilized.
Step S22, returning an access confirmation message to the slave node, where the access confirmation message includes: the node identification assigned to the slave node.
The access confirmation message may be a handshake confirmation message returned to the slave node, corresponding to the handshake request message in step S20.
Corresponding to the random information contained in the access request message in step S20, the access confirmation message including the random information may be broadcast and transmitted including the random information, so that the slave node corresponding to the random information recognizes the access confirmation message and accepts the node identifier as its own node identifier. In this way, under the condition that the slave node does not allocate the node identifier, the slave node sending the access request message can identify the corresponding access confirmation message through the random information which is contained in the access request message and characterizes the source of the access request message, and further can obtain the node identifier allocated by the master node, so that the node identifier of the slave node can be automatically allocated in the access process.
According to the access control method, the master node allocates the node identification to the slave node according to the preset rule based on the node identification requested by the slave node in the access request message from the slave node, and returns the node identification allocated to the slave node through the access confirmation message, so that the automatic allocation of the node identification in the access process of the slave node in an indoor distribution system can be realized, the effective identification and management of the master node to the slave node can be ensured without manual installation, setting and debugging, the equipment installation complexity can be reduced, and the allocation efficiency of the slave node identification can be improved.
In a specific implementation, if an unoccupied node identifier cannot be found, an access confirmation message returned to the slave node may carry allocation node failure indication information to trigger the slave node to initiate an access procedure again, so that the node identifier may be automatically allocated to the slave node in a subsequent slave node access process.
In an alternative implementation, after the indoor distribution system completes the cell search, its communication status may be as illustrated in fig. 3, including:
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 heartbeat State), and after finishing initialization, entering the waiting downlink heartbeat State to Wait for a heartbeat message of the master node;
in the access State (RACH State), in which a slave node requests access to a master node, embodiments of the present invention may implement handshaking between the master node and the slave node in this State, and adaptively allocate a node identifier to the slave node;
in a Normal working State (Normal State), the master node completes initialization operation in the initialization State and has broadcast notification to the master node to restart in the master boot State, then enters the Normal working State, and in the State, 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.
Through the communication state illustrated in fig. 3, it can be seen that, when the slave node receives the heartbeat message of the master node, the slave node enters the access state, and can perform handshaking with the master node, and when the handshaking is successful, the slave node obtains the allocated node identifier, and then the indoor distribution system enters the 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 in the embodiment of the present invention, the slave node may also be configured to receive a handshake invitation message specific to the master node after initialization, so as to enter the access state, and the heartbeat message of the master node is only an optional form of the handshake invitation message.
In some embodiments of this specification, based on the optional implementation of the communication state, after the master node and the slave node are respectively powered on and initialized, the access control method in the foregoing embodiment may be executed in the access state, so as to implement automatic allocation of node identifiers in the slave node access process.
In order to make the present illustrative embodiment better understood and implemented by those skilled in the art, the following description is made with reference to an access procedure of a slave node.
Referring to the flowchart of the access method shown in fig. 4, the access method may be applied to a slave node in an indoor distribution system, and specifically may be executed by the following steps:
step S40, sending an access request message to the master node.
As an optional implementation, the access request message may include: the node identification pre-requested by the slave node can be used as the node identification recommended by the slave node.
In a specific implementation, the slave node may obtain the node identifier allocated to it by the master node through a handshake procedure. The access request message sent to the master node may be a handshake request message, and the handshake request message may include a node identifier requested by the slave node in advance.
In a specific implementation, the node identifier pre-requested by the slave node may include any one of the following:
1) a history node identification of the slave node;
2) a randomly generated node identification.
In a specific implementation, the access request message may further include: a historical node identification information indicator adapted to indicate a type of node identification pre-requested by the slave node. The type of node identification pre-requested from the node may be determined based on actual conditions and indicated by the historical node identification information indicator.
Specifically, when the history node identification information indicator indicates that the node identification type pre-requested by the slave node is history node identification, the node identification pre-requested by the slave node is history node identification of the slave node; when the historical node identification information indicator indicates that the node identification type pre-requested by the slave node is non-historical node identification, the node identification pre-requested by the slave node is the randomly generated node identification.
In an implementation, if the slave node has accessed a certain indoor distribution system, a historical node identification may be maintained. In order to make full use of the node identifier resources and reduce allocation conflicts, the saved historical node identifier may be obtained as the node identifier pre-requested by the slave node.
If the slave node has not accessed any indoor distribution system, a node identifier can be randomly generated for the slave node as the node identifier pre-requested by the slave node. As a specific implementation, the random node identification may be generated by the slave node itself, or randomly generated by a device in communication with the slave node. In a specific implementation, the slave node or a device communicating with the slave node may include a random number generator for randomly generating a node identification. The random number generator may be a hardware circuit, a software device, or a chip or a device, a circuit, etc. implemented by combining software and hardware.
Step S41, receiving an access confirmation message returned by the master node, where the access confirmation message includes: and the master node distributes node identifications for the slave nodes according to a preset rule.
Corresponding to step S40, the access confirmation message returned by the master node may be a handshake confirmation message, and the handshake confirmation message may include a node identifier allocated to the slave node.
The specific implementation that the master node allocates the node identifier to the slave node according to the preset rule based on the node identifier pre-requested by the slave node may be introduced in the foregoing embodiment of the access control method, and a description thereof is not further provided herein.
By adopting the above access scheme, the slave node sends an access request message to the master node, and then can receive an access confirmation message returned by the master node, wherein the access confirmation message includes: the master node allocates the node identification to the slave node according to the preset rule based on the node identification requested by the slave node, so that the slave node can obtain the node identification allocated to the slave node by the master node through the access flow, the automatic allocation of the node identification in the access process of the slave node in an indoor distribution system can be realized, the effective identification and management of the slave node by the master node can be ensured without manual installation, setting and debugging, the equipment installation complexity can be reduced, and the allocation efficiency of the slave node identification can be improved.
In a specific implementation, if the master node fails to allocate a node identifier to the slave node in the slave node access process, the returned access confirmation message may carry allocation node failure indication information to indicate that the master node fails to allocate a node identifier to the slave node according to a preset rule based on the node identifier pre-requested by the slave node, and the slave node may send an access request message to the master node again in response to the allocation node failure indication information, so that the slave node may be automatically allocated with a node identifier in a subsequent slave node access process.
In a specific implementation, as described in the foregoing embodiment, the access method described in the foregoing embodiment may be executed after the master node and the slave node are respectively powered on and initialized.
In an alternative implementation, the embodiment of the present invention may allocate the available node identifiers to the slave nodes during the handshake process by the master node. Optionally, fig. 5 shows a signaling flow of the handshaking method provided in the embodiment of the present invention, and after the master node and the slave node of the indoor distribution system complete startup, network search, and initialization, the handshaking flow shown in fig. 5 may be executed, where the flow may include:
step S50, the master node sends a handshake invitation message to the slave node to wait for the slave node to request access, where the master handshake message at least carries a master hyper frame number.
Alternatively, the master node may send a handshake invitation message to the slave nodes of the indoor distribution system in a broadcast manner (i.e., the master node may broadcast the handshake invitation message to the slave nodes of the indoor distribution system) to wait for the slave nodes receiving the handshake invitation message to request to access the master node.
Optionally, after the master node completes the power-on, network searching and initialization, the master node may periodically send a handshake invitation message to the slave node, for example, the master node may periodically broadcast the handshake invitation message.
In other optional implementations, if the master node has accessed a slave node, during normal communication between the master node and the accessed slave node, the master node may send a handshake invitation message to the slave node during a gap in transmission of the normal communication message, that is, at a lower transmission priority than the normal communication message, and send the handshake invitation message to the slave node during the gap in transmission of the normal communication message. For ease of understanding, the handshake offer message may also be referred to as a master handshake message.
In the embodiment of the present invention, the hyper frame number may be used for communication timing planning between the master node and the slave node, that is, the hyper frame number may determine the time for communication and message sending between the master node and the slave node; correspondingly, the master node can determine the message sending time according to the hyper frame number of the master node, and the slave node can determine the message sending time according to the hyper frame number of the slave node. For convenience of explanation, in the embodiments of the present invention, the hyper frame number of the master node is referred to as a master hyper frame number, and the hyper frame number of the slave node is referred to as a slave hyper frame number.
Optionally, the superframe number may be counted in milliseconds as a basic unit; in a more specific optional implementation, aiming at a specific mobile communication standard, a communication system comprises a system frame number, and the embodiment of the invention can expand a plurality of bits as the hyper frame number on the basis of the system frame number of the communication system, thereby obtaining the hyper frame number on the basis of the existing system frame number of a multiplexing communication system; in an example, in the 3GPP LTE communication standard, there is a 10-bit system frame number, which is counted in units of 10 milliseconds, and then the embodiment of the present invention may extend multiple bits on the basis of the system frame number to obtain a hyper frame number, so that the hyper frame number can cover a longer time, and thus the master node and the slave node can perform communication timing sequence planning within a longer coverage time range; correspondingly, the master hyper-frame number of the master node and the slave hyper-frame number of the slave node can be obtained by expanding a plurality of bits on the basis of the system frame number.
In an alternative implementation, the handshake offer message may be a heartbeat message of a master node; optionally, after the master node is initialized, the master node may periodically broadcast a heartbeat message, so that the slave nodes in the indoor distribution system may learn the state of the master node.
In an example, the structure of a handshake invitation message (e.g., a heartbeat message) sent by a master node may be as shown in fig. 6, and as can be seen from fig. 6, in the handshake invitation message, a hyper frame number must be carried, and remaining bits may transmit some necessary common parameters, it should be explained that CRC (Cyclic Redundancy Check) is a part of the handshake invitation message that checks correctness of message transmission, and other forms of Check information may also be used in the embodiments of the present invention. Of course, the structure of the handshake invitation message illustrated in fig. 6 is only optional, and other handshake invitation message structures carrying the main hyper frame number may also be adopted in the embodiment of the present invention, which is not limited in the embodiment of the present invention.
Step S51, the slave node receives the handshake invitation message, and synchronizes the slave hyper frame number according to the master hyper frame number.
After the slave node is initialized, if a handshake invitation message sent by the master node is received, the slave node can enter an access state; at this time, the slave node can analyze the handshake invitation message to obtain a main hyper-frame number carried in the handshake invitation message, and update the local slave hyper-frame number of the slave node according to the main hyper-frame number, so that the slave hyper-frame number of the slave node is synchronous with the main hyper-frame number of the master node, and the alignment of the hyper-frame numbers is completed.
And step S52, the slave node sends a handshake request message to the master node at the planning time according to the slave hyper-frame number to request to access the master node.
It can be understood that the superframe number is used for communication timing sequence planning of the master node and the slave node in the embodiment of the invention, after the slave node updates the local slave superframe number to be synchronous with the master superframe number of the master node, the slave node can plan the time for sending the message to the master node based on the updated slave superframe number, so that the slave node can send a handshake request message to the master node according to the updated slave superframe number at the planning time to request to access the master node. That is, the master superframe number is used to synchronize the slave superframe numbers of the slave nodes and at least determine the time when the slave nodes send messages to the master node.
In an optional implementation, the slave node may generate random information in a timed or real-time manner, and the slave node may compare the generated random information with the updated slave superframe number to determine whether the current time satisfies a scheduled time for sending the slave handshake message to the master node, for example, when the comparison result matches, it may be determined that the current time satisfies the scheduled time, so that the slave handshake message may be sent to the master node. In a more specific optional implementation, for each generated random information, the embodiment of the present invention may select information with a set position bit from the random information (in an example, the embodiment of the present invention may select information with a lower 6 bits from the random information), so as to compare the selected information with the updated slave superframe number, and if the selected information is consistent with the updated slave superframe number, it may be determined that the current time satisfies the scheduled time, and may send a handshake request message to the master node; in a further alternative implementation, the random information generated this time may be carried in a handshake request message.
On the contrary, if the information of the set position bit in the random information generated this time is inconsistent with the updated slave super frame number, the slave node continues to randomly generate the random information until the information of the set position bit in the random information generated for a certain time is consistent with the updated slave super frame number, and then the current time is considered to meet the planning time, so that the slave handshake message is sent to the master node.
Optionally, the random information may be in the form of a random sequence, for example, a random number, and the like, and the embodiment of the present invention is not limited.
Of course, the above-described manner of sending the handshake request message to the master node according to the scheduled time determined by the slave superframe number is optional, and other manners may also be adopted in the embodiment of the present invention, and the scheduled time is determined and the handshake request message is sent to the master node by using the updated slave superframe number.
Optionally, the handshake request message may further carry message check bits, such as CRC check bits. In an example, fig. 7 shows that reference may be made to the structure of the handshake request message, of course, the structure of the handshake request message illustrated in fig. 7 is only optional, and the specific structure of the slave handshake message is not limited in the embodiment of the present invention. For convenience of description and understanding, the handshake request message may also be referred to as a slave handshake message.
In a specific implementation, the handshake request message may further include a node identifier requested in advance, and data of a corresponding bit may be set in the handshake request message to be transmitted to the requested node identifier. Optionally, the handshake request message may further include a history node identifier information indicator, for example, 1-bit data may be set, and when the bit is 1, the history node identifier of the slave node is carried in a node identifier field that is requested in advance in the handshake request message; and when the bit is 0, representing that the node identification field requested in advance in the handshake request message carries the randomly generated node identification.
Step S53, the master node responds to the handshake request message, and sends a handshake confirmation message to the slave node if the slave node successfully allocates an available node identifier, where the handshake confirmation message at least carries the available node identifier.
Based on the idea of distributing available node identification to the slave node in the handshake process of the master node and the slave node, the master node can respond to the handshake request message after receiving the handshake request message sent by the slave node and distribute the available node identification to the slave node; if the available node identification is successfully allocated to the slave node, a handshake confirmation message carrying at least the available node identification can be sent to the slave node to indicate that the slave node successfully allocates the available node identification to the slave node.
In an optional implementation of the embodiment of the present invention, the master node may select a node identifier for the slave node, and if the selected node identifier is not occupied, the selected node identifier may be used as the available node identifier;
in an optional implementation in which the master node selects the node identifier for the slave node, the master node may select the node identifier for the slave node in a sequential selection manner, and in an embodiment of the present invention, a node identifier set may be set, where the node identifier set may record a plurality of preset node identifiers in sequence according to the size of the node identifier, for example, the node identifier set may record a plurality of node identifiers in sequence from small to large or from large to small, so that the master node may select the node identifier from the node identifier set in sequence (for example, in sequence from small to large or from large to small). If the node identifier selected from the node identifier set by the master node is not occupied, the selected node identifier is used as the available node identifier, so that the available node identifier is successfully allocated to the slave node; if all the node identifiers selected from the node identifier set by the master node are occupied, it can be determined that the allocation of the available node identifiers to the slave nodes fails. It should be noted that the available node identifier may be considered as an unused node identifier (i.e., a node identifier not occupied by other slave nodes).
In another alternative implementation where the master node selects the node identifier for the slave node, the master node may select the node identifier for the slave node in a random selection manner, for example, the master node may intercept part of the information from the random information as the selected node identifier. Optionally, in a case that the handshake request message carries random information, the random information used by the master node to intercept the information may be random information carried by the slave handshake message, and of course, the random information may also be random information randomly generated by the master node; if the selected node identifier is not occupied, the selected node identifier can be used as an available node identifier, and at the moment, the slave node can be confirmed to be successfully allocated with the available node identifier; if the selected node identification is occupied, random information can be generated randomly again, part of information is intercepted from the random information generated randomly again to be used as the reselected node identification, circulation is carried out until the selected node identification is not occupied, the selected node identification is used as an available node identification, at the moment, the slave node can be confirmed to be successfully allocated with the available node identification, or when the node identifications selected on the basis of the random information generated for multiple times are all occupied, the slave node is confirmed to be unsuccessfully allocated with the available node identification.
It should be noted that, in the above sequential selection manner or the random selection manner, the manner in which the master node selects the available node identifier for the slave node is only optional, and other possible manners in which the available node identifier is allocated to the slave node may also be adopted in the embodiment of the present invention, which is not limited in this embodiment of the present invention.
In other possible implementations, in the embodiment of the present invention, the slave node may also indicate a node identifier (for example, the slave handshake message carries the node identifier indicated by the slave node), and the master node determines whether the node identifier indicated by the slave node is available, so as to implement that the slave node is successfully allocated with the available node identifier, or that the slave node is unsuccessfully allocated with the available node identifier.
After the master node successfully allocates the available node identifier to the slave node, the master node may send a handshake confirmation message to the slave node, where the handshake confirmation message may be a handshake confirmation message indicating that the slave node successfully allocates the available node identifier.
Optionally, under the condition that the handshake request message sent by the slave node carries random information, the handshake confirmation message fed back by the master node may also carry the random information, so that the slave node may verify the validity of the handshake confirmation message based on the random information.
In one example, the structure of the handshake confirmation message may be as illustrated in fig. 8, to which reference may be made.
Step S54, the slave node receives the handshake confirmation message, and sets the available node identifier carried in the handshake confirmation message as the node identifier of the slave node, so as to complete the access to the master node.
After the slave node receives the handshake confirmation message, the slave node may set a node identifier for the slave node based on the available node identifier carried in the handshake confirmation message, that is, the available node identifier carried in the handshake confirmation message is set as the node identifier of the slave node, so as to set the node identifier for the slave node.
In a more specific optional implementation, if the handshake confirmation message further carries random information, the slave node may verify whether the handshake confirmation message is valid based on the random information carried by the handshake confirmation message, so that after the handshake confirmation message is verified to be valid, an available node identifier carried by the handshake confirmation message is set as the node identifier of the slave node; specifically, the slave node may analyze the random information carried in the handshake confirmation message, and if the random information in the handshake confirmation message is consistent with the random information reserved by the slave node (the slave node may reserve the random information carried in the handshake request message), it may verify that the handshake confirmation message is valid.
After the step S54, the slave node and the master node may be considered to complete a handshake procedure, the slave node accesses the master node, and the master node may identify different slave nodes of the indoor distribution system based on the node identifiers of the slave nodes, thereby implementing effective identification and management of the slave nodes. It will be appreciated that subsequent indoor distribution systems may be put into normal operation.
In the handshake method provided by the embodiment of the invention, the master node can send a master handshake message at least carrying a master hyper-frame number to the slave node to wait for the request access of the slave node; after receiving the handshake invitation message, the slave node can synchronize the slave hyper frame number of the slave node based on the master hyper frame number, so that the slave node can send a handshake request message to the master node according to the planning time determined by the slave hyper frame number to request for accessing the master node; after receiving the handshake request message, the master node may respond to the handshake request message, and if the master node successfully allocates an available node identifier for the slave node, the master node may send a handshake confirmation message to the slave node, where the handshake confirmation message may carry at least the available node identifier; furthermore, the slave node can set the available node identifier carried by the handshake confirmation message as the node identifier of the slave node, complete the handshake with the master node, and realize the access to the master node. Therefore, in the handshake method provided by the embodiment of the invention, the master node can adaptively allocate the available node identifiers to the slave nodes in the handshake process of the slave nodes, and the complexity of setting the node identifiers for the slave nodes is reduced, so that a basis is provided for the master node to distinguish different slave nodes in an indoor distribution system based on the node identifiers, and the identification and management of the master node to the slave nodes are effectively ensured.
It should be noted that the flow shown in fig. 5 only shows an interaction flow in the case that the available node identifier is successfully allocated to the slave node, further, in the case that the allocation of the available node identifier to the slave node fails, the master node may send a handshake response message indicating that the allocation of the available node identifier fails to the slave node, so that the slave node may confirm that the allocation of the available node identifier to the slave node by the master node fails after receiving the handshake response message, at this time, the slave node may wait for a request to access the master node again, for example, the slave node may return to step S52, send a handshake request message to the master node at the next scheduled time according to the slave superframe number, so as to request to access the master node again, and for example, the slave node may send a handshake request message to the master node again after waiting for a preset fixed time, so as to request to access the master node again.
In another handshake method provided in the embodiment of the present invention, the slave node may pre-request a node identifier from the master node, so that when the master node confirms that the node identifier pre-requested by the slave node is available, the pre-requested node identifier is directly used as an available node identifier allocated to the slave node, and thus, the slave node is successfully allocated with the available node identifier. Optionally, fig. 9 shows another signaling flow of the handshake method provided in the embodiment of the present invention, and as shown in fig. 9, the flow may include:
step S90, the master node sends a handshake invitation message to the slave node to wait for the slave node to request access, where the handshake invitation message at least carries the master hyper frame number.
Step S91, the slave node receives the handshake invitation message, and synchronizes the slave hyper frame number according to the master hyper frame number.
The descriptions of step S90 to step S91 can refer to the corresponding parts before, and are not repeated here.
And step S92, the slave node sends a handshake request message to the master node at the planning time according to the slave hyper-frame number to request to access the master node, wherein the handshake request message at least carries the node identification indicated by the slave node.
In an alternative implementation, the node identifier indicated by the slave node may be a node identifier pre-requested from the node as the recommended node identifier, for example, the slave node may identify a history node as the recommended node identifier, or as another example, the slave node may identify a node identifier generated randomly as the recommended node identifier. In other possible implementations, the node identification indicated by the slave node may be a node identification fixedly used by the slave node.
In a further optional implementation, if the slave node does not have a history node identifier used historically, a history node identifier information indicator may be further carried in the slave handshake message, so as to indicate whether the slave node has a history node identifier used historically or not by the history node identifier information indicator.
Certainly, further, the handshake request message may further carry random information corresponding to the requirement of the planning time; obviously, the handshake request message may also carry message check information. Fig. 10 illustrates another message structure of a handshake request message, which may be referred to for implementation.
Step S93, the master node responds to the handshake request message, and if it is determined that the node identifier pre-requested by the slave node is not occupied, allocates the node identifier pre-requested by the slave node to the slave node as an available node identifier, and sends a handshake confirmation message to the slave node, where the handshake confirmation message at least carries the available node identifier.
After receiving the handshake request message, the master node can respond to the handshake request message, analyze the node identifier pre-requested by the slave node carried in the handshake request message, and judge whether the node identifier pre-requested by the slave node is occupied; if the node identifier pre-requested by the slave node is not occupied, the master node may allocate the node identifier pre-requested by the slave node to the slave node as an available node identifier, and at this time, it may be considered that the master node successfully allocates the available node identifier to the slave node. Furthermore, the master node may feed back a handshake confirmation message to the slave node, and carry the available node identifier in the handshake confirmation message.
Optionally, the handshake acknowledgement message may also carry the random information, CRC information, and the like.
Step S94, the slave node receives the handshake confirmation message, and sets the available node identifier carried in the handshake confirmation message as the node identifier of the slave node, so as to complete the access to the master node.
In the handshake method provided by the embodiment of the invention, the master node can send a handshake invitation message carrying at least a master hyper-frame number to the slave node so as to wait for the slave node to request access; after receiving the handshake invitation message, the slave superframe number of the slave node can be synchronized based on the master superframe number, so that the slave node can send a handshake request message to the master node according to the planning time determined by the slave superframe number to request to access the master node; after receiving the handshake request message, the master node may respond to the handshake request message, and if it is determined that the node identifier indicated by the slave node is not occupied, the master node may use the node identifier requested in advance by the slave node as an available node identifier allocated to the slave node, and send a handshake confirmation message to the slave node, where the handshake confirmation message may at least carry the available node identifier; furthermore, the slave node can set the available node identifier carried by the handshake confirmation message as the node identifier of the slave node, complete the handshake with the master node, and realize the access to the master node.
In the handshake method provided by the embodiment of the invention, the master node can judge whether the node identifier requested by the slave node is occupied or not in the handshake process with the slave node, so that the node identifier is distributed to the slave node as an available node identifier under the condition that the node identifier requested by the slave node is not occupied, the node identifier is set adaptively for the slave node, the complexity of setting the node identifier for the slave node is reduced, and the identification and management of the master node to the slave node are effectively ensured.
It should be noted that, the flow shown in fig. 9 only shows an interaction flow in the case that the available node identifier is successfully allocated to the slave node, further, when the master node determines that the node identifier indicated by the slave node is occupied, it may be determined that the master node fails to allocate the available node identifier to the slave node, the master node may send a handshake response message to the slave node, so that the slave node may trigger a new handshake flow after receiving the handshake response message, for example, the slave node may delete a node identifier that is requested in advance, and send a handshake request message to the master node again at a next planning time determined based on the slave superframe number to request the master node to select an available node identifier for the slave node, and an implementation manner for selecting an available node identifier for the slave node by the master node may refer to the description of the corresponding part, which is not described herein again.
It should be further noted that, after the slave node sends the handshake request message to the master node, there may be a case where the message fed back by the master node cannot be received, which may be because a plurality of slave nodes of the indoor distribution system all send handshake request messages to the master node at the same time, which causes CRC errors to occur in the message received by the master node, and when CRC errors occur, the master node does not feed back the message to the slave node; based on this, after the slave node sends the handshake request message to the master node, if the slave node does not receive the message fed back by the master node within the scheduled time based on the set number determined by the slave superframe number, the slave node can start a new access flow and send the handshake request message to the master node again; it is understood that one scheduling time refers to information for setting position bits from random information randomly generated by the slave node at one time, and is consistent with the slave superframe number of the slave node. It should be noted that, the specific numerical value of the set number may be set according to actual situations, and the embodiment of the present invention is not limited.
In a specific implementation, due to a communication network failure and the like, a message sent by a slave node may not reach a master node, or an access failure may be caused by other reasons. In view of such a situation, in an embodiment of the present invention, the timeout waiting of the slave node is avoided through a timer timeout mechanism, so as to improve the access efficiency and reliability of the slave node.
Specifically, the slave node may set a timer when sending the access request message to the master node, and if the timer is overtime and an access confirmation message returned by the master node is not received yet, the slave node may send the access request message to the master node again, thereby restarting the access procedure. For example, when the slave node sends a handshake request message to the master node, a timer (for example, 30 seconds) may be set, if a handshake confirmation message returned by the master node is received within a set time of the timer, and it is determined that the node identifier is successfully assigned, the timer may be turned off, otherwise, if the timer is out of time (for example, the operation exceeds 30 seconds), it is determined that the handshake fails, an access request message may be sent again to the master node, so as to initiate a handshake flow again.
The handshake method provided by the embodiment of the invention can adaptively allocate the node identifiers for the slave nodes in the handshake process of the master node and the slave nodes, reduce the complexity of setting the node identifiers for the slave nodes, and effectively ensure the identification and management of the slave nodes by the master node when the handshake between the master node and the slave nodes is realized.
While various embodiments of the present invention have been described above, various alternatives described in the various embodiments can be combined and cross-referenced without conflict to extend the variety of possible embodiments that can be considered disclosed and disclosed in connection with the embodiments of the present invention.
In the following, from the perspective of node devices, a master node and a slave node provided in the embodiments of the present invention are introduced separately, and the master node described below may be considered as a node device including corresponding functional modules to implement the access control method provided in the embodiments of the present invention. Each functional module may be implemented by corresponding hardware, or by corresponding software, or by a combination of hardware and software, and the contents of the main node described below may be referred to in correspondence with the contents of the access control method described above.
In an alternative implementation, fig. 11 shows an alternative block diagram of a master node provided in an embodiment of the present invention, and as shown in fig. 11, the master node 110 may include:
a first message receiving module 111 adapted to receive an access request message from a node;
a node identifier allocating module 112, adapted to allocate a node identifier to the slave node according to a preset rule after receiving the access request message of the slave node;
a first message sending module 113, configured to return an access confirmation message to the slave node, where the access confirmation message includes: the node identification assigned to the slave node.
In a specific implementation, the access request message may include a node identification pre-requested by the slave node. As an optional implementation, the node identifier allocating module 112 is adapted to allocate a node identifier to the slave node according to a preset rule based on the node identifier of the pre-request. In particular, the node identification allocation module 112 is adapted to determine whether the node identification pre-requested by the slave node is occupied; when the node identification pre-requested by the slave node is not occupied, the node identification pre-requested by the slave node is distributed to the slave node; when the node identifier pre-requested by the slave node is occupied, an unoccupied node identifier is searched and allocated to the slave node.
For example, the node identifier allocating module 112 is adapted to find an unoccupied node identifier and allocate the unoccupied node identifier to the slave node in a descending order when the node identifier pre-requested by the slave node is occupied. For another example, the node identifier allocating module 112 is adapted to randomly search for an unoccupied node identifier when the node identifier pre-requested by the slave node is occupied, and allocate the unoccupied node identifier to the slave node.
In a specific implementation, the node identifier of the pre-request carried in the access request message may be a history node identifier of the slave node, or may be a randomly generated node identifier.
As an optional implementation, the access request message may further include: a historical node identification information indicator adapted to indicate a type of node identification pre-requested by the slave node; correspondingly, when the historical node identification information indicator indicates that the node identification type pre-requested by the slave node is the historical node identification, the node identification pre-requested by the slave node is the historical node identification of the slave node; when the historical node identification information indicator indicates that the node identification type pre-requested by the slave node is non-historical node identification, the node identification pre-requested by the slave node is the randomly generated node identification.
The node identifier allocating module 112 is adapted to determine whether the history node identifier is occupied when the history node identifier information indicator indicates that the node identifier type pre-requested by the slave node is the history node identifier, and allocate the history node identifier to the slave node when the history node identifier is not occupied; when the historical node identifier is occupied, searching an unoccupied node identifier and distributing the unoccupied node identifier to the slave node; and adapted to determine whether the randomly generated node identity is occupied when the historical node identity information indicator indicates that the node identity type pre-requested by the slave node is a non-historical node identity, and to assign the randomly generated node identity to the slave node when the randomly generated node identity is unoccupied; and when the randomly generated node identifier is occupied, searching an unoccupied node identifier and distributing the unoccupied node identifier to the slave node.
In a specific implementation, the master node 110 may further include: a third message sending module 114, adapted to, when failing to find an unoccupied node identifier, return an access response message to the slave node, where the access response message includes an indication information of node allocation failure, so as to trigger the slave node to initiate an access procedure again.
In a specific implementation, the first message receiving module 111 is implemented by a receiving device and a receiving circuit such as a receiving antenna, the first message sending module 113, the third message sending module 114, and the like may be implemented by a transmitting antenna and a transmitting circuit such as a transmitting antenna, and the node identifier allocating module 112 may be implemented by any one of a Central Processing Unit (CPU), a Field Programmable Gate Array (FPGA), a single chip microcomputer, and a multi-core processor.
In a specific implementation, the access request message may further include random information, for example, a random sequence, where the random information is suitable for characterizing a source of the access request message, and the access confirmation message and the access response message fed back by the master node may further include random information carried in the corresponding access request message.
In an alternative implementation, fig. 12 shows an alternative block diagram of a slave node structure provided by the embodiment of the present invention, and as shown in fig. 12, the slave node 120 may include:
a second message sending module 121 adapted to send an access request message to the master node;
a second message receiving module 122, adapted to receive an access confirmation message returned by the master node, where the access confirmation message includes: and the master node allocates the node identification to the slave node according to a preset rule.
In a specific implementation, the access request message may include a node identifier pre-requested by the slave node, so that the master node allocates a node identifier to the slave node according to a preset rule based on the node identifier pre-requested by the slave node.
In a specific implementation, the node identifier pre-requested by the slave node may include any one of the following:
1) a history node identification of the slave node;
2) a randomly generated node identification.
In a specific implementation, the access request message further includes: a historical node identification information indicator adapted to indicate a type of node identification pre-requested by the slave node; when the historical node identification information indicator indicates that the node identification type pre-requested by the slave node is historical node identification, the node identification pre-requested by the slave node is the historical node identification of the slave node; when the historical node identification information indicator indicates that the node identification type pre-requested by the slave node is non-historical node identification, the node identification pre-requested by the slave node is the randomly generated node identification.
As an optional implementation, the slave node 120 may further include: a third message receiving module 123, and a re-access triggering module 124, wherein:
the third message receiving module 123 is adapted to receive an access response message returned by the master node, where the access response message includes: the master node fails to distribute node failure indication information of a node identifier to the slave node according to a preset rule based on the node identifier requested by the slave node in advance;
the re-access triggering module 124 is adapted to trigger the second message sending module 121 to send an access request message to the master node again in response to the distribution node failure indication information, so as to execute a re-access procedure.
In a specific implementation, the slave node may further include a timer 125, which is adapted to be started when the second message sending module 121 sends the access request message to the master node, and when the second message receiving module 122 still does not receive the access confirmation message when the time is out, trigger the second message sending module to send the access request message to the master node again, so as to initiate the access procedure again.
The embodiment of the present invention further provides a host node, where the host node may be implemented by loading each functional module in the foregoing host node embodiment, so as to execute the access control method provided in the embodiment of the present invention. In an alternative implementation, fig. 13 shows an alternative structure of a master node, which, as shown in fig. 13, may include: at least one processor 1, at least one communication interface 2, at least one memory 3 and at least one 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.
Alternatively, 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 invokes the one or more computer-executable instructions to execute the access control method provided in the embodiment of the present invention, and specific steps may refer to the foregoing embodiments, which are not described herein again.
The embodiment of the present invention further provides a storage medium, where the storage medium may store one or more computer-executable instructions, where the one or more computer-executable instructions may be used to execute the access control method provided in the embodiment of the present invention, and specific steps may refer to the foregoing embodiments, and are not described herein again.
The embodiment of the present invention further provides a slave node, where the master node may execute the access method provided in the embodiment of the present invention, and the slave node may load each functional module in the foregoing slave node embodiment to implement the access method. In an alternative implementation, an optional hardware structure of the slave node may be combined with that shown in fig. 13, and include at least one memory and at least one processor, where the processor stores one or more computer-executable instructions, and the processor invokes the one or more computer-executable instructions to execute the access method provided in the embodiment of the present invention, which may specifically refer to the foregoing embodiment of the access method, and details of the access method are not described here again.
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 access method provided in the embodiment of the present invention.
An embodiment of the present invention further provides an indoor distribution system, as shown in fig. 1, an indoor distribution system 1A may include a master node 01 described in each of the above embodiments, and a plurality of slave nodes 11 to 1N described in the above embodiments, where the master node and the slave nodes have communication connections.
The technical scheme provided by the embodiment of the invention can adaptively set the node identifier for the slave node in the process of accessing the slave node into the master node, reduces the complexity of setting the node identifier for the slave node, and effectively ensures the identification and management of the slave node by the master node when the master node and the slave node are accessed.
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 (22)

1. An access control method is applied to a main node, and the access control method comprises the following steps:
receiving an access request message from a slave node;
distributing node identifications to the slave nodes according to a preset rule;
returning an access confirmation message to the slave node, the access confirmation message comprising: the node identification assigned to the slave node;
the access request message includes: a node identification pre-requested by the slave node; the allocating node identifiers to the slave nodes according to the preset rule includes: determining whether the node identification pre-requested by the slave node is occupied; when the node identification pre-requested by the slave node is not occupied, the node identification pre-requested by the slave node is distributed to the slave node; when the node identifier pre-requested by the slave node is occupied, an unoccupied node identifier is searched and allocated to the slave node.
2. The access control method of claim 1, wherein the receiving an access request message from a slave node comprises: receiving a handshake request message from a slave node;
the returning of the access confirmation message to the slave node comprises: a handshake confirmation message is returned to the slave node.
3. The access control method according to claim 1, wherein the searching for an unoccupied node identifier and allocating it to the slave node when the node identifier pre-requested by the slave node is occupied comprises at least one of:
when the node identifier pre-requested by the slave node is occupied, searching an unoccupied node identifier according to a sequence from small to large, and allocating the unoccupied node identifier to the slave node;
when the node identifier pre-requested by the slave node is occupied, an unoccupied node identifier is randomly searched and allocated to the slave node.
4. The access control method of claim 1, further comprising:
and when an unoccupied node identification cannot be found, returning an access response message to the slave node, wherein the access response message contains allocation node failure indication information to trigger the slave node to initiate an access process again.
5. The access control method according to claim 1, wherein the access control method is executed after the master node and the slave node are respectively powered on and initialized.
6. The access control method according to claim 1, wherein the node identifier pre-requested from the node comprises any one of:
a history node identification of the slave node;
a randomly generated node identification.
7. The access control method of claim 6, wherein the access request message further comprises: a historical node identification information indicator adapted to indicate a type of node identification pre-requested by the slave node;
when the historical node identification information indicator indicates that the node identification type pre-requested by the slave node is historical node identification, the node identification pre-requested by the slave node is the historical node identification of the slave node; when the historical node identification information indicator indicates that the node identification type pre-requested by the slave node is non-historical node identification, the node identification pre-requested by the slave node is the randomly generated node identification.
8. The access control method according to claim 7, wherein said allocating a node identifier to the slave node according to a preset rule comprises:
when the historical node identification information indicator indicates that the node identification type pre-requested by the slave node is historical node identification, determining whether the historical node identification is occupied, and when the historical node identification is not occupied, allocating the historical node identification to the slave node; when the historical node identifier is occupied, searching an unoccupied node identifier and distributing the unoccupied node identifier to the slave node;
when the historical node identification information indicator indicates that the node identification type pre-requested by the slave node is a non-historical node identification, determining whether the randomly generated node identification is occupied, and when the randomly generated node identification is not occupied, allocating the randomly generated node identification to the slave node; when the randomly generated node identification is occupied, an unoccupied node identification is searched and distributed to the slave node.
9. The access control method of claim 1, wherein the access request message further comprises: random information adapted to characterize the source of the access request message;
the returning of the access confirmation message to the slave node comprises: and broadcasting and sending the access confirmation message including the random information, so that the slave node corresponding to the random information recognizes the access confirmation message and receives the node identification as the node identification of the slave node.
10. An access method applied to a slave node, the access method comprising:
sending an access request message to a main node;
receiving an access confirmation message returned by the master node, wherein the access confirmation message comprises: the master node distributes the node identification for the slave node according to a preset rule based on the node identification requested by the slave node in advance;
the access request message includes: a node identification pre-requested by the slave node;
the allocating node identifiers to the slave nodes according to the preset rule includes: determining whether the node identification pre-requested by the slave node is occupied; when the node identification pre-requested by the slave node is not occupied, the node identification pre-requested by the slave node is distributed to the slave node; when the node identifier pre-requested by the slave node is occupied, an unoccupied node identifier is searched and allocated to the slave node.
11. The access method of claim 10, wherein sending the access request message to the master node comprises: sending a handshake request message to a master node;
the receiving of the access confirmation message returned by the master node includes: and receiving a handshake confirmation message returned by the main node.
12. The access method according to claim 10, wherein the node identification pre-requested from the node comprises any one of:
a history node identification of the slave node;
a randomly generated node identification.
13. The access method of claim 12, wherein the access request message further comprises: a historical node identification information indicator adapted to indicate a type of node identification pre-requested by the slave node;
when the historical node identification information indicator indicates that the node identification type pre-requested by the slave node is historical node identification, the node identification pre-requested by the slave node is the historical node identification of the slave node; when the historical node identification information indicator indicates that the node identification type pre-requested by the slave node is non-historical node identification, the node identification pre-requested by the slave node is the randomly generated node identification.
14. The access method according to claim 10, further comprising:
receiving an access response message returned by the main node, wherein the access response message comprises: the master node fails to allocate node failure indication information of a node identifier to the slave node according to a preset rule based on the node identifier requested by the slave node in advance;
and responding to the distribution node failure indication information, and sending an access request message to the main node again.
15. The access method according to claim 10, wherein when sending the access request message to the master node, further comprising: setting a timer;
and if the timer is overtime and does not receive the access confirmation message returned by the main node, sending the access request message to the main node again.
16. The access method according to claim 10, wherein the access method is performed after the master node and the slave node are respectively powered on and initialized.
17. A master node, comprising:
a first message receiving module adapted to receive an access request message from a node;
the node identifier distribution module is suitable for distributing node identifiers for the slave nodes according to a preset rule after receiving the access request message of the slave nodes;
a first message sending module, configured to return an access confirmation message to the slave node, where the access confirmation message includes: the node identification assigned to the slave node;
the access request message includes: a node identification pre-requested by the slave node; the node identification allocation module is suitable for determining whether the node identification pre-requested by the slave node is occupied or not, and allocating the node identification pre-requested by the slave node to the slave node when the node identification pre-requested by the slave node is not occupied; when the node identifier pre-requested by the slave node is occupied, an unoccupied node identifier is searched and allocated to the slave node.
18. A slave node, comprising:
the second message sending module is suitable for sending an access request message to the main node;
a second message receiving module, adapted to receive an access confirmation message returned by the master node, where the access confirmation message includes: the master node distributes node identification for the slave node according to a preset rule;
the access request message includes: a node identification pre-requested by the slave node;
the allocating node identifiers to the slave nodes according to the preset rule includes: determining whether the node identification pre-requested by the slave node is occupied; when the node identification pre-requested by the slave node is not occupied, the node identification pre-requested by the slave node is distributed to the slave node; when the node identifier pre-requested by the slave node is occupied, an unoccupied node identifier is searched and allocated to the slave node.
19. A master node, comprising: at least one memory storing one or more computer-executable instructions and at least one processor invoking the one or more computer-executable instructions to perform the access control method of any one of claims 1-9.
20. A slave node, comprising: at least one memory storing one or more computer-executable instructions and at least one processor invoking the one or more computer-executable instructions to perform the access method of any of claims 10 to 16.
21. A storage medium storing one or more computer-executable instructions for performing the access control method of any one of claims 1-9 or for performing the access method of any one of claims 10-16.
22. An indoor distribution system comprising a master node as claimed in claim 17 and a plurality of slave nodes as claimed in claim 18, the master node and slave nodes having a communications connection therebetween.
CN202010662353.3A 2020-07-10 2020-07-10 Access and access control method, device, system, node and storage medium Active CN111757335B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010662353.3A CN111757335B (en) 2020-07-10 2020-07-10 Access and access control method, device, system, node and storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010662353.3A CN111757335B (en) 2020-07-10 2020-07-10 Access and access control method, device, system, node and storage medium

Publications (2)

Publication Number Publication Date
CN111757335A CN111757335A (en) 2020-10-09
CN111757335B true CN111757335B (en) 2022-06-24

Family

ID=72710190

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010662353.3A Active CN111757335B (en) 2020-07-10 2020-07-10 Access and access control method, device, system, node and storage medium

Country Status (1)

Country Link
CN (1) CN111757335B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112261715B (en) * 2020-10-16 2023-04-07 锐迪科（重庆）微电子科技有限公司 Synchronization method, device and system of indoor distribution communication system
CN112543502B (en) * 2020-11-30 2022-10-11 紫光展锐(重庆)科技有限公司 Communication synchronization method, device, apparatus and storage medium

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101582824A (en) * 2008-05-13 2009-11-18 施耐德电器工业公司 Node number automatic distribution method for controlling secondary node equipment of local area network bus
CN103401694A (en) * 2013-05-09 2013-11-20 瑞斯康达科技发展股份有限公司 Method and system for realizing node management
CN109067863A (en) * 2018-07-25 2018-12-21 上海点融信息科技有限责任公司 For managing the method, apparatus and storage medium of the node identification of block chain link point
CN109121203A (en) * 2018-08-13 2019-01-01 上海感悟通信科技有限公司 A kind of accidental access method, controlled node and control node for wireless self-networking

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100008235A1 (en) * 2008-07-11 2010-01-14 Qualcomm Incorporated Reporting and resolving conflicting use of a node identifier
CN101753610B (en) * 2008-12-19 2012-11-21 华为技术有限公司 Distributed network structure method, device, system and task processing method
CN102905253B (en) * 2011-07-27 2019-07-09 中兴通讯股份有限公司 A kind of mark distributing method and system
CN103731935A (en) * 2013-12-19 2014-04-16 上海卫星工程研究所 Space network communication method based on WIFI
CN108738107A (en) * 2018-06-13 2018-11-02 上海华章信息科技有限公司 A kind of wireless connection means of communication of factory production system

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101582824A (en) * 2008-05-13 2009-11-18 施耐德电器工业公司 Node number automatic distribution method for controlling secondary node equipment of local area network bus
CN103401694A (en) * 2013-05-09 2013-11-20 瑞斯康达科技发展股份有限公司 Method and system for realizing node management
CN109067863A (en) * 2018-07-25 2018-12-21 上海点融信息科技有限责任公司 For managing the method, apparatus and storage medium of the node identification of block chain link point
CN109121203A (en) * 2018-08-13 2019-01-01 上海感悟通信科技有限公司 A kind of accidental access method, controlled node and control node for wireless self-networking

Also Published As

Publication number Publication date
CN111757335A (en) 2020-10-09

Similar Documents

Publication Publication Date Title
US11895709B2 (en) Random access method and terminal
CN111757335B (en) Access and access control method, device, system, node and storage medium
CN113207094B (en) Method and device for receiving Multimedia Broadcast Multicast Service (MBMS)
JP2018536303A (en) Radio resource scheduling method and apparatus
CN109548081B (en) Method and device for allocating paging group, computer readable storage medium and equipment
CN111586717A (en) Network terminal equipment, multi-card mobile terminal and network configuration method and system thereof
WO2020087505A1 (en) Data transmission method and apparatus
CN114401250A (en) Address allocation method and device
CN111935726B (en) Communication processing method, master node, slave node, storage medium and system
CN111935727B (en) Communication exception handling method, master node, indoor distribution system and storage medium
CN108307335B (en) Data transmission method, device and system
CN111935728B (en) Handshaking method, device, related equipment, storage medium and system
US20240057127A1 (en) Pscch detection method and communication apparatus
CN111901803B (en) Communication interaction method, master node, slave node, indoor distribution system and medium
CN107026919B (en) Method for determining network address of node equipment, node equipment and control system
CN111935725B (en) Communication time sequence planning method, device, related equipment, storage medium and system
CN112888063B (en) Remote terminal network access method, system, electronic device and storage medium
CN113711676A (en) Resource configuration for NB-IOT
CN113661754B (en) Data transmission method, device, user equipment and storage medium
CN110611589B (en) Control method and device of regional control system and air conditioning system
CN113612868A (en) Equipment address allocation method, device and system
US20200259762A1 (en) Node management method and device
CN115278705B (en) Communication time sequence planning method, device, related equipment, storage medium and system
CN113438708A (en) Node selection method, electronic device, and storage medium
JP7215721B2 (en) Communication device and communication method

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant