Neighbor node identification method and resource allocation method

Abstract

The application discloses a neighbor node identification method and a resource allocation method. The neighbor node identification method is suitable for a mesh self-organizing network and comprises the following steps: each node in the mesh self-organizing network sends data carrying a synchronization signal on a fixedly occupied resource block of the node; each node performs blind detection on a synchronization signal of other nodes in the mesh self-organizing network to obtain node information of a target node, wherein the node information comprises a time offset of the target node, a frequency offset of the target node and a signal strength between each node and the target node; each node adjusts a receiving configuration according to the obtained node information of the target node to receive a system information block 2 sent by the target node on the fixedly occupied resource block of the target node; and each node confirms the target node as a neighbor node after detecting that the system information block 2 sent by the target node is correct. Therefore, the neighbor node identification problem in the mesh self-organizing network can be effectively solved.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of communication technology, and in particular to a neighbor node identification method and a resource allocation method. BACKGROUND

[0002] Mesh self-organizing network is a kind of wireless network which dynamically establishes new links and connects with other nodes, which is completely different from traditional wireless network. The mesh self-organizing network has the advantages of self-organizing network, self-repair, multi-hop cascade, node self-management, etc., which can greatly reduce the cost and complexity of network deployment.

[0003] Since the mesh self-organizing network has mobility, for the current node, the non-one-hop node may move to its one-hop communication range. At this time, if the current node cannot identify the node that moves to its one-hop communication range in time, it may not only affect the communication of each other, but also affect the stability of the network.

[0004] Therefore, how to provide a solution to the problem of neighbor node identification in mesh self-organizing network is a problem that needs to be solved by the skilled in the art. SUMMARY

[0005] The embodiment of the present application provides a neighbor node identification method and a resource allocation method, which can solve the problem of neighbor node identification in mesh self-organizing network and allocate time-frequency resources for neighbor node identification.

[0006] In order to solve the above technical problems, the present application is implemented as follows:

[0007] The present application provides a neighbor node identification method, which is suitable for mesh self-organizing network. The neighbor node identification method comprises: each node in the mesh self-organizing network sends data carrying a synchronization signal (SS) on the resource block occupied by itself; each node performs blind detection on the synchronization signal of other nodes in the mesh self-organizing network to obtain node information of the target node, wherein the node information includes: time offset of the target node, frequency offset of the target node and signal strength between each node and the target node; each node adjusts the receiving configuration according to the obtained node information of the target node to receive the system information block 2 (SIB2) sent by the target node on the fixed occupied resource block; and each node confirms the target node as a neighbor node after detecting that the system information block 2 sent by the target node is correct.

[0008] This application provides a resource allocation method applicable to mesh self-organizing networks. The resource allocation method includes: obtaining non-one-hop neighbor information of the current node based on network information; identifying the current node's neighbor nodes based on the detection of synchronization signals and the reception of system information block 2; obtaining the current node's non-one-hop node set based on the non-one-hop neighbor information and the identified neighbor nodes, and confirming the time-frequency resources that need to be received based on the non-one-hop node set; and updating the current node's non-one-hop node set in real time and reconfirming the time-frequency resources that need to be received.

[0009] In the neighbor node identification method and resource allocation method of this application embodiment, neighbor nodes are identified in the mesh ad hoc network by detecting synchronization signals and receiving system information block 2 to ensure normal network communication. Furthermore, in the resource allocation method of this application embodiment, the time-frequency resources that need to be received are confirmed based on the real-time updated non-one-hop node set, thereby rationally allocating resources to configure the reception of synchronization signals and system information block 2. Attached Figure Description

[0010] The accompanying drawings, which are included to provide a further understanding of this application and form part of this application, illustrate exemplary embodiments and are used to explain this application, but do not constitute an undue limitation of this application. In the drawings:

[0011] Figure 1 This is a flowchart of an embodiment of the neighbor node identification method according to this application;

[0012] Figure 2 This is an embodiment of resource allocation for a minimum resource allocation period of this application;

[0013] Figure 3 This is a flowchart illustrating an embodiment of the resource allocation method according to this application;

[0014] Figure 4 for Figure 3 Flowchart of an embodiment of the method for confirming the time-frequency resources to be received based on a non-one-hop node set as described in step 230;

[0015] Figure 5 This is a flowchart of another embodiment of the resource allocation method according to this application;

[0016] Figure 6 for Figure 5 A flowchart illustrating an embodiment of the method for confirming the time-frequency resources to be received based on a non-one-hop node set, as described in step 230; and

[0017] Figure 7 For application Figure 5 A schematic diagram of an embodiment of the resource allocation method for identifying resource locations of neighboring nodes. Detailed Implementation

[0018] Embodiments of the present application will be described below with reference to the accompanying drawings. In these drawings, the same or similar components or method flows are denoted by the same reference numerals.

[0019] It must be understood that the terms "comprise", "include", etc. used in the present specification are intended to represent the presence of a specific technical feature, value, method step, operation process and / or component, but do not exclude the presence of more technical features, values, method steps, operation processes, components or any combination thereof.

[0020] Before describing the neighbor node identification method and resource allocation method of the present application, the terms used in the present application are described. The "non-one-hop neighbor node of a node" in the present application refers to a node that is not within the communication range of the node; the "node" refers to a node that executes the resource allocation method, and considers itself as the node when executing the resource allocation method; the "neighbor node of a node" refers to "one-hop neighbor node of the node", i.e. a node within the communication range of the node; the communication range of a single node in a mesh self-organizing network is "one hop".

[0021] Please refer to Figure 1 , which is an embodiment method flowchart of the neighbor node identification method according to the present application. As shown in Figure 1 , the neighbor node identification method is applicable to a mesh self-organizing network and includes: each node in the mesh self-organizing network sending data carrying a synchronization signal on a resource block fixedly occupied by itself (step 110); each node performing blind detection of the synchronization signal of other nodes in the mesh self-organizing network to obtain node information of a target node, wherein the node information includes: time offset of the target node, frequency offset of the target node, and signal strength between each node and the target node (step 120); each node adjusting the reception configuration according to the obtained node information of the target node to receive a system information block 2 sent by the target node on the fixedly occupied resource block (step 130); and each node confirming the target node as a neighbor node after detecting that the system information block 2 sent by the target node is error-free (step 140).

[0022] In step 110, the resource block fixedly occupied by each node refers to a corresponding default resource block fixedly occupied by each node in each minimum resource allocation period (RF_CYCLE), and the synchronization signal includes a primary synchronization signal (PSS) and a secondary synchronization signal (SSS). Specifically, please refer to Figure 2, which is an embodiment of resource allocation of a minimum resource allocation period of the present application, the mesh network comprises P+1 nodes, a minimum resource allocation period comprises M resource blocks, node N P A node occupies a resource block RF fixedly in each minimum resource allocation period P (for example, node N0 occupies resource block RF0 fixedly in each minimum resource allocation period), wherein M is a positive integer greater than P+1, P is the number of nodes in the mesh network, and M is greater than P+1. P The number of the resource block RF P is an integer greater than or equal to 0 (i.e., the node N P The number of the resource block RF P is numbered from 0). That is, the resource allocation period of each node in the mesh network is the same, and each node has a fixedly occupied resource block, and the fixedly occupied resource blocks of each node do not coincide with each other; it should be noted that the nodes more than two hops away from each node can reuse the fixedly occupied resource block of each node (i.e., the resource blocks within two hops of a single node cannot be reused), and the number of the minimum resource allocation period is also numbered from 0 (for example, minimum resource allocation period RF_CYCLE0, minimum resource allocation period RF_CYCLE1, and minimum resource allocation period RF_CYCLE2).

[0023] In step 120, when each node detects other nodes in the mesh network, it needs to perform blind detection of synchronization signals in the receiving frame occupied by other nodes; when the distance between each node and the corresponding node is far, it is expected that each node will not detect the signal sent by the corresponding node, and only when the corresponding node moves into the one-hop communication range of each node, each node will detect the signal sent by the corresponding node; after the corresponding node detects the synchronization signal, each node will obtain the node information of the corresponding node (i.e., the target node) detected, which includes the time offset and frequency offset of the target node and the signal strength between each node and the target node.

[0024] In step 130, since the target node is located within the one-hop communication range of each node (i.e., the target node is a neighbor node of each node), each node adjusts the receiving configuration according to the node information of the target node obtained (for example, adjusts the timing, frequency offset control word, and AGC gain according to the time offset / frequency offset / signal strength of the target node) to receive the system information block 2 sent by the target node on its fixedly occupied resource block.

[0025] In step 140, after each node receives the system information block 2 sent by the target node, the system information block 2 sent by the target node is detected (i.e. decoded), and when it is confirmed that the system information block 2 sent by the target node is correct, the target node is confirmed as a neighbor node. In an embodiment, the neighbor node identification method can further include: after each node confirms that the system information block 2 sent by the target node is correct, obtaining the frequency point, the physical cell identifier (PCI) of the target node, and the network resource information carried thereby.

[0026] In an embodiment, the neighbor node identification method can further include: periodically adjusting the time-frequency offset of each node. Thus, it can be ensured that the time offset of each node is not too large (e.g. not more than 1264ts), i.e. it can be ensured that the time offset of each node is within the synchronization signal detection range.

[0027] In an embodiment, the neighbor node identification method can further include: each node obtaining the node ID information of other nodes and the resource location at which other nodes fixedly send data. Specifically, since each node in the mesh self-organizing network receives data sent by other nodes on the resource blocks fixedly occupied by the other nodes, and each node can obtain network information of the mesh self-organizing network, each node can obtain the node ID information of other nodes and the resource location at which other nodes fixedly send data.

[0028] Please refer to Figure 3 which is an embodiment method flowchart of the resource allocation method according to the present application. As shown in Figure 3 , the resource allocation method is applicable to a mesh self-organizing network and includes: obtaining non-one-hop neighbor node information of the node according to network information (step 210); identifying neighbor nodes of the node based on detection of synchronization signals and reception of system information block 2 (step 220); obtaining a non-one-hop node set of the node based on the non-one-hop neighbor node information and the identified neighbor nodes, and confirming time-frequency resources to be received based on the non-one-hop node set (step 230); and updating the non-one-hop node set of the node in real time, and reconfirming the time-frequency resources to be received (step 240).

[0029] In step 210, the network information includes the number of nodes in the mesh self-organizing network and the number of hops of these nodes relative to the node; step 220 can be performed by a neighbor node identification method similar to the above-described steps 110 to 140 to identify neighbor nodes of the node, and will not be described here.

[0030] In an embodiment, since step 120 of the above-described neighbor node identification method is blind detection, it cannot consume too many resources, but at the same time it is necessary to ensure that the target node can be quickly identified after it moves into the one-hop communication range of each node, which requires a trade-off in the resource allocation strategy. Please refer toFigure 4 , which is Figure 3 an embodiment method flow chart of step 230 for confirming the time-frequency resources needed to be received based on the non-one-hop node set. As shown in Figure 4 , since the non-one-hop node set includes a plurality of non-one-hop nodes that do not support GPS positioning function, step 230 for confirming the time-frequency resources needed to be received based on the non-one-hop node set includes: assuming that a minimum resource allocation period is occupied by M resource blocks, the node N P fixedly occupies resource blocks RF P (step 232); confirming the minimum resource allocation period in which the synchronization signal of the non-one-hop node N x that does not support GPS positioning function is located (step 234); and confirming the minimum resource allocation period in which the system information block 2 of the non-one-hop node N x that does not support GPS positioning function is located (step 236).

[0031] In step 232, M is a positive integer greater than P+1, and P is the number of the resource blocks RF P occupied by the node N P and is an integer greater than or equal to 0.

[0032] In step 234, rf_cycle pss / sss % K cycle =x, rf_cycle pss / sss is the minimum resource allocation period in which the synchronization signal of the non-one-hop node N x that does not support GPS positioning function is located, K cycle is the number of detection periods and is a positive integer greater than or equal to 2 (for the node N x , since the node needs to receive the synchronization signal and the system information block 2 respectively, K cycle is a positive integer greater than or equal to 2), and x is the number of the non-one-hop node N x that does not support GPS positioning function and is an integer greater than or equal to 0. Since step 232 can obtain the resource blocks fixedly occupied by each node in each minimum resource allocation period, step 234 can obtain the minimum resource allocation period in which the synchronization signal of the node N x is located, therefore, the node can confirm in which resource block of which minimum resource allocation period the synchronization signal sent by the node N x is received (i.e. the resource position of the synchronization signal sent by the node N x is allocated). It should be noted that the smaller K cycle is, the higher the detection efficiency is, but the greater the impact on the service resources is.

[0033] In step 236, the node N xthe minimum resource allocation period in which the system information block 2 of the node N x sends the synchronization signal. x sends the system information block 2. x sends the system information block 2. x sends the system information block 2.

[0034] In step 240, since the nodes in the mesh self-organizing network can move their positions, it is necessary to update the set of non-one-hop nodes of the node in real time and reconfirm the time-frequency resources to be received so as to reasonably allocate resources to configure the reception of the synchronization signal and the system information block 2.

[0035] In an embodiment, step 230 can further include confirming the minimum identification period, wherein the minimum identification period (i.e., T min ) is the product of the detection period number (i.e., K cycle ) and the minimum resource allocation period (i.e., RF_CYCLE).

[0036] Please refer to Figure 5 , which is another embodiment method flowchart of the resource allocation method according to the present application. As shown in Figure 5 , the resource allocation method can further include that the node supports GPS positioning function, and when the GPS position distance between the non-one-hop node supporting the GPS positioning function and the node and the transmission power of the node determine that the non-one-hop node supporting the GPS positioning function is within the one-hop communication range of the node, the set of non-one-hop nodes of the node includes the non-one-hop node supporting the GPS positioning function (step 250).

[0037] In an embodiment, step 250 can include that the GPS position distance between the non-one-hop node supporting the GPS positioning function and the node is less than the product of the transmission power (i.e., P sendpower ) of the node and the correlation coefficient (i.e., a) of the transmission power and the propagation distance, and it is determined that the non-one-hop node supporting the GPS positioning function is within the one-hop communication range of the node. It should be noted that a depends on the channel used for communication and the environmental interference.

[0038] Please refer to Figure 6 , which is an embodiment method flowchart of confirming the time-frequency resources to be received based on the set of non-one-hop nodes according to step 230. Figure 5 . As shown inFigure 6 As shown, since the non-hop node set includes a plurality of non-hop nodes not supporting GPS positioning function and non-hop nodes supporting GPS positioning function, the step 230 of confirming the time-frequency resource needed to be received based on the non-hop node set can further include, in addition to the steps 232 to 236: confirming the minimum resource allocation period in which the synchronization signal of the non-hop node N y supporting GPS positioning function is located (step 238); and confirming the minimum resource allocation period in which the system information block 2 of the non-hop node N y supporting GPS positioning function is located (step 239).

[0039] In the step 238, when rf cur ≥ y, the minimum resource allocation period in which the synchronization signal of the non-hop node N y supporting GPS positioning function is located is the (rf_cycle cur + 1)th minimum resource allocation period; when rf cur < y, the minimum resource allocation period in which the synchronization signal of the non-hop node N y supporting GPS positioning function is located is the (rf_cycle cur )th minimum resource allocation period; wherein rf cur is the number of the resource block in which the current frame number is located, y is the number of the node N y supporting GPS positioning function and is an integer greater than or equal to 0, and rf_cycle cur is the minimum resource allocation period in which the current time point is located. That is, for the non-hop node N y supporting GPS positioning function, if the node enters the one-hop communication range of the node, the node immediately allocates the resource closest to the current time for detection. Since the step 232 can obtain the resource block fixedly occupied by each node in each minimum resource allocation period, and the step 238 can obtain the minimum resource allocation period in which the synchronization signal of the node N y is located, the node can confirm the resource block in which the synchronization signal sent by the node N y is received in which minimum resource allocation period (i.e. the resource position in which the synchronization signal sent by the node N y is allocated to be received).

[0040] In the step 239, the minimum resource allocation period in which the system information block 2 of the non-hop node N y supporting GPS positioning function is located is the same as the minimum resource allocation period in which the synchronization signal of the non-hop node N yThe synchronization signals of the nodes have the default interval between the minimum resource allocation periods. Since step 232 can obtain the resource blocks that each node occupies in each minimum resource allocation period, step 239 can obtain node N. y The system information block 2 is located in the minimum resource allocation period. Therefore, this node can determine which resource block in which minimum resource allocation period was received by node N. y System information block 2 sent (i.e., allocation of receiving node N) y (Resource location of system information block 2 sent).

[0041] It should be noted that if there is no causal relationship between the above steps, this application does not limit the order in which they are performed.

[0042] Please see Figure 7 Its application Figure 5 This is a schematic diagram of an embodiment of the resource allocation method that uses neighboring nodes to identify resource locations. In this embodiment, the mesh ad hoc network includes 8 nodes (i.e., node N). o To node N7), K cycle =8, the default interval is 1, rf_cycle cur =1,rf cur =8, the non-one-hop node set includes N non-one-hop nodes that do not support GPS positioning. o N1, N2, N3, N4, N5, N6 (i.e., node N) o Node N6 (which does not support GPS positioning) and non-one-hop node N7 (which supports GPS positioning) are mentioned. Figure 7 As shown, the minimum identification period is 8 minimum resource allocation periods (i.e., minimum resource allocation period RF_CYCLE0 to minimum resource allocation period RF_CYCLE7), and the receiving node N o The resource location of the transmitted synchronization signal is resource block RF0 of the minimum resource allocation period RF_CYCLE0, and the receiving node is N. oThe resource position of the transmitted system information block 2 is the resource block RF0 of the minimum resource allocation period RF_CYCLE2; the resource position of the transmitted synchronization signal of the receiving node N1 is the resource block RF1 of the minimum resource allocation period RF_CYCLE1, and the resource position of the transmitted system information block 2 of the receiving node N1 is the resource block RF1 of the minimum resource allocation period RF_CYCLE3; the resource position of the transmitted synchronization signal of the receiving node N2 is the resource block RF2 of the minimum resource allocation period RF_CYCLE2, and the resource position of the transmitted system information block 2 of the receiving node N2 is the resource block RF2 of the minimum resource allocation period RF_CYCLE4; the resource position of the transmitted synchronization signal of the receiving node N3 is the resource block RF3 of the minimum resource allocation period RF_CYCLE3, and the resource position of the transmitted system information block 2 of the receiving node N3 is the resource block RF3 of the minimum resource allocation period RF_CYCLE5; the resource position of the transmitted synchronization signal of the receiving node N4 is the resource block RF4 of the minimum resource allocation period RF_CYCLE4, and the resource position of the transmitted system information block 2 of the receiving node N4 is the resource block RF4 of the minimum resource allocation period RF_CYCLE6; the resource position of the transmitted synchronization signal of the receiving node N5 is the resource block RF5 of the minimum resource allocation period RF_CYCLE5, and the resource position of the transmitted system information block 2 of the receiving node N5 is the resource block RF5 of the minimum resource allocation period RF_CYCLE7; the resource position of the transmitted synchronization signal of the receiving node N6 is the resource block RF6 of the minimum resource allocation period RF_CYCLE6, and the resource position of the transmitted system information block 2 of the receiving node N6 is the resource block RF6 of the minimum resource allocation period RF_CYCLE0; the resource position of the transmitted synchronization signal of the receiving node N7 is the resource block RF7 of the minimum resource allocation period RF_CYCLE2, and the resource position of the transmitted system information block 2 of the receiving node N7 is the resource block RF7 of the minimum resource allocation period RF_CYCLE4. Therefore, the resource allocation method of the present application can reasonably allocate the resource position for neighbor node identification to configure the reception of the synchronization signal and the system information block 2 of each non-one-hop node.

[0043] In summary, the neighbor node identification method and the resource allocation method can identify the neighbor nodes through the reception of the synchronization signal and the system information block 2 in the mesh self-organizing network to ensure the normal network communication. In addition, the resource allocation method can confirm the time-frequency resource to be received based on the real-time updated non-one-hop node set, thereby reasonably allocating the resource to configure the reception of the synchronization signal and the system information block 2. Furthermore, the resource allocation method can balance the network rate and the detection efficiency of the resource allocation, that is, the effective network node detection can be ensured while the time-frequency resource is saved, thereby reducing the influence on the network communication rate. Moreover, when the present node supports the GPS positioning function, the resource allocation method can optimize the detection performance according to the GPS information of the node.

[0044] While the application has been described with reference to the above example, it is to be noted that these descriptions are not intended to limit the application. To the contrary, the intent is to cover all modifications and alternatives falling within the scope of the claims, which scope is limited only by the claims.

Claims

1. A method for identifying neighboring nodes, characterized in that, Suitable for mesh self-organizing networks, including: Each node in the mesh self-organizing network sends data carrying synchronization signals on its own fixed resource block; Each node performs blind detection of synchronization signals on other nodes within the mesh self-organizing network to obtain node information of the target node. The node information includes: the time offset of the target node, the frequency offset of the target node, and the signal strength between each node and the target node. Each node adjusts its receiving configuration based on the obtained node information of the target node, in order to receive system information block 2 sent by the target node on its fixed-occupancy resource block; and After each node detects that the system information block 2 sent by the target node is correct, it confirms that the target node is a neighboring node.

2. The neighbor node identification method as described in claim 1, characterized in that, Also includes: The time-frequency deviation of each node is periodically adjusted.

3. The neighbor node identification method as described in claim 1, characterized in that, Also includes: Each node obtains the node ID information of the other nodes and the resource location where the other nodes regularly send data.

4. The neighbor node identification method as described in claim 1, characterized in that, Also includes: After each node confirms that the system information block 2 sent by the target node is correct, it obtains the frequency point, physical cell identifier and network resource information carried by the target node.

5. A resource allocation method, characterized in that, Suitable for mesh self-organizing networks, including: Obtain the non-one-hop neighbor information of this node based on network information; The neighboring nodes of the current node are identified based on the detection of the synchronization signal and the reception of system information block 2; Based on the non-one-hop neighbor node information and the identified neighbor nodes, the non-one-hop node set of the current node is obtained, and the time-frequency resources to be received are confirmed based on the non-one-hop node set; and The non-one-hop node set of the current node is updated in real time, and the time-frequency resources that need to be received are reconfirmed.

6. The resource allocation method as described in claim 5, characterized in that, The non-one-hop node set includes multiple non-one-hop nodes that do not support GPS positioning. The step of determining the time-frequency resources to be received based on the non-one-hop node set includes: Assuming a minimum resource allocation cycle includes M resource blocks, and the number of nodes in the mesh self-organizing network is N... P A fixed resource block RF is occupied for each minimum resource allocation cycle. P Where M is a positive integer greater than P+1, and P is the node N. P With the resource block RF P The number is an integer greater than or equal to 0; Confirm that the non-one-hop node N does not support GPS positioning. x The minimum resource allocation cycle in which the synchronization signal is located, where rf_cycle pss / sss %K cycle =x, rf_cycle pss / sss For the non-one-hop node N that does not support GPS positioning function x The minimum resource allocation period in which the synchronization signal is located, K cycle The number of detection cycles is a positive integer greater than or equal to 2, and x is the non-one-hop node N that does not support GPS positioning. x The number is an integer greater than or equal to 0; and Confirm that the non-one-hop node N that does not support GPS positioning function x The minimum resource allocation period where system information block 2 is located, wherein the non-one-hop node N that does not support GPS positioning function x The minimum resource allocation period of system information block 2 and the non-one-hop node N that does not support GPS positioning function x There is a default interval between the minimum resource allocation cycles where the synchronization signals are located.

7. The resource allocation method as described in claim 6, characterized in that, Also includes: The minimum identification period is determined, wherein the minimum identification period is the product of the number of detection periods and the minimum resource allocation period.

8. The resource allocation method as described in claim 5, characterized in that, Also includes: The node supports GPS positioning. When the GPS-enabled node is located within the one-hop communication range of the node, based on the GPS location distance between the non-one-hop node supporting GPS positioning in the mesh self-organizing network and the node and the transmission power of the node, the obtained set of non-one-hop nodes of the node includes the non-one-hop node supporting GPS positioning.

9. The resource allocation method as described in claim 8, characterized in that, The steps for determining whether a non-one-hop node supporting GPS positioning is within the one-hop communication range of the local node based on the GPS location distance between the local node and the local node, and the local node's transmission power, include: When the GPS location distance between the non-one-hop node supporting GPS positioning and the local node is less than the product of the local node's transmission power and the correlation coefficient between the transmission power and the propagation distance, it is determined that the non-one-hop node supporting GPS positioning is within the local node's one-hop communication range.

10. The resource allocation method as described in claim 8, characterized in that, The non-one-hop node set also includes multiple nodes that do not support GPS positioning. The step of determining the time-frequency resources to be received based on the non-one-hop node set includes: Assuming a minimum resource allocation cycle includes M resource blocks, and the number of nodes in the mesh self-organizing network is N... P A fixed resource block RF is occupied for each minimum resource allocation cycle. P Where M is a positive integer greater than P+1, and P is the node N. P With the resource block RF P The number is an integer greater than or equal to 0; Confirm that the non-one-hop node N does not support GPS positioning. x The minimum resource allocation cycle in which the synchronization signal is located, where rf_cycle pss / sss %K cycle =x, rf_cycle pss / sss For the non-one-hop node N that does not support GPS positioning function x The minimum resource allocation period in which the synchronization signal is located, K cycle The number of detection cycles is a positive integer greater than or equal to 2, and x is the non-one-hop node N that does not support GPS positioning. x The number is an integer greater than or equal to 0; Confirm that the non-one-hop node N that does not support GPS positioning function x The minimum resource allocation period where system information block 2 is located, wherein the non-one-hop node N that does not support GPS positioning function x The minimum resource allocation period of system information block 2 and the non-one-hop node N that does not support GPS positioning function x There is a default interval between the minimum resource allocation cycles where the synchronization signal is located; Confirm the minimum resource allocation period in which the synchronization signal of the non-one-hop node N that supports the GPS positioning function is located. Among them, when rf y ≥y, the minimum resource allocation period in which the synchronization signal of the non-one-hop node N that supports the GPS positioning function is located is the (rf_cycle cur +1)-th minimum resource allocation period; when rf y <y, the minimum resource allocation period in which the synchronization signal of the non-one-hop node N that supports the GPS positioning function is located is the (rf_cycle cur )-th minimum resource allocation period; rf cur is the number of the resource block where the current frame number is located, y is the number of the non-one-hop node N that supports the GPS positioning function and is an integer greater than or equal to 0, and rf_cycle y is the minimum resource allocation period at the current time point; and​​​​​​​​ Confirm the non-one-hop node N that supports GPS positioning function y The minimum resource allocation period where system information block 2 is located, wherein the non-one-hop node N that supports GPS positioning function y The minimum resource allocation period of system information block 2 and the non-one-hop node N that supports GPS positioning function y The default interval is between the minimum resource allocation period where the synchronization signal is located.

Images