CN111988841A - Registration, registration request sending method, device, communication equipment and storage medium - Google Patents
Registration, registration request sending method, device, communication equipment and storage medium Download PDFInfo
- Publication number
- CN111988841A CN111988841A CN201910425750.6A CN201910425750A CN111988841A CN 111988841 A CN111988841 A CN 111988841A CN 201910425750 A CN201910425750 A CN 201910425750A CN 111988841 A CN111988841 A CN 111988841A
- Authority
- CN
- China
- Prior art keywords
- terminal
- waiting
- waiting time
- target
- duration
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W60/00—Affiliation to network, e.g. registration; Terminating affiliation with the network, e.g. de-registration
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0446—Resources in time domain, e.g. slots or frames
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/53—Allocation or scheduling criteria for wireless resources based on regulatory allocation policies
Abstract
The application discloses registration, a registration request sending method, a registration request sending device, communication equipment and a storage medium, wherein the registration method comprises the following steps: after receiving a registration request sent by a first terminal, judging whether the first terminal can be successfully registered; if the first terminal can be successfully registered, determining a target waiting time length from a plurality of preset waiting time lengths according to the distribution times of the waiting time lengths and/or the registration frequency of the first terminal; and sending the target waiting duration to the first terminal, so that when the first terminal registers again, the time interval between two adjacent times of sending the registration requests to the base station is the target waiting duration. The total time required for completing the registration by the plurality of terminals with the registration requirements is reduced.
Description
Technical Field
The present application relates to the field of private network communications, and in particular, to a registration method and apparatus, a registration request sending method and apparatus, a communication device, and a computer-readable storage medium.
Background
In the field of private network communication, only a small number of base stations are deployed in some scenes of private network communication, and the deployed small number of base stations need to support thousands of terminals for communication. Because the bandwidth of a base station in private network communication is narrow, channel resources for sending a registration request of a terminal to the base station are less; therefore, the terminal needs to apply for channel resources for sending a registration request first and needs to make authentication information in the registration request meet requirements for successful registration; however, when a large number of terminals simultaneously need to register with a certain base station, a collision may occur when applying for channel resources.
When the terminal applies for the channel resource to conflict, the terminals with the conflict may not rob the channel resource; the terminal which does not seize the channel resource applies the channel resource to the base station again, and the terminal may conflict when applying the channel resource, so that the total time required for a plurality of terminals with registration requirements to apply the channel resource may be longer; and the total time required for the plurality of terminals with the registration requirements to complete the registration is longer. In practical applications, some terminals may need to register for multiple times, so that there are multiple terminals with registration requirements in the terminals after completing one registration, and the time required for completing the registration is longer for the multiple terminals with registration requirements currently, and the time is cycled in turn, so that the total time required for completing the registration is longer for the multiple terminals with registration requirements each time.
Therefore, it is desirable to reduce the total time required for a plurality of terminals having a registration requirement to complete one registration.
Disclosure of Invention
Based on this, the present application provides a registration method and a registration request sending method, so as to reduce the total time required by a plurality of terminals with registration requirements to complete the registration.
The application also provides a registration device, a registration request sending device, a communication device and a computer readable storage medium, which are used for ensuring the realization and the application of the method in practice.
The technical scheme provided by the application is as follows:
the application provides a registration method, which is applied to a base station and comprises the following steps:
after receiving a registration request sent by a first terminal, judging whether the first terminal can be successfully registered;
if the first terminal can be successfully registered, determining a target waiting time length of the first terminal from a plurality of preset waiting time lengths according to the distribution times of the waiting time lengths and/or the registration frequency of the first terminal;
and sending the target waiting duration to the first terminal, so that when the first terminal registers again, the time interval between two adjacent times of sending registration requests to the base station is the target waiting duration.
Optionally, the determining the target waiting duration of the first terminal from a plurality of preset waiting durations according to the distribution times of the waiting durations and/or the registration frequency of the terminal includes: and determining the target waiting time length of the first terminal according to the distribution times of the waiting time length, wherein the distribution times of the target waiting time length are minimum.
Optionally, the ratio of the number of the terminals with the target waiting duration to the total number of the terminals that have successfully registered is smaller than a preset ratio threshold.
Optionally, the determining the target waiting duration of the first terminal from a plurality of preset waiting durations according to the number of times of allocating the waiting duration and/or the registration frequency of the terminal includes: and determining the target waiting time length of the first terminal according to the registration frequency of the first terminal, wherein the registration frequency of the first terminal is in negative correlation with the target waiting time length of the first terminal. A
Optionally, the registration request includes a current waiting duration of the first terminal;
the determining the target waiting duration of the first terminal according to the distribution times of the waiting duration, wherein the distribution times of the target waiting duration are the minimum, comprises:
detecting whether the current waiting time length exists in the waiting time length of the second terminal; the second terminal is as follows: the terminal which is registered successfully and has been distributed with waiting time length;
if the current waiting time length does not exist, determining the current waiting time length as the target waiting time length;
if the current waiting time length exists, detecting whether a first waiting time length exists in the preset multiple waiting time lengths; the first waiting duration is: waiting time durations of the plurality of preset waiting time durations, except the waiting time duration of the second terminal; if the first waiting time length exists, determining one first waiting time length as the target waiting time length; and if the first waiting time does not exist, selecting the target waiting time with the least distribution times from the preset multiple waiting times.
Optionally, after determining the target waiting duration of the first terminal from the preset multiple waiting durations, the method further includes:
storing the corresponding relation between the target waiting time and the identifier of the first terminal;
the detecting whether the current waiting duration exists in the waiting duration of the second terminal specifically includes:
and detecting whether the current waiting time length exists in the stored corresponding relation.
Optionally, after the storing the corresponding relationship between the target waiting duration and the identifier of the first terminal, the method further includes:
and if the first terminal is not registered again within a first preset time range, deleting the target waiting duration corresponding to the first terminal in the corresponding relationship.
The application also provides a registration request sending method, which is applied to a first terminal and comprises the following steps:
receiving a target waiting duration sent by a base station;
if the first terminal needs to register again, sending a registration request to the base station after waiting for the target waiting duration; or after waiting for the target waiting time and a random time belonging to a preset range, sending a registration request to the base station.
The present application also provides a communication device comprising a memory and a processor coupled to the memory, the memory having stored therein one or more programs that, when run on the processor, perform any of the methods described above.
The present application also provides a computer-readable storage medium having stored thereon a computer program for execution by a processor to implement any of the methods described above.
The beneficial effect of this application does:
in the embodiment of the application, after a registration request sent by a first terminal is received, whether the first terminal can be successfully registered is judged, if the first terminal can be successfully registered, a target waiting duration of the first terminal is determined from a plurality of preset waiting durations according to the distribution times of the waiting durations and/or the registration frequency of the first terminal, and the target waiting duration is sent to the first terminal, so that when the first terminal is registered again, the time interval of sending the registration request to a base station twice in adjacent times is the target waiting duration, and the total time required by the plurality of terminals with the registration requirements to complete the registration is reduced.
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 flowchart of a method for interaction between a base station and a terminal in the present application;
FIG. 2 is a flow chart of a method for determining a target wait duration according to the present application;
FIG. 3 is a schematic diagram of a registration apparatus according to the present application;
fig. 4 is a schematic structural diagram of a registration request sending apparatus according to the present application;
fig. 5 is a schematic structural diagram of a communication device in the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, 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 application.
The embodiment of the application can be applied to the base station and the terminal in the TETRA system and can also be applied to the base station and the terminal in the PDT system.
Referring to fig. 1, a flowchart of an embodiment of a method for a base station to interact with a terminal in the present application is shown, where the embodiment of the method may include:
step 101: the base station receives a registration request sent by the first terminal.
In practical applications, there may be a plurality of terminals that need to be registered at the same time, and therefore, in this step, the number of terminals may be multiple. And sending a registration request to the base station for any terminal needing to be registered in the system, wherein the registration request sent by the terminal comprises authentication information of the terminal, so that the base station judges whether the any terminal can be successfully registered or not based on the authentication information in the registration request after receiving the registration request of the any terminal.
In practical applications, the base station provides less channel resources for sending the registration request of the terminal to the base station due to the narrower bandwidth of the base station. Therefore, when a plurality of terminals simultaneously transmit registration requests to the base station, the base station may receive the registration request of only one terminal. For convenience of description, in this step, the terminals corresponding to the registration request received by the base station are collectively referred to as the first terminal. Any one of the terminals in the system may become the first terminal.
Step 102: the base station judges whether the first terminal can be successfully registered or not according to the authentication information of the first terminal in the registration request, and if the first terminal cannot be successfully registered, the step 103 is executed; if the first terminal can register successfully, step 104 is executed.
After the base station receives the registration request of the first terminal, whether the authentication information of the first terminal in the registration request meets the requirement is judged, if the authentication information meets the requirement, the first terminal can be successfully registered, otherwise, the first terminal cannot be successfully registered is shown.
Step 103: the base station continues to wait for the registration request sent by the receiving terminal.
For a first terminal that receives a registration request currently by the base station, if the first terminal cannot successfully register, in this step, the base station continues to wait for receiving the registration request sent by the terminal in the system.
Step 104: the base station determines a target waiting time length from a plurality of preset waiting time lengths.
If the first terminal can register successfully, the base station needs to allocate a target waiting duration for the first terminal. The method aims to solve the problem that the proportion of the number of the same waiting time length in the waiting time lengths distributed to the terminals registered at different moments in the total number of the currently distributed waiting time lengths is smaller than a preset proportion threshold. Therefore, in this step, the target waiting duration determined from the preset waiting durations needs to satisfy: the proportion of the number of the terminals with the target waiting time length to the total number of the terminals which are successfully registered is smaller than a preset proportion threshold value.
For example, the preset waiting time periods are respectively as follows: 0ms, 20ms, 40ms, … … n x 20ms … … 2000ms, wherein n represents an integer belonging to 1-100.
For example, one scenario is: the number of the terminals which are successfully registered at present is 100, wherein a plurality of preset waiting time lengths are allocated, the number of the second terminals with the waiting time length of 20ms is 10, and the preset probability threshold is 10%.
At this time, in this scenario, if the target waiting duration determined for the first terminal is 20ms, at this time, the total number of terminals with the waiting duration of 20ms in the system is the total number of terminals with the waiting duration of 20ms in the second terminal and the first terminal, at this time, the number of the second terminals with the waiting duration of 20ms is 10, and then one first terminal is added, at this time, the total number of terminals with the waiting duration of 20ms is 11, that is, the total number of terminals with the target waiting duration (20ms) is 11.
At this time, the ratio of the total number of terminals having the target waiting time period to the total number of terminals which have been successfully registered is a ratio of 11 to 100. Since the ratio of 11 to 100 is greater than 10%, the target waiting duration determined for the first terminal does not satisfy: and the proportion of the total number of the terminals with the target waiting time length to the total number of the terminals which are successfully registered is smaller than a preset proportion threshold value. Therefore, in this scenario, the target waiting duration determined for the first terminal may not be 20ms, and at this time, other waiting durations should be determined for the first terminal, so that in the system, the ratio of the total number of terminals having the target waiting duration to the total number of terminals that have been successfully registered is smaller than the preset ratio threshold.
For how to determine the target waiting duration, reference may be made to an embodiment of a method for determining the target waiting duration corresponding to fig. 2, so that a ratio of the number of terminals of the target waiting duration to the total number of terminals that have been successfully registered is smaller than a preset ratio threshold.
Step 105: and the base station sends the target waiting duration to the first terminal.
Step 106: and storing the identifier of the first terminal, the target waiting time of the first terminal and the corresponding relation between the times of the current registration of the first terminal.
And storing the corresponding relation among the identifier of the first terminal, the target waiting time of the first terminal and the time when the first terminal registers this time. Specifically, the corresponding relationship may be stored in a list. In practical application, the stored corresponding relation supports power failure protection.
Step 107: and if the first terminal is not registered within the first preset time range, deleting the target waiting duration of the first terminal in the corresponding relationship.
In this embodiment, there may be a case where after the first terminal completes one registration, the base station determines the target waiting duration for the first terminal, but the first terminal has not been registered again within a first preset time range, for example, the first terminal has not been registered again within three days ahead from the current time. In this step, the target waiting duration of the first terminal is deleted from the stored correspondence, so that the deleted target waiting duration can be allocated to a subsequently registered terminal.
In practical applications, the execution sequence of steps 105 to 107 may be interchanged.
Step 108: the first terminal receives a target wait duration.
Step 109: if the first terminal needs to register again, the time interval between two adjacent times of sending the registration request to the base station by the first terminal is the target waiting time length, or the time interval between two adjacent times of sending the registration request to the base station is the sum of the target waiting time length and the random time length belonging to the second preset time range.
And when the first terminal needs to register again, after waiting for the target waiting time, sending a registration request to the base station. For example, if the target waiting duration is 20ms, at this time, the first terminal needs to ensure that the time interval between two adjacent registration requests sent to the base station is 20 ms. For example, the time interval between the first time of sending the registration request to the base station and the second time of sending the registration request to the base station is 20 ms; the time interval between the second time of sending the registration request to the base station and the third time of sending the registration request to the base station is 20 ms; and so on.
In practical application, for terminals having simultaneous registration requests, in order to further reduce the number of terminals sending registration requests to the base station at the same time, in this step, a second preset time range is set, for example, the second preset time range is 1ms to 10ms, at this time, the first terminal sends a registration request to the base station after waiting for 20ms + a random time length, where the random time length is a random time length belonging to the second preset time range, for example, the random time length is 2ms, and at this time, a time interval between two adjacent times of sending registration requests to the base station by the first terminal is 22 ms.
In this embodiment, after receiving a registration request sent by a first terminal, determining whether the first terminal can be successfully registered, and if the first terminal can be successfully registered, determining a target waiting duration from a plurality of preset waiting durations; the proportion of the number of the terminals with the target waiting time length to the total number of the terminals which are successfully registered is smaller than a preset proportion threshold; at this time, for a plurality of terminals which are allocated with waiting time and have registration requirements, the registration requests may be sent to the base station for the first time, and the registration requests are sent simultaneously, and no channel resource is applied in the result; however, at the time when any terminal sends the registration request to the base station for the second time, the interval between the time and the first time of sending the registration request is the corresponding waiting time, and the proportion of the number of the terminals with the waiting time to the total number of the terminals which have successfully registered is smaller than the preset proportion threshold, that is, the number of the terminals which send the registration request to the base station for the second time is reduced, so that the probability that any terminal which sends the registration request to the base station among a plurality of terminals with registration requirements applies for the channel resource is increased; furthermore, the total time required for the plurality of terminals having the registration requirement to complete the registration is reduced.
And after the base station judges that the first terminal can be successfully registered, the base station allocates a target waiting time length for the first terminal. In order to make the waiting time lengths respectively corresponding to all the successfully registered terminals in the system different as much as possible after the target waiting time length is allocated to the first terminal currently, therefore, when a plurality of subsequent terminals with registration requirements send registration requests to the base station for the first time, the terminals with the registration requirements may send the registration requests at the same time, so that the plurality of terminals with the registration requirements do not rush to channel resources for sending the registration requests; however, the time interval during which the plurality of terminals having the registration request transmit the registration request to the base station for the second time is: and the waiting time corresponding to the terminal.
If the ratio of the number of the terminals with the same waiting time length to the total number of the terminals which are successfully registered in the terminals which are successfully registered is smaller than the preset ratio threshold, the number of the terminals which simultaneously send the registration requests to the base station for the second time in the plurality of terminals with the registration requirements is reduced, so that the probability that each terminal can apply for channel resources when sending the registration requests to the base station in the plurality of terminals with the registration requirements is increased.
Therefore, the target waiting duration needs to be determined, so that the ratio of the total number of the terminals with the target waiting duration to the total number of the terminals which have been successfully registered is smaller than the preset ratio threshold. Specifically, referring to fig. 2, a flowchart of an embodiment of a method for determining a target waiting duration in the present application is shown, where an execution main body of the embodiment of the method is a base station, and the embodiment of the method may specifically include:
Step 201: and detecting whether the current waiting time length exists in the waiting time length corresponding to the second terminal. If the current waiting time does not exist, executing step 202; if the current waiting duration exists, step 203 is executed.
In this embodiment, for convenience of description, in the present embodiment, among terminals (including a first terminal) that have been successfully registered at present, terminals other than the first terminal are collectively referred to as a second terminal. In practical applications, the registration request of the first terminal further includes a waiting duration of the first terminal at the time of sending the registration request, and for convenience of description, in this embodiment, the waiting duration of the first terminal at the time of sending the registration request is collectively referred to as a current waiting duration. If the first terminal is successfully registered for the first time, at this time, the current waiting time of the first terminal is 0 ms. If the first terminal does not register successfully for the first time, at this time, the current waiting time of the first terminal is the waiting time allocated by the base station after the last successful registration.
Therefore, in this step, it is detected whether the current waiting duration exists in the waiting durations of the second terminals, for example, the number of the current second terminals is 20, and in this step, it is detected whether the current waiting duration exists in the 20 waiting durations corresponding to the 20 second terminals. If the current waiting time length does not exist, it indicates that the current waiting time length of the first terminal has not been allocated, and at this time, the action of step 202 is executed; if the current waiting duration exists, it indicates that the current waiting duration of the first terminal has been allocated, and at this time, the action of step 203 is executed.
Step 202: and determining the current waiting time length as the target waiting time length.
Since the current waiting duration does not exist in the waiting duration of the second terminal, the current waiting duration is different from the waiting duration of the second terminal, and therefore, the current waiting duration is determined as the target waiting duration. At this time, for the terminals which have been successfully registered in the system, the terminal with the waiting time length equal to the target waiting time length only has the first terminal, and at this time, the proportion of the number of the terminals with the target waiting time length to the total number of the terminals which have been successfully registered is smaller than the preset proportion threshold.
Step 203: whether a first waiting time length exists in a plurality of preset waiting time lengths is detected.
If the waiting time corresponding to the second terminal which is successfully registered is the same as the current waiting time, in order to enable the waiting time of the successfully registered terminal to be different, in this step, whether a first waiting time exists in a plurality of preset waiting times is detected. The first waiting duration is a waiting duration except for the waiting duration corresponding to the second terminal in a plurality of preset waiting durations. If the first waiting duration exists, executing the action of step 204; if the first latency does not exist, the operation of step 205 is performed.
Step 204: a first wait duration is determined as the target wait duration.
When the first waiting time length exists in the preset plurality of waiting time lengths, the first waiting time length is different from the waiting time length of the second terminal in the preset plurality of waiting time lengths, and at this time, any first waiting time length is determined as the target waiting time length, so that the terminal with the target waiting time length only has the first terminal in the terminals which are successfully registered. At this time, the ratio of the number of the terminals with the target waiting duration to the total number of the terminals which have successfully registered is smaller than a preset ratio threshold.
Step 205: and selecting a target waiting time length from a plurality of preset waiting time lengths.
When the first waiting duration does not exist in the preset waiting durations, the preset waiting durations are distributed completely, and at the moment, the target waiting duration determined for the first terminal is repeated with the waiting duration corresponding to the second terminal. At this time, the waiting time with the minimum repetition number is selected from a plurality of preset waiting times. Wherein, aiming at any one of a plurality of preset waiting time lengths, the repetition times of the waiting time length refers to: the number of times it has been allocated.
Therefore, in this step, first, the total number of times of being allocated for each of the preset waiting durations is counted to obtain the total number of times of being allocated corresponding to any one of the waiting durations; and then, determining the waiting time with the minimum total number as the target waiting time according to the total number corresponding to each waiting time.
In practical applications, when the total number of times corresponding to each target waiting duration is the same among a plurality of preset waiting durations, the embodiment considers: and if the registration frequency of the first terminal is higher, determining the waiting time with a smaller value in a plurality of preset waiting time as the target waiting time. The registration frequency of the first terminal is as follows: and if the registration times of the first terminal in unit time is greater than a preset time threshold, the registration frequency of the first terminal is high. At this time, the target waiting time period required to be allocated to the first terminal is shorter, so that the total time required for the first terminal to complete multiple registrations is reduced.
In this embodiment, a method for determining a target waiting duration is provided, and by using the method provided in this embodiment, a ratio of the number of terminals having the target waiting duration to the total number of terminals that have successfully registered may be smaller than a preset ratio threshold.
Referring to fig. 3, a schematic structural diagram of an embodiment of a registration apparatus in the present application is shown, where the embodiment of the apparatus may include:
a determining unit 301, configured to determine whether the first terminal can successfully register after receiving a registration request sent by the first terminal;
a determining unit 302, configured to determine, if the first terminal can be successfully registered, a target waiting duration of the first terminal from a plurality of preset waiting durations according to the number of times of allocating the waiting duration and/or the registration frequency of the first terminal;
a first sending unit 303, configured to send the target waiting duration to the first terminal, so that when the first terminal registers again, a time interval between two adjacent times of sending registration requests to the base station is the target waiting duration.
Optionally, the determining unit 302 is configured to determine, if the first terminal is successfully registered, a target waiting duration from a plurality of preset waiting durations according to the number of times of allocating the waiting duration and/or the registration frequency of the first terminal, and includes: and determining the target waiting time length of the first terminal according to the distribution times of the waiting time length, wherein the distribution times of the target waiting time length are the least.
Optionally, the ratio of the number of terminals with the target waiting duration to the total number of terminals that have successfully registered is smaller than a preset ratio threshold.
Optionally, the determining unit 302 is configured to determine, if the first terminal is successfully registered, a target waiting duration from a plurality of preset waiting durations according to the number of times of allocating the waiting duration and/or the registration frequency of the first terminal, and includes: and determining the target waiting time length of the first terminal according to the registration frequency of the first terminal, wherein the registration frequency of the first terminal is negatively correlated with the target waiting time length of the first terminal.
Optionally, the determining unit 302 is specifically configured to determine the target waiting duration of the first terminal according to the number of times of allocating the waiting duration, where the number of times of allocating the target waiting duration is the minimum, and includes: detecting whether the current waiting time length exists in the waiting time length of the second terminal; the second terminal is as follows: the terminal which is registered successfully and has been distributed with waiting time length; if the current waiting time does not exist, determining the current waiting time as a target waiting time; if the current waiting time length exists, detecting whether a first waiting time length exists in a plurality of preset waiting time lengths; the first waiting duration is: waiting time durations except the waiting time duration of the second terminal in a plurality of preset waiting time durations; if the first waiting time length exists, determining one first waiting time length as a target waiting time length; and if the first waiting time length does not exist, selecting the target waiting time length with the least distribution times from a plurality of preset waiting time lengths.
Optionally, the embodiment of the apparatus further includes:
a storing unit 304, configured to store a corresponding relationship between a target waiting duration and an identifier of the first terminal after the determining unit determines the target waiting duration from a plurality of preset waiting durations;
the determining unit 302 is specifically configured to detect whether a current waiting duration exists in the waiting duration of the second terminal, and includes: and detecting whether the current waiting time length exists in the stored corresponding relation.
Optionally, the embodiment of the apparatus further includes:
a deleting unit 305, configured to delete the target waiting duration corresponding to the first terminal in the correspondence relationship if the first terminal is not registered again within the first preset time range after the storing unit stores the correspondence relationship between the target waiting duration and the identifier of the first terminal.
Referring to fig. 4, a schematic structural diagram of an embodiment of a registration request sending apparatus in the present application is shown, including:
a receiving unit 401, configured to receive a target waiting duration sent by a base station;
a second sending unit 402, configured to send a registration request to the base station after waiting for the target waiting duration if the first terminal needs to register again; or after waiting for the target waiting time and a random time belonging to a preset range, sending a registration request to the base station.
Referring to fig. 5, a schematic structural diagram of a communication device in the present application is shown, including: a memory 501 and a processor 502 coupled to the memory, wherein the memory 501 stores one or more programs, and the one or more programs execute the above-mentioned registration transmission method or the registration request transmission method when running on the processor 502.
The embodiment of the present application also provides a computer storage medium, on which a computer program is stored, where the computer program is executed by a processor to implement the above-mentioned registration sending or registration request sending method.
The embodiments are described in a progressive manner in the specification, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments are referred to each other. In this document, relational terms such as "first" and "second," and the like, may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. The terms "comprising," "including," and the like, as used herein, are to be construed in an inclusive sense as opposed to an exclusive or exhaustive sense; that is, the meaning of "includes but is not limited to". The invention can be applied to various fields, such as a mobile phone, a.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present application. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the application. Thus, the present application is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (10)
1. A registration method applied to a base station includes:
after receiving a registration request sent by a first terminal, judging whether the first terminal can be successfully registered;
if the first terminal can be successfully registered, determining a target waiting time length of the first terminal from a plurality of preset waiting time lengths according to the distribution times of the waiting time lengths and/or the registration frequency of the first terminal;
and sending the target waiting duration to the first terminal, so that when the first terminal registers again, the time interval between two adjacent times of sending registration requests to the base station is the target waiting duration.
2. The method according to claim 1, wherein the determining the target waiting duration of the first terminal from a plurality of preset waiting durations according to the number of times of allocating the waiting duration and/or the registration frequency of the terminal comprises: and determining the target waiting time length of the first terminal according to the distribution times of the waiting time length, wherein the distribution times of the target waiting time length are minimum.
3. The method of claim 2, wherein a ratio of the number of terminals with the target waiting duration to the total number of terminals that have successfully registered is smaller than a preset ratio threshold.
4. The method according to any one of claims 1 to 3, wherein the determining the target waiting duration of the first terminal from a plurality of preset waiting durations according to the number of times of allocation of the waiting duration and/or the registration frequency of the terminal comprises: and determining the target waiting time length of the first terminal according to the registration frequency of the first terminal, wherein the registration frequency of the first terminal is in negative correlation with the target waiting time length of the first terminal.
5. The method according to claim 2, wherein the registration request includes a current waiting duration of the first terminal;
The determining the target waiting duration of the first terminal according to the distribution times of the waiting duration, wherein the distribution times of the target waiting duration are the minimum, comprises:
detecting whether the current waiting time length exists in the waiting time length of the second terminal; the second terminal is as follows: the terminal which is registered successfully and has been distributed with waiting time length;
if the current waiting time length does not exist, determining the current waiting time length as the target waiting time length;
if the current waiting time length exists, detecting whether a first waiting time length exists in the preset multiple waiting time lengths; the first waiting duration is: waiting time durations of the plurality of preset waiting time durations, except the waiting time duration of the second terminal; if the first waiting time length exists, determining one first waiting time length as the target waiting time length; and if the first waiting time does not exist, selecting the target waiting time with the least distribution times from the preset multiple waiting times.
6. The method according to claim 5, further comprising, after said determining the target waiting duration of the first terminal from a plurality of preset waiting durations:
Storing the corresponding relation between the target waiting time and the identifier of the first terminal;
the detecting whether the current waiting duration exists in the waiting duration of the second terminal specifically includes:
and detecting whether the current waiting time length exists in the stored corresponding relation.
7. The method according to claim 6, further comprising, after said storing the correspondence between the target waiting duration and the identifier of the first terminal:
and if the first terminal is not registered again within a first preset time range, deleting the target waiting duration corresponding to the first terminal in the corresponding relationship.
8. A method for sending a registration request is applied to a first terminal, and comprises the following steps:
receiving a target waiting duration sent by a base station;
if the first terminal needs to register again, sending a registration request to the base station after waiting for the target waiting duration; or after waiting for the target waiting time and a random time belonging to a preset range, sending a registration request to the base station.
9. A communication device comprising a memory and a processor coupled to the memory, the memory having stored therein one or more programs which when executed on the processor perform the method of any of claims 1-8.
10. A computer storage medium, having stored thereon a computer program for execution by a processor to perform the method of any one of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910425750.6A CN111988841B (en) | 2019-05-21 | 2019-05-21 | Registration, registration request sending method, device, communication equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910425750.6A CN111988841B (en) | 2019-05-21 | 2019-05-21 | Registration, registration request sending method, device, communication equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111988841A true CN111988841A (en) | 2020-11-24 |
| CN111988841B CN111988841B (en) | 2023-02-07 |
Family
ID=73436223
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910425750.6A Active CN111988841B (en) | 2019-05-21 | 2019-05-21 | Registration, registration request sending method, device, communication equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111988841B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113015187A (en) * | 2021-02-22 | 2021-06-22 | Oppo广东移动通信有限公司 | Network registration method, device, terminal equipment and computer storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH04373328A (en) * | 1991-06-24 | 1992-12-25 | Nippon Telegr & Teleph Corp <Ntt> | Position registration congestion control method |
| US20060079227A1 (en) * | 2004-09-13 | 2006-04-13 | Nextel Communications, Inc. | System and method for improved IMEI registration |
| CN101098180A (en) * | 2007-06-04 | 2008-01-02 | 华为技术有限公司 | Wireless network, terminal message routing method, terminal login and paging method |
| CN101448318A (en) * | 2008-12-22 | 2009-06-03 | 华为技术有限公司 | Registration method, boundary proxy device and communication system thereof |
| CN102130832A (en) * | 2011-03-02 | 2011-07-20 | 中兴通讯股份有限公司 | Terminal log-on method and system in coaxial network |
| CN106487883A (en) * | 2016-09-28 | 2017-03-08 | 乐视控股（北京）有限公司 | Network registration process method and module |
-
2019
- 2019-05-21 CN CN201910425750.6A patent/CN111988841B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH04373328A (en) * | 1991-06-24 | 1992-12-25 | Nippon Telegr & Teleph Corp <Ntt> | Position registration congestion control method |
| US20060079227A1 (en) * | 2004-09-13 | 2006-04-13 | Nextel Communications, Inc. | System and method for improved IMEI registration |
| CN101098180A (en) * | 2007-06-04 | 2008-01-02 | 华为技术有限公司 | Wireless network, terminal message routing method, terminal login and paging method |
| CN101448318A (en) * | 2008-12-22 | 2009-06-03 | 华为技术有限公司 | Registration method, boundary proxy device and communication system thereof |
| WO2010072129A1 (en) * | 2008-12-22 | 2010-07-01 | 华为技术有限公司 | Registration method, outbound-proxy equipment and communication system |
| CN102130832A (en) * | 2011-03-02 | 2011-07-20 | 中兴通讯股份有限公司 | Terminal log-on method and system in coaxial network |
| CN106487883A (en) * | 2016-09-28 | 2017-03-08 | 乐视控股（北京）有限公司 | Network registration process method and module |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113015187A (en) * | 2021-02-22 | 2021-06-22 | Oppo广东移动通信有限公司 | Network registration method, device, terminal equipment and computer storage medium |
| CN113015187B (en) * | 2021-02-22 | 2023-10-10 | Oppo广东移动通信有限公司 | Network registration method, device, terminal equipment and computer storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111988841B (en) | 2023-02-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108282895B (en) | Random access method and terminal | |
| RU2681349C1 (en) | Association method and device | |
| WO2018171376A1 (en) | Method and device for random access and instruction after random access rollback | |
| CN106686728B (en) | Time-frequency resource allocation method and device | |
| CN111294752A (en) | V2X transmission candidate resource determination method and device, storage medium and user equipment | |
| CN110831082A (en) | Cell switching method, cell switching device, RRC reestablishment method, RRC reestablishment device, storage medium and user equipment | |
| EP3142411A1 (en) | Competition-based resource selection method and device, and computer storage medium | |
| WO2017101209A1 (en) | Service transmission method and apparatus | |
| CN109756990B (en) | Random access method and mobile communication terminal | |
| US11246134B2 (en) | Carrier selecting method, terminal device, and computer storage medium | |
| JP7467609B2 (en) | Method, device, terminal and medium for selecting resources in a vehicle internet system | |
| KR20160120770A (en) | Multichannel access method and apparatus | |
| CN111988841B (en) | Registration, registration request sending method, device, communication equipment and storage medium | |
| CN107548070B (en) | Data transmission method, device and system | |
| US20170202030A1 (en) | Random Access Method, Network Device, and User Equipment | |
| CN110933759A (en) | Random access processing method, device and communication equipment | |
| KR200426657Y1 (en) | Working FA Assignment Module and Policy Server in the Wireless Portable Internet System | |
| CN112020142A (en) | Data multiplexing transmission method, base station, terminal, and storage medium | |
| CN109644496B (en) | Access control method and related product | |
| CN111819902B (en) | Random access method and device | |
| Nwogu et al. | A combined static/dynamic partitioned resource usage approach for random access in 5G cellular networks | |
| WO2016184166A1 (en) | Method and apparatus for allocating carrier aggregation bandwidth | |
| US10462728B2 (en) | Access control apparatus and method, and access apparatus and method | |
| CN112954709A (en) | Beam selection method, terminal and storage medium | |
| WO2020164207A1 (en) | Method and device for processing channels, and electronic device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |