WO2022193285A1 - 通信方法和通信装置 - Google Patents

通信方法和通信装置 Download PDF

Info

Publication number
WO2022193285A1
WO2022193285A1 PCT/CN2021/081794 CN2021081794W WO2022193285A1 WO 2022193285 A1 WO2022193285 A1 WO 2022193285A1 CN 2021081794 W CN2021081794 W CN 2021081794W WO 2022193285 A1 WO2022193285 A1 WO 2022193285A1
Authority
WO
WIPO (PCT)
Prior art keywords
positive integer
sending
broadcast information
communication
offset
Prior art date
Application number
PCT/CN2021/081794
Other languages
English (en)
French (fr)
Inventor
高磊
程型清
Original Assignee
华为技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Priority to PCT/CN2021/081794 priority Critical patent/WO2022193285A1/zh
Priority to CN202180003288.6A priority patent/CN113841431B/zh
Publication of WO2022193285A1 publication Critical patent/WO2022193285A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/06—Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/30—Services specially adapted for particular environments, situations or purposes
    • H04W4/40—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/70—Services for machine-to-machine communication [M2M] or machine type communication [MTC]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W76/00—Connection management
    • H04W76/10—Connection setup
    • H04W76/14—Direct-mode setup
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W8/00—Network data management
    • H04W8/005—Discovery of network devices, e.g. terminals
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Definitions

  • the present application relates to the field of communication, in particular to the field of short-distance communication, and in particular to a communication method and a communication device.
  • devices can discover, establish connection, or transmit data between devices by sending broadcast information and scanning broadcast channels.
  • the master node can continuously scan (listen) the broadcast information on the broadcast channel, so as to ensure that the master node receives the broadcast information sent by the slave node.
  • the master node when the master node is busy, the master node cannot continuously scan the broadcast channel, which may cause the master node to fail to receive the broadcast information sent by the slave node for a long time.
  • the present application provides a communication method and a communication device, which can improve the transmission performance of broadcast information.
  • a communication method is provided.
  • the method may be performed by a slave node, such as a mobile terminal, a wearable device, or a vehicle-mounted device; or, the method may also be performed by a chip or an integrated circuit configured in the slave node, which is not limited in this application.
  • the method includes: acquiring a transmission cycle duration T; and transmitting broadcast information at a first time t n , where n is a positive integer.
  • H is the time length unit
  • M 1 is a non-negative integer less than N
  • N is a positive integer
  • An is the offset parameter corresponding to the nth transmission period, and is a positive integer, P>M 1 , mod() means taking the remainder
  • Mn +1 is the offset information of the n+1th transmission cycle.
  • a communication method is provided.
  • the method may be executed by a master node, such as a mobile terminal, a wearable device, or a vehicle-mounted device; or, the method may also be executed by a chip or an integrated circuit configured in the master node, which is not limited in this application.
  • the method includes: determining a scan window; and scanning broadcast information in the scan window.
  • the time length of the scan window is H
  • the time difference between the start times of two consecutive scan windows is Q*H
  • H is the unit of time length
  • Q is a positive integer
  • Q is a submultiple of the broadcast parameter P.
  • H may be specified by the protocol or pre-configured
  • N may be specified by the protocol, pre-configured, or selected by the node from a set of optional parameters specified by the protocol or pre-configured
  • T may be specified by the node according to the N and H are determined.
  • M 1 is a non-negative integer less than N.
  • M1 may be randomly generated from the node, protocol - specified, pre-configured, or selected by the node from a protocol-specified or pre-configured set of optional parameters.
  • P is a divisor of N, P>M 1 , P may be predefined or configured, the predefined may be a protocol specification, and the configuration may refer to pre-configured.
  • Q may be protocol-specified, pre-configured, or selected by the master node from a protocol-specified or pre-configured set of optional parameters.
  • the broadcast information can be used to broadcast data, and can also be used to discover or establish connections between nodes.
  • the master node scans the broadcast information in the scan window, it can be understood that the master node attempts to receive the broadcast information within the scan window, and determines whether there is broadcast information sent starting from the moment in the scan window.
  • the communication method provided by this application clarifies the time when the slave node sends broadcast information and how the master node scans the broadcast information. Based on the solution provided by this application, the broadcast information is sent and scanned, and the start time when the slave node sends the broadcast information in each sending cycle. Generally different, this can improve the transmission performance of broadcast information, which is beneficial for the master node to receive the broadcast information sent by the slave node within a certain period of time.
  • different slave nodes can select different offset parameters and start times of the sending period, and different slave nodes can select different M 1 , which can reduce the probability of continuous collision of broadcast information of multiple slave nodes.
  • the scanning for broadcast information in the current scan window includes: starting to receive a piece of broadcast information sent by a slave node at the first time t n , where n is a positive integer.
  • M 1 is a non-negative integer less than N
  • N is a positive integer
  • a n is the offset parameter corresponding to the nth transmission period, and is a positive integer
  • mod() means Taking the remainder, Mn +1 is the offset information of the
  • the values of the offset parameters corresponding to W consecutive sending periods are the same, and W ⁇ P.
  • the values of the offset parameters corresponding to the W consecutive sending periods are random numbers or are generated according to a random parameter.
  • the values of the offset parameters corresponding to W consecutive sending periods of different slave nodes can be different random numbers or generated according to different random parameters, which is beneficial to reduce the transmission of broadcast information by different slave nodes. probability of collision.
  • the value of the offset parameter corresponding to the consecutive W consecutive sending cycles before or after the W consecutive sending cycles is a random number or is generated according to a random parameter. of.
  • the values of the offset parameters corresponding to at least two or any two consecutive W transmission periods may be different random numbers or generated according to different random parameters.
  • the values of the offset parameters corresponding to the two consecutive W sending cycles of the slave node may be different random numbers or generated according to different random parameters, it is possible to reduce the number of different slave nodes in multiple
  • the probability that the values of the offset parameters corresponding to consecutive W sending periods are all the same can reduce the probability of continuous collision of broadcast information sent by different slave nodes. For example, if the values of A n to A n+w-1 of two slave nodes are the same, it may cause the broadcast information sent by the two slave nodes in the nth to n+w-1th transmission cycle to collide.
  • the consecutive W corresponding to the sending periods are selected from a set whose number of elements is less than or equal to P.
  • the offset parameter when the offset parameter is selected from a set whose number of elements is greater than P, at least two elements in the set have the same value as the remainder of P. Then, when two slave nodes respectively select the above two offset parameters whose remainder to P is the same value, although the selected offset parameters are different, the broadcast information sent by the two slave nodes may continue to collide.
  • the offset parameter is selected from a set whose number of elements is less than or equal to P, if the values obtained by taking the remainder of P for any two elements in the set are different, the two slave nodes select different offset parameters. , so as to avoid continuous collision of the broadcast information sent.
  • the value of the offset parameter corresponding to the consecutive W consecutive sending cycles before or after the W consecutive sending cycles is equal to or less than the number of the elements. selected from the set of P.
  • the values of the offset parameters corresponding to at least two or any two consecutive W transmission periods may be different elements in the set.
  • the values of the offset parameters corresponding to the two consecutive W sending cycles of the slave node may be different elements in the set, it can reduce the number of consecutive W sending cycles of different slave nodes.
  • the values of the corresponding offset parameters all have the same probability, so that the probability of continuous collision of broadcast information sent by different slave nodes can be reduced.
  • P is a divisor of W.
  • the broadcast information sent by multiple slave nodes does not collide, it is beneficial to ensure that there are at least W/P broadcast information among the W broadcast information sent by the slave nodes in consecutive W transmission cycles. If the sending start time is within the scanning window of the master node, then at least W/P broadcast messages are scanned by the master node.
  • An is a prime number.
  • the corresponding M n +1 of different slave nodes may be different, so that the starting time of different slave nodes sending broadcast information in the same transmission cycle may be different. Therefore, there are It is beneficial to reduce the probability of collision of broadcast information sent by different slave nodes.
  • a communication device configured to execute the method provided in the first aspect.
  • the communication apparatus may include a module for performing the method provided by the first aspect.
  • a communication device configured to execute the method provided in the second aspect.
  • the communication apparatus may include a module for performing the method provided by the second aspect.
  • a communication apparatus including at least one processor.
  • the at least one processor is coupled to at least one memory and is operable to execute instructions in the memory to implement the method of the first aspect or any of the possible implementations of the first aspect.
  • the communication device further includes at least one memory.
  • the communication device further includes a communication interface to which the at least one processor is coupled, the communication interface being used for inputting and/or outputting information.
  • the information includes at least one of instructions and data.
  • the communication device is a slave node, such as a mobile terminal.
  • the communication interface may be a transceiver, or an input/output interface.
  • the communication device is a chip or a system of chips.
  • the communication interface may be an input/output interface, and may be an input/output interface, an interface circuit, an output circuit, an input circuit, a pin or a related circuit on the chip or a chip system, etc.
  • the processor may also be embodied as a processing circuit or a logic circuit.
  • the communication device is a chip or a chip system configured in the slave node.
  • the transceiver may be a transceiver circuit.
  • the input/output interface may be an input/output circuit.
  • a communication apparatus including at least one processor.
  • the at least one processor is coupled to a memory and can be used to execute instructions in the memory to implement the method of the second aspect or any of the possible implementations of the second aspect.
  • the communication device further includes at least one memory.
  • the communication device further includes a communication interface to which the at least one processor is coupled, the communication interface being used for inputting and/or outputting information.
  • the communication device is a master node, such as a mobile terminal.
  • the communication interface may be a transceiver, or an input/output interface.
  • the communication device is a chip or a system of chips.
  • the communication interface may be an input/output interface, an interface circuit, an output circuit, an input circuit, a pin or a related circuit on the chip or a chip system.
  • the processor may also be embodied as a processing circuit or a logic circuit.
  • the communication device is a chip or a chip system configured in the master node.
  • the transceiver may be a transceiver circuit.
  • the input/output interface may be an input/output circuit.
  • a chip including: at least one processor and a communication interface.
  • the communication interface is used for receiving signals input to the chip or for outputting signals from the chip, and the processor communicates with the communication interface and implements the first aspect or the first aspect above through a logic circuit or executing code instructions.
  • the method in any one of the possible implementations of one aspect, or for implementing the second aspect or the method in any of the possible implementations of the second aspect.
  • a communication device comprising: at least one memory for storing computer instructions; at least one processor for executing the computer instructions stored in the at least one memory, so that the communication device executes the above-mentioned first In one aspect or the method in any possible implementation manner of the first aspect, or the communication device is caused to perform the method in the above-mentioned second aspect or any possible implementation manner of the second aspect.
  • a computer-readable storage medium on which a computer program is stored, and when the computer program is executed by a communication apparatus, the communication apparatus enables the communication apparatus to realize the first aspect or any possible implementation manner of the first aspect method in .
  • a tenth aspect provides a computer-readable storage medium on which a computer program is stored, and when the computer program is executed by a communication device, enables the communication device to realize the second aspect or any possible implementation manner of the second aspect method in .
  • a computer program product comprising: a computer program (also referred to as code, or instructions), which, when the computer program is executed, causes a computer to execute the above-mentioned first aspect or the first aspect method in any of the possible implementations.
  • a computer program also referred to as code, or instructions
  • a twelfth aspect provides a computer program product, the computer program product comprising: a computer program (also referred to as code, or instructions), when the computer program is executed, causes the computer to execute the above-mentioned second aspect or the second aspect method in any of the possible implementations.
  • a computer program also referred to as code, or instructions
  • a thirteenth aspect provides a terminal device, including the communication apparatus of the third aspect or the fourth aspect.
  • the terminal device may be a vehicle.
  • a fourteenth aspect provides a communication system including the aforementioned slave node and master node.
  • FIG. 1 is a schematic diagram of a communication system applicable to an embodiment of the present application
  • FIG. 2 is a schematic diagram of an application scenario applicable to an embodiment of the present application
  • FIG. 3 is a schematic flowchart of a communication method provided by the present application.
  • Fig. 4 is a schematic diagram of sending and scanning broadcast information provided by the application.
  • FIG. 5 is another schematic diagram of sending and scanning broadcast information provided by the present application.
  • FIG. 6 is a schematic block diagram of a communication device provided by the present application.
  • FIG. 7 is a schematic block diagram of another communication apparatus provided by the present application.
  • the technical solutions of the embodiments of the present application can be applied to various communication systems, for example, fifth generation (5th generation, 5G) systems or new radio (NR), long term evolution (LTE) systems, LTE frequency Frequency division duplex (FDD) system, LTE time division duplex (TDD), universal mobile telecommunication system (UMTS), short-distance communication system, etc.
  • the technical solutions of the embodiments of the present application can also be applied to device to device (device to device, D2D) communication, machine to machine (machine to machine, M2M) communication, machine type communication (machine type communication, MTC), and car networking systems communication in.
  • the communication methods in the Internet of Vehicles system are collectively referred to as V2X (X stands for anything).
  • the V2X communication includes: vehicle-to-vehicle (V2V) communication, vehicle-to-infrastructure (V2I) communication ) communication, vehicle-to-pedestrian (V2P) or vehicle-to-network (V2N) communication, etc.
  • V2V vehicle-to-vehicle
  • V2I vehicle-to-infrastructure
  • V2P vehicle-to-pedestrian
  • V2N vehicle-to-network
  • the network device may be an evolved node B (evolved node B, eNB), a radio network controller (radio network controller, RNC), a node B (node B, NB), a base station controller (base station controller, BSC) ), base transceiver station (base transceiver station, BTS), home base station (for example, home evolved nodeB, or home node B, HNB), baseband unit (baseband unit, BBU), wireless fidelity (wireless fidelity, WIFI) system
  • the access point (AP), wireless relay node, wireless backhaul node, transmission point (TP) or transmission and reception point (TRP), etc. can also be 5G, such as, NR, gNB in the system, or, transmission point (TRP or TP), one or a group (including multiple antenna panels) antenna panels of a base station in a 5G system, or, it can also be a network node that constitutes a gNB or transmission point , such as baseband unit (BBU
  • terminal equipment may also be referred to as user equipment (UE), access terminal, subscriber unit, subscriber station, mobile station, mobile station, remote station, remote terminal, mobile device, user terminal, terminal, wireless Communication equipment, user agent or user equipment.
  • the terminal device in the embodiments of the present application may be a vehicle, a vehicle-mounted device, a non-vehicle device, a handheld terminal (such as a mobile phone or a car key, etc.), a tablet computer (Pad), a computer with wireless Wearable devices (such as virtual reality (VR) terminal devices, augmented reality (AR) terminal devices or headsets, etc.), wireless terminals in industrial control, in self driving wireless terminal in remote medical, wireless terminal in smart grid, wireless terminal in transportation safety, wireless terminal in smart city, smart home (smart home) wireless terminals (eg, smart home) and so on.
  • VR virtual reality
  • AR augmented reality
  • the terminal device may be any type of terminal. Further, the terminal device may be an existing terminal device (eg, a slave node) with a short-range communication function that may appear in the future, for example, a terminal device with a Bluetooth or WiFi communication function.
  • an existing terminal device eg, a slave node
  • a short-range communication function that may appear in the future, for example, a terminal device with a Bluetooth or WiFi communication function.
  • FIG. 1 shows a schematic diagram of a wireless communication system suitable for this embodiment of the present application.
  • the communication system 100 includes a master node 110 and at least one slave node (eg, slave nodes 120 to 160 shown in FIG. 1 ).
  • Master nodes and slave nodes are two types of nodes that are logically functionally differentiated.
  • the master node manages the slave nodes, has the function of allocating resources in the communication domain, and is responsible for allocating resources to the slave nodes; the slave nodes obey the scheduling of the master node and use the resources allocated by the master node to communicate with the master node.
  • the above-mentioned master node and slave node are located in the communication domain.
  • a communication domain is formed by a group of communication nodes having a communication relationship and communication links between the communication nodes.
  • a device or device may be in multiple communication domains. For example, when the mobile phone and the headset communicate wirelessly, the mobile phone is in the communication domain a including the mobile phone and the headset, the mobile phone is the master node in the communication domain a, and the headset is the slave node; then when the mobile phone detects the cockpit domain controller (cockpit domain controller) domain controller, CDC), and after establishing a wireless connection with the CDC, the mobile phone is also in the communication domain b including the mobile phone and the CDC.
  • the CDC is the master node
  • the mobile phone is the slave node
  • the mobile phone listens to the CDC. schedule.
  • the communication domain b may also include other slave nodes, such as a car speaker, a microphone, and the like.
  • the slave node sends broadcast information
  • the master node can scan the broadcast information.
  • the master node may also be referred to as a receiving device, a first device, or a G node, and the like
  • a slave node may also be referred to as a sending device, a second device, or a T node, or the like.
  • the master node may be a network device, and the slave node may be a terminal device.
  • both the master node and the slave node may be terminal devices.
  • the master node is a mobile phone
  • the slave node is a vehicle, a headset, a car key, or an in-vehicle device.
  • the embodiments of the present application do not limit application scenarios, nor do they limit the types of master nodes and slave nodes. Both the master node and the slave node in Fig. 1 take terminal equipment as an example.
  • the communication system 100 may be a short-range communication system, for example, both the master node and the slave node have a short-range communication function, but this is not limited in this application.
  • FIG. 2 is an example of an in-vehicle wireless communication scenario applicable to the embodiment of the present application.
  • the communication system 100 shown in FIG. 1 may be any communication domain shown in FIG. 2 , and it should be understood that the communication method in this embodiment of the present application is not limited to the in-vehicle communication scenario shown in FIG. 2 .
  • the first communication domain includes a first device and at least one third device.
  • the first device may be a master node
  • the third device may be a slave node.
  • the first device may be a mobile phone
  • the third device may be a wearable device such as a headset or a bracelet.
  • the second communication domain includes the second device and at least one fourth device.
  • the second device may be a master node, and the fourth device may be a slave node.
  • the second device may be a cockpit domain controller (CDC), and the fourth device may be a car speaker, a car microphone, and other devices.
  • the third communication domain includes a fifth device and at least one sixth device.
  • the fifth device may be a master node, and the sixth device may be a slave node.
  • the fifth device may be an in-vehicle control device of a keyless system.
  • the sixth device may be a smart car key, or a mobile phone device with a car key function.
  • the master node can continuously scan (listen) for broadcast information on the broadcast channel, so as to ensure that the master node receives the broadcast information sent by the slave node.
  • the master node when the master node is busy, the master node cannot continuously scan the broadcast channel, which may cause the master node to fail to receive the broadcast information sent by the slave node for a long time.
  • the present application provides a communication method, which is conducive to improving the transmission performance of broadcast information, and ensures that the master node can scan the broadcast information sent by the slave node within a certain period of time.
  • FIG. 3 is a schematic flowchart of a communication method 300 provided by an embodiment of the present application. Each step in the method 300 will be described below.
  • the slave node sends broadcast information at the first moment.
  • the first moment is the start moment of sending the broadcast information in the nth sending cycle. That is to say, in the nth sending period, the slave node starts sending broadcast information at the first moment.
  • the slave node may take any moment as the start moment of the first sending cycle.
  • the transmission cycle duration T satisfies formula (1):
  • mod( ) means taking the remainder
  • T n is the start time of the nth transmission cycle
  • n is a positive integer
  • H is a time length unit
  • H is a positive number
  • N is a positive integer.
  • H may be protocol-specified or pre-configured
  • N may be protocol-specified, pre-configured, or selected by the node from a set of optional parameters specified by the protocol or pre-configured.
  • the slave node may determine T according to N and H.
  • M 1 is a non-negative integer less than N.
  • M1 may be randomly generated from the node, protocol - specified, pre-configured, or selected by the node from a protocol-specified or pre-configured set of optional parameters.
  • P is a divisor of N, P>M 1 , and P may be specified by the protocol or pre-configured.
  • An is a positive integer , and An can be determined by the slave node.
  • Mn may be referred to as the offset information of the nth transmission cycle
  • P may be referred to as a broadcast parameter
  • An may be referred to as the offset parameter corresponding to the nth transmission cycle, but it should be understood that among Mn , P, and An Either parameter of can also have another name, or no name at all, representing just one parameter.
  • the broadcast information can be used to broadcast data, and can also be used to discover or establish connections between nodes.
  • the master node determines the scan window.
  • the master node scans (listens) the broadcast information in the scanning window.
  • the time length of the scan window is H, and the time difference between the start times of two consecutive scan windows is Q*H.
  • Q is a divisor of P, or in other words, P is a multiple of Q, and Q is a positive integer.
  • Q may be protocol-specified, pre-configured, or selected by the master node from a protocol-specified or pre-configured set of optional parameters.
  • the master node scans the broadcast information in the scan window, it can be understood that the master node attempts to receive the broadcast information within the scan window, and determines whether there is broadcast information sent starting from the moment in the scan window.
  • the master node may receive the broadcast information at the first moment. That is, the first moment is within the scan window.
  • the master node may scan broadcast information only in the scanning window, or may also scan broadcast information in other time periods, which is not limited in this application.
  • the present application does not limit the execution time of S330, and S330 may be executed before or after S320.
  • FIG. 4 shows an example in which the slave node sends broadcast information and the master node receives the broadcast information.
  • the slave node in the nth transmission cycle, the slave node starts to send broadcast information at time tn; in the n +1th transmission cycle, the slave node starts to send broadcast information at time tn +1 ; Within n+2 sending cycles, the slave node starts to send broadcast information at time t n+2 ; within the n+3th sending cycle, the slave node starts sending broadcast information at time t n+3 .
  • the master node scans for broadcast information in each scan window. In the example shown in FIG. 4 , the master node can scan the broadcast information sent by the slave node at time t n .
  • the communication method provided by this application clarifies the time when the slave node sends broadcast information and how the master node scans the broadcast information. Based on the solution provided by this application, the broadcast information is sent and scanned, and the start time when the slave node sends the broadcast information in each sending cycle. Generally different, this can improve the transmission performance of broadcast information, which is beneficial for the master node to receive the broadcast information sent by the slave node within a certain period of time.
  • different slave nodes can select different offset parameters and start times of the sending period, and different slave nodes can select different M 1 , which can reduce the probability of continuous collision of broadcast information of multiple slave nodes.
  • the parameters specified in the protocol or preconfigured (including all optional values in the optional parameter set) involved in this application may be the parameters themselves specified or preconfigured by the protocol, or they may be specified or preconfigured according to the protocol.
  • the other parameters of the configuration are directly calculated.
  • P may be specified by the protocol or pre-configured, or it may be determined by the slave node according to N.
  • the parameter determined by the node can be determined directly, or it can be determined by one or more other parameters, and according to the one or more parameters, optional requirements also need to be specified according to the protocol Or preconfigured one or more parameters, determine the parameter.
  • the protocols described in this application include technical standards, regulations, and the like.
  • An is a prime number.
  • Mn +1 in formula (3) corresponding to different slave nodes may be different, so that different slave nodes send the start of broadcast information in the same transmission cycle
  • the time may be different, so it is beneficial to reduce the probability of collision of broadcast information sent by different slave nodes.
  • the values of the offset parameters corresponding to W consecutive sending periods are the same, and W ⁇ P.
  • the values from A n+k*w to A n+(k+1)*w-1 may be the same, and k is an integer greater than or equal to 0.
  • the offset information corresponding to the P broadcast information sent by the slave nodes in the P transmission periods is different, which is beneficial to ensure that the P broadcast information has at least one broadcast information transmission start time Within the scan window of the master node, it may be scanned by the master node. For example, if the broadcast messages sent by multiple slave nodes do not collide, at least one of the P pieces of broadcast messages sent by the slave nodes can be scanned by the master node.
  • the master node can scan the broadcast information sent by the slave node in the first sending cycle and the third sending cycle.
  • the value of the offset parameter corresponding to W consecutive sending periods may be a random number or be generated according to a random parameter. That is to say, the values of the offset parameters corresponding to the W consecutive sending periods are the same, and the values are random numbers or are generated according to a random parameter.
  • the values of the offset parameters corresponding to W consecutive sending periods of different slave nodes can be different random numbers or generated according to different random parameters, which is beneficial to reduce the transmission of broadcast information by different slave nodes. probability of collision.
  • the value of the offset parameter corresponding to W consecutive sending periods may also be selected from a set (denoted as: the first set). That is to say, the values of the offset parameters corresponding to the W consecutive sending periods are the same, and the value is an element in the first set.
  • the selection may be random selection or selection according to a certain rule.
  • the first set may be preconfigured or specified by a protocol or may be obtained by other means.
  • the first set may include greater than and all integers less than P, alternatively, the first set may include greater than and all prime numbers less than P.
  • different slave nodes can independently select their respective offset parameters from their corresponding first sets, which is beneficial to reduce the probability of collision of broadcast information sent by different slave nodes.
  • first sets corresponding to different slave nodes may be the same or different, which is not limited in this application.
  • the number of elements in the first set is less than or equal to P.
  • the P elements are all greater than The smaller P of the prime numbers. That is, will be greater than The prime numbers of are arranged in ascending order, and the P elements can be the first P prime numbers among these prime numbers.
  • the offset parameter When the offset parameter is selected from a set whose number of elements is greater than P, at least two elements in the set have the same value as the remainder of P. Then, when two slave nodes respectively select the above two offset parameters whose remainder to P is the same value, although the selected offset parameters are different, the broadcast information sent by the two slave nodes may continue to collide.
  • the offset parameter is selected from a set whose number of elements is less than or equal to P, if the values obtained by taking the remainder of P for any two elements in the set are different, the two slave nodes select different offset parameters. , so as to avoid continuous collision of the broadcast information sent.
  • the value of the offset parameter corresponding to W consecutive sending cycles may be a random number or generated according to a random parameter, and the consecutive W consecutive W sending cycles before or after the W consecutive sending cycles may be a random number.
  • the value of the offset parameter corresponding to the sending period may be a random number or generated according to a random parameter.
  • the value of the offset parameter corresponding to every W consecutive sending cycles may be a random number or be generated according to a random parameter.
  • the slave node may re-determine the offset parameter every W consecutive sending cycles.
  • the values of the offset parameters corresponding to at least two or any two consecutive W transmission periods may be different random numbers or generated according to different random parameters.
  • the value of A n to A n+w-1 is 1, the value of A n+w to A n+2w-1 is 2, and the value of A n+2w to A n+3w-1 is 1 Wait.
  • the values of the offset parameters corresponding to the two consecutive W sending cycles of the slave node may be different random numbers or generated according to different random parameters, it is possible to reduce the number of different slave nodes in multiple
  • the probability that the values of the offset parameters corresponding to consecutive W sending periods are all the same can reduce the probability of continuous collision of broadcast information sent by different slave nodes. For example, if the values of A n to A n+w-1 of two slave nodes are the same, it may cause the broadcast information sent by the two slave nodes in the nth to n+w-1th transmission cycle to collide.
  • the value of the offset parameter corresponding to W consecutive sending cycles is selected from the first set, and the value of the offset parameter corresponding to W consecutive sending cycles before or after the W consecutive sending cycles is selected from the first set. selected from a set.
  • the value of the offset parameter corresponding to every W consecutive sending cycles may be selected from the first set.
  • the values of the offset parameters corresponding to at least two or any two consecutive W transmission periods may be different elements in the first set. Based on this solution, since the values of the offset parameters corresponding to the two consecutive W sending periods of the slave node may be different elements in the first set, it can reduce the number of consecutive W sending periods sent by different slave nodes. All the values of the offset parameters corresponding to the period have the same probability, so that the probability of continuous collision of broadcast information sent by different slave nodes can be reduced.
  • P is a divisor of W, or in other words, W is a multiple of P. It should be understood that P may be equal to W.
  • the broadcast information sent by multiple slave nodes does not collide, it is beneficial to ensure that there are at least W/P broadcast information among the W broadcast information sent by the slave nodes in consecutive W transmission cycles. If the sending start time is within the scanning window of the master node, then at least W/P broadcast messages are scanned by the master node.
  • W can be protocol-specified or pre-configured, or can be determined from the node.
  • k can be protocol specified or preconfigured.
  • H 62.5us
  • l may be protocol specified, preconfigured, or selected by the node from a set of optional parameters specified or preconfigured by the protocol.
  • N 256.
  • the methods and operations implemented by the master node can also be implemented by components (such as chips or integrated circuits) that can be used for the master node, and the methods and operations implemented by the slave nodes can also be implemented by Component (eg, chip or integrated circuit) implementation available for slave nodes.
  • components such as chips or integrated circuits
  • Component eg, chip or integrated circuit
  • each network element such as a master node or a master node, includes hardware structures and/or software modules corresponding to performing the functions in order to implement the above functions.
  • a master node or a master node includes hardware structures and/or software modules corresponding to performing the functions in order to implement the above functions.
  • the present application can be implemented in hardware or a combination of hardware and computer software with the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein. Whether a function is performed by hardware or computer software driving hardware depends on the specific application and design constraints of the technical solution. Skilled artisans may implement the described functionality using different methods for each particular application, but such implementations should not be considered beyond the scope of this application.
  • the main node or the main node can be divided into functional modules according to the above method examples.
  • each functional module can be divided according to each function, or two or more functions can be integrated into one processing module.
  • the above-mentioned integrated modules can be implemented in the form of hardware, and can also be implemented in the form of software function modules. It should be noted that, the division of modules in the embodiments of the present application is schematic, and is only a logical function division, and there may be other division manners in actual implementation. The following description will be given by taking as an example that each function module is divided corresponding to each function.
  • FIG. 6 is a schematic block diagram of a communication apparatus provided by an embodiment of the present application.
  • the communication device 1000 includes a communication unit 1010 and a processing unit 1020 .
  • the communication unit 1010 is mainly used for communicating with other nodes, and the processing unit 1010 is mainly used for processing.
  • the communication unit 1010 may also be referred to as a communication interface, a transceiver unit, or an input/output interface.
  • the communication apparatus 1000 may further include a storage unit, which may be used to store instructions and/or data, and the processing unit 1020 may read the instructions and/or data in the storage unit, so that the communication apparatus implements the foregoing method Example.
  • a storage unit which may be used to store instructions and/or data
  • the processing unit 1020 may read the instructions and/or data in the storage unit, so that the communication apparatus implements the foregoing method Example.
  • the communication apparatus 1000 may be used to perform the actions performed by the slave node in the above method embodiments.
  • the communication apparatus 1000 may be a slave node or a component configurable in the slave node, the communication unit 1010
  • the processing unit 1020 is configured to perform the operations related to the sending and receiving on the slave node side in the above method embodiments, and the processing unit 1020 is configured to perform the operations related to the processing on the slave node side in the above method embodiments.
  • the communication device 1000 can implement steps or processes corresponding to the slave nodes in the above method embodiments.
  • the processing unit 1020 is configured to acquire the transmission period duration T; the communication unit 1010 is configured to send the broadcast information at the first time t n , where n is a positive integer.
  • the communication apparatus 1000 may be used to perform the actions performed by the master node in the above method embodiments.
  • the communication apparatus 1000 may be the master node or a component configurable in the master node
  • the communication unit 1010 is configured to perform the operations related to the transmission and reception on the master node side in the above method embodiments
  • the processing unit 1020 is configured to perform the operations related to the processing on the master node side in the above method embodiments.
  • the communication device 1000 can implement steps or processes corresponding to the master node in the above method embodiments.
  • the processing unit 1020 is configured to determine a scanning window; the communication unit 1010 is configured to scan the broadcast information in the scanning window.
  • the time length of the scan window is H
  • the time difference between the start times of two consecutive scan windows is Q*H
  • H is the unit of time length
  • Q is a positive integer
  • Q is the submultiple of the broadcast parameter P
  • P is pre-defined or configured.
  • the communication unit 1010 is specifically configured to: receive the broadcast information at the first time t n , where n is a positive integer.
  • the values of the offset parameters corresponding to the W consecutive sending periods are the same, and W ⁇ P.
  • the value of the offset parameter corresponding to the W consecutive sending periods is a random number or is generated according to a random parameter.
  • the value of the offset parameter corresponding to the consecutive W consecutive sending cycles before or after the W consecutive sending cycles is a random number or is generated according to a random parameter.
  • the value of the offset parameter corresponding to the W consecutive sending periods is selected from a set whose number of elements is less than or equal to P.
  • the values of the offset parameters corresponding to the consecutive W consecutive sending cycles before or after the W consecutive sending cycles are selected from the foregoing set.
  • any two elements in the set have different values obtained by taking the remainder of P.
  • P is a divisor of W.
  • An is a prime number.
  • FIG. 7 is another schematic block diagram of a communication apparatus 2000 provided by an embodiment of the present application.
  • the communication apparatus 2000 includes at least one processor 2001 and a communication interface 2003 .
  • the communication apparatus 2000 may further include at least one memory 2002 .
  • connection medium between the processor 2001 , the memory 2002 , and the communication interface 2003 is not limited in the embodiments of the present application.
  • the memory 2002, the processor 2001 and the communication interface 2003 may be connected through a bus, or may be connected through other connection media.
  • the processor 2001 may have a processing function.
  • the communication interface 2003 is used for sending and receiving information, such as sending or receiving broadcast information.
  • Memory 2002 may store programs (or instructions).
  • the processor 2001 may perform the processing-related steps performed by the master node in the above method embodiments (such as step S330), and the communication interface 2003 may perform the above method embodiments performed by the master node. step (eg step S340).
  • the processor 2001 is configured to perform the processing-related steps performed by the slave node in the above method embodiments (eg, step S310 ), and the communication interface 2003 is configured to perform the above method embodiments performed by the slave node. related steps (eg step S320).
  • a program is stored in the memory 2002, and the processor 2001 is configured to execute the program stored in the memory 2002, and the execution of the program stored in the memory 2002 enables the processor 2001 to execute the main functions in the above method embodiments.
  • the processing-related steps performed by the node such as step S330), and the execution of the program stored in the memory 2002, so that the processor 2001 controls the communication interface 2003 to perform the above method embodiments. Step S340).
  • a program is stored in the memory 2002, and the processor 2001 is used to execute the program stored in the memory 2002, and the execution of the program stored in the memory 2002 causes the processor 2001 to execute the above method embodiments.
  • the processing-related steps performed by the slave node eg, step S310), and the execution of the program stored in the memory 2002, so that the processor 2001 controls the communication interface 2003 to perform the above-mentioned method embodiments performed by the slave node. as in step S320).
  • the embodiment of the present application also provides a processing apparatus, including a processor and an interface.
  • the processor may be used to execute the methods in the above method embodiments.
  • the above processing device may be a chip.
  • the processing device may be a field programmable gate array (FPGA), an application specific integrated circuit (ASIC), a system on chip (SoC), or a It is a central processing unit (CPU), a network processor (NP), a digital signal processing circuit (DSP), or a microcontroller (microcontroller unit). , MCU), it can also be a programmable logic device (PLD) or other integrated chips.
  • FPGA field programmable gate array
  • ASIC application specific integrated circuit
  • SoC system on chip
  • MCU microcontroller unit
  • MCU programmable logic device
  • PLD programmable logic device
  • the memory in the embodiments of the present application may be volatile memory or non-volatile memory, or may include both volatile and non-volatile memory.
  • the non-volatile memory may be read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically programmable Erase programmable read-only memory (electrically EPROM, EEPROM) or flash memory.
  • Volatile memory may be random access memory (RAM), which acts as an external cache.
  • RAM random access memory
  • DRAM dynamic random access memory
  • SDRAM synchronous DRAM
  • SDRAM double data rate synchronous dynamic random access memory
  • ESDRAM enhanced synchronous dynamic random access memory
  • SLDRAM synchronous link dynamic random access memory
  • direct rambus RAM direct rambus RAM
  • the processor in the embodiment of the present application may be an integrated circuit chip, which has signal processing capability.
  • each step of the above method embodiments may be completed by a hardware integrated logic circuit in a processor or an instruction in the form of software.
  • the aforementioned processors may be general purpose processors, digital signal processors (DSPs), application specific integrated circuits (ASICs), field programmable gate arrays (FPGAs) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components .
  • DSPs digital signal processors
  • ASICs application specific integrated circuits
  • FPGAs field programmable gate arrays
  • the methods, steps, and logic block diagrams disclosed in the embodiments of this application can be implemented or executed.
  • a general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
  • the steps of the method disclosed in conjunction with the embodiments of the present application may be directly embodied as being executed and completed by a hardware decoding processor, or executed and completed by a combination of hardware and software modules in the decoding processor.
  • the software modules may be located in random access memory, flash memory, read-only memory, programmable read-only memory or electrically erasable programmable memory, registers and other storage media mature in the art.
  • the storage medium is located in the memory, and the processor reads the information in the memory, and completes the steps of the above method in combination with its hardware.
  • the present application also provides a computer-readable medium on which a computer program is stored, and when the computer program is executed by a computer, implements the functions of any of the foregoing method embodiments.
  • the present application also provides a computer program product, which implements the functions of any of the above method embodiments when the computer program product is executed by a computer.
  • the present application also provides a chip, comprising: at least one processor and a communication interface, the communication interface is used for receiving signals input to the chip or for outputting signals from the chip, the processor communicates with the chip
  • the interface communicates and is used to implement the functions of any of the above method embodiments through logic circuits or executing code instructions.
  • the present application also provides a terminal device, including the communication apparatus shown in FIG. 6 or FIG. 7 .
  • the terminal device may be any type of terminal such as a handheld terminal (such as a mobile phone, a game console, etc.), a wearable device (such as a headset, an AR/VR device), a vehicle, a vehicle-mounted device, or a smart home.
  • the terminal device has a short-range communication function.
  • the present application also provides a system including the aforementioned one or more master nodes and one or more slave nodes.
  • the above-mentioned embodiments it may be implemented in whole or in part by software, hardware, firmware or any combination thereof.
  • software it can be implemented in whole or in part in the form of a computer program product.
  • the computer program product includes one or more computer instructions. When the computer instructions are loaded and executed on a computer, all or part of the processes or functions described in the embodiments of the present application are generated.
  • the computer may be a general purpose computer, special purpose computer, computer network, or other programmable device.
  • the computer instructions may be stored in or transmitted from one computer readable storage medium to another computer readable storage medium, for example, the computer instructions may be downloaded from a website site, computer, server or data center Transmission to another website site, computer, server, or data center by wire (eg, coaxial cable, optical fiber, digital subscriber line, DSL) or wireless (eg, infrared, wireless, microwave, etc.).
  • the computer-readable storage medium may be any available medium that can be accessed by a computer or a data storage device such as a server, data center, etc. that includes an integration of one or more available media.
  • the available media may be magnetic media (eg, floppy disks, hard disks, magnetic tapes), optical media (eg, high-density digital video discs (DVDs)), or semiconductor media (eg, solid state disks, SSD)) etc.
  • a component may be, but is not limited to, a process running on a processor, a processor, an object, an executable, a thread of execution, a program, or a computer.
  • an application running on a computing device and the computing device may be components.
  • One or more components may reside within a process or thread of execution, and a component may be localized on one computer or distributed among 2 or more computers.
  • these components can execute from various computer readable media having various data structures stored thereon.
  • a component may, for example, pass a signal through a local system based on a signal having one or more data packets (such as data from two components interacting with another component between a local system, a distributed system, or a network, such as the Internet interacting with other systems through signals). or remote process to communicate.
  • a signal having one or more data packets (such as data from two components interacting with another component between a local system, a distributed system, or a network, such as the Internet interacting with other systems through signals). or remote process to communicate.
  • B corresponding to A indicates that B is associated with A, and B can be determined according to A.
  • determining B according to A does not mean that B is only determined according to A, and B may also be determined according to A and/or other information.
  • an item includes one or more of the following: A, B, and C
  • the item can be any of the following: A; B, unless otherwise specified. ;C;A and B;A and C;B and C;A,B and C;A and A;A,A and A;A,A and B;A,A and C,A,B and B;A , C and C; B and B, B, B and B, B, B and C, C and C; C, C and C, and other combinations of A, B and C.
  • a total of three elements of A, B and C are used as examples above to illustrate the optional items of the item.
  • the master node and/or the slave nodes may perform some or all of the steps in the embodiments of the present application, these steps or operations are only examples, and the embodiments of the present application may also perform other operations or various Variation of operations.
  • various steps may be performed in different orders presented in the embodiments of the present application, and may not be required to perform all the operations in the embodiments of the present application.
  • the disclosed system, apparatus and method may be implemented in other manners.
  • the apparatus embodiments described above are only illustrative.
  • the division of the units is only a logical function division. In actual implementation, there may be other division methods.
  • multiple units or components may be combined or Can be integrated into another system, or some features can be ignored, or not implemented.
  • the shown or discussed mutual coupling or direct coupling or communication connection may be through some interfaces, indirect coupling or communication connection of devices or units, and may be in electrical, mechanical or other forms.
  • the units described as separate components may or may not be physically separated, and components shown as units may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution in this embodiment.
  • each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically alone, or two or more units may be integrated into one unit.
  • the functions, if implemented in the form of software functional units and sold or used as independent products, may be stored in a computer-readable storage medium.
  • the technical solution of the present application can be embodied in the form of a software product in essence, or the part that contributes to the prior art or the part of the technical solution.
  • the computer software product is stored in a storage medium, including Several instructions are used to cause a computer device (which may be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of the present application.
  • the aforementioned storage medium includes: a U disk, a removable hard disk, a read-only memory ROM, a random access memory RAM, a magnetic disk or an optical disk and other media that can store program codes.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Databases & Information Systems (AREA)
  • Multimedia (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

本申请提供了一种通信方法和通信装置，能够提高广播信息的发送性能。该方法包括：获取发送周期时长T；在第一时刻tn 发送广播信息，n为正整数。其中，第一时刻tn 满足：tn＝Tn+Mn*H，T＝N*H；tn 为第n个发送周期内发送广播信息的起始时刻，Tn 为第n个发送周期的起始时刻，H 为时间长度单位，M1 为小于N的非负整数，N 为正整数，Mn 为第n个发送周期的偏移信息，其中 Mn+1 和 Mn 满足 Mn+1＝mod(Mn+An，P)，广播参数P为N的约数，An 为第n个发送周期对应的偏移参数，且为正整数，P＞M1。

Description

通信方法和通信装置 技术领域
本申请涉及通信领域，尤其涉及短距离通信领域，具体涉及一种通信方法和通信装置。
背景技术
在通信技术中，设备之间可以通过发送广播信息以及扫描广播信道实现设备间发现、连接建立或数据传输。其中，在点对点的通信场景下，主节点可以在广播信道上持续扫描(侦听)广播信息，这样可以确保主节点收到从节点发送的广播信息。然而，在点对多点的通信场景下，当主节点业务比较繁忙时，由于主节点无法持续扫描广播信道，这样可能导致主节点在很长一段时间内无法收到从节点发送的广播信息。
发明内容
本申请提供了一种通信方法和通信装置，能够提高广播信息的传输性能。
第一方面，提供了一种通信方法。该方法可以由从节点执行，如由移动终端、可穿戴设备或者车载设备等执行；或者，该方法也可以由配置于从节点中的芯片或集成电路执行，本申请对此不作限定。
该方法包括：获取发送周期时长T；在第一时刻t n发送广播信息，n为正整数。其中，该第一时刻t n满足：t n＝T n+M n*H，T＝N*H；t n为第n个发送周期内发送广播信息的起始时刻，T n为该第n个发送周期的起始时刻，H为时间长度单位，M 1为小于N的非负整数，N为正整数，M n为该第n个发送周期的偏移信息，其中M n+1和M n满足M n+1＝mod(M n+A n，P)，广播参数P为N的约数，A n为该第n个发送周期对应的偏移参数，且为正整数，P＞M 1，mod()表示取余，M n+1为第n+1个发送周期的偏移信息。
第二方面，提供了一种通信方法。该方法可以由主节点执行，如由移动终端、可穿戴设备或者车载设备等执行；或者，该方法也可以由配置于主节点中的芯片或集成电路执行，本申请对此不作限定。
该方法包括：确定扫描窗口；在该扫描窗口扫描广播信息。其中，该扫描窗口的时间长度为H，两个连续的扫描窗口的起始时间之间的时间差为Q*H，H为时间长度单位，Q为正整数，Q为广播参数P的约数。
上述参数中，H可以是协议规定的或者预配置的，N可以是协议规定的、预配置的、或者从节点从协议规定或者预配置的可选参数集合中选择的，T可以是从节点根据N和H确定的。
M 1为小于N的非负整数。M 1可以是从节点随机生成的、协议规定的、预配置的、或者从节点从协议规定或者预配置的可选参数集合中选择的。
P为N的约数，P＞M 1，P可以是预先定义或者配置的，预定义可以是协议规定，配置可以指预配置。
Q可以是协议规定的、预配置的、或者主节点从协议规定或者预配置的可选参数集合 中选择的。
可选地，该广播信息可以用于广播数据，也可以用于节点间发现或建立连接。
应理解，主节点在扫描窗口扫描广播信息可以理解为，主节点在扫描窗口内尝试接收广播信息，并确定是否存在以扫描窗口内的时刻为起始时刻发送的广播信息。
本申请提供的通信方法明确了从节点发送广播信息的时间以及主节点如何扫描广播信息，基于本申请提供的方案进行广播信息的发送和扫描，每个发送周期从节点发送广播信息的起始时刻一般不同，这样可以提高广播信息的传输性能，有利于主节点在一定时间内接收到从节点发送的广播信息。另外，不同从节点可以选择不同的偏移参数和发送周期的起始时刻，并且不同从节点可以选择不同的M 1，这样可以降低多个从节点的广播信息持续碰撞的概率。
结合第二方面，在某些实现方式中，该在该当前扫描窗口扫描广播信息，包括：在第一时刻t n开始接收到一个从节点发送的广播信息，n为正整数。其中，该第一时刻t n满足：t n＝T n+M n*H，T＝N*H；t n为第n个发送周期内发送广播信息的起始时刻，T n为该第n个发送周期的起始时刻，M 1为小于N的非负整数，N为正整数，M n为该第n个发送周期的偏移信息，其中M n+1和M n满足M n+1＝mod(M n+A n，P)，广播参数P为N的约数，A n为该第n个发送周期对应的偏移参数，且为正整数，P＞M 1，mod()表示取余，M n+1为第n+1个发送周期的偏移信息。
结合上述第一方面和第二方面，在某些实现方式中，连续W个该发送周期对应的偏移参数的取值相同，W≥P。
基于该方案，有利于保证从节点在P个发送周期内共发送的P个广播信息所对应的偏移信息不同，这样有利于保证这P个广播信息中至少有一个广播信息的发送起始时刻在主节点的扫描窗内，从而可能被主节点扫描到。
结合上述第一方面和第二方面，在某些实现方式中，该连续W个该发送周期对应的偏移参数的取值是随机数或者是根据一个随机参数生成的。
基于该方案，不同的从节点的连续W个该发送周期对应的偏移参数的取值可以是不同的随机数或者是根据不同的随机参数生成的，这样有利于降低不同的从节点发送广播信息碰撞的概率。
结合上述第一方面和第二方面，在某些实现方式中，该连续W个发送周期之前或者之后的连续W个发送周期对应的偏移参数的取值是随机数或者是根据一个随机参数生成的。
进一步地，至少两个或者任意两个连续的W个该发送周期对应的偏移参数的取值可以是不同的随机数或者是根据不同的随机参数生成的。
基于该方案，由于从节点的两个连续的W个该发送周期对应的偏移参数的取值可以是不同的随机数或者是根据不同的随机参数生成的，因此可以降低不同从节点在多个连续的W个发送周期对应的偏移参数的取值全部相同的概率，从而可以降低不同的从节点发送广播信息持续碰撞的概率。比如，两个从节点的A n至A n+w-1的取值相同，那么有可能导致这两个从节点在第n至第n+w-1个发送周期发送的广播信息发生碰撞，而如果这两个从节点选择的A n+w至A n+2w-1的取值不同，那么就有利于保证这两个从节点在第n+w至第n+2w-1个发送周期发送的广播信息不发生碰撞。
结合上述第一方面和第二方面，在某些实现方式中，该连续W个所述发送周期对应的是从一个元素个数小于或等于P的集合中选择的。
基于该方案，当偏移参数从一个元素个数大于P的集合选择中，该集合中有至少两个元素对P取余数是相同的值。那么，当两个从节点分别选择了上述两个对P取余数是相同的值的偏移参数，尽管选择的偏移参数不同，这两个从节点发送的广播信息可能会持续碰撞。而当偏移参数从一个元素个数小于或等于P的集合中选择时，如果该集合中的任意两个元素对P取余得到的值不同，则这两个从节点选择不同的偏移参数，即可避免发送的广播信息持续碰撞。
进一步地，该集合中的任意两个元素对P取余得到的值不同。
结合上述第一方面和第二方面，在某些实现方式中，该连续W个发送周期之前或者之后的连续W个发送周期对应的偏移参数的取值是从所述元素个数小于或等于P的集合中选择的。
进一步地，至少两个或者任意两个连续的W个该发送周期对应的偏移参数的取值可以是该集合中的不同的元素。
基于该方案，由于从节点的两个连续的W个该发送周期对应的偏移参数的取值可以是该集合中的不同的元素，因此可以降低不同从节点在多个连续的W个发送周期对应的偏移参数的取值全部相同的概率，从而可以降低不同的从节点发送广播信息持续碰撞的概率。
结合上述第一方面和第二方面，在某些实现方式中，P为W的约数。
基于该方案，在多个从节点发送的广播信息不发生碰撞的情况下，有利于保证从节点在连续的W个发送周期内共发送的W个广播信息中，至少有W/P个广播信息的发送起始时刻在主节点的扫描窗内，那么至少有W/P个广播信息被主节点扫描到。
结合上述第一方面和第二方面，在某些实现方式中，A n为质数。
基于该方案，在不同的从节点选择不同质数作为A n时，不同从节点对应的M n+1可能不同，从而使得不同从节点在同一发送周期发送广播信息的起始时刻可能不同，因此有利于降低不同从节点发送的广播信息发生碰撞的概率。
结合上述第一方面和第二方面，在某些实现方式中，
Figure PCTCN2021081794-appb-000001
或者，A n<P。或者，
Figure PCTCN2021081794-appb-000002
或者，A n≤P。或者，
Figure PCTCN2021081794-appb-000003
或者，
Figure PCTCN2021081794-appb-000004
或者，
Figure PCTCN2021081794-appb-000005
或者，
Figure PCTCN2021081794-appb-000006
基于该方案，有利于降低多个从节点发送的广播信息持续碰撞的概率。
结合上述第一方面和第二方面，在某些实现方式中，H满足：H＝k*62.5us，k为正整数。
结合上述第一方面和第二方面，在某些实现方式中，N满足：N＝l*256，l为正整数。
第三方面，提供一种通信装置，所述通信装置用于执行上述第一方面提供的方法。具体地，所述通信装置可以包括用于执行第一方面提供的方法的模块。
第四方面，提供一种通信装置，所述通信装置用于执行上述第二方面提供的方法。具体地，所述通信装置可以包括用于执行第二方面提供的方法的模块。
第五方面，提供一种通信装置，包括至少一个处理器。该至少一个处理器与至少一个存储器耦合，可用于执行存储器中的指令，以实现上述第一方面或第一方面中任一种可能 实现方式中的方法。可选地，该通信装置还包括至少一个存储器。可选地，该通信装置还包括通信接口，至少一个处理器与通信接口耦合，所述通信接口用于输入和/或输出信息。所述信息包括指令和数据中的至少一项。
在一种实现方式中，该通信装置为从节点，如移动终端。当该通信装置为从节点时，所述通信接口可以是收发器，或，输入/输出接口。
在另一种实现方式中，该通信装置为芯片或芯片系统。当该通信装置为芯片或芯片系统时，所述通信接口可以是输入/输出接口可以是该芯片或芯片系统上的输入/输出接口、接口电路、输出电路、输入电路、管脚或相关电路等。所述处理器也可以体现为处理电路或逻辑电路。
在另一种实现方式中，该通信装置为配置于从节点中的芯片或芯片系统。
可选地，所述收发器可以为收发电路。可选地，所述输入/输出接口可以为输入/输出电路。
第六方面，提供一种通信装置，包括至少一个处理器。该至少一个处理器与存储器耦合，可用于执行存储器中的指令，以实现上述第二方面或第二方面中任一种可能实现方式中的方法。可选地，该通信装置还包括至少一个存储器。可选地，该通信装置还包括通信接口，至少一个处理器与通信接口耦合，所述通信接口用于输入和/或输出信息。
在一种实现方式中，该通信装置为主节点，如移动终端。当该通信装置为主节点时，所述通信接口可以是收发器，或，输入/输出接口。
在另一种实现方式中，该通信装置为芯片或芯片系统。当该通信装置为芯片或芯片系统时，所述通信接口可以是该芯片或芯片系统上的输入/输出接口、接口电路、输出电路、输入电路、管脚或相关电路等。所述处理器也可以体现为处理电路或逻辑电路。
在另一种实现方式中，该通信装置为配置于主节点中的芯片或芯片系统。
可选地，所述收发器可以为收发电路。可选地，所述输入/输出接口可以为输入/输出电路。
第七方面，提供了一种芯片，包括：至少一个处理器和通信接口。所述通信接口用于接收输入所述芯片的信号或用于从所述芯片输出信号，所述处理器与所述通信接口通信且通过逻辑电路或执行代码指令用于实现上述第一方面或第一方面中任一种可能实现方式中的方法，或用于实现上述第二方面或第二方面中任一种可能实现方式中的方法。
第八方面，提供了一种通信装置，包括：至少一个存储器，用于存储计算机指令；至少一个处理器，用于执行所述至少一个存储器中存储的计算机指令，使得所述通信装置执行上述第一方面或第一方面中任一种可能实现方式中的方法，或，使得所述通信装置执行上述第二方面或第二方面中任一种可能实现方式中的方法。
第九方面，提供一种计算机可读存储介质，其上存储有计算机程序，所述计算机程序被通信装置执行时，使得所述通信装置实现第一方面或第一方面的任一可能的实现方式中的方法。
第十方面，提供一种计算机可读存储介质，其上存储有计算机程序，所述计算机程序被通信装置执行时，使得所述通信装置实现第二方面或第二方面的任一可能的实现方式中的方法。
第十一方面，提供一种计算机程序产品，该计算机程序产品包括：计算机程序(也可 以称为代码，或指令)，当该计算机程序被运行时，使得计算机执行上述第一方面或第一方面中任一可能实现方式中的方法。
第十二方面，提供一种计算机程序产品，该计算机程序产品包括：计算机程序(也可以称为代码，或指令)，当该计算机程序被运行时，使得计算机执行上述第二方面或第二方面中任一可能实现方式中的方法。
第十三方面，提供了一种终端设备，包括第三方面或第四方面的通信装置。例如，该终端设备可以是车辆。
第十四方面，提供了一种通信系统，包括前述的从节点和主节点。
附图说明
图1是适用于本申请实施例的通信系统的示意图；
图2是适用于本申请实施例的一个应用场景的示意图；
图3是本申请提供的通信方法的示意性流程图；
图4是本申请提供的发送和扫描广播信息的一个示意图；
图5是本申请提供的发送和扫描广播信息的另一示意图；
图6是本申请提供的一种通信装置的示意性框图；
图7是本申请提供的另一通信装置的示意性框图。
具体实施方式
下面将结合附图，对本申请中的技术方案进行描述。
本申请实施例的技术方案可以应用于各种通信系统，例如：第五代(5th generation，5G)系统或新无线(new radio，NR)、长期演进(long term evolution，LTE)系统、LTE频分双工(frequency division duplex，FDD)系统、LTE时分双工(time division duplex，TDD)、通用移动通信系统(universal mobile telecommunication system，UMTS)、短距离通信系统等。本申请实施例的技术方案还可以应用于设备到设备(device to device，D2D)通信，机器到机器(machine to machine，M2M)通信，机器类型通信(machine type communication，MTC)，以及车联网系统中的通信。其中，车联网系统中的通信方式统称为V2X(X代表任何事物)，例如，该V2X通信包括：车辆与车辆(vehicle to vehicle，V2V)通信，车辆与路边基础设施(vehicle to infrastructure，V2I)通信、车辆与行人之间的通信(vehicle to pedestrian，V2P)或车辆与网络(vehicle to network，V2N)通信等。
本申请中，网络设备可以是演进型节点B(evolved node B，eNB)、无线网络控制器(radio network controller，RNC)、节点B(node B，NB)、基站控制器(base station controller，BSC)、基站收发台(base transceiver station，BTS)、家庭基站(例如，home evolved nodeB，或home node B，HNB)、基带单元(baseband unit，BBU)，无线保真(wireless fidelity，WIFI)系统中的接入点(access point，AP)、无线中继节点、无线回传节点、传输点(transmission point，TP)或者发送接收点(transmission and reception point，TRP)等，还可以为5G，如，NR，系统中的gNB，或，传输点(TRP或TP)，5G系统中的基站的一个或一组(包括多个天线面板)天线面板，或者，还可以为构成gNB或传输点的网络节点，如基带单元(BBU)，或，分布式单元(distributed unit，DU)。应理解，该网络 设备可以是还可以是5.5G或6G等系统中的基站，或者，还可以是当前或未来短距离通信系统中的具有管理功能的设备(例如主节点等)等。
本申请中，终端设备也可以称为用户设备(user equipment，UE)、接入终端、用户单元、用户站、移动站、移动台、远方站、远程终端、移动设备、用户终端、终端、无线通信设备、用户代理或用户装置。本申请的实施例中的终端设备可以是车辆、车载设备、非车载设备、手持终端(如，手机(mobile phone)或者车钥匙等)、平板电脑(Pad)、带无线收发功能的电脑、可穿戴设备(如，虚拟现实(virtual reality，VR)终端设备、增强现实(augmented reality，AR)终端设备或者耳机等)、工业控制(industrial control)中的无线终端、无人驾驶(self driving)中的无线终端、远程医疗(remote medical)中的无线终端、智能电网(smart grid)中的无线终端、运输安全(transportation safety)中的无线终端、智慧城市(smart city)中的无线终端、智慧家庭(smart home)中的无线终端(如，智能家居)等等。应理解，终端设备可以是任意类型的终端。进一步地，该终端设备可以是现有的或者未来可能出现的具有短距离通信功能的终端设备(例如从节点)，比如，可以为具有蓝牙或者WiFi通信功能的终端设备。
图1示出了适用于本申请实施例的无线通信系统示意图。参见图1，该通信系统100包括主节点110和至少一个从节点(例如，图1所示的从节点120至160)。
主节点和从节点是在逻辑功能上区分的两类节点。其中主节点管理从节点，具有分配通信域的资源的功能，负责为从节点分配资源；从节点听从主节点的调度，使用主节点分配的资源与主节点进行通信。上述主节点和从节点位于通信域中。
其中，通过一组具有通信关系的通信节点，以及通信节点之间的通信链路构成通信域。其中，一个装置或设备可以在多个通信域中。例如当手机与耳机进行无线通信时，手机在包括手机与耳机在内的通信域a中，在通信域a中手机为主节点，耳机为从节点；然后当手机检测到座舱域控制器(cockpit domain controller，CDC)，并与该CDC建立无线连接后，手机也在包括手机与CDC在内的通信域b中，在通信域b中CDC为主节点，手机为从节点，手机听从该CDC的调度。通信域b中还可以包括其他从节点，如车载音箱、麦克等。
本申请中，从节点发送广播信息，主节点可以扫描广播信息。可以理解，主节点也可以称为接收设备、第一设备或者G节点等，从节点也可以称为发送设备、第二设备或者T节点等。
在一种可能的实施方式中，主节点可以是网络设备，从节点可以是终端设备。
在另一种可能的实施方式中，主节点和从节点都可以是终端设备。例如主节点为手机，从节点为车辆、耳机、车钥匙或者车载设备等。
本申请实施例对应用场景不做限定，也并不限定主节点和从节点的类型。图1中的主节点和从节点均以终端设备为例。
可选地，通信系统100可以是短距离通信系统，例如，主节点和从节点都具备短距离通信功能，但本申请对此不作限定。
图2是适用于本申请实施例的车内无线通信场景的一个示例。图1所示的通信系统100可以是图2所示的任一通信域，应理解，本申请实施例的通信方法不限于图2所示的车内通信场景。参见图2，第一通信域包括第一装置与至少一个第三装置。其中，第一装 置可以是主节点，第三装置可以是从节点。第一装置可以是手机，第三装置可以是耳机、手环等可穿戴式设备。第二通信域包括第二装置与至少一个第四装置。其中，第二装置可以是主节点，第四装置可以是从节点。第二装置可以是座舱域控制器(cockpit domain controller，CDC)，第四装置可以是车载音箱、车载麦克等设备。第三通信域包括第五装置和至少一个第六装置。其中，第五装置可以是主节点，第六装置可以是从节点。第五装置可以是无钥匙系统的车载控制装置。第六装置可以是智能车钥匙，或者具有车钥匙功能的手机设备。
在点对点的通信场景下，主节点可以在广播信道上持续扫描(侦听)广播信息，这样可以确保主节点收到从节点发送的广播信息。然而，在点对多点的通信场景下，当主节点业务比较繁忙时，由于主节点无法持续扫描广播信道，这样可能导致主节点在很长一段时间内无法收到从节点发送的广播信息。
有鉴于此，本申请提供了一种通信方法，有利于提高广播信息的传输性能，保证主节点可以在一定时间时长内扫描到从节点发送的广播信息。
下面将结合附图对本申请提供的方案进行说明。
图3是本申请实施例提供的一种通信方法300的示意性流程图。下面对该方法300中的各步骤进行说明。
S310，从节点获取发送周期时长。
S320，从节点在第一时刻发送广播信息。
其中，第一时刻为第n个发送周期内发送广播信息的起始时刻。也就是说，在第n个发送周期内，从节点在第一时刻开始发送广播信息。示例性的，从节点可以将任意时刻作为第一个发送周期的开始时刻。
发送周期时长T满足公式(1)：
T＝N*H，             (1)
第一时刻t n满足公式(2)：
t n＝T n+M n*H，          (2)
M n+1和M n满足公式(3)：
M n+1＝mod(M n+A n，P)，       (3)
上述公式中，mod()表示取余，T n为第n个发送周期的起始时刻，n为正整数。
具体的，H为时间长度单位，H为正数，N为正整数。H可以是协议规定的或者预配置的，N可以是协议规定的、预配置的、或者从节点从协议规定或者预配置的可选参数集合中选择的。在S310中，从节点可以根据N和H确定T。M 1为小于N的非负整数。M 1可以是从节点随机生成的、协议规定的、预配置的、或者从节点从协议规定或者预配置的可选参数集合中选择的。P为N的约数，P＞M 1，P可以是协议规定的或者预配置的。A n为正整数，且A n可以由从节点确定。M n可以称为第n个发送周期的偏移信息，P可以称为广播参数，A n可以称为第n个发送周期对应的偏移参数，但应理解，M n、P和A n中的任一参数也可以是其他名称，或没有任何名称，仅表示一个参数。
本申请中，所述广播信息可以用于广播数据，也可以用于节点间发现或建立连接。
S330，主节点确定扫描窗口。
S340，主节点在扫描窗口扫描(侦听)广播信息。
其中，扫描窗口的时间长度为H，两个连续的扫描窗口的起始时间之间的时间差为 Q*H。Q为P的约数，或者说，P为Q的倍数，且Q为正整数。Q可以是协议规定的、预配置的、或者主节点从协议规定或者预配置的可选参数集合中选择的。
应理解，主节点在扫描窗口扫描广播信息可以理解为，主节点在扫描窗口内尝试接收广播信息，并确定是否存在以扫描窗口内的时刻为起始时刻发送的广播信息。
可选地，在S340中，主节点可以在第一时刻接收广播信息。也就是说，第一时刻在扫描窗口内。
需要说明的是，本申请中，主节点可能仅在扫描窗口内扫描广播信息，也可能还在其他的时间段扫描广播信息，本申请对此不作限定。
另外，本申请并不限定S330的执行时间，S330可以在S320之前执行，也可以在S320之后执行。
参见图4，图4示出了从节点发送广播信息，主节点接收广播信息的一个示例。
如图4所示，在第n个发送周期内在，从节点在t n时刻开始发送广播信息；在第n+1个发送周期内在，从节点在t n+1时刻开始发送广播信息；在第n+2个发送周期内在，从节点在t n+2时刻开始发送广播信息；在第n+3个发送周期内在，从节点在t n+3时刻开始发送广播信息。主节点在每个扫描窗口中扫描广播信息。在图4所示的示例中，主节点可以扫描到从节点在t n时刻开始发送的广播信息。
本申请提供的通信方法明确了从节点发送广播信息的时间以及主节点如何扫描广播信息，基于本申请提供的方案进行广播信息的发送和扫描，每个发送周期从节点发送广播信息的起始时刻一般不同，这样可以提高广播信息的传输性能，有利于主节点在一定时间内接收到从节点发送的广播信息。另外，不同从节点可以选择不同的偏移参数和发送周期的起始时刻，并且不同从节点可以选择不同的M 1，这样可以降低多个从节点的广播信息持续碰撞的概率。
需要说明的是，本申请中涉及的协议规定或预配置的参数(包括可选参数集合中的所有可选值)，可以是协议规定或预配置这些参数本身，也可以是根据协议规定或预配置的其它参数直接计算获得的。例如，P可以是协议规定的或者预配置的，也可以是从节点根据N所确定的。另外，节点(主节点或从节点)确定的参数，可以是直接确定该参数，也可以是确定其它一个或多个参数，并根据所述一个或多个参数，可选的还需要根据协议规定或预配置的一个或多个参数，确定该参数。本申请所述协议包括技术标准、法规等。
下面对本申请可能的实现方式进行说明。
可选地，A n为质数。
基于该方案，在不同的从节点选择不同质数作为A n时，不同从节点对应的公式(3)中的M n+1可能不同，从而使得不同从节点在同一发送周期发送广播信息的起始时刻可能不同，因此有利于降低不同从节点发送的广播信息发生碰撞的概率。
可选地，
Figure PCTCN2021081794-appb-000007
或者，A n<P。或者，
Figure PCTCN2021081794-appb-000008
或者，A n≤P。或者，
Figure PCTCN2021081794-appb-000009
或者，
Figure PCTCN2021081794-appb-000010
或者，
Figure PCTCN2021081794-appb-000011
或者，
Figure PCTCN2021081794-appb-000012
基于该方案，有利于降低多个从节点发送的广播信息持续碰撞的概率。
在一种可能的实现方式中，连续W个发送周期对应的偏移参数的取值相同，W≥P。
比如，A n+k*w至A n+(k+1)*w-1的取值可以相同，k为大于或等于0的整数。
基于该方案，有利于保证从节点在P个发送周期内共发送的P个广播信息所对应的偏 移信息不同，这样有利于保证这P个广播信息中至少有一个广播信息的发送起始时刻在主节点的扫描窗口内，从而可能被主节点扫描到。比如，如果多个从节点发送的广播信息没有发生碰撞，则从节点发送的P个广播信息中至少有一个广播信息可以被主节点扫描到。
举例来说，参见图5，假设N＝32，M 1＝1，A 1＝A 2＝A 3＝A 4＝7，W＝P＝16，Q＝8。那么，
当n＝1时，t 1＝T 1+M 1*H＝T 1+H，M 2＝mod(M 1+A 1，P)＝8；
当n＝2时，t 2＝T 2+M 2*H＝T 2+8*H，M 3＝mod(M 2+A 2，P)＝15；
当n＝3时，t 3＝T 3+M 3*H＝T 3+15*H，M 4＝mod(M 3+A 3，P)＝6；
当n＝4时，t 4＝T 4+M 4*H＝T 4+6*H。
从图5中可以看出，主节点可以扫描到从节点在第一个发送周期和第三个发送周期发送的广播信息。
进一步地，连续W个发送周期对应的偏移参数的取值可以是一个随机数或者是根据一个随机参数生成的。也就是说，该连续W个发送周期对应的偏移参数的取值相同，并且该取值是随机数或者是根据一个随机参数生成的。
基于该方案，不同的从节点的连续W个该发送周期对应的偏移参数的取值可以是不同的随机数或者是根据不同的随机参数生成的，这样有利于降低不同的从节点发送广播信息碰撞的概率。
或者，连续W个发送周期对应的偏移参数的取值也可以是从一个集合(记作：第一集合)中选择的。也就是说，该连续W个发送周期对应的偏移参数的取值相同，并且该取值是第一集合中的一个元素。所述选择可以是随机选择或者按照一定的规律选择。
例如，第一集合可以预配置或者由协议规定或者可以通过其他方式获得。比如，第一集合可以包括大于
Figure PCTCN2021081794-appb-000013
且小于P的所有整数，或者，第一集合可以包括大于
Figure PCTCN2021081794-appb-000014
且小于P的所有质数。
基于该方案，不同的从节点可以独立的从各自对应的第一集合中选择各自的偏移参数，这样有利于降低不同的从节点发送广播信息碰撞的概率。
应理解，不同从节点对应的第一集合可以相同也可以不同，本申请对此不作限定。
示例性的，第一集合中的元素个数小于或等于P。
进一步地，第一集合中的任意两个元素对P取余得到的值不同。
比如，该P个元素是所有大于
Figure PCTCN2021081794-appb-000015
的质数中较小的P个数。也就是说，将大于
Figure PCTCN2021081794-appb-000016
的质数按照从小到大的顺序排列，该P个元素可以是这些质数中的前P个质数。
当偏移参数从一个元素个数大于P的集合选择中，该集合中有至少两个元素对P取余数是相同的值。那么，当两个从节点分别选择了上述两个对P取余数是相同的值的偏移参数，尽管选择的偏移参数不同，这两个从节点发送的广播信息可能会持续碰撞。而当偏移参数从一个元素个数小于或等于P的集合中选择时，如果该集合中的任意两个元素对P取余得到的值不同，则这两个从节点选择不同的偏移参数，即可避免发送的广播信息持续碰撞。
在一种可能的实现方式中，连续W个发送周期对应的偏移参数的取值可以是一个随机数或者是根据一个随机参数生成的，并且该连续W个发送周期之前或者之后的连续W个发送周期对应的偏移参数的取值可以是一个随机数或者是根据一个随机参数生成的。
也就是说，每连续W个发送周期对应的偏移参数的取值可以是一个随机数或者是根 据一个随机参数生成的。
比如，从节点可以每连续W个发送周期重新确定偏移参数。
进一步地，至少两个或者任意两个连续的W个该发送周期对应的偏移参数的取值可以是不同的随机数或者是根据不同的随机参数生成的。比如，A n至A n+w-1的取值为1，A n+w至A n+2w-1的取值为2，A n+2w至A n+3w-1的取值为1等。
基于该方案，由于从节点的两个连续的W个该发送周期对应的偏移参数的取值可以是不同的随机数或者是根据不同的随机参数生成的，因此可以降低不同从节点在多个连续的W个发送周期对应的偏移参数的取值全部相同的概率，从而可以降低不同的从节点发送广播信息持续碰撞的概率。比如，两个从节点的A n至A n+w-1的取值相同，那么有可能导致这两个从节点在第n至第n+w-1个发送周期发送的广播信息发生碰撞，而如果这两个从节点选择的A n+w至A n+2w-1的取值不同，那么就有利于保证这两个从节点在第n+w至第n+2w-1个发送周期发送的广播信息不发生碰撞。
或者，连续W个发送周期对应的偏移参数的取值是从第一集合中选择的，并且连续W个发送周期之前或者之后的连续W个发送周期对应的偏移参数的取值是从第一集合中选择的。
也就是说，每连续W个发送周期对应的偏移参数的取值都可以是从第一集合中选择的。
进一步地，至少两个或者任意两个连续的W个该发送周期对应的偏移参数的取值可以是第一集合中的不同的元素。基于该方案，由于从节点的两个连续的W个该发送周期对应的偏移参数的取值可以是第一集合中的不同的元素，因此可以降低不同从节点在多个连续的W个发送周期对应的偏移参数的取值全部相同的概率，从而可以降低不同的从节点发送广播信息持续碰撞的概率。
可选地，P为W的约数，或者说，W为P的倍数。应理解，P可以等于W。
示例性的，P＝W＝Q。
基于该方案，在多个从节点发送的广播信息不发生碰撞的情况下，有利于保证从节点在连续的W个发送周期内共发送的W个广播信息中，至少有W/P个广播信息的发送起始时刻在主节点的扫描窗内，那么至少有W/P个广播信息被主节点扫描到。
可选地，W可以是协议规定或预配置的，也可以是从节点确定的。
比如，从节点可以根据P的取值确定W的取值，例如，确定W＝P或W＝2*P。
可选地，H满足：H＝k*62.5us，k为正整数。k可以是协议规定的或者预配置的。
比如，H＝62.5us。
可选地，N满足：N＝l*256，l为正整数。l可以是协议规定的、预配置的、或者从节点从协议规定或者预配置的可选参数集合中选择的。
比如，N＝256。
应理解，本申请中所涉及的任一公式可能有多种变形，但任何满足相应公式的变形都应落入本申请的保护范围内。例如，公式(3)可以变形为：X*P+M n+1＝M n+A n，或者(M n+A n)/P＝X……M n+1，公式(3)的这两个变形也应落入本申请的保护范围内。
还应理解，对于本申请提供的方法，由主节点实现的方法和操作，也可以由可用于主节点的部件(例如芯片或者集成电路)实现，由从节点实现的方法和操作，也可以由可用于从节点的部件(例如芯片或者集成电路)实现。
以上，结合图3至图5详细说明了本申请实施例提供的方法。以下，结合图6和图7详细说明本申请实施例提供的通信装置。应理解，装置实施例的描述与方法实施例的描述相互对应，因此，未详细描述的内容可以参见上文方法实施例，为了简洁，这里不再赘述。
上述主要从节点之间交互的角度对本申请实施例提供的方案进行了介绍。可以理解的是，各个网元，例如主节点或者主节点，为了实现上述功能，其包含了执行各个功能相应的硬件结构和/或软件模块。本领域技术人员应该可以意识到，结合本文中所公开的实施例描述的各示例的单元及算法步骤，本申请能够以硬件或硬件和计算机软件的结合形式来实现。某个功能究竟以硬件还是计算机软件驱动硬件的方式来执行，取决于技术方案的特定应用和设计约束条件。专业技术人员可以对每个特定的应用来使用不同方法来实现所描述的功能，但是这种实现不应认为超出本申请的范围。
本申请实施例可以根据上述方法示例对主节点或者主节点进行功能模块的划分，例如，可以对应各个功能划分各个功能模块，也可以将两个或两个以上的功能集成在一个处理模块中。上述集成的模块既可以采用硬件的形式实现，也可以采用软件功能模块的形式实现。需要说明的是，本申请实施例中对模块的划分是示意性的，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式。下面以采用对应各个功能划分各个功能模块为例进行说明。
图6是本申请实施例提供的通信装置的示意性框图。该通信装置1000包括通信单元1010和处理单元1020。通信单元1010主要用于与其他节点进行通信，处理单元1010主要用于进行处理。通信单元1010还可以称为通信接口、收发单元、或者输入/输出接口。
可选地，该通信装置1000还可以包括存储单元，该存储单元可以用于存储指令和/或数据，处理单元1020可以读取存储单元中的指令和/或数据，以使得通信装置实现前述方法实施例。
在一种设计中，该通信装置1000可以用于执行上文方法实施例中从节点所执行的动作，这时，该通信装置1000可以为从节点或者可配置于从节点的部件，通信单元1010用于执行上文方法实施例中从节点侧的收发相关的操作，处理单元1020用于执行上文方法实施例中从节点侧的处理相关的操作。
基于该设计，该通信装置1000可实现对应于上文方法实施例中的从节点执行的步骤或者流程。在一个示例中，处理单元1020，用于获取发送周期时长T；通信单元1010用于，在第一时刻t n发送广播信息，n为正整数。其中，所述第一时刻t n满足：t n＝T n+M n*H，T＝N*H；t n为第n个发送周期内发送广播信息的起始时刻，T n为所述第n个发送周期的起始时刻，H为时间长度单位，M 1为小于N的非负整数，N为正整数，M n为所述第n个发送周期的偏移信息，其中M n+1和M n满足M n+1＝mod(M n+A n，P)，广播参数P为N的约数，A n为所述第n个发送周期对应的偏移参数，且为正整数，P＞M 1，P为预先定义或者配置的。
在另一种设计中，该通信装置1000可以用于执行上文方法实施例中主节点所执行的动作，这时，该通信装置1000可以为主节点或者可配置于主节点的部件，通信单元1010用于执行上文方法实施例中主节点侧的收发相关的操作，处理单元1020用于执行上文方法实施例中主节点侧的处理相关的操作。
基于该设计，该通信装置1000可实现对应于上文方法实施例中的主节点执行的步骤 或者流程。在一个示例中，处理单元1020，用于确定扫描窗口；通信单元1010，用于在所述扫描窗口扫描广播信息。其中，所述扫描窗口的时间长度为H，两个连续的扫描窗口的起始时间之间的时间差为Q*H，H为时间长度单位，Q为正整数，Q为广播参数P的约数，P为预先定义或者配置的。
可选地，通信单元1010具体用于：在第一时刻t n接收到广播信息，n为正整数。其中，所述第一时刻t n满足：t n＝T n+M n*H，T＝N*H；t n为第n个发送周期内发送广播信息的起始时刻，T n为所述第n个发送周期的起始时刻，M 1为小于N的非负整数，N为正整数，M n为所述第n个发送周期的偏移信息，其中M n+1和M n满足M n+1＝mod(M n+A n，P)，广播参数P为N的约数，A n为所述第n个发送周期对应的偏移参数，且为正整数，P＞M 1。
下面是基于上述两种设计的一些可能的实施方式。
可选地，连续W个所述发送周期对应的偏移参数的取值相同，W≥P。
可选地，所述连续W个所述发送周期对应的偏移参数的取值是随机数或者是根据一个随机参数生成的。
可选地，所述连续W个发送周期之前或者之后的连续W个发送周期对应的偏移参数的取值是随机数或者是根据一个随机参数生成的。
可选地，连续W个所述发送周期对应的偏移参数的取值是从一个元素个数小于或等于P的集合中选择的。
可选地，所述连续W个发送周期之前或者之后的连续W个发送周期对应的偏移参数的取值是从上述集合中选择的。
可选地，所述集合中的任意两个元素对P取余得到的值不同。
可选地，P为W的约数。
可选地，A n为质数。
可选地，
Figure PCTCN2021081794-appb-000017
和/或，A n≤P。
可选地，H满足：H＝k*62.5us，k为正整数。
可选地，N满足：N＝l*256，l为正整数。
应理解，各单元执行上述相应步骤的具体过程在上述方法实施例中已经详细说明，为了简洁，在此不再赘述。
图7是本申请实施例提供的通信装置2000的又一示意性框图。如图7所示，该通信装置2000包括至少一个处理器2001和通信接口2003。可选的，该通信装置2000还可以包括至少一个存储器2002。
本申请实施例中不限定上述处理器2001、存储器2002以及通信接口2003之间的具体连接介质。例如，存储器2002、处理器2001和通信接口2003之间可以通过总线连接，也可以通过其他连接介质连接。
处理器2001可以具有处理功能。通信接口2003，用于收发信息，如用于发送或接收广播信息。存储器2002可以存储程序(或指令)。
在一种设计中，处理器2001可以执行上述方法实施例中主节点执行的与处理相关的步骤(如步骤S330)，通信接口2003可以执行上文方法实施例中主节点执行的与收发相关的步骤(如步骤S340)。
在另一种设计中，处理器2001用于执行上文方法实施例中从节点执行的与处理相关 的步骤(如步骤S310)，通信接口2003执行上文方法实施例中从节点执行的与收发相关的步骤(如步骤S320)。
在一种设计中，存储器2002中存储有程序，处理器2001用于执行存储器2002中存储的程序，对存储器2002中存储的程序的执行，使得处理器2001用于执行上文方法实施例中主节点执行的与处理相关的步骤(如步骤S330)，对存储器2002中存储的程序的执行，使得处理器2001控制通信接口2003执行上文方法实施例中主节点执行的与收发相关的步骤(如步骤S340)。
在另一种设计中，存储器2002中存储有程序，处理器2001用于执行存储器2002中存储的程序，对存储器2002中存储的程序的执行，使得处理器2001用于执行上文方法实施例中从节点执行的与处理相关的步骤(如步骤S310)，对存储器2002中存储的程序的执行，使得处理器2001控制通信接口2003执行上文方法实施例中从节点执行的与收发相关的步骤(如步骤S320)。
本申请实施例还提供了一种处理装置，包括处理器和接口。所述处理器可用于执行上述方法实施例中的方法。
应理解，上述处理装置可以是一个芯片。例如，该处理装置可以是现场可编程门阵列(field programmable gate array，FPGA)，可以是专用集成芯片(application specific integrated circuit，ASIC)，还可以是系统芯片(system on chip，SoC)，还可以是中央处理器(central processor unit，CPU)，还可以是网络处理器(network processor，NP)，还可以是数字信号处理电路(digital signal processor，DSP)，还可以是微控制器(micro controller unit，MCU)，还可以是可编程控制器(programmable logic device，PLD)或其他集成芯片。
本申请实施例中的存储器可以是易失性存储器或非易失性存储器，或可包括易失性和非易失性存储器两者。其中，非易失性存储器可以是只读存储器(read-only memory，ROM)、可编程只读存储器(programmable ROM，PROM)、可擦除可编程只读存储器(erasable PROM，EPROM)、电可擦除可编程只读存储器(electrically EPROM，EEPROM)或闪存。易失性存储器可以是随机存取存储器(random access memory，RAM)，其用作外部高速缓存。通过示例性但不是限制性说明，许多形式的RAM可用，例如静态随机存取存储器(static RAM，SRAM)、动态随机存取存储器(dynamic RAM，DRAM)、同步动态随机存取存储器(synchronous DRAM，SDRAM)、双倍数据速率同步动态随机存取存储器(double data rate SDRAM，DDR SDRAM)、增强型同步动态随机存取存储器(enhanced SDRAM，ESDRAM)、同步连接动态随机存取存储器(synchlink DRAM，SLDRAM)和直接内存总线随机存取存储器(direct rambus RAM，DR RAM)。应注意，本文描述的系统和方法的存储器旨在包括但不限于这些和任意其它适合类型的存储器。
本申请实施例中的处理器可以是一种集成电路芯片，具有信号的处理能力。在实现过程中，上述方法实施例的各步骤可以通过处理器中的硬件的集成逻辑电路或者软件形式的指令完成。上述的处理器可以是通用处理器、数字信号处理器(DSP)、专用集成电路(ASIC)、现场可编程门阵列(FPGA)或者其他可编程逻辑器件、分立门或者晶体管逻辑器件、分立硬件组件。可以实现或者执行本申请实施例中的公开的各方法、步骤及逻辑框图。通用处理器可以是微处理器或者该处理器也可以是任何常规的处理器等。结合本申请实施例所公开的方法的步骤可以直接体现为硬件译码处理器执行完成，或者用译码处理 器中的硬件及软件模块组合执行完成。软件模块可以位于随机存储器，闪存、只读存储器，可编程只读存储器或者电可擦写可编程存储器、寄存器等本领域成熟的存储介质中。该存储介质位于存储器，处理器读取存储器中的信息，结合其硬件完成上述方法的步骤。
本申请还提供了一种计算机可读介质，其上存储有计算机程序，该计算机程序被计算机执行时实现上述任一方法实施例的功能。
本申请还提供了一种计算机程序产品，该计算机程序产品被计算机执行时实现上述任一方法实施例的功能。
本申请还提供了一种芯片，包括：至少一个处理器和通信接口，所述通信接口用于接收输入所述芯片的信号或用于从所述芯片输出信号，所述处理器与所述通信接口通信且通过逻辑电路或执行代码指令用于实现上述任一方法实施例的功能。
本申请还提供了一种终端设备，包括图6或图7所示的通信装置。该终端设备可以是手持终端(如手机、游戏机等)、可穿戴设备(如耳机、AR/VR设备)、车辆、车载设备或者智能家居等任意类型的终端。可选地，该终端设备具有短距离通信功能。
本申请还提供一种系统，其包括前述的一个或多个主节点以及一个或多个从节点。
在上述实施例中，可以全部或部分地通过软件、硬件、固件或者其任意组合来实现。当使用软件实现时，可以全部或部分地以计算机程序产品的形式实现。所述计算机程序产品包括一个或多个计算机指令。在计算机上加载和执行所述计算机指令时，全部或部分地产生按照本申请实施例所述的流程或功能。所述计算机可以是通用计算机、专用计算机、计算机网络、或者其他可编程装置。所述计算机指令可以存储在计算机可读存储介质中，或者从一个计算机可读存储介质向另一个计算机可读存储介质传输，例如，所述计算机指令可以从一个网站站点、计算机、服务器或数据中心通过有线(例如同轴电缆、光纤、数字用户线(digital subscriber line，DSL))或无线(例如红外、无线、微波等)方式向另一个网站站点、计算机、服务器或数据中心进行传输。所述计算机可读存储介质可以是计算机能够存取的任何可用介质或者是包含一个或多个可用介质集成的服务器、数据中心等数据存储设备。所述可用介质可以是磁性介质(例如，软盘、硬盘、磁带)、光介质(例如，高密度数字视频光盘(digital video disc，DVD))、或者半导体介质(例如，固态硬盘(solid state disk，SSD))等。
在本说明书中使用的术语“部件”、“模块”、“系统”等用于表示计算机相关的实体、硬件、固件、硬件和软件的组合、软件、或执行中的软件。例如，部件可以是但不限于，在处理器上运行的进程、处理器、对象、可执行文件、执行线程、程序或计算机。通过图示，在计算设备上运行的应用和计算设备都可以是部件。一个或多个部件可驻留在进程或执行线程中，部件可位于一个计算机上或分布在2个或更多个计算机之间。此外，这些部件可从在上面存储有各种数据结构的各种计算机可读介质执行。部件可例如根据具有一个或多个数据分组(例如来自与本地系统、分布式系统或网络间的另一部件交互的二个部件的数据，例如通过信号与其它系统交互的互联网)的信号通过本地或远程进程来通信。
应理解，说明书通篇中提到的“实施例”意味着与实施例有关的特定特征、结构或特性包括在本申请的至少一个实施例中。因此，在整个说明书各个实施例未必一定指相同的实施例。此外，这些特定的特征、结构或特性可以任意适合的方式结合在一个或多个实施例中。
应理解，在本申请实施例中，编号“第一”、“第二”…仅仅为了区分不同的对象，比如为了区分不同的网络设备，并不对本申请实施例的范围构成限制，本申请实施例并不限于此。
还应理解，在本申请中，“当…时”、“若”以及“如果”均指在某种客观情况下网元会做出相应的处理，并非是限定时间，且也不要求网元实现时一定要有判断的动作，也不意味着存在其它限定。
还应理解，在本申请中，“至少一个”是指一个或者多个，“多个”是指两个或两个以上。
还应理解，在本申请各实施例中，“A对应的B”表示B与A相关联，根据A可以确定B。但还应理解，根据A确定B并不意味着仅仅根据A确定B，还可以根据A和/或其它信息确定B。
还应理解，本文中术语“和/或”，仅仅是一种描述关联对象的关联关系，表示可以存在三种关系，例如，A和/或B，可以表示：单独存在A，同时存在A和B，单独存在B这三种情况。另外，本文中字符“/”，一般表示前后关联对象是一种“或”的关系。
本申请中出现的类似于“项目包括如下中的一项或多项：A，B，以及C”表述的含义，如无特别说明，通常是指该项目可以为如下中任一个：A；B；C；A和B；A和C；B和C；A，B和C；A和A；A，A和A；A，A和B；A，A和C，A，B和B；A，C和C；B和B，B，B和B，B，B和C，C和C；C，C和C，以及其他A，B和C的组合。以上是以A，B和C共3个元素进行举例来说明该项目的可选用条目，当表达为“项目包括如下中至少一种：A，B，……，以及X”时，即表达中具有更多元素时，那么该项目可以适用的条目也可以按照前述规则获得。
可以理解的，本申请实施例中，主节点和/或从节点可以执行本申请实施例中的部分或全部步骤，这些步骤或操作仅是示例，本申请实施例还可以执行其它操作或者各种操作的变形。此外，各个步骤可以按照本申请实施例呈现的不同的顺序来执行，并且有可能并非要执行本申请实施例中的全部操作。
本领域普通技术人员可以意识到，结合本文中所公开的实施例描述的各示例的单元及算法步骤，能够以电子硬件、或者计算机软件和电子硬件的结合来实现。这些功能究竟以硬件还是软件方式来执行，取决于技术方案的特定应用和设计约束条件。专业技术人员可以对每个特定的应用来使用不同方法来实现所描述的功能，但是这种实现不应认为超出本申请的范围。
所属领域的技术人员可以清楚地了解到，为描述的方便和简洁，上述描述的系统、装置和单元的具体工作过程，可以参考前述方法实施例中的对应过程，在此不再赘述。
在本申请所提供的几个实施例中，应该理解到，所揭露的系统、装置和方法，可以通过其它的方式实现。例如，以上所描述的装置实施例仅仅是示意性的，例如，所述单元的划分，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式，例如多个单元或组件可以结合或者可以集成到另一个系统，或一些特征可以忽略，或不执行。另一点，所显示或讨论的相互之间的耦合或直接耦合或通信连接可以是通过一些接口，装置或单元的间接耦合或通信连接，可以是电性，机械或其它的形式。
所述作为分离部件说明的单元可以是或者也可以不是物理上分开的，作为单元显示的部件可以是或者也可以不是物理单元，即可以位于一个地方，或者也可以分布到多个网络 单元上。可以根据实际的需要选择其中的部分或者全部单元来实现本实施例方案的目的。
另外，在本申请各个实施例中的各功能单元可以集成在一个处理单元中，也可以是各个单元单独物理存在，也可以两个或两个以上单元集成在一个单元中。
所述功能如果以软件功能单元的形式实现并作为独立的产品销售或使用时，可以存储在一个计算机可读取存储介质中。基于这样的理解，本申请的技术方案本质上或者说对现有技术做出贡献的部分或者该技术方案的部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质中，包括若干指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)执行本申请各个实施例所述方法的全部或部分步骤。而前述的存储介质包括：U盘、移动硬盘、只读存储器ROM、随机存取存储器RAM、磁碟或者光盘等各种可以存储程序代码的介质。
以上所述，仅为本申请的具体实施方式，但本申请的保护范围并不局限于此，任何熟悉本技术领域的技术人员在本申请揭露的技术范围内，可轻易想到变化或替换，都应涵盖在本申请的保护范围之内。因此，本申请的保护范围应以所述权利要求的保护范围为准。

Claims (42)

  1. 一种通信方法，其特征在于，包括：
    获取发送周期时长T；
    在第一时刻t n发送广播信息，n为正整数；
    其中，所述第一时刻t n满足：t n＝T n+M n*H，T＝N*H；
    t n为第n个发送周期内发送广播信息的起始时刻，T n为所述第n个发送周期的起始时刻，H为时间长度单位，M 1为小于N的非负整数，N为正整数，M n为所述第n个发送周期的偏移信息，其中M n+1和M n满足M n+1＝mod(M n+A n，P)，广播参数P为N的约数，A n为所述第n个发送周期对应的偏移参数，且为正整数，P＞M 1，P为预先定义或者配置的。
  2. 如权利要求1所述的方法，其特征在于，连续W个所述发送周期对应的偏移参数的取值相同，W≥P。
  3. 如权利要求2所述的方法，其特征在于，所述连续W个所述发送周期对应的偏移参数的取值是随机数或者是根据一个随机参数生成的。
  4. 如权利要求3所述的方法，其特征在于，所述连续W个发送周期之前或者之后的连续W个发送周期对应的偏移参数的取值是随机数或者是根据一个随机参数生成的。
  5. 如权利要求2所述的方法，其特征在于，所述连续W个所述发送周期对应的偏移参数的取值是从一个元素个数小于或等于P的集合中选择的。
  6. 如权利要求5所述的方法，其特征在于，所述集合中的任意两个元素对P取余得到的值不同。
  7. 如权利要求2至6中任一项所述的方法，其特征在于，P为W的约数。
  8. 如权利要求1至7中任一项所述的方法，其特征在于，A n为质数。
  9. 如权利要求1至8中任一项所述的方法，其特征在于，
    Figure PCTCN2021081794-appb-100001
    和/或，A n≤P。
  10. 如权利要求1至9中任一项所述的方法，其特征在于，H满足：H＝k*62.5us，k为正整数。
  11. 如权利要求1至10中任一项所述的方法，其特征在于，N满足：N＝l*256，l为正整数。
  12. 一种通信方法，其特征在于，包括：
    确定扫描窗口；
    在所述扫描窗口扫描广播信息，其中，所述扫描窗口的时间长度为H，两个连续的扫描窗口的起始时间之间的时间差为Q*H，H为时间长度单位，Q为正整数，Q为广播参数P的约数，P为预先定义或者配置的。
  13. 如权利要求12所述的方法，其特征在于，所述在所述当前扫描窗口扫描广播信息，包括：
    在第一时刻t n接收到广播信息，n为正整数；
    其中，所述第一时刻t n满足：t n＝T n+M n*H，T＝N*H；
    t n为第n个发送周期内发送广播信息的起始时刻，T n为所述第n个发送周期的起始时刻，M 1为小于N的非负整数，N为正整数，M n为所述第n个发送周期的偏移信息，其中 M n+1和M n满足M n+1＝mod(M n+A n，P)，广播参数P为N的约数，A n为所述第n个发送周期对应的偏移参数，且为正整数，P＞M 1。
  14. 如权利要求13所述的方法，其特征在于，连续W个所述发送周期对应的偏移参数的取值相同，W≥P。
  15. 如权利要求14所述的方法，其特征在于，P为W的约数。
  16. 如权利要求13至15中任一项所述的方法，其特征在于，A n为质数。
  17. 如权利要求13至16中任一项所述的方法，其特征在于，
    Figure PCTCN2021081794-appb-100002
    和/或，A n≤P。
  18. 如权利要求12至17中任一项所述的方法，其特征在于，H满足：H＝k*62.5us，k为正整数。
  19. 如权利要求13至18中任一项所述的方法，其特征在于，N满足：N＝l*256，l为正整数。
  20. 一种通信装置，其特征在于，包括：
    处理单元，用于获取发送周期时长T；
    通信单元，用于在第一时刻t n发送广播信息，n为正整数；
    其中，所述第一时刻t n满足：t n＝T n+M n*H，T＝N*H；
    t n为第n个发送周期内发送广播信息的起始时刻，T n为所述第n个发送周期的起始时刻，H为时间长度单位，M 1为小于N的非负整数，N为正整数，M n为所述第n个发送周期的偏移信息，其中M n+1和M n满足M n+1＝mod(M n+A n，P)，广播参数P为N的约数，A n为所述第n个发送周期对应的偏移参数，且为正整数，P＞M 1，P为预先定义或者配置的。
  21. 如权利要求20所述的装置，其特征在于，连续W个所述发送周期对应的偏移参数的取值相同，W≥P。
  22. 如权利要求21所述的装置，其特征在于，所述连续W个所述发送周期对应的偏移参数的取值是随机数或者是根据一个随机参数生成的。
  23. 如权利要求22所述的装置，其特征在于，所述连续W个发送周期之前或者之后的连续W个发送周期对应的偏移参数的取值是随机数或者是根据一个随机参数生成的。
  24. 如权利要求21所述的装置，其特征在于，所述连续W个所述发送周期对应的偏移参数的取值是从一个元素个数小于或等于P的集合中选择的。
  25. 如权利要求24所述的装置，其特征在于，所述集合中的任意两个元素对P取余得到的值不同。
  26. 如权利要求21至25中任一项所述的装置，其特征在于，P为W的约数。
  27. 如权利要求20至26中任一项所述的装置，其特征在于，A n为质数。
  28. 如权利要求20至27中任一项所述的装置，其特征在于，
    Figure PCTCN2021081794-appb-100003
    和/或，A n≤P。
  29. 如权利要求20至28中任一项所述的装置，其特征在于，H满足：H＝k*62.5us，k为正整数。
  30. 如权利要求20至29中任一项所述的装置，其特征在于，N满足：N＝l*256，l为正整数。
  31. 一种通信装置，其特征在于，包括：
    处理单元，用于确定扫描窗口；
    通信单元，用于在所述扫描窗口扫描广播信息，其中，所述扫描窗口的时间长度为H，两个连续的扫描窗口的起始时间之间的时间差为Q*H，H为时间长度单位，Q为正整数，Q为广播参数P的约数，P为预先定义或者配置的。
  32. 如权利要求31所述的装置，其特征在于，所述通信单元具体用于：
    在第一时刻t n接收到广播信息，n为正整数；
    其中，所述第一时刻t n满足：t n＝T n+M n*H，T＝N*H；
    t n为第n个发送周期内发送广播信息的起始时刻，T n为所述第n个发送周期的起始时刻，M 1为小于N的非负整数，N为正整数，M n为所述第n个发送周期的偏移信息，其中M n+1和M n满足M n+1＝mod(M n+A n，P)，广播参数P为N的约数，A n为所述第n个发送周期对应的偏移参数，且为正整数，P＞M 1。
  33. 如权利要求32所述的装置，其特征在于，连续W个所述发送周期对应的偏移参数的取值相同，W≥P。
  34. 如权利要求33所述的装置，其特征在于，P为W的约数。
  35. 如权利要求32至34中任一项所述的装置，其特征在于，A n为质数。
  36. 如权利要求32至35中任一项所述的装置，其特征在于，
    Figure PCTCN2021081794-appb-100004
    和/或，A n≤P。
  37. 如权利要求31至36中任一项所述的装置，其特征在于，H满足：H＝k*62.5us，k为正整数。
  38. 如权利要求32至37中任一项所述的装置，其特征在于，N满足：N＝l*256，l为正整数。
  39. 一种通信装置，其特征在于，包括：
    至少一个存储器，用于存储计算机指令；
    至少一个处理器，用于执行所述至少一个存储器中存储的计算机指令，使得所述通信装置执行如权利要求1至11中任一项所述的方法，或，使得所述通信装置执行如权利要求12至19中任一项所述的方法。
  40. 一种芯片，其特征在于，包括：至少一个处理器和通信接口，所述通信接口用于接收输入所述芯片的信号或用于从所述芯片输出信号，所述处理器与所述通信接口通信且通过逻辑电路或执行代码指令用于实现如权利要求1至11中任一项或者如权利要求12至19中任一项所述的方法。
  41. 一种计算机可读存储介质，其特征在于，其上存储有计算机程序，所述计算机程序被通信装置执行时，使得所述通信装置执行如权利要求1至11中任一项所述的方法，或，使得所述通信装置执行如权利要求12至19中任一项所述的方法。
  42. 一种终端设备，其特征在于，包括如权利要求20至30中任一项或者如权利要求31至38中任一项所述的通信装置。
PCT/CN2021/081794 2021-03-19 2021-03-19 通信方法和通信装置 WO2022193285A1 (zh)

Priority Applications (2)

Application Number Priority Date Filing Date Title
PCT/CN2021/081794 WO2022193285A1 (zh) 2021-03-19 2021-03-19 通信方法和通信装置
CN202180003288.6A CN113841431B (zh) 2021-03-19 2021-03-19 通信方法和通信装置

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2021/081794 WO2022193285A1 (zh) 2021-03-19 2021-03-19 通信方法和通信装置

Publications (1)

Publication Number Publication Date
WO2022193285A1 true WO2022193285A1 (zh) 2022-09-22

Family

ID=78971955

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2021/081794 WO2022193285A1 (zh) 2021-03-19 2021-03-19 通信方法和通信装置

Country Status (2)

Country Link
CN (1) CN113841431B (zh)
WO (1) WO2022193285A1 (zh)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090252128A1 (en) * 2008-04-04 2009-10-08 Xue Yang Multi-transceiver wireless communication device and methods for operating during device discovery and connection establishment
CN104936211A (zh) * 2015-04-27 2015-09-23 深圳市金立通信设备有限公司 一种无线资源分配方法
CN105072565A (zh) * 2015-08-10 2015-11-18 深圳市金立通信设备有限公司 一种数据传输方法及相关设备
CN111343709A (zh) * 2020-05-15 2020-06-26 深圳市汇顶科技股份有限公司 节点控制方法、系统、芯片、电子设备和存储介质

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102984794B (zh) * 2011-09-05 2017-11-07 中兴通讯股份有限公司 一种多点传输系统数据发送的方法、系统、基站和终端
WO2017133792A1 (en) * 2016-02-05 2017-08-10 Telefonaktiebolaget Lm Ericsson (Publ) Timing information for access information table transmission
CN109076516A (zh) * 2016-05-11 2018-12-21 瑞典爱立信有限公司 用于控制信号发送的方法和装置
CN108781410B (zh) * 2017-03-14 2020-09-11 华为技术有限公司 一种扫描方法及设备
CN110351823A (zh) * 2018-04-03 2019-10-18 华为技术有限公司 通信的方法和装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090252128A1 (en) * 2008-04-04 2009-10-08 Xue Yang Multi-transceiver wireless communication device and methods for operating during device discovery and connection establishment
CN104936211A (zh) * 2015-04-27 2015-09-23 深圳市金立通信设备有限公司 一种无线资源分配方法
CN105072565A (zh) * 2015-08-10 2015-11-18 深圳市金立通信设备有限公司 一种数据传输方法及相关设备
CN111343709A (zh) * 2020-05-15 2020-06-26 深圳市汇顶科技股份有限公司 节点控制方法、系统、芯片、电子设备和存储介质

Also Published As

Publication number Publication date
CN113841431B (zh) 2022-09-09
CN113841431A (zh) 2021-12-24

Similar Documents

Publication Publication Date Title
WO2019154333A1 (zh) 资源选择的方法和终端设备
US10154384B2 (en) Systems and methods for back channel communication
TWI821359B (zh) 側行通道配置方法、終端設備和網路設備
JP6607939B2 (ja) 優先されるｒｔｓ−ｃｔｓリソース
WO2022246803A1 (zh) 接入方法及通信装置
WO2019127284A1 (zh) 冲突解决的方法和终端设备
WO2019084929A1 (zh) 资源选取的方法和终端设备
EP3952541A1 (en) Communication method and device
WO2024067687A1 (zh) 信息传输方法、第一通信节点、第二通信节点及存储介质
WO2022193285A1 (zh) 通信方法和通信装置
JP2023547806A (ja) 通信方法および装置
CN110944401B (zh) 随机接入方法、终端设备及网络设备
WO2022206672A1 (zh) 发现和连接电子设备的方法以及电子设备
US10314073B2 (en) Data transmission method and user equipment
WO2022033424A1 (zh) 资源传输方法、装置及通信设备
WO2021000954A1 (zh) 一种数据传输方法及通信装置
WO2021212522A1 (zh) 资源选择方法及通信装置
CN112825572A (zh) 蓝牙查询/寻呼的方法及通信设备
WO2021212261A1 (zh) 一种通信方法以及通信装置
WO2023272444A1 (zh) 一种通信方法及其通信装置
WO2024093683A1 (zh) 信道接入方法及相关装置
WO2023227041A1 (zh) 通信方法及装置
US20230090911A1 (en) Low Latency Orthogonal Frequency Division Multiple Access Transmission Scheme
WO2019028603A1 (zh) 数据传输的方法和终端设备
WO2023165211A1 (zh) 一种通信方法及装置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 21930877

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 21930877

Country of ref document: EP

Kind code of ref document: A1