Communication method and communication apparatus

Abstract

The present application relates to the technical field of communications. Provided a communication method and a communication apparatus. In the method, at least one piece of first information among K pieces of first information that are sent by a first device to a second device comprises a first value, a first value, which is comprised in a Qth piece of first information among the at least one piece of first information, is used for instructing a second device in a first sub-group of a first group to send access information, the second device in the first group is a device that sends a (Q-1)th piece of access information, Q is less than or equal to K, and whether the second device in the first group belongs to the first sub-group is determined by means of the first value, which is comprised in the Qth piece of first information, so as to determine whether to continue sending access information. In this way, the number of second devices, which continue sending access information to a first device after first information carrying a first value is received, can be effectively reduced, thereby effectively reducing overall signaling overheads when the first device estimates the number of second devices.

Description

Communication method and communication device

[0001] This application claims priority to the Chinese patent application filed with the State Intellectual Property Office of China on September 20, 2023, with application number 202311221851.4 and application name “Communication Method and Communication Device”, and the Chinese patent application filed with the State Intellectual Property Office of China on May 6, 2024, with application number 202410548756.3 and application name “Communication Method and Communication Device”, the entire contents of which are incorporated by reference into this application. Technical Field

[0002] The present application relates to the field of communication technology, and more specifically, to a communication method and a communication device. Background Art

[0003] Radio frequency identification (RFID) uses radio frequency to conduct non-contact two-way data communication and read and write recording media (such as tag devices or radio frequency cards) to achieve the purpose of identifying targets and exchanging data.

[0004] An RFID system typically includes a reader / writer (interrogator) and a tag device (tag). The reader / writer and the tag device can exchange information. For example, the reader / writer reads information from the tag device or writes information that the tag device needs to store into the tag device.

[0005] When RFID is applied to mobile communication systems (eg, new radio (NR) systems), it is necessary to configure access resources for tag devices (eg, terminal devices) so that the tag devices can initiate access. How to configure access resources is an urgent problem to be solved.

[0006] Summary of the Invention

[0007] The present application provides a communication method and a communication device that can effectively reduce the overall signaling overhead when a reader estimates the number of tag devices.

[0008] In a first aspect, a communication method is provided, which is applied to a first device side, and the method includes: sending first information K times, the first information being used to instruct a second device to send access information, at least one first information among the K first information includes a first value, and at least one first information includes the Q-th first information, the first value included in the Q-th first information is used to instruct the second device in the first subgroup in the first group to send access information, the second device in the first group is a device that sends access information for the Q-1th time, Q and K are positive integers, and Q is less than or equal to K; sending second information, the second information being used to indicate that at least one second device has successfully accessed.

[0009] The execution subject of the solution described in the first aspect may be the first device, or a chip or integrated circuit in the first device, etc., without limitation. For ease of description, the following description takes the first device as an example.

[0010] In the above scheme, at least one of the K first messages sent by the first device to the second device includes the first value, which can be used to reduce the number of second devices that continue to send access information to the first device after receiving the first message carrying the first value. For example, the proportion of second devices that do not carry the first value and continue to send access information to the first device after receiving the first message is 50%, and the proportion of second devices that carry the first value and continue to send access information to the first device after receiving the first message carrying the first value can be 25% or 12.5%. This can effectively reduce the number of second devices that send access information to the first device, and thus effectively reduce the overall signaling overhead when the first device estimates the number of second devices.

[0011] In certain implementations of the first aspect, the method further includes: updating a first parameter K times, the first parameter being used to determine the number of access resources to be allocated, the access resources being used to receive the access information.

[0012] The first parameter can be used by the first device to determine the number of second devices or the number of access resources to be allocated. The update of the first parameter is related to the sending of the first information. For example, each time the first device sends the first information, the first device updates the first parameter once. If the first information is sent K times, the first parameter is updated K times. The first device can determine the number of second devices or the number of access resources to be allocated based on the first parameter after being updated K times.

[0013] In certain implementations of the first aspect, the pair of first parameters is updated K times, including: the first parameter corresponding to the Q-th first information includes the first parameter corresponding to the Q-1-th first information and the first value included in the Q-th first information.

[0014] In this way, the first device may estimate the number of second devices or the number of access resources to be allocated by combining the first parameter and the first value.

[0015] In certain implementations of the first aspect, the method further includes: determining the number of access resources to be allocated based on a first parameter corresponding to the K-th first information.

[0016] In this way, the first device can more accurately determine the amount of access resources to be allocated.

[0017] In certain implementations of the first aspect, the method further includes: successfully decoding access information received after sending the first information for the Kth time.

[0018] In this way, the first device can more accurately determine the number of access resources to be allocated or the number of second devices according to the first parameter corresponding to the K-th first information.

[0019] In certain implementations of the first aspect, the method further includes: before sending the K-th first information, failing to decode the access information received for the K-1th time.

[0020] In this way, the first device can more accurately determine the number of access resources to be allocated or the number of second devices according to the first parameter corresponding to the K-th first information.

[0021] In certain implementations of the first aspect, the method further includes: sending third information, where the third information is used to indicate the number of access resources to be allocated.

[0022] In this way, the second device can determine the amount of access resources to be allocated.

[0023] In certain implementations of the first aspect, the method further includes: after sending the first information for the Ith time and before sending the first information for the (I+1th) time, receiving at least one access information, where I is a positive integer less than or equal to K-1.

[0024] In this way, after sending the first information once, the first device can receive a certain amount of access information, which can help the first device determine the number of second devices according to the first parameter.

[0025] In certain implementations of the first aspect, the method further includes: sending T fourth information, each fourth information configuring an access resource, where T is a positive integer greater than N.

[0026] By sending T fourth information, the probability of the second device successfully initiating access can be effectively increased.

[0027] In some implementations of the first aspect, T is determined based on a bit error rate of a channel between the first device and the second device.

[0028] In this way, the first device can determine the appropriate amount of fourth information according to the channel error rate between the first device and the second device, which can effectively improve the probability of the second device successfully initiating access.

[0029] In certain implementations of the first aspect, T is determined based on a channel bit error rate between the first device and the second device, including: the value of T is determined based on the channel bit error rate between the first device and the second device and the value of N.

[0030] In this way, the overhead of access resources can be reduced while effectively increasing the probability that each second device can successfully initiate access.

[0031] In certain implementations of the first aspect, the value of T satisfies the following: y is the channel bit error rate between the first device and the second device, which is rounded up.

[0032] In this way, the first device can determine the appropriate amount of fourth information according to the above formula. In a second aspect, a communication method is provided, which is applied to a second device side, the method comprising: receiving K first information, the first information being used to indicate the sending of access information, at least one first information of the K first information including a first value, the at least one first information including a Q-th first information, the first value included in the Q-th first information being used to indicate that a second device in a first subgroup in a first group sends access information, the second device in the first group being a device that sends access information for the Q-1th time, where Q and K are positive integers and Q is less than or equal to K; and sending access information K times.

[0033] The execution subject of the solution described in the second aspect can be the second device, or a chip or integrated circuit in the second device, etc., which is not limited to this. For ease of description, the following description takes the second device as an example.

[0034] In the above scheme, at least one of the K first messages sent by the first device to the second device includes the first value, which can be used to reduce the number of second devices that continue to send access information to the first device after receiving the first message carrying the first value. For example, the proportion of second devices that do not carry the first value and continue to send access information to the first device after receiving the first message is 50%, and the proportion of second devices that carry the first value and continue to send access information to the first device after receiving the first message carrying the first value can be 25% or 12.5%. This can effectively reduce the number of second devices that send access information to the first device, and thus effectively reduce the overall signaling overhead when the first device estimates the number of second devices.

[0035] In certain implementations of the second aspect, sending the K-th access information includes: determining that the access information belongs to the first subgroup based on a first value included in the Q-th first information; and sending the Q-th access information.

[0036] In this way, the number of second devices that continue to send access information to the first device can be effectively reduced, thereby effectively reducing the overall signaling overhead when the first device estimates the number of second devices.

[0037] In certain implementations of the second aspect, the method further includes: receiving second information, where the second information is used to indicate that access of at least one second device is successful.

[0038] In this way, the second device can determine that the access is successful.

[0039] In certain implementations of the second aspect, the method further includes: receiving third information, where the third information is used to indicate the number of access resources to be allocated, and the access resources are used to send the access information.

[0040] In this way, the second device can determine the amount of access resources to be allocated.

[0041] In certain implementations of the second aspect, the method further includes: receiving part or all of T fourth information, each fourth information configuring an access resource, where T is a positive integer greater than N.

[0042] In some implementations of the second aspect, T is determined based on a bit error rate of a channel between the first device and the second device.

[0043] In certain implementations of the second aspect, T is determined based on a channel bit error rate between the first device and the second device, including: the value of T is determined based on the channel bit error rate between the first device and the second device and the value of N.

[0044] In certain implementations of the second aspect, the value of T satisfies the following: y is the channel bit error rate between the first device and the second device, which is rounded up.

[0045] In combination with the solutions described in any one of the first and second aspects, in a possible implementation manner, the first information includes: information indicating access failure, or information indicating that access information has not been received.

[0046] The "access failure" mentioned above may be caused by the first device receiving a large number of access messages that exceed the number of access messages that the first device can recognize. For example, the first device can only recognize one access message. If the first device receives two or more access messages, the first device determines that the access has failed. If the first device receives one access message, the first device determines that the access has succeeded.

[0047] The “access failure” may also include: the first device does not receive the access information.

[0048] In this way, the first device can instruct the second device to send access information.

[0049] In combination with the scheme described in any one of the first and second aspects, a possible implementation method is that at least one first information also includes the P-th first information, the first value included in the P-th first information is different from the first value included in the Q-th first information, P is not equal to Q, and P is a positive integer less than or equal to K.

[0050] In this way, flexible adjustment of the first value carried in the first information can be supported.

[0051] In combination with the solutions described in any one of the first and second aspects, in one possible implementation, the ratio between the number of second devices in the first subgroup and the number of second devices in the first group is related to the first value included in the Q-th first information.

[0052] For example, the first value is 2, and the ratio of the number of second devices in the first subgroup to the number of second devices in the first group is 1 / 22, or the ratio of the number of second devices in the first subgroup to the number of second devices in the first group is 1 / 32, etc. The base number is related to the probability that the second device can send access information after each reception of the first information. For example, the probability that the second device can send access information after each reception of the first information is 1 / 2, and the ratio of the number of second devices in the first subgroup to the number of second devices in the first group is 1 / 22; the probability that the second device can send access information after each reception of the first information is 1 / 3, and the ratio of the number of second devices in the first subgroup to the number of second devices in the first group is 1 / 32.

[0053] In this way, the number of second devices that continue to send access information to the first device can be effectively reduced, thereby effectively reducing the overall signaling overhead when the first device estimates the number of second devices.

[0054] In combination with the solution described in any one of the first and second aspects, in a possible implementation manner, the first value is a positive integer greater than or equal to 2.

[0055] In this way, the number of second devices that continue to send access information to the first device can be effectively reduced, thereby effectively reducing the overall signaling overhead when the first device estimates the number of second devices.

[0056] In combination with the solutions described in any one of the first and second aspects, in one possible implementation, the second device is a device that can be paged by the first device.

[0057] In this way, the first device can estimate the number of second devices that the first device can page.

[0058] In combination with the solution described in any one of the first and second aspects, in a possible implementation manner, the number of access resources to be allocated is related to the number of second devices.

[0059] For example, one access resource allows one second device to initiate access, and the number of access resources is equal to the number of second devices; for another example, one access resource allows two second devices to initiate access, and the number of access resources is half the number of second devices; for another example, one access resource allows four second devices to initiate access, and the number of access resources is equal to one-fourth the number of second devices.

[0060] In this way, the first device can determine the number of second devices according to the number of access resources to be allocated.

[0061] In a third aspect, a communication method is provided, including: sending third information, where the third information is used to indicate that the number of access resources to be allocated is N; sending T fourth information, where each fourth information configures an access resource, and T is a positive integer greater than N.

[0062] The execution subject of the solution described in the third aspect can be the first device, or a chip or integrated circuit in the first device, etc., which is not limited to this. For ease of description, the following description takes the first device as an example.

[0063] By sending T fourth information, each fourth information configures an access resource, and the value of T is greater than the value of N, and by configuring T access resources that are more than N access resources, this can effectively increase the probability of the second device successfully initiating access.

[0064] In the fourth aspect, a communication method is provided, including: receiving third information, the third information indicating that the number of access resources to be allocated is N; receiving part or all of T fourth information, each fourth information configures an access resource, and T is a positive integer greater than N.

[0065] The execution subject of the solution described in the fourth aspect may be the second device, or a chip or integrated circuit in the second device, etc., without limitation. For ease of description, the following description takes the second device as an example.

[0066] In combination with the solutions described in any one of the third and fourth aspects, in one possible implementation manner, T is determined based on a channel bit error rate between the first device and the second device.

[0067] In this way, the first device can determine the appropriate amount of fourth information according to the channel error rate between the first device and the second device, which can effectively improve the probability of the second device successfully initiating access.

[0068] In combination with the solutions described in any one of the third and fourth aspects, a possible implementation method is that T is determined based on the channel bit error rate between the first device and the second device, including: the value of T is determined based on the channel bit error rate between the first device and the second device and the value of N.

[0069] In this way, the overhead of access resources can be reduced while effectively increasing the probability that each second device can successfully initiate access.

[0070] In combination with the solutions described in any one of the third and fourth aspects, in one possible implementation, the value of T satisfies the following: y is the channel bit error rate between the first device and the second device, which is rounded up.

[0071] In this way, the first device can determine the appropriate amount of fourth information according to the above formula.

[0072] In a fifth aspect, a communication device is provided. The communication device may be a network device, or a device or module for performing the functions of a network device.

[0073] In one possible implementation, the communication device may include a module or unit corresponding to each of the methods / operations / steps / actions described in the first aspect. The module or unit may be a hardware circuit, software, or a combination of hardware circuit and software.

[0074] In a sixth aspect, a communication device is provided, which may be a terminal device, or a device or module for executing the functions of a terminal device.

[0075] In one possible implementation, the communication device may include a module or unit corresponding to each of the methods / operations / steps / actions described in the second aspect. The module or unit may be a hardware circuit, software, or a combination of hardware circuit and software.

[0076] In a seventh aspect, a communication device is provided, which may be a network device, or a device or module for performing the functions of a network device.

[0077] In one possible implementation, the communication device may include a module or unit corresponding to each of the methods / operations / steps / actions described in the third aspect. The module or unit may be a hardware circuit, software, or a combination of hardware circuit and software.

[0078] In an eighth aspect, a communication device is provided, which may be a terminal device, or a device or module for executing the functions of a terminal device.

[0079] In one possible implementation, the communication device may include a module or unit corresponding to each of the methods / operations / steps / actions described in the fourth aspect. The module or unit may be a hardware circuit, software, or a combination of hardware circuit and software.

[0080] In the ninth aspect, a communication device is provided, comprising a processor, wherein the processor is used to, by executing a computer program or instruction, or by a logic circuit, enable the communication device to perform the method described in the first aspect and any possible embodiment of the first aspect; or, enable the communication device to perform the method described in the second aspect and any possible embodiment of the second aspect; or, enable the communication device to perform the method described in the third aspect and any possible embodiment of the third aspect; or, enable the communication device to perform the method described in the fourth aspect and any possible embodiment of the fourth aspect.

[0081] In a possible implementation, the communication device further includes a memory for storing the computer program or instruction.

[0082] In a possible implementation, the communication device further includes a communication interface, which is used to input and / or output signals.

[0083] In the tenth aspect, a communication device is provided, comprising a logic circuit and an input / output interface, the input / output interface being used to input and / or output signals, the logic circuit being used to execute the method described in the first aspect and any possible embodiment of the first aspect; or, the logic circuit being used to execute the method described in the second aspect and any possible embodiment of the second aspect; or, the logic circuit being used to execute the method described in the third aspect and any possible embodiment of the third aspect; or, the logic circuit being used to execute the method described in the fourth aspect and any possible embodiment of the fourth aspect.

[0084] In the eleventh aspect, a computer-readable storage medium is provided, on which a computer program or instruction is stored. When the computer program or the instruction is run on a computer, the method described in the first aspect and any possibility of the first aspect is executed; or, the method described in the second aspect and any possibility of the second aspect is executed; or, the method described in the third aspect and any possibility of the third aspect is executed; or, the method described in the fourth aspect and any possibility of the fourth aspect is executed.

[0085] In the twelfth aspect, a computer program product is provided, comprising instructions, which, when executed on a computer, cause the method described in the first aspect and any possibility of the first aspect to be executed; or, cause the method described in the second aspect and any possibility of the second aspect to be executed; or, cause the method described in the third aspect and any possibility of the third aspect to be executed; or, cause the method described in the fourth aspect and any possibility of the fourth aspect to be executed.

[0086] The description of the advantageous effects of any of the fifth to twelfth aspects, etc., can refer to the description of the advantageous effects of the first to fourth aspects. BRIEF DESCRIPTION OF THE DRAWINGS

[0087] FIG1 is a schematic block diagram of a communication system 100 to which an embodiment of the present application is applicable.

[0088] FIG2 is a schematic diagram of an interaction flow of a communication method 200 according to an embodiment of the present application.

[0089] FIG3 is a schematic diagram of a method principle 300 according to an embodiment of the present application.

[0090] FIG4 is a schematic diagram of a binary tree 400 according to an embodiment of the present application.

[0091] FIG5 is a schematic diagram of a binary tree 500 according to an embodiment of the present application.

[0092] FIG6 is a schematic diagram of a method principle 600 according to an embodiment of the present application.

[0093] FIG7 is a schematic diagram of a binary tree 700 according to an embodiment of the present application.

[0094] FIG8 is a schematic diagram of a binary tree 800 according to an embodiment of the present application.

[0095] FIG9 is a schematic diagram of a method principle 900 according to an embodiment of the present application.

[0096] FIG10 is a schematic diagram of the interaction flow of a communication method 1000 according to an embodiment of the present application.

[0097] FIG11 is a schematic block diagram of a communication device 1100 according to an embodiment of the present application.

[0098] FIG12 is a schematic block diagram of a communication device 1200 according to an embodiment of the present application.

[0099] FIG13 is a schematic block diagram of a communication device 1300 according to an embodiment of the present application.

[0100] FIG14 is a schematic block diagram of a communication device 1400 according to an embodiment of the present application.

[0101] FIG15 is a schematic block diagram of a communication device 1500 according to an embodiment of the present application. DETAILED DESCRIPTION

[0102] The technical solution in this application will be described below with reference to the accompanying drawings.

[0103] In order to facilitate understanding of the embodiments of the present application, the following points are first explained.

[0104] 1. Unless otherwise specified, “plurality” means two or more.

[0105] 2. Unless otherwise specified or there is no logical conflict, the terms and / or descriptions between different embodiments of this application are consistent and can be referenced by each other. The technical features in different embodiments can be combined to form new embodiments based on their internal logical relationships.

[0106] 3. The various numerical numbers involved in this application are only used for the convenience of description and are not used to limit the scope of protection of this application. The size of the serial numbers involved in this application does not mean the order of execution. The order of execution of each process should be determined by its function and internal logic. For example, the terms "first", "second", "third", "fourth" and other various terminology labels (if any) in the specification and claims and drawings of this application are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. Among them, the data used in this way can be interchangeable where appropriate, so that the embodiments described here can be implemented in an order other than what is illustrated or described here.

[0107] At the same time, any embodiment or design described in this application as "exemplary" or "for example" should not be interpreted as being more preferred or more advantageous than other embodiments or designs. Specifically, the use of words such as "exemplary" or "for example" is intended to present the relevant concepts in a concrete manner to facilitate understanding.

[0108] 4. The terms "comprise" and "have" and any variations thereof are intended to cover non-exclusive inclusions. For example, a process, method, system, product or apparatus that includes a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such process, method, product or apparatus.

[0109] 5. In this application, "used to indicate" can be understood as "enabling," and "enabling" can include direct enabling and indirect enabling. When describing that certain information is used to enable A, it can include that the information directly enables A or indirectly enables A, and does not necessarily mean that the information contains A.

[0110] The information enabled by the information is called information to be enabled. In the specific implementation process, there are many ways to enable the enabled information, such as but not limited to, directly enabling the information to be enabled, such as the information to be enabled itself or the index of the information to be enabled. The information to be enabled can also be indirectly enabled by enabling other information, wherein there is an association between the other information and the information to be enabled. It is also possible to enable only a part of the information to be enabled, while the other parts of the information to be enabled are known or agreed in advance. For example, it is also possible to enable specific information with the help of the arrangement order of each piece of information agreed in advance (such as specified in the protocol), thereby reducing the enabling overhead to a certain extent. At the same time, it is also possible to identify the common parts of each piece of information and enable them uniformly to reduce the enabling overhead caused by enabling the same information separately.

[0111] 6. In this application, "pre-configuration" may include pre-definition, such as protocol definition. "Pre-definition" may be implemented by pre-storing corresponding codes, tables, or other methods that can be used to indicate relevant information in a device (e.g., including each network element). This application does not limit the specific implementation method.

[0112] 7. "Storage" or "saving" as used in this application may refer to storage in one or more memories. The one or more memories may be provided separately or integrated into an encoder or decoder, a processor, or a communication device. The one or more memories may also be provided in part separately and in part integrated into a decoder, processor, or communication device. The type of memory may be any form of storage medium and is not limited thereto.

[0113] 8. The “protocol” referred to in this application may refer to a standard protocol in the field of communications, such as the fourth generation (4G) th generation, 4G) network, fifth generation (5 th generation, 5G) network protocol, NR protocol, 5.5G network protocol, sixth generation (6 th generation, 6G) network protocols and related protocols used in future communication systems, which are not limited in this application.

[0114] 9. The arrows or boxes indicated by dotted lines in the schematic diagrams in the accompanying drawings of this application specification represent optional steps or optional modules.

[0115] 10. Unless otherwise specified, “ / ” indicates that the objects associated with each other are in an “or” relationship. For example, A / B can mean A or B. “And / or” in this application is only a description of the association relationship between the associated objects, indicating that there can be three relationships. For example, A and / or B can mean: A exists alone, A and B exist at the same time, and B exists alone. A and B can be singular or plural.

[0116] First, a communication system to which the embodiments of the present application are applicable is described.

[0117] Figure 1 is a schematic diagram of a communication system 100 applicable to an embodiment of the present application. As shown in Figure 1, communication system 100 includes: a first device and M second devices (e.g., second device #1, second device #2, ..., and second device #M, etc.). The first device can be a reader / writer in an RFID system, and the second device can be a tag device in an RFID system, and the second device is located within the coverage range of the first device. The first device is a network device, and the second device is a terminal device; alternatively, both the first device and the second device can be terminal devices, without limitation.

[0118] A terminal device is a device with wireless transceiver capabilities and can refer to user equipment (UE), access terminal, subscriber unit, user station, mobile station, remote station, remote terminal, mobile device, user terminal, wireless communication device, user agent or user device. The terminal device may also be a satellite phone, a cellular phone, a smart phone, a wireless data card, a wireless modem, a machine type communication device, a cordless phone, a session initiation protocol (SIP) phone, a wireless local loop (WLL) station, a personal digital assistant (PDA), a customer premises equipment (CPE), a smart point of sale (POS) machine, a handheld device with wireless communication capabilities, a computing device or other processing device connected to a wireless modem, an in-vehicle device, a communication device carried on a high-altitude aircraft, a wearable device, a drone, a robot, a terminal in device-to-device (D2D) communication, a terminal in vehicle-to-everything (V2X), a virtual reality (VR) terminal device, an augmented reality (AR) terminal device, a wireless terminal in industrial control, a wireless terminal in self-driving, a wireless terminal in remote medical care, a smart grid, etc. This application does not limit the wireless terminals in the wireless grid, transportation safety, smart city, smart home, or terminal devices in the communication network evolved after 5G.

[0119] The communication device used to implement the functions of the terminal device can be the terminal device, or it can be a device that can support the terminal device to implement the functions, such as a chip system. The device can be installed in the terminal device or used in conjunction with the terminal device. In this application, the chip system can be composed of a chip or include a chip and other discrete devices.

[0120] A network device is a device with wireless transceiver functions used to communicate with terminal devices. A network device can be a node in a radio access network (RAN), also known as a base station or a RAN node. It can be an evolved Node B (eNB or eNodeB) of LTE; or a base station of a 5G network such as gNodeB (gNB) or a base station in a public land mobile network (PLMN) that evolves after 5G, a broadband network gateway (BNG), an aggregation switch or a 3GPP (3rd Generation Partnership Project) rd generation partnership project, 3GPP) access equipment, etc.

[0121] The RAN can be configured as a RAN defined by the 3GPP protocol, an open radio access network (O-RAN), or a cloud radio access network (C-RAN). Network equipment can also include various forms of base stations, such as macro base stations, micro base stations (also known as small stations), relay stations, transmission points (transmitting and receiving points, TRPs), transmission points (transmitting points, TPs), mobile switching centers, and devices that perform base station functions in device-to-device (D2D), vehicle-to-everything (V2X), and machine-to-machine (M2M) communications, network equipment in non-terrestrial networks (NTNs), etc., without specific limitation.

[0122] The network equipment may also include network elements or modules that implement some functions of the base station, for example, one or more of the following: a centralized unit (CU), a distributed unit (DU), or a radio unit (RU). Optionally, the CU can be further separated into a CU-control plane (CP) and a CU-user plane (UP). The functions of the CU and DU can be implemented by different network elements, or simultaneously by the baseband unit (BBU) of the base station. The functions of the RU can be implemented by the radio frequency equipment of the base station. For example, the radio frequency equipment of the base station may be a remote radio unit (RRU), a pico remote radio unit (pRRU), an active antenna unit (AAU), or other units, modules or devices with radio frequency processing functions. The communication interface protocol between the BBU and the radio frequency equipment can be a common public radio interface (CPRI) interface protocol, an enhanced common public radio interface (eCPRI) interface protocol, or a fronthaul interface protocol between the DU and RU in the O-RAN system, etc., without limitation.

[0123] The communication device used to implement the function of the network device can be a network device, or a device that can support the network device to implement the function, such as a chip system. The device can be installed in the network device or used in conjunction with the network device. The chip system in the embodiment of the present application can be composed of a chip, or it can include a chip and other discrete devices.

[0124] Optionally, the communication system 100 may be an ambient internet of things (A-IoT) system. With the advancement of communication technologies, 3GPP has defined A-IoT technology. A-IoT is a cellular network communications infrastructure consisting of readers and writers and passive, semi-passive, or active tags. Its primary services include inventory management, positioning, and sensor reporting. Typical application scenarios include logistics, warehousing, industrial manufacturing, identity recognition, and environmental monitoring.

[0125] The A-IoT in A-IoT technology includes network devices and first-class terminal devices, or in other words, the communication system based on A-IoT includes network devices and first-class terminal devices. Among them, the first-class terminal device can be a device with the function of a tag device. In this case, both the reader and the tag device can be implemented based on the infrastructure in the cellular network. In other words, both the reader and the tag device can be devices in the cellular network. For example, the function of the reader and the tag device can be implemented by a network device, such as a base station. The tag device can be implemented by a terminal in the cellular network, such as an extremely low-power, extremely low-complexity Internet of Things terminal, that is, a first-class terminal device. Contactless data communication can be carried out between the network device and the first-class terminal device, thereby reading information from the first-class terminal device and / or writing information to be stored into the first-class terminal device.

[0126] A-IoT technology can be used to implement one or more of the following services: inventory, positioning, sensing, and command. Command services can be understood as implementing write or lock processes. In terms of application scope, A-IoT technology can be applied in scenarios such as logistics, warehousing, industrial manufacturing, identity recognition, and environmental monitoring.

[0127] Among them, the first type of terminal device in the A-IoT technology can be the second device, and the network device in the A-IoT technology can be the first device.

[0128] When the first device and the second device are a network device and a terminal device respectively, the first device and the second device communicate through an air interface; when the first device and the second device are both terminal devices, the first device and the second device communicate through a side link (SL).

[0129] In order to solve the technical problems mentioned in the background technology, the present application provides a communication method and a communication device, which can effectively reduce the overall signaling overhead when a reader estimates the number of tag devices.

[0130] The communication method and communication device provided in this application are described below with reference to the accompanying drawings.

[0131] Figure 2 is a schematic diagram of the interaction flow of a communication method 200 according to an embodiment of the present application. Method 200 can be performed by a first device and M second devices, or by modules and / or devices (e.g., chips or integrated circuits) with corresponding functions installed in the first device and the M second devices, without limitation. The following description uses the first device and the M second devices as an example. Method 200 includes:

[0132] S201. A first device sends first information K times to M second devices, where the first information is used to instruct the second devices to send access information.

[0133] Correspondingly, the M second devices receive the first information K times.

[0134] In a possible implementation, the access information may be identification information of the second device, or a preamble, or a pulse sequence, etc., which can be used to indicate that the second device is initiating access, without limitation.

[0135] For example, the first device may send the first information K times to M second devices through broadcasting, and the value of M is unknown.

[0136] In one possible implementation, the M second devices meet at least one of the following characteristics:

[0137] a) a device that can be paged by the first device;

[0138] b) a device within the coverage area of ​​the first device;

[0139] c) The device selected by the first device.

[0140] For feature a, the first device broadcasts a paging message (paging), and the second device determines whether to respond to the paging message based on whether the paging message includes the second device's user identity (UE identity) or group identity. If so, the second device responds to the paging message and is one of the M second devices described above; if not, the second device does not respond to the paging message and is not one of the M second devices described above.

[0141] For feature b, the first device broadcasts a signal (which can be any signal), and the device that receives and successfully decodes the signal is the M second devices mentioned above; the device that does not receive the signal is not the M second devices mentioned above; the device that receives but does not successfully decode the signal is also not the M second devices mentioned above.

[0142] For feature c, the first device broadcasts a selection signal (select), which carries mask information for triggering the device receiving the selection signal to initiate access. The device receiving the selection signal needs to determine whether it matches the mask information carried in the selection signal before determining whether to respond to the selection signal. For example, the selection signal includes a mask field 111000, which can indicate that the first four digits need to be matched (matching the first four digits can be preconfigured or predefined, and is not limited). The device that can match the first four digits is the M second device mentioned above; the device that cannot match the first four digits is not the M second device mentioned above.

[0143] In summary, the first device may send the first information K times to a device that meets any of the above characteristics.

[0144] Optionally, before sending the first information K times, the first device may first send a signaling for selecting the M second devices, and the signaling is used to indicate that the qualified device can access or initiate access. The signaling can be a selection signaling (select) or a paging message (paging), and the selection signaling or paging message includes an identifier, which is used to indicate that the qualified device (such as M second devices) accesses, or the identifier is used to indicate that the M second devices are selected, and the selected M second devices can respond to the subsequently sent K times of first information, or the selected M second devices can initiate access and send access information on a designated / or self-selected time resource (immediate sending by default). For the unselected second device, it needs to wait to be triggered before initiating access.

[0145] In one embodiment, the first device sending the first information K times may include: the first device sending the first information K times to M second devices at K different times, as shown in Table 1. The content shown in Table 1 is only an example and is not a final limitation.

[0146] Table 1

[0147] As shown in Table 1, taking K=4 as an example, the first device sends the first information for the first time at time 1, the first device sends the first information for the second time at time 2, the first device sends the first information for the third time at time 3, and the first device sends the first information for the fourth time at time 4. Time 1 is before time 2, time 2 is before time 3, and time 3 is before time 4.

[0148] In another embodiment, the first device sending the first information K times may further include: after sending the I-th first information and before sending the (I+1)-th first information, receiving at least one access information, where I is a positive integer less than or equal to K-1, as shown in Table 2. The content shown in Table 2 is only an example and is not intended to be a final limitation.

[0149] Table 2

[0150] As shown in Table 2, taking K=4 as an example, after sending the first first message, the first device receives 100 access messages; after sending the second first message, the first device receives 50 access messages; after sending the third first message, the first device receives 25 access messages; and after sending the fourth first message, the first device receives 1 access message. In other words, the first device can receive access messages after sending one first message and before sending the next first message.

[0151] Table 2 takes the example that the first device receives access information after sending the first information once, but does not limit the scenario where the first device fails to receive access information once or multiple times during the process of sending the first information K times.

[0152] In the embodiment of the present application, each time the first device sends the first message, the first device can receive access information, and the number of access messages received by the first device shows a decreasing trend. In other words, as the number of times the first message is sent increases, the number of corresponding access messages received each time decreases. In this way, the first device can estimate the number of second devices or the number of access resources to be allocated based on the number of times the first message is sent, and the access resources are used for sending or receiving access information.

[0153] In a possible embodiment, at least one of the K pieces of first information carries a first value, and the first values ​​carried by different pieces of first information may be the same or different, as shown in Table 3. Table 3 is provided for illustrative purposes only and is not intended to be limiting.

[0154] Table 3

[0155] As shown in Table 3, taking K=4 as an example, the first value carried by the first information sent for the first time is 0 (the first value may not be carried in this case), and the first information sent for the second through fourth times all carry the first value. The first value carried by the first information sent for the second time is different from the first value carried by the first information sent for the third time, and the first value carried by the first information sent for the third time is the same as the first value carried by the first information sent for the fourth time. For ease of description, the following example uses the Qth first information among the K first information times including the first value, where Q and K are positive integers, and Q is less than or equal to K.

[0156] In one possible implementation, the Qth first information includes a first value, and the first value in the Qth first information is used to indicate that the second device in the first subgroup in the first group sends access information, and the second device in the first group is the device that sends access information for the Q-1th time.

[0157] The above grouping may be related to the number of times the second device executes the first rule, or may be related to the result of the second device executing the first rule once, without limitation. For a description of the grouping, see Table 4. The contents shown in Table 4 are for example only and are not intended to be definitive.

[0158] Table 4

[0159] As shown in Table 4, taking the example of eight second devices sending access information to the first device after the first device sends the Q-1th first information, the eight first devices can be further divided into four subgroups: the first subgroup includes second device #1 and second device #2, the second subgroup includes second device #3 and second device #4, the third subgroup includes second device #5 and second device #6, and the fourth subgroup includes second device #7 and second device #8.

[0160] In one example, the above grouping is related to the number of times the second device executes the first rule. For example, if the value of the first value carried in the Qth first information is 2, it can indicate that the first rule was executed twice, and the results of the first rule include two possibilities. It can be stipulated that devices that have the first possible result after executing the first rule twice in a row belong to the first subgroup. In other words, devices that have the first possible result after executing the first rule twice in a row can send access information to the first device. See Table 5. The content shown in Table 5 is for example only and is not a final definition.

[0161] Table 5

[0162] As shown in Table 5, taking the case where the results of the first rule include 0 and 1, the results of two consecutive executions of the first rule include: 00, 01, 10, and 11. It can be stipulated that the second device with a result of 00 belongs to the first subgroup. Second devices belonging to the first subgroup can continue to send access information to the first device, while other devices do not send access information to the first device. This effectively reduces the number of second devices that send access information to the first device for the Qth time, thereby effectively reducing overall signaling overhead.

[0163] In another example, the above grouping may be related to the result of a single execution of the first rule by the second device. For example, if the first value carried in the Qth first information is 2, it may indicate that the first rule was executed once, and the first rule had four possible results. It may be specified that devices that have the first possible result from executing the first rule belong to the first subgroup, as shown in Table 6. The content shown in Table 6 is for example only and is not intended to be definitive.

[0164] Table 6

[0165] As shown in Table 6, taking the case where the results of the first rule include 0, 1, 2, and 3, the results of executing the first rule once include: 0, 1, 2, and 3. It can be stipulated that the second device with a result of 0 belongs to the first subgroup, and the second devices belonging to the first subgroup continue to send access information to the first device, while the remaining devices do not continue to send access information to the first device. This effectively reduces the number of second devices that send access information to the first device for the Qth time, thereby effectively reducing overall signaling overhead.

[0166] Optionally, for the eight second devices that send access information to the first device for the Qth time, each second device can determine the identifier of the subgroup to which it belongs based on the result of executing the first rule the first value number of times. For example, the second device executes the first rule N times (used to represent the first value) in sequence, and stops if the result of executing the first rule in the tth round is 1, and level_ue = t. Among them, only if the result of executing the first rule N times is N, then level_ue = 0. The second device with level_ue = 0 belongs to the first subgroup and can send access information to the first terminal device.

[0167] In the above description, the ratio between the number of second devices in the first group and the number of second devices in the first subgroup is related to the first value. For example, if the first value is 2, the ratio between the number of second devices in the first subgroup and the number of second devices in the first group is 1 / 2. 2 , or, the ratio between the number of second devices in the first subgroup and the number of second devices in the first group is 1 / 3 2 The base number is related to the probability that the second device can send access information after receiving the first information each time. For example, the probability that the second device can send access information after receiving the first information each time is 1 / 2, and the ratio between the number of second devices in the first subgroup and the number of second devices in the first group is 1 / 2. 2 The probability that the second device can send access information after receiving the first information each time is 1 / 3, and the ratio between the number of second devices in the first subgroup and the number of second devices in the first group is 1 / 3 2 .

[0168] Optionally, the first value may also be used to indicate the probability of the second device sending access information. For example, when the first value is not carried, the probability that the second device can send access information is 0.5. After carrying the first value, with the first value = 2, the probability that the second device can send access information is 0.25. In other words, after sending the first information for the Qth time, the number of access information that the first device can receive will be 1 / 4 of the number of access information received by the first device for the Q-1th time.

[0169] In addition, the first information may include: information indicating an access failure, or information indicating that the access information was not received. Both the information indicating that the access information was not received and the information indicating the access failure may be used to instruct the sending of access information. In this way, the first device may instruct the M second devices to send access information.

[0170] In one example, the first information includes information indicating that access information was not received, and the second device (e.g., second device #1, second device #2, ..., and second device #M) determines that access information needs to be sent to the first device based on the information indicating that access information was not received. In another example, the first information includes information indicating an access failure, and the second device (e.g., second device #1, second device #2, ..., and second device #M) determines that access information needs to be sent to the first device based on the information indicating the access failure.

[0171] Optionally, the first information may be information indicating access failure, or the first information may be information indicating that access information has not been received. For example, when the second device receives information indicating access failure, the second device may determine that access information needs to be sent; or, when the second device receives information indicating that access information has not been received, the second device may also determine that access information needs to be sent.

[0172] Optionally, the information indicating access failure and the information indicating that access information has not been received may be two different pieces of information, and both may be used to instruct the second device to send access information (which may be a subordinate information form of the first information). Upon receiving the information indicating access failure and the information indicating that access information has not been received, the second device may determine whether to send access information based on certain rules. For details, see the following description.

[0173] It should be noted that each of the K first messages may be information for indicating access failure, or one or more first messages may be information for indicating that access information has not been received, which is not limited to this.

[0174] The "access failure" mentioned herein may be: the first device receives a large number of access messages that exceed the number of access messages that the first device can recognize. For example, the first device can only recognize one access message. If the first device receives two or more access messages, the first device determines that the access has failed. If the first device receives one access message, the first device determines that the access has succeeded.

[0175] Optionally, the "access failure" may also include: the first device does not receive the access information. For ease of description, the following description uses the example of the first device receiving one access message indicating successful access. However, the present invention is not limited to the scenario where the first device receives multiple access messages indicating successful access.

[0176] S202. The second device sends K access information to the first device.

[0177] Correspondingly, the first device receives K access information.

[0178] The number of access information received by the first device each time may be different. For example, as the number of first information transmissions increases, the number of access information received by the first device decreases. For example, after sending the first information for the first time, the first device receives the first access information, and the number of the first access information is 10. After sending the first information for the second time, the first device receives the second access information, and the number of the second access information is 6, etc.

[0179] In one possible implementation, the M second devices may determine whether to send access information to the first device based on a first rule. The first rule may include:

[0180] a) satisfying the access status and determining to send access information;

[0181] b) The access status is not satisfied, and it is determined not to send the access information.

[0182] The aforementioned access-satisfied state may be a state in which the second device can send access information to the first device.

[0183] In one possible implementation, the aforementioned "whether the access status is satisfied" can be determined by the value of a counter. For example, second device #1 generates counter #1, second device #2 generates counter #2, second device #3 generates counter #3, second device #4 generates counter #4, second device #5 generates counter #5, second device #6 generates counter #6, second device #7 generates counter #7, second device #8 generates counter #8, second device #9 generates counter #9, second device #10 generates counter #10, second device #11 generates counter #11, second device #12 generates counter #12, second device #13 generates counter #13, second device #14 generates counter #14, second device #15 generates counter #15, and second device #16 generates counter #16. The value of the counter generated by each second device can be different. It can be specified that when the counter value is a specific value, access information can be sent to the first device, and when the counter value is not the specific value, access information is not sent to the first device. For example, the specific value may be 0 or 1, and is not limited thereto.

[0184] In one possible implementation, the probability of satisfying the access status is equal to the probability of not satisfying the access status. In this way, the probability of the second device feeding back access information after receiving the first information can be 50%.

[0185] The counter of the second device may change due to receiving the first information. For ease of description, this application takes the value of the counter as 0 or 1 as an example for description, but does not limit other possible scenarios.

[0186] In one possible implementation, the aforementioned "whether the access status is met" can be determined by whether the device belongs to the first subgroup. For example, the second device generates a random number based on the first information. The first value may indicate the number of random numbers generated. For example, if the second device has a first value of 1 and generates a random number of 0 and belongs to the first subgroup, after the second device sending the access information receives the first information carrying the first value of 1, as shown in Table 7, in the first round, second devices #1 through #8 generate a random number of 0, and second devices #9 through #16 generate a random number of 1. Then, second devices #1 through #8 send access information. This continues in this manner, with 50% of the second devices entering the first subgroup in each round. By the fourth round, only second device #1 sends an access information.

[0187] Table 7 Second device update example in the first subgroup

[0188] Exemplarily, the first value can take different values ​​in different rounds. Taking the first values ​​in three rounds as 1, 2 and 1 respectively, assuming that the second device that generates all random numbers as 0 belongs to the first subgroup, the second device that sends the access information randomly generates 2 random numbers after receiving the first information carrying the first value of 2. The second device that generates the random number 00 belongs to the first subgroup. Please refer to Table 8.

[0189] Table 8 Second device update example in the first subgroup

[0190] As shown in Table 8, in the first round, the first value is 1, and the second device has a 50% probability of generating 0, so 50% of the second devices belong to the first subgroup, that is, second devices #1 to #8 generate the random number 0, and second devices #9 to #16 generate the random number 1, among which second devices #1 to #8 send access information; in the second round, second devices #1 to #8 receive the first information with the first value of 2, that is, generate two random numbers, among which 25% of the second devices generate 00, belonging to the first subgroup, that is, second device #1 and second device #2; in the third round, second devices #1 to #2 receive the first information with the first value of 1, that is, generate 1 random number, among which 50% of the second devices generate 0, belonging to the first subgroup, that is, second device #1.

[0191] In another possible implementation, the aforementioned "whether the access status is satisfied" can be determined by whether a certain probability condition is satisfied. For example, a first value indicates the probability that the second device satisfies the access status. A specific implementation method may be to generate a specified random number. For example, if the first value indicates a probability of 25%, then generating 1 to 25 from 1 to 100 indicates that the access status is satisfied. The specific implementation method is not limited.

[0192] In one possible implementation, the second device may determine the current state of the time resource by updating a Y parameter. The Y parameter may be an internal variable of the second device (e.g., a counter value) or time information (e.g., a system frame number (SFN)). The counter update may be flexible, such as initiating access when the counter value decreases to 0 or initiating access when the counter value increases to a value, such as 15, without limitation.

[0193] In one implementation, the Yth parameter is an internal variable: Taking counter as the Yth parameter as an example, the second device can maintain a counter value in each time resource, and send access information when the counter value reaches the counter threshold. It can be understood that each time resource corresponds to a counter value of the second device. Exemplarily, if counter = 0, access information is sent; if counter > 0, access information is not sent. The update of the counter value can be determined based on the received information. Exemplarily, when the second device receives the first information, counter = counter - 1. If counter is zero after decrementing by 1, access information is sent; if it is not zero after decrementing by 1, access information is not sent.

[0194] In another implementation, the Y parameter may be a timer. When the timer reaches a timer threshold, the random access information is sent. The timer update may be incremented or decremented over time, without limitation. For example, using the example of a timer decrementing over time, the access information is sent when the timer reaches zero. The initial value of the timer is 10 ms, and the second device sends the access information 10 ms later.

[0195] For frame number information: the Yth parameter can be obtained from the network side (such as the first device). Taking the Yth parameter as the frame number as an example, the first device sends the Yth parameter through broadcast and / or unicast and / or multicast messages, and the second device obtains the Yth parameter. When the Yth parameter reaches the first threshold, it sends access information. The first threshold can be randomly generated or obtained according to a calculation rule. For example, it is calculated based on UE_ID. The first threshold = UE_ID mod W, where UE_ID is the unique identifier of the second device, W is a constant that can be configured by the network, and mod is a modulo calculation.

[0196] For a description of the first device receiving K access information, please refer to FIG. 3 to FIG. 8 .

[0197] FIG3 is a schematic diagram of a method principle 300 according to an embodiment of the present application. As shown in FIG3 , M=16, and each first information does not include the first value:

[0198] 1) Round number = 1. The first device sends the first message to 16 second devices (e.g., second device #1 through second device #16) for the first time. The counters of the second devices are randomly generated to be 0 or 1. It is stipulated that the second device with a counter = 0 sends access information to the first device, and the second device with a counter = 1 does not send access information to the first device. The first device will receive 8 access messages.

[0199] 2) Round number = 2: The first device sends the first message to the 16 second devices for the second time. The counters of the eight second devices (e.g., second devices #1 through #8) that sent access messages to the first device continue to randomly generate 0 or 1. Second devices with a counter of 0 can continue to send access messages to the first device, while second devices with a counter of 1 do not send access messages to the first device. The first device can receive four access messages (from second devices #1 through #4).

[0200] 3) Round number = 3. The first device sends the first message to the 16 second devices for the third time. The counters of the four second devices (e.g., second devices #1 through #4) that sent access messages to the first device continue to randomly generate 0 or 1. Second devices with a counter of 0 can continue to send access messages to the first device, while second devices with a counter of 1 do not send access messages to the first device. Therefore, the first device receives two access messages (from second devices #1 through #2).

[0201] 4) Round number = 4. The first device sends the first message to the 16 second devices for the fourth time. The counters of the two second devices (e.g., second device #1 and second device #2) that sent access messages to the first device continue to randomly generate 0 or 1. A second device with a counter of 0 can send access messages to the first device, while a second device with a counter of 1 does not send access messages to the first device. Therefore, the first device receives one access message (from second device #1).

[0202] In the above description, the second device may determine whether to send access information according to the following rules:

[0203] a) counter(i-1) = 0, then counter(i) = counter(i-1) + rand(0,1), where rand(0,1) represents a random value of 0 or 1.

[0204] b) counter(i-1)>0, then counter(i)=counter(i-1)+1. Here, counter(i-1) is used to indicate the counter value before the i-th round, and each round corresponds to a first information.

[0205] If a second device fails to send access information to a first device, it does not participate in the process of sending access information to the first device. If a second device successfully sends access information to a first device, it can determine whether to continue sending access information to the first device based on the current value of the counter. This effectively controls the amount of access information received by the first device, thereby effectively reducing overall signaling overhead.

[0206] The contents shown in Figure 3 can be found in the description of Table 9. The contents of Table 9 are for illustrative purposes only and are not intended to be definitive. The round number in the first column indicates the number of times the first information is sent. For example, round 1 corresponds to the first time the first device sends the first information and the first time the second device receives the first information. Columns 2 to 17 represent the updated values ​​of the counter on the second device in different rounds.

[0207] Table 9 Example of counter value change of the second device

[0208] As shown in Table 9:

[0209] 1) Round number = 1. The first device sends the first message to the second device for the first time. Second devices #1 through #16 generate counters. The counters for second devices #1 through #8 are 0, and the counters for second devices #9 through #16 are 1. Therefore, second devices #1 through #8 send access messages to the first device. The first device receives 8 access messages.

[0210] 2) Round number = 2. The first device sends the first message to the second device for the second time. Second devices #1-#16 continue to generate counters. The counters for second devices #1-#4 are 0, the counters for second devices #5-#8 are 1, and the counters for second devices #9-#16 are 2. Therefore, second devices #1-#4 send access messages to the first device. The first device receives four access messages.

[0211] 3) Round number = 3. The first device sends the first message to the second device for the third time. Second devices #1-#16 continue to generate counters. The counters for second devices #1-#2 are 0, 1 for second devices #3-#4, 2 for second devices #5-#8, and 3 for second devices #9-#16. Therefore, second devices #1-#2 send access messages to the first device. The first device receives two access messages.

[0212] 4) Round number = 4. The first device sends the first message to the second device for the fourth time. Second devices #1-#16 continue to generate counters. The counter of second device #1 is 0, the counter of second device #2 is 1, the counters of second devices #3-#4 are 2, the counters of second devices #5-#8 are 3, and the counters of second devices #9-#16 are 4. Second device #1 sends an access message to the first device. The first device receives 1 access message.

[0213] In the above description, the second device #1 to the second device #16 can maintain a variable, and there is no restriction on the name of the variable. For example, each second device can maintain X, and the initial value of X can be 0.

[0214] In one possible implementation, the second device #1-second device #16 can set X=0, and determine whether to send access information to the first device based on the value of counter, and update X. For example, if the counter of the second device #1-second device #8 is 0, it is determined to send access information to the first device, and X=X+1 (X=1) is updated. If the counter of the second device #9-second device #16 is not 0, it is determined not to send access information to the first device, and X=X+0=0 (X=0) is updated. For the changes in the value of X of the second device, please refer to Table 10 and Table 11. Among them, the round number in the first column indicates the number of times the first information is sent, for example, round number 1 corresponds to the first time the first device sends the first information and the first time the second device receives the first information, and columns 2 to 17 indicate the updated values ​​of X of the second device in different rounds. Among them, the contents described in Table 10 and Table 11 are only to be understood as examples and are not to be regarded as final limitations.

[0215] Table 10 Example of X value change for the second device

[0216] As shown in Table 10, take the case where X is not equal to the counter value as an example:

[0217] 1) Round number = 1. The first device sends the first message to the second device for the first time. Devices #1 through #16 generate counters. The counters for devices #1 through #8 are 0, and the counters for devices #9 through #16 are 1. Devices #1 through #8 update X to 1. Devices #9 through #16 do not update X, and X remains 0.

[0218] 2) Round number = 2. The first device sends the first message to the second device for the second time. Devices #1 through #16 continue to generate counters. The counters for devices #1 through #4 are set to 0, the counters for devices #5 through #8 are set to 1, and the counters for devices #9 through #16 are set to 2. Devices #1 through #4 update X to 2. Devices #5 through #8 do not update X, and X = 1. Devices #9 through #16 do not update X, and X = 0.

[0219] 3) Round number = 3. The first device sends the first message to the second device for the third time. Second devices #1-#16 continue to generate counters. The counters for second devices #1-#2 are 0, the counters for second devices #3-#4 are 1, the counters for second devices #5-#8 are 2, and the counters for second devices #9-#16 are 3. Second devices #1-#2 update X to 3. Second devices #3-#4 do not update X, and X = 2. Second devices #5-#8 do not update X, and X = 1. Second devices #9-#16 do not update X, and X = 0.

[0220] 4) Round number = 4. The first device sends the first information to the second device for the fourth time. Second devices #1-#16 continue to generate counters, with counter = 0 for second device #1, counter = 1 for second device #2, counter = 2 for second device #3-#4, counter = 3 for second device #5-#8, and counter = 4 for second device #9-#16. Second device #1 updates X = 4. Second device #2 does not update X, and X = 3. Second devices #3-#4 do not update X, and X = 2. Second devices #5-#8 do not update X, and X = 1. Second devices #9-#16 do not update X, and X = 0.

[0221] Table 11 Example of X value changes for the second device

[0222] As shown in Table 11, take X equal to the counter value as an example:

[0223] 1) Round number = 1. The first device sends the first message to the second device for the first time. Second devices #1 through #16 generate counters. The counters for second devices #1 through #8 are 0, and the counters for second devices #9 through #16 are 1. Second devices #1 through #8 do not update X, and X = 1. Second devices #9 through #16 then update X = 1.

[0224] 2) Round number = 2. The first device sends the first message to the second device for the second time. Devices #1 through #16 continue to generate counters. The counters for devices #1 through #4 are set to 0, the counters for devices #5 through #8 are set to 1, and the counters for devices #9 through #16 are set to 2. Devices #1 through #4 do not update X, and X = 0. Devices #5 through #8 update X to 1, and devices #9 through #16 update X to 2.

[0225] 3) Round number = 3. The first device sends the first message to the second device for the third time. Second devices #1-#16 continue to generate counters. The counters for second devices #1-#2 are 0, the counters for second devices #3-#4 are 1, the counters for second devices #5-#8 are 2, and the counters for second devices #9-#16 are 3. Second devices #1-#2 do not update X, and X = 3. Second devices #3-#4 update X to 1, second devices #5-#8 update X to 2, and second devices #9-#16 update X to 3.

[0226] 4) Round number = 4. The first device sends the first message to the second device for the fourth time. Devices #1 through #16 continue to generate counters: device #1's counter = 0, device #2's counter = 1, device #3 through #4's counter = 2, device #5 through #8's counter = 3, and device #9 through #16's counter = 4. Device #1 does not update X, and X = 4. Device #2 updates X = 1. Device #3 through #4 updates X = 2. Device #5 through #8's counter = 3, and device #9 through #16's counter = 4.

[0227] For the description of FIG3 , please refer to FIG4 .

[0228] FIG4 is a schematic diagram of a binary tree 400 according to an embodiment of the present application. As shown in FIG4 , second devices #1 through #16 participate in the above process. In each round, the second devices are divided into two equal groups, and each time the first information does not include the first value. In the first round, second devices #1 through #8 are devices that send access information to the first device (this can be determined based on the aforementioned information regarding whether the access status is satisfied), while second devices #9 through #16 are devices that do not send access information to the first device. In the second round, second devices #1 through #4 are devices that send access information to the first device, while second devices #4 through #8 are devices that do not send access information to the first device. In the third round, second devices #1 through #2 are devices that send access information to the first device, while second devices #3 through #4 are devices that do not send access information to the first device. In the fourth round, second device #1 is a device that sends access information to the first device, while second device #2 is a device that does not send access information to the first device.

[0229] It should be noted that the content shown in FIG4 is described by taking M=16 as an example. Please also refer to FIG5 .

[0230] Figure 5 is a schematic diagram of a binary tree 500 according to an embodiment of the present application. As shown in Figure 5, second devices #1 through #M participate in the above process, and each time the first information does not include the first value. Specifically, in the first round, M / 2 second devices send access information to the first device, while M / 2 second devices do not send access information to the first device. In the second round, M / 4 second devices send access information to the first device, while M / 4 second devices do not send access information to the first device. This continues in this order, and in the log2Mth round, one second device sends access information to the first device.

[0231] FIG6 is a schematic diagram of a method principle 600 according to an embodiment of the present application. As shown in FIG6 , M=16, and the second first information includes the first value:

[0232] Round number = 1: The first device sends the first information to the second devices #1 to #16 for the first time. The first device receives 8 access information.

[0233] Round number = 2: The first device sends the first message a second time to second devices #1-#16. This second first message includes N (a first value, using N=2 as an example), which indicates that the second devices in the first subgroup of the first group should send access information. Second devices #1-#8 determine whether to send access information to the first device based on the first rule. Second devices #9-#16 do not send access information. The first device receives two access messages.

[0234] For example, for second device #1 to second device #8, the second device may determine whether it belongs to the first subgroup according to N or determine whether to continue sending access information.

[0235] In one example, the second device may determine whether to send access information or whether to belong to the first subgroup according to the following rules:

[0236] a) The result of the first rule in round i is to determine to send access information, and the first rule in round i+1 is performed;

[0237] b) The result of the first rule of the i-th round is to determine not to send access information, and stop performing the first rule of the i+1-th round; where i is a positive integer, and i+1 is less than or equal to N.

[0238] For example, the second device #1 and the second device #2 execute the first rule for the first time (or randomly generate 0 or 1), and determine that the result of the first rule is to send access information (or counter = 0), then they can execute the first rule for the second time, and determine that the result of the second rule is to send access information, then determine to send access information to the first device, and determine that they belong to the first subgroup. The second device #3 and the second device #4 execute the first rule for the first time, and determine that the result of the first rule is to send access information, then they can execute the first rule for the second time, and determine that the result of the second rule is not to send access information, then determine not to send access information to the first device, and determine that they do not belong to the first subgroup. The second device #5-the second device #8 execute the first rule for the first time, and determine that the result of the first rule is not to send access information, then determine not to send access information to the first device, and determine that they do not belong to the first subgroup. In this way, the number of second devices that can send access information to the first device can be reduced.

[0239] In another example, the second device may determine whether to send access information according to the following rules:

[0240] c) Execute the first rule N times.

[0241] For example, if second device #1 and second device #2 execute the first rule twice, and the result of both executions is to send access information, they determine to send access information to the first device and are determined to belong to the first subgroup. If second device #3 and second device #4 execute the first rule twice, and the result of one execution is not to send random access information, they determine not to send access information to the first device and are determined not to belong to the first subgroup. If second device #5-second device #8 execute the first rule twice, and the result of both executions is not to send access information, they determine not to send access information to the first device and are determined not to belong to the first subgroup.

[0242] Optionally, the second device executes the first rule twice, that is, the second device generates a counter twice, the probability of the counter taking a value of 0 and the counter taking a value of 1 are the same, and the value of the previous counter does not affect the value of the next counter.

[0243] Furthermore, the first device receives two access information and determines that the access fails.

[0244] Round number=3, the first device sends the first information to the 16 second devices for the third time, the first information does not include the first value. The first device receives an access message.

[0245] For the description of FIG6 , please refer to Table 12. The contents of Table 12 are only to be understood as examples and are not to be construed as final limitations.

[0246] Table 12 Example of counter value change of the second device

[0247] As shown in Table 12:

[0248] 1) Round number = 1. The first device sends the first message to the second device for the first time. The counters of second devices #1-#8 are 0, and the counters of second devices #9-#16 are 1. Second devices #1-#8 send access messages to the first device. The first device receives 8 access messages.

[0249] 2) Round number = 2. The first device sends the first message to the second device for the second time. The first message includes the first value (N = 2). For example, when the first rule is executed twice, the counters for second device #1 and second device #4 are 0, 1 for second device #5 and second device #8, and 2 for second device #9 and second device #16. When the first rule is executed again, the counters for second device #1 and second device #2 are 0, 1 for second device #3 and second device #4, and second device #1 and second device #2 send access messages to the first device. The first device receives two access messages.

[0250] 3) Round number = 3. The first device sends the first message to the second device for the third time. The first message does not include the first value. The counter of second device #1 is 0, the counter of second device #2 is 1, the counters of second device #3 and second device #4 are 2, the counters of second device #5 and second device #8 are 3, and the counters of second device #9 and second device #16 are 4. Second device #1 sends an access message to the first device. The first device receives 1 access message.

[0251] Correspondingly, the second device may also update the X value, as shown in Table 13. The contents described in Table 13 are only to be understood as examples and are not to be construed as final limitations.

[0252] Table 13 Example of X value change for the second device

[0253] As shown in Table 13, take the case where X is not equal to the counter value as an example:

[0254] 1) Round number = 1. The first device sends the first message to the second device for the first time. Devices #1 through #16 generate counters. The counters for devices #1 through #8 are 0, and the counters for devices #9 through #16 are 1. Devices #1 through #8 update X to 1. Devices #9 through #16 do not update X, and X remains 0.

[0255] 2) Round number = 2. The first device sends the first message to the second device for the second time. The first message includes the first value, which is 2. Devices #1 through #16 continue to generate counters. The counters of devices #1 through #2 are both 0. One of the counters of devices #3 through #4 is 1. The counters of devices #9 through #16 are both 1. Devices #1 through #2 update X to 3. Devices #3 through #4 update X to 2. Devices #5 through #8 do not update X, and X = 1. Devices #9 through #16 do not update X, and X = 0.

[0256] 3) Round number = 3. The first device sends the first information to the second device for the third time. The first information does not include the first value. Second devices #1-#16 continue to generate counters. The counter of second device #1 is 0, the counter of second device #2 is 1, the counters of second devices #3-#4 are 2, the counters of second devices #5-#8 are 3, and the counters of second devices #9-#16 are 4. Second device #1 updates X to 4. Second device #2 does not update X, and X = 3. Second devices #3-#4 do not update X, and X = 2. Second devices #5-#8 do not update X, and X = 1. Second devices #9-#16 do not update X, and X = 0.

[0257] For the description of FIG6 , please refer to FIG7 .

[0258] Figure 7 is a schematic diagram of a binary tree 700 according to an embodiment of the present application. As shown in Figure 7 , in each round, the second devices are divided into two equal groups. Second devices #1 through #16 participate in the above process, and each time the first information includes a first value, where the first value = 2. In the first round, second devices #1 through #4 send access information to the first device, while second devices #5 through #16 do not. In the second round, second device #1 sends access information to the first device, while second devices #2 through #4 do not.

[0259] It should be noted that the content shown in FIG. 7 is described by taking M=16 as an example. Please also refer to FIG. 8 .

[0260] Figure 8 is a schematic diagram of a binary tree 800 according to an embodiment of the present application. As shown in Figure 8, second devices #1 through #M participate in the above process, with each first message including a first value, where the first value = 2. In the first round, M / 4 second devices send access information to the first device, while M / 4 second devices do not send access information to the first device. In the second round, M / 16 second devices send access information to the first device, while M / 16 second devices do not send access information to the first device. This continues in this order, until the log2Mth round, when one second device sends access information to the first device.

[0261] In summary, the second device can determine whether to send access information to the first device according to the value of counter, and update X=X+a, where a is the number of times the access information is sent as a result of executing the first rule.

[0262] From the above content, it can be seen that when the first value is carried in the first information, the number of times the first device sends the first information to the second device can be effectively reduced (compared with Figure 3 and Figure 6, the sending of the first information can be reduced once), which can effectively reduce the overall signaling overhead.

[0263] In one possible implementation, the second device can determine the corresponding LEVEL identifier based on the value of X. For example, using Table 10 as an example, for second device #1 and second device #2, the LEVEL identifier is 3; for second device #3 and second device #4, the LEVEL identifier is 2; for second devices #5 to #8, the LEVEL identifier is 1; and for second devices #9 to #16, the LEVEL identifier is 0. In this way, the first device can trigger the second device with the corresponding LEVEL identifier to initiate access.

[0264] It should be noted that, during subsequent access, the first device can specify a second device corresponding to a certain X value for access each time it initiates access. This is because, in the aforementioned process, the first device can estimate the number of second devices corresponding to a certain X value and then reasonably allocate the number of access resources. For example, the number of second devices corresponding to X=0 is 8, i.e., second devices #9-second devices #16. The first device can send a selection message carrying parameter Y, select second devices with X=Y for access, and allocate access resources based on the estimated number of second devices, such as allocating 8 access resources for access by second devices with X=0 (or LEVEL identifier=0).

[0265] The contents shown in Tables 9 to 13 are also applicable to grouping the second devices and are not described in detail herein.

[0266] In the above description, the first device may set a first value with a larger value, which may cause the first device to not receive the access information. Therefore, the information sent by the first device to the second device, including an indication that the access information has not been received, carries the first value. The first value can also be used to indicate the maximum number of times the first rule is executed. Please refer to the description of Figure 9.

[0267] FIG9 is a schematic diagram of a method principle 900 of an embodiment of the present application. As shown in FIG5 , with M=16, the second first information includes a first value with a larger value, and the third first information includes a first value with a smaller value:

[0268] Round number = 1: The first device sends the first information to the second devices #1 to #16 for the first time. The first device receives 8 access information.

[0269] Round number = 2: The first device sends a second first message to second devices #1-#16. This second first message includes N (using N = 5 as an example), where N indicates the maximum number of times the first rule can be executed. Second devices #1-#16 can determine whether to send access information based on the rules described in Figure 6. If no second device satisfies the counter = 0 condition N times, the first device fails to receive the access message. The first device does not receive the access message.

[0270] Round number=3: the first device sends the third first information to the second device #1-second device #16, the third first information includes information indicating that the access information has not been received, and the third first information includes the first value (taking H=2 as an example).

[0271] H=2 is used to indicate that N=5 is partially invalid (for example, the results of the first rule for the third, fourth, and fifth times are invalid). The second device #1-second device #16 can clear or reduce the value of the counter caused by N=5, for example, counter=5-3, or the second device #1-second device #16 can re-execute the first rule twice based on the first information. Correspondingly, the X value is also updated. The counter minus 3 corresponds to the X value being minus 3. If X=0, X remains unchanged at 0. The description of the second device executing the first rule twice can be found in rules (a)-(c) of Figure 6 and will not be repeated here. For ease of description, taking the counter minus 3 as an example, that is, the second device with counter=2 can send access information to the first device, and taking the second device #1-second device #2 sending access information to the first device as an example. Among them, the first device receives two access messages and determines that the access has failed.

[0272] Optionally, H=2 may be carried through additional information, which is not limited.

[0273] Round number = 4: The first device sends the fourth first message to second devices #1 through #16. The fourth first value does not include the first value. Second device #1 and first device #2 execute the first rule and, based on the result of the first rule, determine whether to send an access message to the first device. The first device receives one access message.

[0274] In summary, H = 2 can also be used to indicate the maximum number of times the first rule is executed (two times), and its meaning is somewhat different from N = 5. For example, H = 2 can be used to indicate that only two of the N = 5 times are valid. For example, the first and second times the first rule results are valid.

[0275] In the solutions shown in Figures 6 and 9, the values ​​of N and H can be flexibly adjusted and can be located in each message or in part of the message, without limitation. In this way, the first value carried in the first message can be flexibly adjusted.

[0276] It should be noted that the aforementioned N may be located in information indicating access failure, and the aforementioned H may be located in information indicating non-receipt of access information. For example, when some of the K first messages are information indicating access failure, one or more of the first messages in the portion may include the first value. The function of the first value can be described above. When the first device does not receive access information after sending information indicating access failure carrying the first value (e.g., N), the first device may send the next information indicating non-receipt of access information to the second device. The information indicating non-receipt of access information may carry the first value (e.g., H). The second device may determine whether to send access information based on the function of H=2.

[0277] S203: The first device sends second information to the second device, where the second information is used to indicate that at least one second device has successfully accessed.

[0278] In the above scheme, at least one of the K first messages sent by the first device to the second device includes the first value, which can be used to reduce the number of second devices that continue to send access information to the first device after receiving the first message carrying the first value. For example, the proportion of second devices that do not carry the first value and continue to send access information to the first device after receiving the first message is 50%, and the proportion of second devices that carry the first value and continue to send access information to the first device after receiving the first message carrying the first value can be 25% or 12.5%. This can effectively reduce the number of second devices that send access information to the first device, and thus effectively reduce the overall signaling overhead when the first device estimates the number of second devices.

[0279] In one possible implementation, before the first device sends the second information to the second device, the first device successfully decodes access information received after sending the first information for the Kth time.

[0280] In one possible implementation, the first device fails to decode K-1 access information received before sending the K-th first information.

[0281] In one possible implementation, method 200 may further include:

[0282] S204: Update the first parameter K times, where the first parameter is used to determine the number of access resources to be allocated, and the access resources are used to receive access information.

[0283] For example, the value change of the first parameter is related to the K-times first information. In other words, the K-times first information can cause the value of the first parameter to change. Please refer to Table 14. The content shown in Table 14 is only an example and is not a final limitation.

[0284] Table 14

[0285] As shown in Table 14, taking K=4 as an example, each first message does not include the first value. After the first device sends the first message for the first time, the value of the first parameter changes from 0 (taking the initial value of 0 as an example) to 1; after the first device sends the second first message, the value of the first parameter is 2; after the first device sends the third first message, the value of the first parameter is 3; after the first device sends the fourth first message, the value of the first parameter is 4. In this way, flexible adjustment of the first value carried in the first message can be supported.

[0286] Therefore, the “updating the first parameter K times” may include: updating the first parameter once each time the first information is sent, and updating the first information K times when the first information is sent K times.

[0287] Because at least one first information includes the first value, "updating the first parameter" may include: the first parameter corresponding to the Qth first information includes the first parameter corresponding to the Q-1th first information and the first value included in the Qth first information, as shown in Table 15. In this way, the first device can estimate the number of second devices or the number of access resources to be allocated by combining the first parameter and the first value. The content shown in Table 15 is for example only and is not intended to be definitive.

[0288] Table 15

[0289] As described in Table 15, taking K=4 as an example, the third first information includes the first value, which is 2. After the first device sends the first information for the first time, the value of the first parameter changes from 0 (taking the initial value of 0 as an example) to 1; after the first device sends the second first information, the value of the first parameter is 2; after the first device sends the third first information, the value of the first parameter is 2+2; and after the first device sends the fourth first information, the value of the first parameter is 5.

[0290] Optionally, the first device may send the first information after updating the first parameter, or may update the first parameter after sending the first information. In other words, each time the first device sends the first information, the first parameter needs to be updated, and the update of the first parameter is related to the first value. For example, each update of the first parameter is to add the first value to the current first parameter, or the update of the first parameter is related to the first value, such that if the first value changes, the size of the first parameter update also changes. In this way, the first device can combine the first parameter and the first value to estimate the number of second devices or the number of access resources to be allocated.

[0291] Optionally, the present application supports the estimation parameter of the first parameter that can be combined with the core network device input (or other L estimation algorithm), and can adjust the setting of the first value in the first information. The first device can provide the estimated value of the first parameter based on the binary tree estimation value and CN, and adjust the first parameter. For example, the core network device can send indication information to the first device, and the indication information is used to indicate some auxiliary parameters, such as the reference value of the number of second devices in the current area and / or the current time. Accordingly, the first device can update the setting of the first value or the first parameter based on the above-mentioned auxiliary parameters.

[0292] In summary, the first parameter can be used by the first device to determine the number of second devices or the number of access resources to be allocated. The update of the first parameter is related to the sending of the first information. For example, each time the first device sends the first information, the first device updates the first parameter once. If the first information is sent K times, the first parameter is updated K times. The first device can determine the number of second devices or the number of access resources to be allocated based on the first parameter after updating K times.

[0293] Optionally, the method 200 may further include:

[0294] S205: The first device determines the number of access resources to be allocated according to the first parameter corresponding to the K-th first information.

[0295] Taking Table 15 as an example, after sending the fourth first information, the first device successfully decodes the fourth received access information. The first device can determine the number of access resources to be allocated or the estimated number of second devices based on the first parameter corresponding to the fourth first information. For example, the number of access resources or the estimated number of second devices is: 2 5 (Can also be 3 5 , which is related to the probability of the second device sending access information each time it receives the first information. For example, if the second device has a 1 / p probability of sending access information each time it receives the first information, the number of access resources is p R , R is a first parameter, and p is a positive integer), so that the number of access resources or the number of second devices can be determined more accurately.

[0296] To sum up, the first device can set a first parameter, and the numerical change of the first parameter is related to the K-th first information. As the number of times the first device sends the first information increases, the corresponding number of received access information will show a decreasing trend. In this way, the first device can determine the access resources to be allocated based on the numerical value of the first parameter corresponding to the K-th first information.

[0297] In one possible implementation, the first device successfully decodes the access information received after sending the first information for the Kth time. In this way, the first device can more accurately determine the number of access resources to be allocated or the number of second devices based on the first parameter corresponding to the Kth first information.

[0298] In one possible implementation, before sending the Kth first information, the first device fails to decode the access information received K-1 times. In this way, the first device can more accurately determine the number of access resources to be allocated or the number of second devices based on the first parameter corresponding to the Kth first information.

[0299] In one possible implementation, the number of access resources to be allocated is related to the number of second devices. For example, if one access resource allows one second device to initiate access, the number of access resources is equal to the number of second devices. For another example, if one access resource allows two second devices to initiate access, the number of access resources is half the number of second devices. For another example, if one access resource allows four second devices to initiate access, the number of access resources is one-quarter the number of second devices. In this way, the first device can determine the number of second devices based on the number of access resources to be allocated.

[0300] In summary, the first device determining the access resources to be allocated can be used to determine an estimate of the number of second devices by the first device. In other words, the first device determines an estimate of the value of M. For ease of description, the following description uses the first device determining the number of access resources to be allocated as an example. For a description of the relationship between the number of access resources to be allocated and the estimate of the number of second devices, see Table 16.

[0301] Table 16

[0302] As shown in Table 16, the first parameter is 0 to 2, the number of access resources is 1 to 4, and the estimated number of the second device is 2; the first parameter is 1 to 3, the number of access resources is 2 to 8, and the estimated number of the second device is 4; the first parameter is 2 to 4, the number of access resources is 4 to 16, and the estimated number of the second device is 8; the first parameter is 3 to 5, the number of access resources is 8 to 32, and the estimated number of the second device is 16; the first parameter is 4 to 6, the number of access resources is 16 to 64, and the estimated number of the second device is 32; the first parameter is 5 to 7, the number of access resources is 32 to 128, and the estimated number of the second device is 64; the first parameter is R-1 to R+1, the number of access resources is 2 R-1 ~2 R+1 , the second estimated number of devices is 2 R . Wherein, R is used to represent the value of the first parameter.

[0303] After the first device determines the number of access resources to be allocated, the first device can determine the estimated number of second devices based on the relationship shown in Table 16, or, after the first device determines the estimated number of second devices, the first device can determine the number of access resources to be allocated based on the relationship shown in Table 16.

[0304] In one possible implementation, the first device can use a binary tree (or N-fork tree, where N is greater than 2 and is not limited to this) to determine an estimate of the number of second devices. Taking the first value equal to 1 as an example, as shown in FIG5 , after each of the M second devices receives the first message, each second device has a 50% probability of being assigned to the first subgroup, as described in S201 and S202 . The first subgroup is the left portion. Thus, after the first reception of the first message, M / 2 of the M second devices are assigned to the first subgroup. Second devices not in the first subgroup do not send access information. Similarly, after the nth reception of the first message, one second device enters the first subgroup, where n = log2M.

[0305] For example, taking FIG4 as an example, in the fourth round, there is a second device that can be identified by the first device, that is, n=4. The first device can determine the current number of second devices based on n==log2M. The estimated value M is 2 n =2 4 =16, or the number of access resources to be allocated is determined to be 16, that is, 16 access resources (such as the number of time slots) are allocated to the M second devices currently waiting to access.

[0306] It should be explained that the embodiment of the present application can be used to determine the estimated number of second devices or the number of access resources to be allocated, and can also be used to determine the range of the estimated number of second devices or the range of the number of access resources to be allocated, that is, the range of M or the range of the number of access resources to be allocated can be determined based on the first parameter. For example, when the first device identifies a second device when the first parameter is 4, it can be determined that the range of the estimated number of second devices is 2 4-1 to 2 4+1 Alternatively, the range of the number of access resources to be allocated is determined to be between 4-1 and 4+1, that is, 3 to 5.

[0307] In another possible implementation, the first device uses a binary tree method to determine an estimate of the number of second devices. For example, assuming the first value is 2, as shown in Figure 8 , after each of the M second devices receives the first message, there is a 25% probability that the second device will be assigned to the first subgroup. The principle is as described in S201 and S202 . The first subgroup is the left portion. Thus, after the first reception of the first message, M / 4 of the M second devices are assigned to the first subgroup. Second devices not in the first subgroup do not send access information. Similarly, after the nth reception of the first message, one second device enters the first subgroup, where n = log4M.

[0308] For example, taking FIG7 as an example, in the second round, there is a second device that can be identified by the first device, that is, n=2, then the first device can determine the current number of second devices M as 4 according to n==log4M. n =4 2 =16, or the number of access resources to be allocated is determined to be 16, that is, 16 access resources (such as the number of time slots) are allocated to the M second devices currently waiting to access. Compared with the previous implementation, the number of rounds required when the first value is equal to 2 is reduced compared to the number of rounds required when the first value is equal to 1, and the signaling overhead is reduced.

[0309] In another possible implementation, the first value sent each time may be different.

[0310] As shown in Figure 8, the first value carried in the first message sent by the first device for the first time is 2. After each of the M second devices receives the first message, there is a 25% probability that the second device will be assigned to the first subgroup. The principle is as described in S201 and S202. The first subgroup is the left portion. Thus, after the first reception of the first message, M / 4 of the M second devices are assigned to the first subgroup. Second devices not in the first subgroup do not send access information. Similarly, after the nth reception of the first message, one second device enters the first subgroup, where n = log4M.

[0311] For example, taking FIG7 as an example, in the second round, there is a second device that can be identified by the first device, that is, n=2, then the first device can determine the current number of second devices M as 4 according to n==log4M. n =4 2 =16, or the number of access resources to be allocated is determined to be 16, that is, 16 access resources (such as the number of time slots) are allocated to the M second devices currently waiting to access.

[0312] Another possible implementation method is that when the number of times the first device sends the first information reaches a second threshold, the first device determines an estimate of the number of second devices or determines the number of access resources to be allocated based on the corresponding first parameter. In this way, the number of times the first information is sent can be limited and the signaling overhead can be controlled.

[0313] Optionally, the method 200 may further include:

[0314] S206. The first device sends third information to the second device, where the third information is used to indicate the number of access resources to be allocated.

[0315] Correspondingly, the M second devices receive the third information and can determine the number of access resources to be allocated according to the third information.

[0316] After the first device determines the number of access resources to be allocated, the first device sends third information to the M second devices, where the third information is used to indicate the number of access resources to be allocated.

[0317] For example, the first device can estimate the number of second devices to be accessed / selected based on the first parameter, and then allocate a reasonable number of access resources. For example, if R (the first parameter) = 4, then allocate 2 R =2 4 =16 access resources.

[0318] For example, if the initial value of R is 1, and the final value of R is 5, then 2 is allocated. R-1 =16, the specific calculation result may be related to the initial value of R and the R update rule, and there is no restriction on this.

[0319] It should be noted that the initial value of R mentioned above can be 0, or other values ​​such as 1, and is not limited to this.

[0320] Furthermore, the first device and the M second devices may perform contention resolution based on an existing slotted / framed aloha or binary tree algorithm. For a detailed description, please refer to the prior art, which will not be described in detail.

[0321] It should be noted that existing theory demonstrates that the relationship between the number of allocated access resources and the number of second devices can affect access efficiency. When the number of allocated access resources is close to or equal to the number of second devices, access efficiency reaches its theoretical maximum. Therefore, the first device can determine or estimate the number of second devices using the aforementioned solution, thereby achieving higher access efficiency or resource utilization.

[0322] Optionally, the first device may further send fourth information to the M second devices. The fourth information is used to indicate selection of a second device in the first set. The selected second device may send access information or wait for an access opportunity to send access information. The fourth information includes a second parameter, and the second parameter is related to the value of X. For example, if the second parameter is 3, the fourth information is used to select the second device with X=3.

[0323] In one possible implementation, the third information and the fourth information can be combined. For example, the first device can estimate the number of second devices for any value of X. For example, in Table 8, the number of second devices when X = 0 is 8. Furthermore, the first device can determine the number of access resources indicated by the third information based on the number of second devices. The third and fourth information can be included in the same message, without limitation.

[0324] It should be noted that the aforementioned scheme is described as an example in which the first device can determine the number of access resources to be allocated based on the first parameter corresponding to the K-th first information after successfully decoding the received access information after sending the K-th first information. The embodiment of the present application also supports the scenario in which the first device can determine the number of access resources to be allocated based on the value of the first parameter corresponding to the K-th first information after failing to decode the received access information after sending the K-th first information. The two schemes are basically the same.

[0325] Optionally, the method 200 may further include:

[0326] S207: The first device sends T pieces of fourth information. Correspondingly, the second device receives part or all of the T pieces of fourth information.

[0327] Each fourth information corresponds to a random access opportunity, or in other words, each fourth information configures an access resource. T is a positive integer greater than N.

[0328] Optionally, the fourth information is used to trigger / indicate the next access opportunity, and can also be understood as indicating / associated with the boundary (start or end) of an access opportunity. For example, it can also be called (next) random access indication / trigger (message).

[0329] In one possible implementation, the first device sending T fourth information may include:

[0330] The first device first sends N pieces of fourth information, and then sends TN pieces of fourth information; or, the first device directly sends T pieces of fourth information.

[0331] For the first implementation, the first device sends T fourth information in two steps. For example, after the first device sends N fourth information, it sends TN additional fourth information.

[0332] Optionally, the first device may determine whether to send TN additional fourth information according to a core network instruction. For example, a core network element sends instruction information to the network device, which is used to instruct the first device to send TN additional fourth information after sending N fourth information.

[0333] For the second implementation manner, the first device sends T pieces of fourth information in one step. For example, the first device directly sends T pieces of fourth information.

[0334] By sending T pieces of fourth information, where T is greater than N, the probability of the second device successfully initiating access can be effectively increased. For example, if the channel environment between a second device and the first device is poor, the second device can receive at least two pieces of fourth information. For another example, if the channel environment between a second device and the first device is good, the second device can receive one piece of fourth information. This allows the second device to receive more fourth information, thereby increasing the probability of the second device successfully receiving the fourth information.

[0335] In summary, by sending an additional amount of fourth information, the probability of the second device receiving the fourth information can be improved, and thus the probability of the second device successfully initiating access can be improved.

[0336] In the embodiment of the present application, the value of T may be related to factors that affect the probability of the second device successfully receiving the fourth information. For example, the value of T may be related to the channel quality between the first device and the second device, or the block error rate (BLER), or SINR, or the bit error rate (BER), etc.

[0337] In the embodiments of the present application, the value of T may be specified by the protocol; or, the value of T may be a fixed value; or, the value of T may be related to N, such as T = fun2(N), or T = N*110%, where fun represents a mapping relationship or calculation formula between N and T; or, the value of T may be determined by the first device through self-configuration, which is not limited to this. In summary, the embodiments of the present application do not limit how the first device determines the value of T.

[0338] In one possible implementation, T is determined according to a bit error rate of a channel between the first device and the second device.

[0339] For example, the first device may measure the channel between it and each second device to obtain corresponding channel measurement information. Accordingly, the first device may obtain the channel measurement information between it and each second device and determine the bit error rate of the channel between it and each second device. Based on this information, the first device may determine the average bit error rate between the first device and the second devices.

[0340] In this way, the first device can determine the total number of access resources to be allocated based on the channel bit error rate between the first device and the second device. Thus, the first device can send T fourth information (more than M) to M second devices, which can effectively increase the probability of each second device initiating access.

[0341] Optionally, T is related to the number of second devices. For example, the first device may determine the number of second devices by estimation or prediction, or the first device may determine the number of second devices by interaction with a core network element, etc., which is not limited.

[0342] In one possible implementation, T is determined based on a channel bit error rate between the first device and the second device, including: a value of T is determined based on the channel bit error rate between the first device and the second device and a value of N.

[0343] For example, if the channel error rate between the first device and the second device is y, the first device can determine the value of T based on y and N. For example, T=N*(1+Y) 2 ; Another exemplary, T = N * (1 + Y) 3 etc.

[0344] When the first device determines the number of access resources actually allocated based on N and the channel error rate between the first device and the second device, this can ensure that the number of access resources actually allocated will not be excessive, or in other words, the overhead of access resources can be reduced while effectively increasing the probability that the second device can successfully initiate access.

[0345] In a possible implementation, the value of T satisfies the following relationship:

[0346] in, Indicates rounding up.

[0347] In this way, the first device can determine appropriate access resources to be allocated based on the channel error rate between the first device and the second device, thereby effectively reducing the overhead of access resources while increasing the probability of each second device successfully initiating access.

[0348] In the above solution, after the first device determines the number of access resources to be allocated based on the number of second devices, the number of signaling messages received by the second devices for triggering access resources may be inconsistent with the number of signaling messages sent by the first device for triggering access resources. This may result in some second devices being unable to initiate access. For example, due to low channel quality between the first and second devices, interference, or low received signal strength, this may prevent some second devices from being able to access.

[0349] For example, the first device determines that the number of second devices is 100. Based on this, the first device determines that the number of access resources to be allocated is approximately 100, with each second device corresponding to one access resource. The first device will send 100 signalings in sequence, each signaling will correspond to or trigger an access resource. For example, the second device selects the access resource corresponding to the 95th signaling to initiate access. However, due to channel transmission loss, the second device can only successfully receive 90 signalings (successful reception refers to successful cyclic redundancy check code (CRC) verification or decoding, etc.), and cannot trigger the selected access resource. As a result, some second devices may be unable to initiate access.

[0350] In view of this, an embodiment of the present application further provides a communication method that can effectively increase the probability of the second device successfully initiating access.

[0351] The communication method of the embodiment of the present application is described below in conjunction with Figure 10.

[0352] FIG10 is a schematic diagram of a communication method 1000 according to an embodiment of the present application. As shown in FIG10 , the method includes:

[0353] S1010. The first device sends third information.

[0354] The third information indicates the quantity of access resources.

[0355] Optionally, the third information is used to trigger / indicate at least one access opportunity, such as directly or indirectly indicating the total number of access opportunities, and may also be used to trigger the first access opportunity. For example, it may also be called an access round indication / trigger (message).

[0356] The description of S1010 may refer to the description of S206.

[0357] Optionally, the third information may also indicate the number of random access opportunities.

[0358] For example, the third information indicates that the number of random access opportunities is N, where N is a positive integer.

[0359] For example, the third information indicates a parameter W, and the second device determines the number of access opportunities N=fun(W) according to the parameter, where fun represents a mapping or calculation formula, such as N=2 W .

[0360] The value of N is determined based on the number of second devices, or in other words, is related to the number of second devices. For example, the value of N is greater than or equal to M. For a description of the value of N, refer to the description of how the first device determines the number of access resources.

[0361] S1020: The first device sends T pieces of fourth information. Correspondingly, the second device receives part or all of the T pieces of fourth information.

[0362] For the description of the fourth information, please refer to the description of the fourth information in Figure 2, which will not be repeated here.

[0363] It should be noted that the content shown in FIG. 10 can be combined with the content shown in FIG. 2 , or can be used alone as an embodiment, which is not limited to this.

[0364] Finally, the device embodiment of the embodiment of the present application is introduced.

[0365] To implement the various functions of the method provided herein, the first device and the second device may each include hardware structures and / or software modules, and implement the aforementioned functions in the form of hardware structures, software modules, or a combination of hardware structures and software modules. Whether a particular one of the aforementioned functions is implemented in the form of hardware structures, software modules, or a combination of hardware structures and software modules depends on the specific application and design constraints of the technical solution.

[0366] Figure 11 is a schematic block diagram of a communication device 1000 according to an embodiment of the present application. The communication device 1100 includes a processor 1110 and a communication interface 1120, which may be interconnected via a bus 1130. The communication device 1100 may be a first device or a second device.

[0367] Optionally, the communication device 1100 may further include a memory 1140. The memory 1140 includes, but is not limited to, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM), or portable read-only memory (CD-ROM), and is used for related instructions and data.

[0368] The processor 1110 may be one or more central processing units (CPUs). In the case where the processor 1010 is a CPU, the CPU may be a single-core CPU or a multi-core CPU.

[0369] When the communication apparatus 1100 is a first device, illustratively, the processor 1110 is configured to perform the following operations: sending first information K times; determining the number of access resources to be allocated according to a first parameter corresponding to the K-th first information, etc.

[0370] When the communication apparatus 1100 is a second device, illustratively, the processor 1110 is configured to perform the following operations: receive K times of first information; determine whether the information belongs to the first subgroup according to the first value, etc.

[0371] The above contents are described as examples only. The communication apparatus 1100 is a first device or a second device, which is responsible for executing the methods or steps related to the first device or the second device in the above method embodiments.

[0372] The above description is merely exemplary. For details, please refer to the contents of the above method embodiments. The implementation of each operation in FIG11 may also correspond to the corresponding description of the method embodiments shown in FIG2 to FIG10.

[0373] Figure 12 is a schematic block diagram of a communication device 1200 according to an embodiment of the present application. The communication device 1200 may be a first device or a second device, or a chip or module in the first device or the second device, for implementing the method according to the above embodiment.

[0374] Communication device 1200 includes a transceiver unit 1210 and a processing unit 1220. Transceiver unit 1210 may include a transmitting unit and a receiving unit. The transmitting unit is used to perform the transmitting operation of the communication device, and the receiving unit is used to perform the receiving operation of the communication device. For ease of description, this embodiment of the application combines the transmitting unit and the receiving unit into a single transceiver unit. This is described here as a unified description and will not be repeated later.

[0375] When the communication apparatus 1200 is a first device, illustratively, the transceiver unit 1210 is configured to transmit K first messages; the transceiver unit 1210 is configured to receive K access messages, etc. The processing unit 1220 is configured to execute the processing, coordination, and other steps of the first device. For example, the processing unit 1220 is configured to determine the number of access resources to be allocated based on the value of the first parameter corresponding to the K-th first message.

[0376] When the communication apparatus 1200 is a second device, illustratively, the transceiver unit 1210 is configured to receive K first messages. The processing unit 1220 is configured to execute the processing, coordination, and other steps of the second device. For example, the processing unit 1220 is configured to determine whether the first value belongs to the first subgroup based on the first value.

[0377] The above contents are described as examples only. The communication apparatus 1200 is a first device or a second device, which is responsible for executing the methods or steps related to the first device or the second device in the above method embodiments.

[0378] Optionally, the communication device 1200 further includes a storage unit 1230, which is used to store a program or code for executing the aforementioned method.

[0379] The device embodiments shown in Figures 11 and 12 are used to implement the contents described in Figures 2 to 10. The specific execution steps and methods of the devices shown in Figures 11 and 12 can refer to the contents described in the above method embodiments.

[0380] Figure 13 is a schematic block diagram of a communication device 1300 according to an embodiment of the present application. The communication device 1300 is used to implement the functions of the first device or the second device. The communication device 1300 may be a chip in the first device or the second device.

[0381] Communication device 1300 includes an input / output interface 1320 and a processor 1310. Input / output interface 1320 may be an input / output circuit. Processor 1310 may be a signal processor, a chip, or other integrated circuit capable of implementing the methods of the present application. Input / output interface 1320 is used for inputting or outputting signals or data.

[0382] For example, when communication apparatus 1300 is a first device, input / output interface 1320 is configured to send K first messages. Processor 1310 is configured to determine the number of access resources to be allocated based on the value of the first parameter corresponding to the K-th first message. Processor 1310 is further configured to execute some or all of the steps of any method provided herein.

[0383] For example, the communication device 1300 is a second device, and the input / output interface 1320 is configured to receive K times of the first information. The processor 1310 is configured to execute part or all of the steps of any method provided in this application.

[0384] In one possible implementation, the processor 1310 implements the functions of the network device or the terminal device by executing instructions stored in the memory.

[0385] Optionally, the communication device 1300 further includes a memory.

[0386] Optionally, the processor and memory are integrated together.

[0387] Optionally, the memory is outside the communication device 1300 .

[0388] In one possible implementation, the processor 1310 may be a logic circuit, which inputs / outputs messages or signals through the input / output interface 1320. The logic circuit may be a signal processor, a chip, or other integrated circuit that can implement the method of the embodiment of the present application.

[0389] The above description of the communication device 1300 is only used as an example. The communication device 1300 can be used to execute the method described in the above embodiments. For specific content, please refer to the description of the above method embodiments, which will not be repeated here.

[0390] FIG14 is a schematic block diagram of a communication device 1400 according to an embodiment of the present application. The communication device 1400 may be a first device or a chip. The communication device 1400 is configured to execute the operations performed by the first device in the method embodiments shown in FIG2-FIG10 above.

[0391] When the communication device 1400 is a first device, for example, a base station. Figure 14 shows a simplified schematic diagram of the base station structure. The base station includes a module 1410, a module 1420, and a module 1430. Module 1410 is mainly used for baseband processing, controlling the base station, etc.; module 1410 is usually the control center of the base station, which can usually be called a processor, and is used to control the base station to perform the processing operations on the network device side in the above method embodiment. Module 1420 is mainly used to store computer program code and data. Module 1430 is mainly used for receiving and transmitting radio frequency signals and converting radio frequency signals into baseband signals; module 1430 can usually be called a transceiver module, a transceiver, a transceiver circuit, or a transceiver, etc. The transceiver module of module 1430 can also be called a transceiver or a transceiver, etc., which includes an antenna 1433 and a radio frequency circuit (not shown in Figure 14), wherein the radio frequency circuit is mainly used for radio frequency processing.

[0392] Alternatively, the device for implementing the receiving function in module 1430 may be considered a receiver, and the device for implementing the transmitting function may be considered a transmitter, that is, module 1430 includes a receiver 1432 and a transmitter 1431. The receiver may also be referred to as a receiving module, a receiver, or a receiving circuit, and the transmitter may be referred to as a transmitting module, a transmitter, or a transmitting circuit.

[0393] Modules 1410 and 1420 may include one or more boards, each of which may include one or more processors and one or more memories. The processor is used to read and execute programs in the memory to implement baseband processing functions and control the base station. If multiple boards are present, the boards may be interconnected to enhance processing capabilities. As an optional implementation, multiple boards may share one or more processors, multiple boards may share one or more memories, or multiple boards may simultaneously share one or more processors.

[0394] For example, in one implementation, the transceiver module of module 1430 is used to execute the transceiver-related processes performed by the first device in the embodiments shown in Figures 2 to 10. The processor of module 1410 is used to execute the processing-related processes performed by the first device in the embodiments shown in Figures 2 to 10.

[0395] FIG14 is merely an example and not a limitation. The first device including the processor, memory, and transceiver may not depend on the structures shown in FIG11 to FIG13 .

[0396] When communication device 1400 is a chip, the chip includes a transceiver, memory, and a processor. The transceiver can be an input / output circuit or a communication interface; the processor can be a processor, microprocessor, or integrated circuit integrated on the chip. In the above method embodiments, the sending operation of the first device can be understood as an output of the chip, and the receiving operation of the first device in the above method embodiments can be understood as an input of the chip.

[0397] Figure 15 is a schematic block diagram of a communication device 1500 according to an embodiment of the present application. The communication device 1500 may be a second device, a processor or a chip of the second device. The communication device 1500 may be used to execute the operations performed by the second device in the above method embodiment.

[0398] When communication device 1500 is a second device (e.g., a terminal device), FIG15 shows a simplified schematic diagram of the terminal device structure. As shown in FIG15 , the terminal device includes a processor, a memory, and a transceiver. The memory can store computer program code, and the transceiver includes a transmitter 1531, a receiver 1532, a radio frequency circuit (not shown in FIG15 ), an antenna 1533, and an input / output device (not shown in FIG15 ).

[0399] The processor is primarily used to process communication protocols and communication data, control terminal devices, execute software programs, and process software program data. Memory is primarily used to store software programs and data. Radio frequency circuits are primarily used to convert baseband signals into radio frequency signals and process radio frequency signals. Antennas are primarily used to transmit and receive radio frequency signals in the form of electromagnetic waves. Input / output devices. For example, touch screens, displays, and keyboards are primarily used to receive user input and output data to the user. It should be noted that some types of terminal devices may not have input / output devices.

[0400] When data needs to be sent, the processor performs baseband processing on the data to be transmitted and outputs the baseband signal to the RF circuit. The RF circuit then performs RF processing on the baseband signal and transmits it via the antenna in the form of electromagnetic waves. When data is sent to a terminal device, the RF circuit receives the RF signal via the antenna, converts it into a baseband signal, and outputs the baseband signal to the processor, which converts the baseband signal into data and processes it.

[0401] For ease of explanation, Figure 15 shows only one memory, processor, and transceiver. In actual terminal equipment products, one or more processors and one or more memories may exist. Memory may also be referred to as a storage medium or storage device. The memory may be independent of the processor or integrated with the processor, and this is not limited in this embodiment of the present application.

[0402] In the embodiment of the present application, the antenna and radio frequency circuit with transceiver functions can be regarded as the transceiver module of the terminal device, and the processor with processing function can be regarded as the processing module of the terminal device.

[0403] As shown in Figure 15, the terminal device includes a processor 1510, a memory 1520, and a transceiver 1530. The processor 1510 can be called a processing unit, a processing board, a processing module, a processing device, etc., and the transceiver 1530 can also be called a transceiver unit, a transceiver, a transceiver device, etc.

[0404] Alternatively, the device implementing the receiving function in transceiver 1530 may be considered a receiving module, and the device implementing the transmitting function in transceiver 1530 may be considered a transmitting module. That is, transceiver 1530 includes a receiver and a transmitter. A transceiver may also be sometimes referred to as a transceiver, a transceiver module, or a transceiver circuit. A receiver may also be sometimes referred to as a receiver, a receiving module, or a receiving circuit. A transmitter may also be sometimes referred to as a transmitter, a transmitting module, or a transmitting circuit.

[0405] For example, in one implementation, the processor 1510 is used to execute the processing actions of the second device in the embodiments shown in Figures 2-10, and the transceiver 1530 is used to execute the transceiver actions of the second device in Figures 2-10.

[0406] FIG15 is merely an example and not a limitation. The terminal device including the transceiver module and the processing module may not rely on the structures shown in FIG10 to FIG12 .

[0407] When the communication device 1500 is a chip, the chip includes a processor, a memory, and a transceiver. The transceiver can be an input / output circuit or a communication interface; the processor can be a processing module, a microprocessor, or an integrated circuit integrated on the chip.

[0408] The sending operation of the second device in the above method embodiment can be understood as the output of the chip, and the receiving operation of the second device in the above method embodiment can be understood as the input of the chip.

[0409] The present application also provides a chip, including a processor, for calling and executing instructions stored in a memory from the memory, so that a communication device equipped with the chip executes the methods in the above examples.

[0410] The present application also provides another chip, comprising: an input interface, an output interface, and a processor, wherein the input interface, the output interface, and the processor are connected via an internal connection path, and the processor is configured to execute code in a memory. When the code is executed, the processor is configured to execute the methods in the above examples. Optionally, the chip also includes a memory, which is configured to store computer programs or code.

[0411] The present application also provides a processor for coupling with a memory, and for executing the methods and functions involving a network device or a terminal device in any of the above embodiments.

[0412] In another embodiment of the present application, a computer program product including instructions is provided. When the computer program product is run on a computer, the method of the above embodiment is implemented.

[0413] The present application also provides a computer program. When the computer program is executed in a computer, the method of the aforementioned embodiment is implemented.

[0414] In another embodiment of the present application, a computer-readable storage medium is provided, which stores a computer program. When the computer program is executed by a computer, the method described in the above embodiment is implemented.

[0415] Those skilled in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0416] Those skilled in the art will clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.

[0417] In the several embodiments provided in this application, the disclosed systems, devices, and methods can be implemented in other ways. For example, the device embodiments described above are merely schematic. For example, the division of units is merely a logical function division. In actual implementation, there may be other division methods, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of devices or units, which can be electrical, mechanical or other forms.

[0418] Units described as separate components may or may not be physically separate, and components shown as units may or may not be physical units, that is, they may be located in one place or distributed across multiple network units. Some or all of these units may be selected to achieve the purpose of this embodiment according to actual needs.

[0419] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

[0420] If the function is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the embodiment of the present application, or the part that contributes to the prior art, or the part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions for enabling a computer device (which can be a personal computer, server, or network device, etc.) to execute all or part of the steps of the various embodiments of the present application. The aforementioned storage medium includes various media that can store program codes, such as a USB flash drive, a mobile hard disk, a ROM, a RAM, a magnetic disk, or an optical disk.

[0421] The above is only a specific implementation of the embodiment of the present application, but the scope of protection of the embodiment of the present application is not limited to this. Any person skilled in the art can easily think of changes or substitutions within the technical scope disclosed in the embodiment of the present application, and they should be included in the scope of protection of the embodiment of the present application. Therefore, the scope of protection of the embodiment of the present application should be based on the scope of protection of the claims.

Claims

1. A communication method, characterized in that: Applied to the first device side, including: Sending first information K times, where the first information is used to instruct a second device to send access information, where at least one of the K times of first information includes a first value, where the at least one time of first information includes the Qth time of first information, where the first value included in the Qth time of first information is used to instruct the second device in a first subgroup in a first group to send the access information, where the second device in the first group is a device that sends the access information for the Q-1th time, where Q and K are positive integers, and Q is less than or equal to K; Sending second information, where the second information is used to indicate that at least one of the second devices has successfully accessed.

2. The method according to claim 1, characterized in that The method further comprises: A first parameter is updated K times, where the first parameter is used to determine the number of access resources to be allocated, and the access resources are used to receive the access information.

3. The method according to claim 2, characterized in that The updating of the first parameter K times comprises: The first parameter corresponding to the Q-th first information includes the first parameter corresponding to the Q-1-th first information and the first value included in the Q-th first information.

4. The method according to claim 2 or 3, characterized in that: The method further comprises: Determine the number of access resources to be allocated according to the first parameter corresponding to the K-th first information.

5. The method according to any one of claims 1 to 4, characterized in that The method further comprises: The access information received after the first information is sent for the Kth time is successfully decoded.

6. The method according to any one of claims 1 to 5, characterized in that The method further comprises: Before sending the first information for the Kth time, decoding of the access information received for the K-1th time fails.

7. The method according to any one of claims 1 to 6, characterized in that The first information includes: Information indicating access failure, or information indicating that the access information has not been received.

8. The method according to any one of claims 3 to 7, characterized in that The method further comprises: Sending third information, where the third information is used to indicate the quantity of the access resources to be allocated.

9. The method according to any one of claims 1 to 8, characterized in that The method further comprises: After sending the first information for the Ith time and before sending the first information for the (I+1th) time, at least one access information is received, where I is a positive integer less than or equal to K-1.

10. The method according to any one of claims 1 to 9, characterized in that The at least one first information also includes the Pth first information, the first value included in the Pth first information is different from the first value included in the Qth first information, P is not equal to Q, and P is a positive integer less than or equal to K.

11. The method according to any one of claims 1 to 10, characterized in that A ratio between the number of the second devices in the first subgroup and the number of the second devices in the first group is related to a first value included in the Q-th first information.

12. The method according to any one of claims 1 to 11, characterized in that The first value is a positive integer greater than or equal to 2.

13. The method according to any one of claims 1 to 12, characterized in that The second device is a device that can be paged by the first device.

14. The method according to any one of claims 2 to 13, characterized in that The number of the access resources to be allocated is related to the number of the second devices.

15. The method according to any one of claims 8 to 14, characterized in that The method further comprises: T fourth information are sent, each fourth information configures one access resource, T is greater than N, and N is the number of access resources to be allocated.

16. The method according to claim 15, characterized in that The T is determined according to a channel bit error rate between the first device and the second device.

17. The method according to claim 16, characterized in that The T is determined according to a channel bit error rate between the first device and the second device, including: The value of T is determined according to the channel bit error rate between the first device and the second device and the value of N, and the number of access resources to be allocated is N.

18. The method according to any one of claims 15 to 17, characterized in that The value of T satisfies the following: y is the channel bit error rate between the first device and the second device, Indicates rounding up.

19. A communication method, characterized in that: Applied to the second device side, including: receiving K times of first information, where the first information is used to indicate sending access information, where at least one of the K times of first information includes a first value, where the at least one time of first information includes a Q-th time of the first information, where the first value included in the Q-th time of first information is used to indicate that a second device in a first subgroup in a first group sends the access information, where the second device in the first group is a device that sends the access information for the Q-1th time, where Q and K are positive integers, and Q is less than or equal to K; The access information is sent K times.

20. The method according to claim 19, characterized in that The sending K times of the access information comprises: Determine, according to a first value included in the Q-th first information, that it belongs to the first subgroup; Send the access information for the Qth time.

21. The method according to claim 19 or 20, characterized in that The method further comprises: Second information is received, where the second information is used to indicate that at least one of the second devices has successfully accessed.

22. The method according to any one of claims 19 to 21, characterized in that The first information includes: Information indicating access failure, or information indicating that the access information has not been received.

23. The method according to any one of claims 19 to 22, characterized in that The method further comprises: Receive third information, where the third information is used to indicate the amount of access resources to be allocated, and the access resources are used to send the access information.

24. The method according to any one of claims 19 to 23, characterized in that The at least one first information also includes the Pth first information, the first value included in the Pth first information is different from the first value included in the Qth first information, P is not equal to Q, and P is a positive integer less than or equal to K.

25. The method according to any one of claims 19 to 24, characterized in that A ratio between the number of the second devices in the first subgroup and the number of the second devices in the first group is related to a first value included in the Q-th first information.

26. The method according to any one of claims 19 to 25, characterized in that The first value is a positive integer greater than or equal to 2.

27. The method according to any one of claims 19 to 26, characterized in that The second device is a device that can be paged by the first device.

28. The method according to any one of claims 23 to 27, characterized in that The number of the access resources to be allocated is related to the number of the second devices.

29. The method according to any one of claims 23 to 28, characterized in that The method further comprises: Receive part or all of T fourth information, one fourth information configures one access resource, T is greater than N, and N is the number of access resources to be allocated.

30. The method according to claim 29, characterized in that The T is determined according to a channel bit error rate between the first device and the second device.

31. The method according to claim 30, characterized in that The T is determined according to a channel bit error rate between the first device and the second device, including: The value of T is determined according to the channel bit error rate between the first device and the second device and the value of N, and the number of access resources to be allocated is N.

32. The method according to any one of claims 29 to 31, characterized in that The value of T satisfies the following: y is the channel bit error rate between the first device and the second device, Indicates rounding up.

33. A communication device, characterized in that: comprising a processor configured to, by executing a computer program or instructions, or, by means of a logic circuit, causing the communication device to perform the method according to any one of claims 1 to 18; or, The communication device is caused to execute the method according to any one of claims 19 to 32.

34. The communication device according to claim 33, characterized in that: The communication device further comprises a memory for storing the computer program or instructions.

35. The communication device according to claim 33 or 34, characterized in that: The communication device further comprises a communication interface, and the communication interface is used for inputting and / or outputting signals.

36. A communication device, characterized in that: It includes a logic circuit and an input / output interface, wherein the input / output interface is used to input and / or output signals. The logic circuit is used to execute the method according to any one of claims 1 to 18; or, The logic circuit is configured to execute the method according to any one of claims 19 to 32.

37. A computer-readable storage medium, characterized in that: The computer readable storage medium stores a computer program or instruction. When the computer program or instruction is executed on a computer, so that the method of any one of claims 1 to 18 is performed; or, The method according to any one of claims 19 to 32 is performed.

38. A computer program product, characterized in that Contains instructions that, when executed on a computer, so that the method of any one of claims 1 to 18 is performed; or, The method according to any one of claims 19 to 32 is performed.

Images