CN113841431B

CN113841431B - Communication method and communication device

Info

Publication number: CN113841431B
Application number: CN202180003288.6A
Authority: CN
Inventors: 高磊; 程型清
Original assignee: Huawei Technologies Co Ltd
Current assignee: Huawei Technologies Co Ltd
Priority date: 2021-03-19
Filing date: 2021-03-19
Publication date: 2022-09-09
Anticipated expiration: 2041-03-19
Also published as: CN113841431A; WO2022193285A1

Abstract

The application provides a communication method and a communication device, which can improve the sending performance of broadcast information. The method comprises the following steps: acquiring a sending period duration T; at a first time t _n And transmitting the broadcast information, wherein n is a positive integer. Wherein the first time t _n Satisfies the following conditions: t is t _n ＝T _n +M _n *H，T＝N*H；t _n Starting time, T, for transmitting broadcast information in the nth transmission period _n Is the starting time of the nth transmission period, H is the unit of time length, M ₁ Is a non-negative integer less than N, N is a positive integer, M _n Offset information for nth transmission period, where M _n+1 And M _n Satisfies M _n+1 ＝mod(M _n +A _n P) the broadcast parameter P is a divisor of N, a _n Is an offset parameter corresponding to the nth transmission period and is a positive integer, P > M ₁ 。

Description

Communication method and communication device

Technical Field

The present application relates to the field of communications, and in particular, to the field of short-range communications, and more particularly, to a communication method and a communication apparatus.

Background

In the communication technology, discovery, connection establishment or data transmission between devices can be realized by sending broadcast information and scanning broadcast channels between the devices. In a point-to-point communication scenario, the master node may continuously scan (listen to) broadcast information on a broadcast channel, so that the master node may be ensured to receive broadcast information sent by the slave node. However, in a point-to-multipoint communication scenario, when the service of the master node is busy, the master node cannot continuously scan the broadcast channel, which may result in that the master node cannot receive the broadcast information sent by the slave node for a long time.

Disclosure of Invention

The application provides a communication method and a communication device, which can improve the transmission performance of broadcast information.

In a first aspect, a method of communication is provided. The method may be performed by a slave node, such as a mobile terminal, a wearable device, or a vehicle-mounted device; alternatively, the method may be performed by a chip or an integrated circuit configured in the slave node, which is not limited in this application.

The method comprises the following steps: acquiring a sending period duration T; at a first time t _n And transmitting the broadcast information, wherein n is a positive integer. Wherein the first time t _n Satisfies the following conditions: t is t _n ＝T _n +M _n *H，T＝N*H；t _n Starting time, T, for transmitting broadcast information in the nth transmission period _n Is the start time of the nth transmission period, H is the unit of time length, M ₁ Is a non-negative integer less than N, N is a positive integer, M _n Offset information for the nth transmission period, where M _n+1 And M _n Satisfy M _n+1 ＝mod(M _n +A _n P) the broadcast parameter P is a divisor of N, A _n Is an offset parameter corresponding to the nth transmission period and is a positive integer, P > M ₁ Mod () denotes remainder, M _n+1 Offset information for the (n + 1) th transmission period.

In a second aspect, a method of communication is provided. The method may be performed by a master node, such as a mobile terminal, a wearable device, or a vehicle-mounted device; alternatively, the method may be performed by a chip or an integrated circuit configured in the host node, which is not limited in this application.

The method comprises the following steps: determining a scanning window; broadcast information is scanned over the scanning window. The time length of the scanning window is H, the time difference between the starting times of two continuous scanning windows is Q H, H is a time length unit, Q is a positive integer, and Q is a divisor of the broadcast parameter P.

Of the above parameters, H may be protocol specified or preconfigured, N may be protocol specified, preconfigured, or selected from a set of protocol specified or preconfigured optional parameters from the node, and T may be determined from N and H from the node.

M ₁ Is a non-negative integer less than N. M is a group of ₁ May be randomly generated from the node, protocol specified, pre-configured, or selected from a set of optional parameters that the node specifies or pre-configures from the protocol.

P is a divisor of N, P > M ₁ P may be predefined or configured, the predefined may be a protocol specification, and the configuration may refer to a pre-configuration.

Q may be protocol specified, pre-configured, or the master node is selected from a protocol specified or pre-configured set of optional parameters.

Optionally, the broadcast information may be used for broadcasting data, and may also be used for discovering or establishing a connection between nodes.

It should be understood that the master node scans the scanning window for the broadcast information may be understood as the master node attempting to receive the broadcast information within the scanning window and determining whether there is broadcast information transmitted with a time within the scanning window as a starting time.

The communication method provided by the application defines the time for the slave node to send the broadcast information and how the master node scans the broadcast information, the broadcast information is sent and scanned based on the scheme provided by the application, and the starting time for the slave node to send the broadcast information in each sending period is generally different, so that the transmission performance of the broadcast information can be improved, and the master node can receive the broadcast information sent by the slave node in a certain time. In addition, different slave nodes may select different offset parameters and start times of the transmission periods, and different slave nodes may select different M ₁ Therefore, the probability of continuous collision of the broadcast information of a plurality of slave nodes can be reduced.

With reference to the second aspect, in some implementations, the scanning for broadcast information in the current scanning window includes: at a first time t _n And starting to receive broadcast information sent by a slave node, wherein n is a positive integer. Wherein the first time t _n Satisfies the following conditions: t is t _n ＝T _n +M _n *H，T＝N*H；t _n Is the n-thStarting time, T, for transmitting broadcast information in a transmission cycle _n Is the start time of the nth transmission period, M ₁ Is a non-negative integer less than N, N is a positive integer, M _n Offset information for the nth transmission period, where M _n+1 And M _n Satisfies M _n+1 ＝mod(M _n +A _n P) the broadcast parameter P is a divisor of N, A _n Is an offset parameter corresponding to the nth transmission period and is a positive integer, P > M ₁ Mod () denotes remainder, M _n+1 Offset information for the (n + 1) th transmission period.

With reference to the first aspect and the second aspect, in some implementation manners, values of offset parameters corresponding to W consecutive transmission periods are the same, and W is greater than or equal to P.

Based on the scheme, the offset information corresponding to the P pieces of broadcast information which are sent by the slave node in the P sending periods is different, so that the starting time of sending at least one piece of broadcast information in the P pieces of broadcast information is in the scanning window of the master node, and the master node can scan the P pieces of broadcast information.

With reference to the first aspect and the second aspect, in some implementation manners, values of the offset parameters corresponding to the W consecutive transmission periods are random numbers or generated according to a random parameter.

Based on the scheme, values of offset parameters corresponding to the W consecutive sending periods of different slave nodes can be different random numbers or generated according to different random parameters, so that the probability of collision of broadcast information sent by different slave nodes is favorably reduced.

With reference to the first aspect and the second aspect, in some implementations, values of offset parameters corresponding to W consecutive transmission periods before or after the W consecutive transmission periods are random numbers or generated according to a random parameter.

Further, 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.

Based on the scheme, the method comprises the following steps of,because the values of the offset parameters corresponding to two continuous W sending periods of the slave node may be different random numbers or generated according to different random parameters, the probability that the values of the offset parameters corresponding to a plurality of continuous W sending periods of different slave nodes are all the same can be reduced, and thus the probability that the broadcast information sent by different slave nodes continuously collides can be reduced. For example, A of two slave nodes _n To A _n+w-1 If the values of the two slave nodes are the same, the broadcast messages sent by the two slave nodes in the (n) th to (n + w-1) th sending periods may collide, and if the two slave nodes select a _n+w To A _n+2w-1 The values of the two slave nodes are different, so that the two slave nodes are favorable for ensuring that the broadcast information sent in the (n + w) th to (n +2 w-1) th sending periods does not collide.

With reference to the first aspect and the second aspect, in some implementations, the W consecutive transmission periods correspond to one selected from a set whose number of elements is less than or equal to P.

Based on the scheme, when the offset parameter is selected from a set with the number of elements larger than P, at least two elements in the set take the same value as the remainder of P. Then, when two slave nodes respectively select the offset parameters whose remainder for P is the same value, although the selected offset parameters are different, the broadcast messages transmitted by the two slave nodes may continuously collide. When the offset parameter is selected from a set with the number of elements less than or equal to P, if the values obtained by the balance of any two elements in the set on P are different, the two slave nodes select different offset parameters, and the continuous collision of the transmitted broadcast information can be avoided.

Further, any two elements in the set are different values left over for P.

With reference to the first aspect and the second aspect, in some implementations, the value of the offset parameter corresponding to the W consecutive transmission periods before or after the W consecutive transmission periods is selected from a set in which the number of elements is less than or equal to P.

Further, 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.

Based on the scheme, because the values of the offset parameters corresponding to two consecutive W transmission periods of the slave node may be different elements in the set, the probability that the values of the offset parameters corresponding to a plurality of consecutive W transmission periods of different slave nodes are all the same can be reduced, and thus the probability that the broadcast information sent by different slave nodes continuously collides can be reduced.

In certain implementations, in combination with the first and second aspects, P is a divisor of W.

Based on the scheme, under the condition that the broadcast information sent by the plurality of slave nodes does not collide, the method is favorable for ensuring that at least W/P broadcast information is sent in the W broadcast information sent by the slave nodes in the continuous W sending periods, the sending starting time of the W/P broadcast information is in the scanning window of the master node, and then at least W/P broadcast information is scanned by the master node.

In certain implementations, combining the first and second aspects above, a _n Are prime numbers.

Based on the scheme, different prime numbers are selected as A from different slave nodes _n M corresponding to different slave nodes _n+1 The starting time of the broadcast information sent by different slave nodes in the same sending period can be different, so that the probability of collision of the broadcast information sent by different slave nodes is favorably reduced.

In combination with the first and second aspects described above, in certain implementations,

or, A _n <And P. Or,

or, A _n P is less than or equal to P. Or,

or,

or,

or,

based on the scheme, the probability of continuous collision of the broadcast information sent by the plurality of slave nodes is favorably reduced.

With reference to the first and second aspects above, in certain implementations, H satisfies: h ═ k × 62.5us, k being a positive integer.

With reference to the first and second aspects, in some implementations, N satisfies: n × 256, l is a positive integer.

In a third aspect, a communication device is provided, which is configured to perform the method provided in the first aspect. In particular, the communication device may comprise means for performing the method provided by the first aspect.

In a fourth aspect, a communication device is provided, which is configured to perform the method provided by the second aspect. In particular, the communication device may comprise means for performing the method provided by the second aspect.

In a fifth aspect, a communications apparatus is provided that includes at least one processor. The at least one processor is coupled to the 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. Optionally, the communication device further comprises at least one memory. Optionally, the communication device further comprises a communication interface, the at least one processor being coupled to the communication interface for inputting and/or outputting information. The information includes at least one of instructions and data.

In one implementation, the communication device is a slave node, such as a mobile terminal. When the communication device is a slave node, the communication interface may be a transceiver, or an input/output interface.

In another implementation, the communication device is a chip or a system of chips. When the communication device is a chip or a system of chips, the communication interface may be an input/output interface, which may be an input/output interface, an interface circuit, an output circuit, an input circuit, a pin or related circuit on the chip or the system of chips, and the like. The processor may also be embodied as a processing circuit or a logic circuit.

In another implementation, the communication device is a chip or system of chips configured in the slave node.

Alternatively, the transceiver may be a transmit-receive circuit. Alternatively, the input/output interface may be an input/output circuit.

In a sixth aspect, a communications apparatus is provided that includes at least one processor. The at least one processor is coupled to the memory and is operable to execute instructions in the memory to implement the method of the second aspect or any of the possible implementations of the second aspect. Optionally, the communication device further comprises at least one memory. Optionally, the communication device further comprises a communication interface, the at least one processor being coupled to the communication interface for inputting and/or outputting information.

In one implementation, the communication device is a master node, such as a mobile terminal. When the communication device is a master node, the communication interface may be a transceiver, or an input/output interface.

In another implementation, the communication device is a chip or a system of chips. When 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 related circuit, etc. on the chip or the system of chips. The processor may also be embodied as a processing circuit or a logic circuit.

In another implementation, the communication device is a chip or system of chips configured in the master node.

In a seventh aspect, a chip is provided, which includes: at least one processor and a communication interface. The communication interface is configured to receive signals input to the chip or to output signals from the chip, and the processor is in communication with the communication interface and configured to implement the method according to the first aspect or any of the possible implementations of the first aspect, or the second aspect or any of the possible implementations of the second aspect, by logic circuits or executing code instructions.

In an eighth aspect, there is provided a communication apparatus comprising: at least one memory for storing computer instructions; at least one processor configured to execute computer instructions stored in the at least one memory to cause the communication apparatus to perform the method of any one of the above-described first aspect or any one of the above-described possible implementations, or to cause the communication apparatus to perform the method of any one of the above-described second aspect or any one of the above-described possible implementations.

A ninth aspect provides a computer readable storage medium having stored thereon a computer program which, when executed by a communication apparatus, causes the communication apparatus to implement the method of the first aspect or any possible implementation manner of the first aspect.

A tenth aspect provides a computer readable storage medium having stored thereon a computer program which, when executed by a communication apparatus, causes the communication apparatus to implement the method of the second aspect or any possible implementation of the second aspect.

In an eleventh aspect, there is provided a computer program product comprising: a computer program (which may also be referred to as code, or instructions), which when executed, causes a computer to perform the method of the first aspect or any of the possible implementations of the first aspect.

In a twelfth aspect, there is provided a computer program product comprising: a computer program (also referred to as code, or instructions), which when executed, causes a computer to perform the method of the second aspect or any of the possible implementations of the second aspect.

In a thirteenth aspect, a terminal device is provided, which includes the communication apparatus of the third aspect or the fourth aspect. For example, the terminal device may be a vehicle.

In a fourteenth aspect, a communication system is provided, comprising the aforementioned slave node and master node.

Drawings

FIG. 1 is a schematic diagram of a communication system suitable for use with embodiments of the present application;

FIG. 2 is a schematic diagram of an application scenario suitable for use with embodiments of the present application;

FIG. 3 is a schematic flow chart diagram of a communication method provided herein;

FIG. 4 is a schematic diagram of sending and scanning broadcast information as provided herein;

FIG. 5 is another schematic diagram of sending and scanning broadcast information as provided herein;

FIG. 6 is a schematic block diagram of a communication device provided herein;

fig. 7 is a schematic block diagram of another communication device provided herein.

Detailed Description

The technical solution in the present application will be described below with reference to the accompanying drawings.

The technical scheme of the embodiment of the application can be applied to various communication systems, for example: a fifth generation (5G) system or a New Radio (NR), a Long Term Evolution (LTE) system, an LTE Frequency Division Duplex (FDD) system, an LTE Time Division Duplex (TDD), a Universal Mobile Telecommunications System (UMTS), a short-range communication system, etc. The technical scheme of the embodiment of the application can also be applied to device-to-device (D2D) communication, machine-to-machine (M2M) communication, Machine Type Communication (MTC), and communication in a car networking system. The communication modes in the car networking system are collectively referred to as V2X (X represents anything), for example, the V2X communication includes: vehicle to vehicle (V2V), vehicle to roadside infrastructure (V2I), vehicle to pedestrian (V2P) or vehicle to network (V2N), etc.

In this application, the network device may be an evolved node B (eNB), a Radio Network Controller (RNC), a Node B (NB), a Base Station Controller (BSC), a base transceiver station (base transceiver station, BTS), a home base station (e.g., home evolved node B, or home node B, HNB), a baseband unit (BBU), an Access Point (AP), a wireless relay node, a wireless backhaul node, a Transmission Point (TP), or a transmission point (TRP) in a wireless fidelity (WIFI) system, and may also be an int 5G, such as NR, a gbb in the system, or a transmission point (TRP or TP), one or a group of base stations in the system may further include an antenna (NB), and may further constitute a panel of the network, such as a baseband unit (BBU), or a Distributed Unit (DU). It should be understood that the network device may be a base station in a 5.5G or 6G system, or may be a device with management function (e.g., a master node, etc.) in a current or future short-range communication system.

In this application, a terminal device may also be referred to as a User Equipment (UE), an access terminal, a subscriber unit, a subscriber station, a mobile station, a remote terminal, a mobile device, a user terminal, a wireless communication device, a user agent, or a user equipment. The terminal device in the embodiment of the present application may be a vehicle, an in-vehicle device, an off-vehicle device, a handheld terminal (e.g., a mobile phone (mobile phone) or a vehicle key, etc.), a tablet computer (Pad), a computer with a wireless transceiving function, a wearable device (e.g., a Virtual Reality (VR) terminal device, an Augmented Reality (AR) terminal device or an earphone, etc.), a wireless terminal in industrial control (industrial control), a wireless terminal in unmanned driving (self), a wireless terminal in remote medical (remote medical), a wireless terminal in smart grid, a wireless terminal in transportation safety, a wireless terminal in smart city (smart home), a wireless terminal in smart home (smart home) (e.g., smart home), and the like. It should be understood that the terminal device may be any type of terminal. Further, the terminal device may be an existing or future terminal device (e.g. slave node) with a short-range communication function, 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 use in embodiments of the present application. Referring to fig. 1, the communication system 100 includes a master node 110 and at least one slave node (e.g., slave nodes 120 through 160 shown in fig. 1).

The master node and the slave nodes are two types of nodes that are logically functionally distinct. The master node manages the slave nodes, has the function of allocating resources of a communication domain and is responsible for allocating the resources to the slave nodes; the slave node listens to the schedule of the master node and communicates with the master node using the resources allocated by the master node. The master node and the slave nodes are located in a communication domain.

Wherein, a communication domain is formed by a group of communication nodes with communication relations and communication links among the communication nodes. Wherein one apparatus or device may be in multiple communication domains. For example, when the mobile phone and the earphone perform wireless communication, the mobile phone is in a communication domain a including the mobile phone and the earphone, the mobile phone is a master node in the communication domain a, and the earphone is a slave node; then, when the mobile phone detects a Cockpit Domain Controller (CDC) and establishes a wireless connection with the CDC, the mobile phone is also in a communication domain b including the mobile phone and the CDC, the CDC is a master node in the communication domain b, the mobile phone is a slave node, and the mobile phone listens to the schedule of the CDC. Other slave nodes, such as a car speaker, a microphone, etc., may also be included in the communication domain b.

In the application, the slave node sends the broadcast information, and the master node can scan the broadcast information. It is to be understood that the master node may also be referred to as a receiving device, a first device, a G node, or the like, and the slave node may also be referred to as a transmitting device, a second device, a T node, or the like.

In one possible embodiment, the master node may be a network device and the slave nodes may be terminal devices.

In another possible embodiment, both the master node and the slave node may be terminal devices. For example, the master node is a mobile phone, and the slave nodes are vehicles, earphones, vehicle keys or vehicle-mounted devices.

The embodiment of the application is not limited to the application scene, and the types of the master node and the slave node are not limited. The master node and the slave node in fig. 1 are both exemplified by terminal devices.

Alternatively, the communication system 100 may be a short-range communication system, for example, the master node and the slave node have short-range communication functions, but the present application is not limited thereto.

Fig. 2 is an example of an in-vehicle wireless communication scenario suitable for use with embodiments 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 of the embodiment of the present application is not limited to the in-vehicle communication scenario shown in fig. 2. Referring to fig. 2, the first communication domain includes a first device and at least one third device. Wherein the first device may be a master node and the third device may be a slave node. The first device may be a mobile phone and the third device may be a wearable device such as an earphone or a bracelet. The second communication domain includes the second device and at least one fourth device. Wherein 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, or the like. The third communication domain includes a fifth device and at least one sixth device. Wherein the fifth apparatus may be a master node and the sixth apparatus may be a slave node. The fifth device may be an in-vehicle control device of the keyless system. The sixth device may be a smart car key, or a mobile phone device having a car key function.

In a point-to-point communication scenario, the master node may continuously scan (listen) for broadcast information on the broadcast channel, which may ensure that the master node receives broadcast information sent by the slave node. However, in a point-to-multipoint communication scenario, when the service of the master node is busy, the master node cannot continuously scan the broadcast channel, which may result in that the master node cannot receive the broadcast information sent by the slave node for a long time.

In view of this, the present application provides a communication method, which is beneficial to improving the transmission performance of broadcast information and ensuring that a master node can scan the broadcast information sent by a slave node within a certain time duration.

The scheme provided by the application is explained in the following with reference to the attached drawings.

Fig. 3 is a schematic flow chart of a communication method 300 according to an embodiment of the present application. The steps in the method 300 are explained below.

S310, the slave node acquires the sending period duration.

The slave node transmits the broadcast information at a first time S320.

The first time is the starting time for transmitting the broadcast information in the nth transmission period. That is, in the nth transmission period, the slave node starts transmitting the broadcast information at the first time. For example, the slave node may use any time as the starting time of the first transmission period.

The transmission cycle duration T satisfies formula (1):

T＝N*H， (1)

first time t _n Satisfies formula (2):

t _n ＝T _n +M _n *H， (2)

M _n+1 and M _n Satisfies formula (3):

M _n+1 ＝mod(M _n +A _n ，P)， (3)

in the above equation, mod () represents the remainder, T _n Is the starting time of the nth sending period, and n is a positive integer.

Specifically, H is a time length unit, H is a positive number, and N is a positive integer. H may be protocol specific or preconfigured, N may be protocol specific, preconfigured, or slaveSelected from a set of optional parameters specified or pre-configured by the protocol. In S310, the slave node may determine T from N and H. M ₁ Is a non-negative integer less than N. M ₁ May be randomly generated from the node, protocol specified, pre-configured, or selected from a set of optional parameters that the node specifies or pre-configures from the protocol. P is a divisor of N, P > M ₁ P may be protocol specified or pre-configured. A. the _n Is a positive integer, and A _n May be determined by the slave node. M _n Offset information which may be referred to as the nth transmission period, P may be referred to as a broadcast parameter, A _n May be referred to as an offset parameter for the nth transmission period, but it should be understood that M is _n P and A _n Any one of the parameters may be other names, or no name, indicating only one parameter.

In the present application, the broadcast information may be used for broadcasting data, and may also be used for discovering or establishing a connection between nodes.

S330, the main node determines a scanning window.

S340, the master node scans (listens) for broadcast information in the scanning window.

The time length of the scanning window is H, and the time difference between the starting times of two continuous scanning windows is Q H. Q is a divisor of P, or P is a multiple of Q, and Q is a positive integer. Q may be protocol specified, pre-configured, or the master node is selected from a protocol specified or pre-configured set of optional parameters.

It should be understood that the master node scans the broadcast information in the scanning window may be understood as the master node attempting to receive the broadcast information in the scanning window and determining whether there is broadcast information transmitted with a time within the scanning window as a start time.

Alternatively, the master node may receive the broadcast information at the first time in S340. That is, the first time instant is within the scanning window.

It should be noted that, in the present application, the master node may scan the broadcast information only in the scanning window, or may scan the broadcast information in other time periods, which is not limited in the present application.

In addition, the execution time of S330 is not limited in the present application, and S330 may be executed before S320 or after S320.

Referring to fig. 4, fig. 4 shows an example in which a slave node transmits broadcast information and a master node receives the broadcast information.

As shown in FIG. 4, during the nth transmission period, the slave node is at t _n Starting to send broadcast information at the moment; in the (n + 1) th transmission period, the slave node is at t _n+1 Starting to send broadcast information at the moment; in the (n + 2) th transmission period, the slave node is at t _n+2 Starting to send broadcast information at the moment; in the (n + 3) th transmission period, the slave node is at t _n+3 The broadcast information is transmitted from time to time. The master node scans for broadcast information in each scanning window. In the example shown in FIG. 4, the master node may scan to the slave node at t _n Broadcast information that is transmitted from time to time.

It should be noted that the parameters (including all optional values in the optional parameter set) specified or preconfigured by the protocol in the present application may be specified or preconfigured by the protocol, or directly calculated according to other parameters specified or preconfigured by the protocol. For example, P may be protocol specified or pre-configured, or may be determined by the slave node based on N. In addition, the parameter determined by the node (master node or slave node) may be directly determined, or may be determined by determining one or more other parameters, and determining the parameter according to the one or more parameters, optionally one or more parameters specified or preconfigured by the protocol. The protocols described herein include technical standards, regulations, and the like.

The following is a description of possible implementations of the present application.

Alternatively, A _n Are prime numbers.

Based on the scheme, different prime numbers are selected as A from different slave nodes _n M in formula (3) corresponding to different slave nodes _n+1 The starting time of the broadcast information sent by different slave nodes in the same sending period can be different, so that the probability of collision of the broadcast information sent by different slave nodes is favorably reduced.

Alternatively,

or, A _n <And P. Or,

or, A _n P is less than or equal to P. Or,

or,

or,

or,

In a possible implementation manner, values of offset parameters corresponding to W consecutive transmission periods are the same, and W is greater than or equal to P.

For example, A _n+k*w To A _n+(k+1)*w-1 Can be the same, k is greater than or equal toAn integer equal to 0.

Based on the scheme, the offset information corresponding to the P pieces of broadcast information which are sent by the slave node in the P sending periods is different, so that the starting time of sending at least one piece of broadcast information in the P pieces of broadcast information is in the scanning window of the master node, and the master node can scan the P pieces of broadcast information. For example, if there is no collision among the broadcast messages sent by multiple slave nodes, at least one broadcast message of the P broadcast messages sent by the slave nodes may be scanned by the master node.

For example, referring to fig. 5, assume N-32, M ₁ ＝1，A ₁ ＝A ₂ ＝A ₃ ＝A ₄ 7, 16 and 8. Then the user can either, for example,

when n is equal to 1, t ₁ ＝T ₁ +M ₁ *H＝T ₁ +H，M ₂ ＝mod(M ₁ +A ₁ ，P)＝8；

When n is 2, t ₂ ＝T ₂ +M ₂ *H＝T ₂ +8*H，M ₃ ＝mod(M ₂ +A ₂ ，P)＝15；

When n is 3, t ₃ ＝T ₃ +M ₃ *H＝T ₃ +15*H，M ₄ ＝mod(M ₃ +A ₃ ，P)＝6；

When n is 4, t ₄ ＝T ₄ +M ₄ *H＝T ₄ +6*H。

As can be seen from fig. 5, the master node may scan the broadcast information transmitted by the slave node in the first transmission period and the third transmission period.

Further, the value of the offset parameter corresponding to W consecutive transmission periods may be a random number or generated according to a random parameter. That is, the offset parameters corresponding to the W consecutive transmission periods have the same value, and the value is a random number or generated according to a random parameter.

Alternatively, the value of the offset parameter corresponding to W consecutive transmission periods may be selected from a set (referred to as a first set). That is to say, the values of the offset parameters corresponding to the W consecutive transmission periods are the same, and the value is one element in the first set. The selection may be random or according to a certain rule.

For example, the first set may be preconfigured or specified by a protocol or may be obtained by other means. For example, the first set can include more than

And less than P, or the first set may include all integers greater than

And less than all prime numbers of P.

Based on the scheme, different slave nodes can independently select respective offset parameters from the respective corresponding first sets, which is beneficial to reducing the probability of collision of broadcast information sent by different slave nodes.

It should be understood that the first set corresponding to different slave nodes may be the same or different, and the application is not limited thereto.

Illustratively, the number of elements in the first set is less than or equal to P.

Further, any two elements in the first set are different values left over P.

For example, the P elements are all greater than

The smaller number of P in prime numbers of (a). That is, will be greater than

The P elements may be the first P prime numbers of the prime numbers arranged in order from small to large.

When the offset parameter is selected from a set having a number of elements greater than P, at least two elements in the set have the same value for the remainder of P. Then, when two slave nodes respectively select the offset parameters whose remainder for P is the same value, although the selected offset parameters are different, the broadcast messages transmitted by the two slave nodes may continuously collide. When the offset parameter is selected from a set with the number of elements less than or equal to P, if the values obtained by the balance of any two elements in the set on P are different, the two slave nodes select different offset parameters, and the continuous collision of the transmitted broadcast information can be avoided.

In a possible implementation manner, the value of the offset parameter corresponding to the W consecutive transmission periods may be a random number or generated according to a random parameter, and the value of the offset parameter corresponding to the W consecutive transmission periods before or after the W consecutive transmission periods may be a random number or generated according to a random parameter.

That is, the value of the offset parameter corresponding to each continuous W transmission periods may be a random number or generated according to a random parameter.

For example, the slave node may re-determine the offset parameter every W consecutive transmission periods.

Further, 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. For example, A _n To A _{n + w-1 of} A value of 1, A _n+w To A _n+2w-1 Has a value of 2, A _n+2w To A _n+3w-1 The value of (A) is 1, etc.

Based on the scheme, because the values of the offset parameters corresponding to two continuous W transmission periods of the slave node can be different random numbers or generated according to different random parameters, the probability that the values of the offset parameters corresponding to a plurality of continuous W transmission periods of different slave nodes are all the same can be reduced, and thus the probability that the broadcast information sent by different slave nodes continuously collides can be reduced.For example, A of two slave nodes _n To A _n+w-1 If the values of the two slave nodes are the same, the broadcast messages sent by the two slave nodes in the (n) th to (n + w-1) th sending periods may collide, and if the two slave nodes select a _n+w To A _n+2w-1 The values of the two slave nodes are different, so that the broadcast information sent by the two slave nodes in the (n + w) th to (n +2 w-1) th sending periods is favorably ensured not to collide.

Or, the values of the offset parameters corresponding to the W consecutive transmission periods are selected from the first set, and the values of the offset parameters corresponding to the W consecutive transmission periods before or after the W consecutive transmission periods are selected from the first set.

That is, the value of the offset parameter corresponding to each W consecutive transmission periods may be selected from the first set.

Further, 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 the scheme, because the values of the offset parameters corresponding to two consecutive W transmission periods of the slave node may be different elements in the first set, the probability that the values of the offset parameters corresponding to a plurality of consecutive W transmission periods of different slave nodes are all the same can be reduced, and thus the probability that the broadcast information sent by different slave nodes continuously collides can be reduced.

Optionally, P is a divisor of W, or W is a multiple of P. It is understood that P may be equal to W.

Illustratively, P ═ W ═ Q.

Based on the scheme, under the condition that the broadcast information sent by the plurality of slave nodes does not collide, the method is beneficial to ensuring that at least W/P broadcast information in the W broadcast information sent by the slave nodes in the continuous W sending periods has the sending starting time in the scanning window of the master node, and then at least W/P broadcast information is scanned by the master node.

Optionally, W may be protocol specified or preconfigured, or may be determined from the node.

For example, the slave node may determine the value of W according to the value of P, for example, W ═ P or W ═ 2 × P.

Optionally, H satisfies: h ═ k × 62.5us, k being a positive integer. k may be protocol specified or pre-configured.

For example, H ═ 62.5 us.

Optionally, N satisfies: n × 256, l is a positive integer. l may be protocol specified, preconfigured, or selected from a protocol specified or preconfigured set of optional parameters by the node.

For example, N is 256.

It should be understood that many variations of any of the equations involved in this application are possible, but any variations that satisfy the corresponding equations should fall within the scope of the present application. For example, equation (3) can be modified as: x P + M _n+1 ＝M _n +A _n Or (M) _n +A _n )/P＝X……M _n+1 These two variants of equation (3) are also intended to fall within the scope of protection of the present application.

It should also be understood that for the methods provided herein, the methods and operations implemented by the master node may also be implemented by components (e.g., chips or integrated circuits) available to the master node, the methods and operations implemented by the slave node may also be implemented by components (e.g., chips or integrated circuits) available to the slave node.

The method provided by the embodiment of the present application is described in detail above with reference to fig. 3 to 5. Hereinafter, a communication apparatus according to an embodiment of the present application will be described in detail with reference to fig. 6 and 7. It should be understood that the description of the apparatus embodiments corresponds to the description of the method embodiments, and therefore, for brevity, details are not repeated here, since the details that are not described in detail may be referred to the above method embodiments.

The scheme provided by the embodiment of the present application is introduced mainly from the perspective of interaction between nodes. It will be appreciated that each network element, e.g. a master node or master node, comprises corresponding hardware structures and/or software modules for performing the respective functions in order to implement the above-described functions. Those of skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as hardware or combinations of hardware and computer software. Whether a function is performed in hardware or computer software drives hardware depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.

In the embodiment of the present application, the main node or the main node may be divided into functional modules according to the above method example, for example, each functional module may be divided corresponding to each function, or two or more functions may be integrated into one processing module. The integrated module can be realized in a hardware mode, and can also be realized in a software functional module mode. It should be noted that, in the embodiment of the present application, the division of the module is schematic, and is only one logic function division, and there may be another division manner in actual implementation. The following description will be given taking the example of dividing each functional module corresponding to each function.

Fig. 6 is a schematic block diagram of a communication device provided in 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 1020 is mainly used for processing. The communication unit 1010 may also be referred to as a communication interface, a transceiving unit, or an input/output interface.

Optionally, the communication device 1000 may further include a storage unit, and the storage unit may be configured to store instructions and/or data, and the processing unit 1020 may read the instructions and/or data in the storage unit, so as to enable the communication device to implement the foregoing method embodiments.

In one design, the communication apparatus 1000 may be configured to perform the actions performed by the slave node in the foregoing method embodiments, in this case, the communication apparatus 1000 may be a slave node or a component configurable in the slave node, the communication unit 1010 is configured to perform the operations related to the transceiving of the slave node in the foregoing method embodiments, and the processing unit 1020 is configured to perform the operations related to the processing of the slave node in the foregoing method embodiments.

Based on this design, the communication device 1000 may implement the steps or flows corresponding to those performed by the slave node in the above method embodiments. In one example, the processing unit 1020 is configured to obtain a sending cycle duration T; the communication unit 1010 is used for, at a first time t _n And transmitting the broadcast information, wherein n is a positive integer. Wherein the first time t _n Satisfies the following conditions: t is t _n ＝T _n +M _n *H，T＝N*H；t _n For the starting time, T, of the transmission of the broadcast information in the nth transmission period _n Is the starting time of the nth transmission period, H is a time length unit, M ₁ Is a non-negative integer less than N, N is a positive integer, M _n Offset information for the nth transmission period, where M _n+1 And M _n Satisfies M _n+1 ＝mod(M _n +A _n P) the broadcast parameter P is a divisor of N, a _n Is the offset parameter corresponding to the nth sending period and is a positive integer, P > M ₁ And P is predefined or configured.

In another design, the communication apparatus 1000 may be configured to perform the actions performed by the master node in the foregoing method embodiments, in which case, the communication apparatus 1000 may be a master node or a component configurable in the master node, the communication unit 1010 is configured to perform the operations related to the transceiving of the master node side in the foregoing method embodiments, and the processing unit 1020 is configured to perform the operations related to the processing of the master node side in the foregoing method embodiments.

Based on this design, the communication apparatus 1000 may implement the steps or flows corresponding to the steps or flows performed by the master node in the above method embodiments. In one example, a processing unit 1020 for determining a scanning window; a communication unit 1010, configured to scan broadcast information in the scanning window. The time length of the scanning window is H, the time difference between the start times of two consecutive scanning windows is Q × H, H is a time length unit, Q is a positive integer, Q is a divisor of a broadcast parameter P, and P is predefined or configured.

Optionally, the communication unit 1010 is specifically configured to: at a first time t _n Broadcast information is received, and n is a positive integer. It is composed ofIn (1), the first time t _n Satisfies the following conditions: t is t _n ＝T _n +M _n *H，T＝N*H；t _n Starting time, T, for transmitting broadcast information in the nth transmission period _n Is the starting time of the nth transmission period, M ₁ Is a non-negative integer less than N, N is a positive integer, M _n Offset information for the nth transmission period, where M _n+1 And M _n Satisfies M _n+1 ＝mod(M _n +A _n P) the broadcast parameter P is a divisor of N, a _n Is an offset parameter corresponding to the nth transmission period and is a positive integer, P > M ₁ 。

The following are some possible implementations based on the two designs described above.

Optionally, values of offset parameters corresponding to W consecutive sending periods are the same, and W is greater than or equal to P.

Optionally, the value of the offset parameter corresponding to the W consecutive sending periods is a random number or generated according to a random parameter.

Optionally, a value of the offset parameter corresponding to the W consecutive transmission periods before or after the W consecutive transmission periods is a random number or generated according to a random parameter.

Optionally, the value of the offset parameter corresponding to W consecutive transmission periods is selected from a set whose element number is less than or equal to P.

Optionally, the value of the offset parameter corresponding to the W consecutive transmission periods before or after the W consecutive transmission periods is selected from the above set.

Optionally, any two elements in the set are different values left over for P.

Optionally, P is a divisor of W.

Alternatively, A _n Are prime numbers.

Alternatively,

and/or, A _n ≤P。

Optionally, H satisfies: h ═ k × 62.5us, k being a positive integer.

Optionally, N satisfies: n is l 256, and l is a positive integer.

It should be understood that the specific processes of the units for executing the corresponding steps are already described in detail in the above method embodiments, and therefore, for brevity, detailed descriptions thereof are omitted.

Fig. 7 is a further schematic block diagram of a communication device 2000 provided in an embodiment of the present application. As shown in fig. 7, the communication device 2000 includes at least one processor 2001 and a communication interface 2003. Optionally, the communication device 2000 may further include at least one memory 2002.

The specific connection medium between the processor 2001, the memory 2002, and the communication interface 2003 is not limited in the embodiment of the present application. For example, the memory 2002, the processor 2001, and the communication interface 2003 may be connected via a bus, or may be connected via another connection medium.

The processor 2001 may have a processing function. A communication interface 2003 for transceiving information, such as for transmitting or receiving broadcast information. The memory 2002 may store programs (or instructions).

In one design, processor 2001 may perform the processing-related steps performed by the master node in the above-described method embodiments (e.g., step S330), and communication interface 2003 may perform the transceiving-related steps performed by the master node in the above-described method embodiments (e.g., step S340).

In another design, processor 2001 is configured to perform the processing-related steps performed by the slave node in the above method embodiment (e.g., step S310), and communication interface 2003 performs the transceiving-related steps performed by the slave node in the above method embodiment (e.g., step S320).

In one design, the memory 2002 stores programs, the processor 2001 is configured to execute the programs stored in the memory 2002, execution of the programs stored in the memory 2002 is configured to enable the processor 2001 to execute the steps related to the processing performed by the master node in the above method embodiment (as in step S330), and execution of the programs stored in the memory 2002 is configured to enable the processor 2001 to control the communication interface 2003 to execute the steps related to the transmission and reception performed by the master node in the above method embodiment (as in step S340).

In another design, a program is stored in the memory 2002, the processor 2001 is configured to execute the program stored in the memory 2002, the execution of the program stored in the memory 2002 is configured to enable the processor 2001 to execute the steps related to the processing executed by the slave node in the above method embodiment (as in step S310), and the execution of the program stored in the memory 2002 is configured to enable the processor 2001 to control the communication interface 2003 to execute the steps related to the transmission and reception executed by the slave node in the above method embodiment (as in step S320).

The embodiment of the application also provides a processing device which comprises a processor and an interface. The processor may be adapted to perform the method of the above-described method embodiments.

It should be understood that the processing means may be a chip. For example, the processing device may be a Field Programmable Gate Array (FPGA), an Application Specific Integrated Circuit (ASIC), a system on chip (SoC), a Central Processing Unit (CPU), a Network Processor (NP), a digital signal processing circuit (DSP), a Microcontroller (MCU), a Programmable Logic Device (PLD), or other integrated chips.

The memory in the embodiments of the present application may be either volatile memory or nonvolatile memory, or may include both volatile and nonvolatile memory. The non-volatile memory may be a read-only memory (ROM), a Programmable ROM (PROM), an Erasable PROM (EPROM), an electrically Erasable EPROM (EEPROM), or a flash memory. Volatile memory can be Random Access Memory (RAM), which acts as external cache memory. By way of example, but not limitation, many forms of RAM are available, such as Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), Synchronous Dynamic Random Access Memory (SDRAM), double data rate SDRAM, enhanced SDRAM, SLDRAM, Synchronous Link DRAM (SLDRAM), and direct rambus RAM (DR RAM). It should be noted that the memory of the systems and methods described herein is intended to comprise, without being limited to, these and any other suitable types of memory.

The processor in the embodiment of the present application may be an integrated circuit chip having signal processing capability. In implementation, the steps of the above method embodiments may be performed by integrated logic circuits of hardware in a processor or instructions in the form of software. The processor described above may be a general purpose processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components. The various methods, steps, and logic blocks disclosed in the embodiments of the present application may be implemented or performed. 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 connection with the embodiments of the present application may be directly implemented by a hardware decoding processor, or implemented by a combination of hardware and software modules in the decoding processor. The software modules may be located in ram, flash, rom, prom, or eprom, registers, etc. as is well known in the art. The storage medium is located in a memory, and a processor reads information in the memory and completes the steps of the method in combination with hardware of the processor.

The present application also provides a computer-readable medium having stored thereon a computer program which, when executed by a computer, performs the functions of any of the method embodiments described above.

The present application also provides a computer program product which, when executed by a computer, implements the functionality of any of the method embodiments described above.

The present application also provides a chip, including: at least one processor and a communication interface for receiving signals input to the chip or for outputting signals from the chip, the processor being in communication with the communication interface and being configured to implement the functions of any of the above method embodiments by logic circuits or executing code instructions.

The application also provides a terminal device comprising the communication device shown in fig. 6 or fig. 7. The terminal device can be any type of terminal such as a handheld terminal (such as a mobile phone, a game machine and the like), a wearable device (such as an earphone, an AR/VR device), a vehicle, an on-board device or a smart home. Optionally, the terminal device has a short-range communication function.

The present application also provides a system comprising one or more master nodes and one or more slave nodes as described above.

In the above embodiments, all or part of the implementation may be realized by software, hardware, firmware, or any combination thereof. When implemented in software, may 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 loaded and executed on a computer, cause the processes or functions described in accordance with the embodiments of the application to occur, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored on a computer readable storage medium or transmitted from one computer readable storage medium to another, for example, from one website, computer, server, or data center to another website, computer, server, or data center via wire (e.g., coaxial cable, fiber optic, Digital Subscriber Line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device, such as a server, a data center, etc., that incorporates one or more of the available media. The usable medium may be a magnetic medium (e.g., a floppy disk, a hard disk, a magnetic tape), an optical medium (e.g., a Digital Video Disk (DVD)), or a semiconductor medium (e.g., a Solid State Disk (SSD)), among others.

As used in this specification, the terms "component," "module," "system," and the like are intended to refer to a computer-related entity, either hardware, firmware, a combination of hardware and software, or software in execution. For example, a component may be, but is not limited to being, a process running on a processor, an object, an executable, a thread of execution, a program, or a computer. By way of illustration, both an application running on a computing device and the computing device can be a component. One or more components may reside within a process or thread of execution and a component may be localized on one computer and distributed between 2 or more computers. In addition, these components can execute from various computer readable media having various data structures stored thereon. The components may communicate by way of local or remote processes such as in accordance with a signal having one or more data packets (e.g., data from two components interacting with another component in a local system, distributed system, or across a network such as the internet with other systems by way of the signal).

It should be appreciated that reference throughout this specification to "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the present application. Thus, the various embodiments are not necessarily referring to the same embodiment throughout the specification. Furthermore, the particular features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.

It should be understood that, in the embodiment of the present application, the numbers "first" and "second" … are only used for distinguishing different objects, such as for distinguishing different network devices, and do not limit the scope of the embodiment of the present application, and the embodiment of the present application is not limited thereto.

It should also be understood that, in this application, "when …", "if" and "if" all refer to the fact that a network element performs a corresponding process under certain objective circumstances, and are not limiting times, and do not require any judgment when the network element is implemented, nor do they imply that other limitations exist.

It is also understood that, in the present application, "at least one" means one or more, "a plurality" means two or more.

It should also be understood that in the embodiments of the present application, "B corresponding to a" means that B is associated with a, from which B can be determined. It should also be understood that determining B from a does not mean determining B from a alone, but may be determined from a and/or other information.

It should also be understood that the term "and/or" herein is merely one type of association relationship that describes an associated object, meaning that three relationships may exist, e.g., a and/or B, may represent: a exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" herein generally indicates that the former and latter related objects are in an "or" relationship.

Items appearing in this application as similar to "include one or more of the following: the meaning of the expressions A, B, and C "generally means that the item may be any of the following, unless otherwise specified: a; b; 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 C, C and C; c, C and C, and other combinations of A, B and C. The above description is made by taking 3 elements of a, B and C as examples of optional items of the item, when the expression "item includes at least one of the following: a, B, … …, and X ", i.e., more elements in the expression, then the items to which the item may apply may also be obtained according to the aforementioned rules.

It is understood that, in the embodiments of the present application, a master node and/or a slave node may perform some or all of the steps in the embodiments of the present application, and these steps or operations are merely examples, and the embodiments of the present application may also perform other operations or various operation variations. Further, the various steps may be performed in a different order presented in the embodiments of the application, and not all operations in the embodiments of the application may be performed.

Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.

It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.

In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.

The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.

In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit.

The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solutions of the present application or portions thereof that substantially contribute to the prior art may be embodied in the form of a software product, which is stored in a storage medium and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the methods described in the embodiments of the present application. And the aforementioned storage medium includes: various media capable of storing program codes, such as a U disk, a removable hard disk, a read-only memory ROM, a random access memory RAM, a magnetic disk, or an optical disk.

The above description is only for the specific embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present application, and shall be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims

1. A method of communication, comprising:

acquiring a sending period duration T from a node;

the slave node generates M ₁ And A _n ；

The slave node is at a first time t _n Sending broadcast information, wherein n is a positive integer;

wherein the first time t _n Satisfies the following conditions: t is t _n ＝T _n +M _n *H，T＝N*H；

t _n For the starting time, T, of the transmission of the broadcast information in the nth transmission period _n Is the starting time of the nth transmission period, H is a time length unit, M ₁ Is a non-negative integer less than N, N is a positive integer, M _n An offset information for the nth transmission periodIn which M is _n+1 And M _n Satisfies M _n+1 ＝mod(M _n +A _n P), mod () represents a divisor, with the broadcast parameter P being a divisor of N, a _n Is the offset parameter corresponding to the nth sending period and is a positive integer, P > M ₁ And P is predefined or configured.

2. The method of claim 1, wherein offset parameters corresponding to W consecutive transmission periods have the same value, and W is greater than or equal to P.

3. The method of claim 2, wherein values of the offset parameters corresponding to the W consecutive transmission periods are random numbers or are generated according to a random parameter.

4. The method of claim 3, wherein values of offset parameters corresponding to the W consecutive transmission periods before or after the W consecutive transmission periods are random numbers or generated according to a random parameter.

5. The method of claim 2, wherein the offset parameter for the W consecutive transmission periods is selected from a set having a number of elements less than or equal to P.

6. The method of claim 5, wherein any two elements in the set differ in value by being left over on P.

7. The method of any one of claims 2 to 6, wherein P is a divisor of W.

8. The method of any one of claims 1 to 6, wherein A is _n Are prime numbers.

9. The method of any one of claims 1 to 6, wherein the method is carried out in a single vessel，

And/or, A _n ≤P。

10. The method of any one of claims 1 to 6, wherein H satisfies: h ═ k × 62.5us, k being a positive integer.

11. The method of any one of claims 1 to 6, wherein N satisfies: n × 256, l is a positive integer.

12. A method of communication, comprising:

the main node determines a scanning window;

the main node scans broadcast information in the scanning window, wherein the time length of the scanning window is H, the time difference between the starting times of two continuous scanning windows is Q & ltH & gt, H is a time length unit, Q is a positive integer, Q is a divisor of a broadcast parameter P, and P is predefined or configured;

the main node scans broadcast information in the scanning window, and the method comprises the following steps:

the master node being at a first time t _n Receiving broadcast information, wherein n is a positive integer;

t _n For the starting time, T, of the transmission of the broadcast information in the nth transmission period _n Is the starting time of the nth transmission period, M ₁ Is a non-negative integer less than N, M ₁ Is generated from a node, N is a positive integer, M _n Offset information for the nth transmission period, where M _n+1 And M _n Satisfies M _n+1 ＝mod(M _n +A _n P), mod () represents a divisor, with the broadcast parameter P being a divisor of N, a _n Is an offset parameter corresponding to the nth transmission period and is a positive integer, A _n Is generated from a node, P > M ₁ 。

13. The method of claim 12, wherein values of offset parameters corresponding to W consecutive transmission periods are the same, W ≧ P.

14. The method of claim 13, wherein P is a divisor of W.

15. The method of any one of claims 12 to 14, wherein a is _n Are prime numbers.

16. The method of any one of claims 12 to 14,

and/or, A _n ≤P。

17. The method of any one of claims 12 to 14, wherein H satisfies: h ═ k × 62.5us, k being a positive integer.

18. The method of any one of claims 12 to 14, wherein N satisfies: n × 256, l is a positive integer.

19. A communications apparatus, comprising:

the processing unit is used for acquiring the sending period duration T;

the processing unit is also used for generating M ₁ And A _n ；

A communication unit for at a first time t _n Sending broadcast information, wherein n is a positive integer;

t _n Starting time, T, for transmitting broadcast information in the nth transmission period _n Is the starting time of the nth transmission period, H isUnit of time length, M ₁ Is a non-negative integer less than N, N is a positive integer, M _n Offset information for the nth transmission period, where M _n+1 And M _n Satisfies M _n+1 ＝mod(M _n +A _n P), mod () represents a divisor, with the broadcast parameter P being a divisor of N, a _n Is the offset parameter corresponding to the nth sending period and is a positive integer, P > M ₁ And P is predefined or configured.

20. The apparatus of claim 19, wherein values of offset parameters corresponding to W consecutive transmission periods are the same, W ≧ P.

21. The apparatus of claim 20, wherein values of the offset parameters corresponding to the W consecutive transmission periods are random numbers or are generated according to a random parameter.

22. The apparatus of claim 21, wherein values of offset parameters corresponding to W consecutive transmission periods before or after the W consecutive transmission periods are random numbers or generated according to a random parameter.

23. The apparatus of claim 20, wherein values of the offset parameter for the W consecutive transmission periods are selected from a set having a number of elements less than or equal to P.

24. The apparatus of claim 23, wherein any two elements in the set differ in value by being left over on P.

25. The apparatus of any one of claims 20 to 24, wherein P is a divisor of W.

26. The apparatus of any one of claims 19 to 24, wherein a is _n Are prime numbers.

27. The apparatus of any one of claims 19 to 24,

and/or, A _n ≤P。

28. The apparatus of any one of claims 19 to 24, wherein H satisfies: h ═ k × 62.5us, k being a positive integer.

29. The apparatus of any one of claims 19 to 24, wherein N satisfies: n is l 256, and l is a positive integer.

30. A communications apparatus, comprising:

a processing unit for determining a scanning window;

the communication unit is used for scanning the broadcast information in the scanning window, wherein the time length of the scanning window is H, the time difference between the starting times of two continuous scanning windows is Q & ltH & gt, H is a time length unit, Q is a positive integer, Q is a divisor of a broadcast parameter P, and P is predefined or configured;

the communication unit is specifically configured to:

at a first time t _n Receiving broadcast information, wherein n is a positive integer;

31. The apparatus of claim 30, wherein values of offset parameters corresponding to W consecutive transmission periods are the same, W ≧ P.

32. The apparatus of claim 31, wherein P is a divisor of W.

33. The device of any one of claims 30 to 32, wherein a is _n Are prime numbers.

34. The apparatus of any one of claims 30 to 32,

and/or, A _n ≤P。

35. The apparatus of any one of claims 30 to 32, wherein H satisfies: h ═ k × 62.5us, k being a positive integer.

36. The apparatus of any one of claims 30 to 32, wherein N satisfies: n is l 256, and l is a positive integer.

37. A communications apparatus, comprising:

at least one memory for storing computer instructions;

at least one processor configured to execute computer instructions stored in the at least one memory to cause the communication device to perform the method of any one of claims 1 to 11 or to cause the communication device to perform the method of any one of claims 12 to 19.

38. A chip, comprising: at least one processor and a communication interface for receiving signals input to the chip or for outputting signals from the chip, the processor being in communication with the communication interface and being operable by logic circuitry or executing code instructions for implementing the method of any of claims 1 to 11 or any of claims 12 to 18.

39. A computer-readable storage medium, having stored thereon a computer program which, when executed by a communication apparatus, causes the communication apparatus to perform the method of any of claims 1 to 11 or causes the communication apparatus to perform the method of any of claims 12 to 18.

40. A terminal device, characterized in that it comprises a communication means according to any one of claims 19 to 29 or according to any one of claims 30 to 36.