A signal transmission method, a terminal device, and a storage medium

By employing a symmetric partitioning strategy in wireless sensor networks, the communication area is divided equally and cooperative nodes are selected, thus solving the problem of local optima in traditional algorithms under sparse distribution and improving signal communication quality and cooperative transmission performance.

CN116781113BActive Publication Date: 2026-06-23CHINA MOBILE (SUZHOU) SOFTWARE TECH CO LTD +1

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
CHINA MOBILE (SUZHOU) SOFTWARE TECH CO LTD
Filing Date
2023-01-03
Publication Date
2026-06-23

AI Technical Summary

Technical Problem

In wireless sensor networks, when terminal node clusters are sparsely distributed, traditional cooperative transmission algorithms based on virtual arrays are prone to getting trapped in local optima, making it difficult to form the desired array structure and resulting in poor signal communication quality.

Method used

A symmetrical partitioning strategy is adopted to divide the communication area into a first area and a second area. A first preset number of first cooperative nodes and a second preset number of second cooperative nodes are selected from each area, and signal transmission is carried out based on these nodes.

Benefits of technology

In sparsely distributed scenarios, it improves cooperative transmission performance and signal communication quality, avoids local optima trapping, forms a better array structure, and enhances signal transmission capability.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN116781113B_ABST
    Figure CN116781113B_ABST
Patent Text Reader

Abstract

The embodiment of the application discloses a signal transmission method, a terminal device and a storage medium. The signal transmission method comprises the following steps: in the case that a source node transmits a signal to a destination base station, acquiring the position of the destination base station, the position of the source node and a communication area covered by the source node; wherein the communication area comprises a plurality of communication nodes; determining a division line passing through the position of the destination base station and the position of the source node; and dividing the communication area into a first area and a second area based on the division line; wherein the first area comprises first communication nodes in the plurality of communication nodes; the second area comprises second communication nodes in the plurality of communication nodes; finding a first preset number of first cooperative nodes from the first communication nodes; and in the case that the first preset number of first cooperative nodes are found, finding a second preset number of second cooperative nodes from the second communication nodes; and transmitting the signal to the destination base station based on the first cooperative nodes, the second cooperative nodes and the source node.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This application relates to the field of wireless communication technology, and in particular to a signal transmission method, terminal device and storage medium. Background Technology

[0002] Distributed beamforming, as an effective means to enhance the transmission capability of a single power-constrained terminal node, utilizes multiple distributed terminal nodes to enhance the transmission and reception capabilities of a single node through cooperative transmission, and has been widely studied in wireless sensor networks.

[0003] In the prior art, ideally, the pattern of the cooperative transmission array obtains N in the desired direction. 2 While the power gain is increased by a factor of two, selecting different nodes to participate in the cooperative transmission process will cause the sidelobe performance of the radiation pattern to change accordingly. In some practical scenarios, the terminal node clusters are often not densely arranged. At this time, the final optimized solution set of the traditional virtual array-based selection algorithm is often restricted to a certain region, getting stuck in local optima. Moreover, the cooperative nodes obtained cannot form the desired array structure well, so the selection results are often restricted to a few fixed nodes, resulting in low cooperative transmission performance and poor signal communication quality. Summary of the Invention

[0004] In view of this, embodiments of this application aim to provide a signal transmission method, terminal device, and storage medium that can improve the performance of cooperative transmission and the quality of signal communication.

[0005] To achieve the above objectives, the technical solution of this application is implemented as follows:

[0006] In a first aspect, embodiments of this application provide a signal transmission method, the method comprising:

[0007] When the source node sends a signal to the destination base station, the location of the destination base station, the location of the source node, and the communication area covered by the source node are obtained; wherein, the communication area contains multiple communication nodes;

[0008] Determine a dividing line that passes through the location of the destination base station and the location of the source node; and based on this dividing line, divide the communication area into a first region and a second region; wherein the first region contains a first communication node among multiple communication nodes; and the second region contains a second communication node among multiple communication nodes.

[0009] Search for a first preset number of first cooperative nodes from the first communication nodes; and if the first preset number of first cooperative nodes are found, search for a second preset number of second cooperative nodes from the second communication nodes;

[0010] The signal is transmitted to the destination base station based on the first cooperating node, the second cooperating node, and the source node.

[0011] Secondly, embodiments of this application provide a terminal device, the terminal device comprising:

[0012] The acquisition unit is used to acquire the location of the destination base station, the location of the source node, and the communication area covered by the source node when the source node sends a signal to the destination base station; wherein the communication area contains multiple communication nodes.

[0013] A determining unit is used to determine a dividing line that passes through the location of the destination base station and the location of the source node;

[0014] A partitioning unit is used to divide a communication area into a first region and a second region based on a dividing line; wherein the first region contains a first communication node among multiple communication nodes; and the second region contains a second communication node among multiple communication nodes.

[0015] The search unit is configured to search for a first preset number of first cooperative nodes from the first communication nodes; and if the first preset number of first cooperative nodes are found, to search for a second preset number of second cooperative nodes from the second communication nodes.

[0016] The transmission unit is used to transmit signals to the destination base station based on the first cooperating node, the second cooperating node, and the source node.

[0017] Thirdly, embodiments of this application provide a terminal device, which includes a processor, a memory, and a communication bus; the processor implements the above-mentioned signal transmission method when executing the running program stored in the memory.

[0018] Fourthly, embodiments of this application provide a storage medium storing a computer program thereon, which, when executed by a processor, implements the above-described signal transmission method.

[0019] This application provides a signal transmission method, terminal device, and storage medium. The method includes: when a source node sends a signal to a destination base station, obtaining the location of the destination base station, the location of the source node, and the communication area covered by the source node; wherein the communication area contains multiple communication nodes; determining a dividing line passing through the location of the destination base station and the location of the source node; and dividing the communication area into a first area and a second area based on the dividing line; wherein the first area contains a first communication node among the multiple communication nodes; the second area contains a second communication node among the multiple communication nodes; searching for a first preset number of first cooperating nodes from the first communication nodes; and if the first preset number of first cooperating nodes are found, searching for a second preset number of second cooperating nodes from the second communication nodes; and transmitting the signal to the destination base station based on the first cooperating nodes, the second cooperating nodes, and the source node. Using the above implementation scheme, during signal transmission, considering that most terminal nodes are not densely distributed in reality, based on the sparse distribution scenario, the communication area covered by the source node is divided into a first region and a second region according to the line connecting the source node and the target base station's transmission direction. First and second cooperative nodes for cooperative transmission are then identified from the first and second regions, respectively. These first and second cooperative nodes are located within two symmetrical partitions within the communication area, ensuring signal transmission in both the first and second regions. By using cooperative nodes determined in different regions and the source node for cooperative transmission, even in scenarios with sparsely distributed terminal nodes, the selected cooperative transmission nodes can meet the signal transmission requirements within the communication area covered by the source node. This results in high cooperative performance and high signal communication quality during cooperative transmission. Attached Figure Description

[0020] Figure 1 This is a schematic diagram of a node selection method based on a virtual circular array in the prior art;

[0021] Figure 2 This is a schematic diagram of a node selection method based on a virtual linear array in the prior art;

[0022] Figure 3 The flowcharts show the node selection methods based on virtual ring arrays and virtual linear arrays in the prior art.

[0023] Figure 4 A signal transmission method flow provided in the embodiments of this application Figure 1 ;

[0024] Figure 5 This application provides a schematic diagram of a collaborative node selection method.

[0025] Figure 6A signal transmission method flow provided in the embodiments of this application Figure 2 ;

[0026] Figure 7 A schematic diagram of the structure of a terminal device 1 provided in this application embodiment. Figure 1 ;

[0027] Figure 8 A schematic diagram of the structure of a terminal device 1 provided in this application embodiment. Figure 2 . Detailed Implementation

[0028] To gain a more detailed understanding of the features and technical content of the embodiments of this application, the technical solution of this application will be further described in detail below with reference to the accompanying drawings and specific embodiments. The accompanying drawings are for reference only and are not intended to limit the embodiments of this application.

[0029] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs. The terminology used herein is for the purpose of describing embodiments of this application only and is not intended to be limiting of this application.

[0030] In the following description, references to "some embodiments" refer to a subset of all possible embodiments. It is understood that "some embodiments" may be the same or different subsets of all possible embodiments and may be combined with each other without conflict. It should also be noted that the terms "first / second / third" used in the embodiments of this application are merely for distinguishing similar objects and do not represent a specific ordering of objects. It is understood that "first / second / third" may be interchanged in a specific order or sequence where permitted, so that the embodiments of this application described herein can be implemented in orders other than those illustrated or described herein.

[0031] Distributed beamforming, as an effective means to enhance the transmission capability of a single power-constrained terminal node, utilizes multiple distributed terminal nodes to enhance the transmission and reception capabilities of a single node through cooperative transmission, and has been widely studied in wireless sensor networks.

[0032] Compared to traditional point-to-point transmission, distributed beamforming, through its cooperative transmission method, can improve the signal-to-noise ratio (SNR) gain. If the antenna elements in a wireless sensor network have a fixed transmit power, an ideal distributed beamforming system with N cooperative nodes can achieve N signal-to-noise ratio gains at the destination. 2 A power gain of times, or in other words, for a given received power threshold, the received signal power can be reduced by 1 / N. 2 On the order of magnitude.

[0033] In the prior art, under ideal conditions, the pattern of the cooperative transmission array obtains N in the desired direction. 2 The power gain is several times. However, selecting different cooperating nodes to participate in the cooperative process causes the sidelobe performance of the radiation pattern to change with the number of cooperating nodes. Therefore, how to select suitable cooperating nodes to participate in cooperative transmission in the entire wireless sensor network is a very complex nonlinear optimization problem.

[0034] In existing technical solutions, based on the experience that uniform arrays can achieve better sidelobe performance, cooperative node selection algorithms based on virtual linear arrays and circular arrays have been proposed, such as... Figure 1 and Figure 2 As shown, Figure 1 The diagram illustrates a boundary point selection method based on a virtual circular array. Figure 2 The diagram illustrates a node selection method based on a virtual linear array. Specifically, the flowcharts for the node selection algorithms based on virtual linear arrays and circular arrays are shown below. Figure 3 As shown.

[0035] Regarding the existing technical solutions, the following technical problems still exist when selecting collaborative nodes:

[0036] 1. In some real-world scenarios, terminal node clusters are often not arranged in such a large and dense manner. In this case, the final optimized solution set of traditional virtual array-based selection algorithms is often limited to a certain region, falling into the "trap" of local optima.

[0037] 2. In traditional wireless sensor network scenarios, nodes are densely deployed in a certain area, and the cooperating nodes can often form a topology that approximates an ideal virtual linear array or circular array. However, in the case of sparsely distributed terminal nodes, using this strategy for node selection does not result in the desired array structure being formed by the active nodes, and the selection results are often limited to a few fixed nodes.

[0038] To address the technical problems in the existing technology, this application proposes a node selection algorithm based on a symmetric partitioning strategy for sparse terminal distribution models. This algorithm aims to overcome the shortcomings of node selection algorithms based on virtual linear arrays and virtual circular arrays in sparse terminal scenarios.

[0039] This application provides a signal transmission method, such as... Figure 4 As shown, the method may include:

[0040] S101. When the source node sends a signal to the destination base station, obtain the location of the destination base station, the location of the source node, and the communication area covered by the source node; wherein the communication area contains multiple communication nodes.

[0041] In the embodiments of this application, the signal transmission method is applied to wireless communication technology, especially in wireless sensor networks. The selection of cooperative communication nodes has an important impact on the quality of cooperative communication. Therefore, in wireless sensor networks, the selection of cooperative communication nodes used for cooperative communication is particularly important.

[0042] In the embodiments of this application, a wireless sensor network (WSN) is a wireless network composed of a large number of stationary / moving sensors in a self-organizing and multi-hop manner. The purpose is to collaboratively detect, process, transmit monitoring information of sensed objects within the network coverage area, and report it to the user.

[0043] In this embodiment of the application, in a wireless sensor network, when a source node sends a signal to a destination base station, the location of the source node and the location of the destination base station are obtained, and the communication area covered by the source node is also obtained.

[0044] In this embodiment of the application, the communication area covered by the source node includes multiple communication nodes for communication.

[0045] For example, such as Figure 5 As shown, the source node is located at the center of the circular communication area it covers, which contains multiple communication nodes used for communication.

[0046] It should be noted that not all nodes in the communication area covered by the source node are ultimately used for collaborative communication. The communication nodes that ultimately conduct collaborative communication need to be selected from the multiple communication nodes contained in its coverage area based on the actual situation.

[0047] It should be noted that the communication area covered by the source node is not limited to the circular area in this application. Specifically, it can be selected according to the actual situation, and no specific limitation is made in this application.

[0048] S102. Determine a dividing line that passes through the location of the destination base station and the location of the source node; and based on the dividing line, divide the communication area into a first area and a second area; wherein the first area contains a first communication node among multiple communication nodes; and the second area contains a second communication node among multiple communication nodes.

[0049] In this embodiment, after determining the location of the destination base station and the location of the source node, a line segment is formed connecting the locations of the destination base station and the source node. This line segment is then extended to form a dividing line, which is used to divide the communication area covered by the source node into two equal regions, namely the first region and the second region. Figure 5As shown, the first area is a blank area, and the second area is a shaded area.

[0050] It should be noted that the first area can also be a shaded area, and the second area can be a blank area. Specifically, the choice can be made according to the actual situation, and no specific limitation is made in this application.

[0051] It should be noted that the first area contains a portion of the communication nodes among the multiple communication nodes in the communication area, and the second area contains another portion of the communication nodes among the multiple communication nodes in the communication area.

[0052] In this embodiment of the application, the first region includes a first communication node among a plurality of communication nodes; the second region includes a second communication node among a plurality of communication nodes.

[0053] S103. Search for a first preset number of first cooperative nodes from the first communication nodes; and if the first preset number of first cooperative nodes are found, search for a second preset number of second cooperative nodes from the second communication nodes.

[0054] In this embodiment, after dividing the communication area covered by the source node into a first region and a second region by the dividing line between the location of the source node and the location of the destination base station, the total number of cooperating nodes required for the source node to transmit signals is further determined.

[0055] It should be noted that the process of determining the total number of required collaborative nodes can also be carried out before the communication area covered by the source node is divided. The specific order of execution can be selected according to the actual situation, and no specific limitation is made in this application.

[0056] In this embodiment, searching for a first preset number of first cooperative nodes from the first communication nodes; and if the first preset number of first cooperative nodes are found, searching for a second preset number of second cooperative nodes from the second communication nodes may involve obtaining the target base station antenna receiving gain, signal transmission loss gain, system bit error rate, and cooperative node transmit power; determining an omnidirectional radiated power threshold based on the base station antenna receiving gain, signal transmission loss gain, and system bit error rate; determining the total number of cooperative nodes using a preset cooperative node spatial location information function, cooperative node transmit power, and omnidirectional radiated power threshold; determining a first preset number and a second preset number based on the total number; searching for first cooperative nodes from the first communication nodes based on the first preset number; and if the first cooperative nodes are found, searching for second cooperative nodes from the second communication nodes based on the second preset number.

[0057] In this embodiment of the application, when determining the total number of cooperative transmission nodes, the omnidirectional radiation power threshold can be determined first. It is necessary to obtain the target base station antenna receiving gain, signal transmission loss gain, system bit error rate and cooperative node transmission power, and calculate based on the following formulas (1) and (2).

[0058] In this embodiment of the application, the equivalent isotropic radiated power of the wireless sensor network can be expressed as shown in the following formula (1):

[0059] EIRP CB (dBW)=P R (dBW)-G R (dBi)+L f (dB) (1)

[0060] Among them, EIRP CB P represents the equivalent isotropic radiated power at the transmitting end of the cooperating node; R Indicates the power of the received signal; G R Indicates the base station antenna receiving gain; L f This indicates the signal loss and gain during transmission.

[0061] It should be noted that the equivalent isotropic radiated power in formula (1) is expressed in decibels (dB).

[0062] In the embodiments of this application, P is used according to different signal modulation methods. R It can be expressed as a function of the system bit error rate, as shown in formula (2):

[0063] P R =f(BER) th (2)

[0064] In this embodiment, combining formulas (1) and (2), the threshold range of the system bit error rate function can be determined in formula (2) based on the system's bit error rate requirements. Substituting formula (2) into formula (1), the isotropic radiated power EIRP can be obtained. CB threshold EIRP CB,th .

[0065] It should be noted that the system mentioned here can be an antenna or other system capable of signal transmission. The specific system can be selected according to the actual situation, and no specific limitation is made in this application.

[0066] In this embodiment of the application, the equivalent isotropic radiated power of the transmitting end of the cooperative node can be expressed as shown in the following formula (3):

[0067] EIRP CB =G CB ·Ptot (3)

[0068] Among them, G CB P represents the cooperative beamforming gain. tot This represents the total power emitted by all cooperating nodes.

[0069] In this embodiment, the equivalent omnidirectional radiated power of the transmitting end of the cooperating node can also be written as a function F(φ,θ) of the number of cooperating nodes N and the spatial location information of the cooperating nodes. If the cooperating nodes are all weighted by equal amplitude, the amplitude gain generated by the N cooperating nodes during cooperative communication can be expressed as the following formula (4):

[0070] G CB =N·F(φ,θ) (4)

[0071] Wherein, F(φ,θ) is a function of the spatial location information of the cooperating nodes. Assuming that the position of the target base station in the spherical coordinate system centered on the source node is (A,φ0,θ0), without loss of generality, assuming that all nodes in the coverage area of ​​the source node carry omnidirectional antennas, the array factor can be used to replace the radiation pattern. When the target base station is in the far field, its normalized array radiation pattern can be expressed as shown in formula (5), which is also a function of the spatial location information of the cooperating nodes. Specifically, F(φ,θ) can be expressed as shown in formula (5) below:

[0072]

[0073] Where, r k φ represents the distance from the k-th node to the source node. k λ represents the orientation of the k-th node in the coordinate system; N represents the number of cooperating nodes; λ represents the wavelength of the electromagnetic wave; w k This represents the excitation current value at the k-th node.

[0074] In this embodiment, the N cooperating nodes are configured to have the same transmission power. If the transmission power of a single cooperating node is P... s If P represents P, then tot The sum of the power transmitted by all cooperating nodes can be expressed as shown in the following formula (6):

[0075] P tot =N·P s (6)

[0076] Therefore, EIRP in formula (3) CB It can be rewritten as a function of the number of nodes N and the spatial location information of the cooperating nodes, specifically as shown in the following formula (7):

[0077]

[0078] Where, r k φ represents the distance from the k-th collaborating node to the source node; k The coordinate system represents the orientation of the k-th cooperating node; λ represents the wavelength of the electromagnetic wave; w k w is the weight coefficient of the k-th collaborating node. k ∈w.

[0079] It should be noted that w represents the complex domain and is the weighted vector corresponding to the cooperative beamforming of N cooperative nodes, which is expected to achieve maximum gain at the far-field target azimuth. The form of w can be represented as shown in the following formula (8):

[0080] w = [w1 w2 … w] k ] T , k=1,2,…,N (8)

[0081] Among them, w k The representation is shown in formula (9):

[0082]

[0083] Combining formulas (1)-(9), the total number N of cooperative nodes required can be calculated using the preset spatial location information function of cooperative nodes, the transmission power of cooperative nodes, and the threshold of omnidirectional radiation power. The total number N is represented by the formula shown in formula (10):

[0084]

[0085] The number N of cooperative nodes can be calculated by using a preset cooperative node spatial location information function, a preset cooperative node transmission power, and the omnidirectional radiation power threshold.

[0086] In the embodiments of this application, under the ideal condition of not considering the location information error of the cooperating nodes, N nodes can generate a maximum amplitude gain of N times when cooperating, as shown in formula (11):

[0087] [G CB ] max =N (11)

[0088] Combining formulas (1)-(9) and (11), the total number of required collaborative nodes N can be calculated, and its expression is shown in formula (12):

[0089]

[0090] In this embodiment of the application, based on the above formulas (1)-(12), the number N of cooperative nodes required for signal transmission can be calculated.

[0091] In this embodiment of the application, the communication area covered by the source node is divided into a first area and a second area. After determining the total number of cooperative nodes required for cooperative transmission, cooperative nodes are searched from the first area and the second area respectively according to the determined total number of cooperative nodes.

[0092] It should be noted that when searching for collaborative nodes in the first and second regions, the number of collaborative nodes searched in the first and second regions is equal, and the sum of the number of collaborative nodes in the first and second regions is the total number of collaborative nodes obtained above minus 1.

[0093] It should be noted that the number of cooperative transmission nodes in the first and second regions can also be set in advance. Specifically, the number can be selected according to the actual situation, and no specific limitation is made in this application.

[0094] In this embodiment of the application, if the communication area contains multiple communication nodes, then both the first and second regions each contain multiple communication nodes, such as... Figure 5 As shown, the communication area covered by the source base station contains multiple communication nodes. After dividing the area into a first region and a second region, the first region contains multiple first communication nodes and the second region contains multiple second communication nodes.

[0095] In this embodiment of the application, when selecting the first cooperative node, the number of first cooperative nodes to be selected in the first region is determined based on the total number of cooperative nodes. Example: if the total number of required cooperative nodes is N, then the number of first cooperative nodes to be selected in the first region is (N-1) / 2.

[0096] It should be noted that if N is odd, the number of first cooperative nodes selected from the first region is (N-1) / 2. If N is even, the number of first cooperative nodes selected from the first region is (N+1) / 2.

[0097] It should be noted that the number of first cooperative nodes in the first region and the number of second cooperative nodes in the second region in this application are equal. In fact, the selection can be made according to the actual situation, and no specific limitation is made in this application.

[0098] After determining the first preset quantity and the second preset quantity based on the total quantity, the cooperating nodes can be searched from the communication nodes contained in the corresponding area according to the first preset quantity and the second preset quantity.

[0099] In this embodiment of the application, finding a first preset number of first cooperative nodes in the first communication node may involve obtaining the first position of each of the multiple first nodes; and finding the first preset number of first cooperative nodes from the first communication node based on the distance between the first position and the position of the source node.

[0100] In the embodiments of this application, such as Figure 5 The first region shown contains multiple first communication nodes. The selection of the first cooperating node from the first communication nodes contained in the first region can be carried out by using a random round-robin method in the first region.

[0101] In this embodiment of the application, after determining the number of first cooperative nodes selected from the first communication nodes contained in the first region, the first positions of all the first communication nodes contained in the first region are obtained, and the distance between the first position corresponding to each first communication node and the source node position is calculated. One or more first communication nodes with the smallest distance are selected as the first cooperative nodes.

[0102] For example, if the total number N of required collaborating nodes is 9, then the number of first collaborating nodes to be selected in the first region is 4. That is, the 4 smallest distances are selected from the distances between the positions of all first nodes and the positions of the source node, and the 4 first nodes corresponding to these 4 distances are determined. These 4 first nodes are then used as the 4 first collaborating nodes in the first region. Figure 5 The numbers k1, k2, k3, and k4 are shown in the diagram.

[0103] It should be noted that the initial node selection generally starts with the node closest to the source node.

[0104] In this embodiment of the application, after determining a first preset number of first cooperative nodes from the first communication nodes included in the first region, the first cooperative nodes are used as reference nodes, and the second cooperative nodes are determined from the second communication nodes included in the second region based on the first cooperative nodes.

[0105] In this embodiment, searching for a second preset number of second cooperative nodes from the second communication nodes contained in the second region may involve, if a preset number of first cooperative nodes are found, obtaining the locations of the preset number of first cooperative nodes; determining the desired nodes corresponding to the preset number of first cooperative nodes based on the locations of the preset number of first cooperative nodes and the location of the source node; wherein the number of desired nodes is the same as the number of first cooperative nodes; determining the desired region corresponding to each desired node based on the desired nodes; wherein each desired region contains multiple second communication nodes; and searching for a second preset number of second cooperative nodes from the multiple second communication nodes contained in each desired region.

[0106] In this embodiment, after finding multiple first cooperative nodes from the first region, the position of each first cooperative node is obtained. The positions of the first cooperative nodes are then symmetrically represented around the position of the source node to obtain the positions of the desired nodes corresponding to the first cooperative nodes. The positions of the desired nodes are as follows: Figure 5 The values ​​k1', k'2, k3', and k'4 are shown in the diagram.

[0107] It should be noted that one primary cooperative node corresponds to one desired node, and their numbers are equal.

[0108] In this embodiment of the application, after determining the location of the desired node, the determined desired node is transferred from the source node S. node It broadcasts to other nodes within its coverage area.

[0109] It should be noted that all other nodes include any node within the coverage area of ​​the source node.

[0110] In this embodiment, a circle is drawn with the location of the desired node as the center and R as the radius, resulting in a circular region corresponding to each desired node. This circular region is called the desired region area. ideal .

[0111] It should be noted that the value of R is determined based on the coverage of the node in the actual application, but this application does not specifically limit it.

[0112] It should be noted that after the second region is divided, it will contain multiple second communication nodes. Therefore, each desired region obtained by drawing a circle with each desired node as the center will also contain some nodes from multiple second communication nodes. These partial nodes can be one or more.

[0113] In this embodiment of the application, when selecting a second cooperative node from the second communication nodes contained in the second region, one second communication node is selected as the second cooperative node from the second communication nodes contained in each desired region.

[0114] In this embodiment of the application, finding a second preset number of second cooperative nodes from a plurality of second communication nodes contained in each desired region may involve determining the second position and first remaining energy value of each second communication node contained in each desired region, and the position of the desired node; determining the distance between each second communication node and the desired node based on the second position and the position of the desired node; determining the node value of each second communication node in each desired region based on the distance between each second communication node and the desired node and the first remaining energy value; sequentially finding the second communication node with the largest node value in each desired region; and determining the second communication node with the largest node value as the second cooperative node.

[0115] In this embodiment, by selecting reasonable cooperating nodes for cooperative transmission through a node value function, network power consumption can be effectively controlled, the life cycle of the terminal network can be extended, and the maintenance cost of terminal nodes can be reduced.

[0116] In this embodiment of the application, the selection of the second cooperative node in the second region can be performed by determining the node value of the second communication node based on the node value function, and selecting the second cooperative node based on the node value. The node value function is shown in formula (13):

[0117] V node =w d `d node +w e `E node w d ∈[-1,0], w e ∈[0,1] (13)

[0118] Where, d node Indicates area ideal The distance between the node in the graph and the ideal node; E node w represents the remaining energy of a node. d w e The separate tables represent the weighting coefficients for distance and energy.

[0119] In this embodiment of the application, based on the above formula (13), in the specific implementation process, the second communication nodes contained in each expected area are determined. Taking an expected area as an example, if the expected area contains 3 second communication nodes, the positions of these three second communication nodes and their corresponding remaining energy values, the positions of the expected nodes, and the distance between the position of the expected node and the position of each second communication node in the expected area are calculated. Three distances will be determined. The three determined distances and the remaining energy values ​​corresponding to these three second communication nodes are substituted into the above formula (13). According to the above formula (13), the node value of these three second communication nodes can be calculated. The node value with the largest value is selected from the node values ​​corresponding to these three second communication nodes, and the second communication node with the largest node value is used as a second cooperative node.

[0120] It should be noted that the method of selecting the remaining second cooperative node from the remaining expected region is the same as the implementation process of determining a second cooperative node described above. Specifically, you can refer to the above implementation method, which will not be repeated here.

[0121] It should be noted that the number of desired regions is equal to the number of first cooperative nodes. Each desired region determines one second cooperative node. Therefore, the number of determined second cooperative nodes is the same as the number of first cooperative nodes. For example, if the required number of cooperative nodes is N, and N is an odd number, the number of first cooperative nodes is (N-1) / 2. The same applies when N is an even number.

[0122] For example, such as Figure 5 As shown, the second cooperative node in the second region corresponding to the first cooperative nodes k1, k2, k3, and k4 found in the first region is...

[0123] It should be noted that the implementation of the cooperative node selection method in this application is based on real-world scenarios and considers the node distribution in wireless sensor networks. Given that most terminal nodes are not densely distributed in practice, this study analyzes the performance of the cooperative node selection algorithm in scenarios with sparsely distributed terminal nodes. Furthermore, it analyzes the factors that restrict the quality of cooperation. Considering that symmetrical end-fire arrays in centralized arrays have good cooperative performance, the cooperative node selection utilizes the idea of ​​symmetrical partitioning. The communication area covered by the source node is divided equally according to the end-fire direction of the destination base station, and the cooperative node with better cooperative transmission is selected based on the node value function.

[0124] Based on the above embodiments, the technical solution of this application provides a node selection method, the execution process of which is shown in Table 1:

[0125] Table 1 Symmetric Partition Node Selection Algorithm

[0126]

[0127]

[0128] In the embodiments of this application, the cooperative node selection method proposed in this application can effectively shorten the solution set search space and time, and can achieve better cooperative performance compared with traditional node selection algorithms based on virtual arrays.

[0129] In this embodiment of the application, in order to measure the performance of different node selection algorithms in the scenario of this application, the complementary cumulative function (CCDF) is defined as shown in the following formula (14), that is, the probability that the peak value of the average power pattern in the sidelobe region exceeds the threshold power P0:

[0130]

[0131] Based on formula (14), Table 2 gives the C values ​​for different algorithms. P(φ) (P0) Performance Comparison. The results show that the average power pattern obtained by the virtual linear array, virtual circular array, and symmetric partitioning node selection algorithm has a sidelobe peak power exceeding -10dB with a probability of 98.81%, 77.27%, and 42.52%, respectively; the pattern obtained by using the symmetric partitioning strategy for node selection in the scenario of this invention has a better sidelobe peak power level.

[0132] Table 2 C-values ​​for different node selection algorithms P(φ) (P0) comparison

[0133] Node selection algorithm Virtual linear array Virtual circular array Symmetric partitioning strategy <![CDATA[C P(φ) (P0)]]> 98.81% 77.27% 42.52%

[0134] It should be noted that formula (14) can be used to measure the selection performance of the node selection algorithm by statistically analyzing the sidelobe suppression performance of the node position information in the direction map.

[0135] S104. Transmit the signal to the destination base station based on the first cooperating node, the second cooperating node and the source node.

[0136] In this embodiment of the application, after finding the first cooperating node in the first region and the second cooperating node in the second region, the first cooperating node in the first region, the second cooperating node in the second region, and the source node are used as cooperating nodes for cooperative communication, and the signal is transmitted to the target base station using the determined cooperating nodes.

[0137] In this embodiment, after determining the first and second cooperative nodes, all selected first and second cooperative nodes, along with the source node, are added to the cooperative node set C.beam_nodes That is, the set of collaborative nodes is The collaborative nodes include the first collaborative node, the second collaborative node, and the source node.

[0138] In this embodiment of the application, when transmitting signals, the signals can be electromagnetic signals, and the electromagnetic signals are transmitted through cooperative beamforming.

[0139] It should be noted that the sum of the number of the first cooperating node, the second cooperating node, and the source node is the total number of nodes required for cooperative transmission.

[0140] It should be noted that this application is not limited to electromagnetic signals. Specifically, the appropriate signal can be selected based on the actual situation, and no specific limitation is made in this application.

[0141] It should be noted that, compared with the traditional node selection algorithm based on virtual arrays, this cooperative node selection algorithm based on symmetric partitioning narrows the range of optimal cooperative nodes, avoids unnecessary power waste caused by too many nodes joining the cooperative process, and can form beam nulls in the undesired azimuth of the system, reducing interference from other systems. Furthermore, the cooperative transmission results show that the scheme proposed in this application can obtain a better radiation pattern function and has better cooperative transmission performance.

[0142] Optionally, the signal is transmitted to the destination base station based on the first cooperating node, the second cooperating node, and the source node. This can be achieved by: obtaining the location of the second cooperating node; determining the first optimal excitation level corresponding to the first cooperating node using the location of the first cooperating node, a preset sidelobe peak power, and a preset genetic algorithm; determining the second optimal excitation level corresponding to the second cooperating node using the location of the second cooperating node, a preset sidelobe peak power, and a preset genetic algorithm; and determining the third optimal excitation level corresponding to the source node using the location of the source node, a preset sidelobe peak power, and a preset genetic algorithm. When signal transmission is performed using the first cooperating node, the second cooperating node, and the source node, the first cooperating node transmits the signal based on the first optimal excitation level; the second cooperating node transmits the signal based on the second optimal excitation level; and the source node transmits the signal based on the third optimal excitation level.

[0143] In this embodiment, the sidelobe peak power of the cooperative beamforming pattern is used as the cost function, and the weighting coefficients during cooperative node transmission are solved by combining it with a biological algorithm, thereby obtaining the optimal cooperative transmission scheme.

[0144] In the embodiments of this application, when using the first cooperating node, the second cooperating node and the source node for cooperative transmission, the optimal excitation current value of the first cooperating node, the second cooperating node and the source node can be determined. The optimal excitation current value can be understood as the weight value when the first cooperating node, the second cooperating node and the source node perform cooperative transmission.

[0145] In this embodiment of the application, calculating the optimal excitation current value of the cooperative node can be achieved by obtaining the position corresponding to the cooperative node and substituting the position corresponding to the cooperative node into formula (15), as shown below:

[0146]

[0147] It should be noted that, without loss of generality, the beam shape can be observed from the cross-section of the radiation pattern function. Let θ = 90°, then Fitness SSL =P(φ) dB .

[0148] In this embodiment of the application, for the first cooperative node, the position of the first cooperative node and the preset sidelobe peak power are substituted into formula (15), and the first optimal excitation level corresponding to the first cooperative node is determined by combining the preset genetic algorithm.

[0149] In this embodiment of the application, for the second cooperative node, the position of the second cooperative node and the preset sidelobe peak power are substituted into formula (15), and the second optimal excitation level corresponding to the second cooperative node is determined by combining the preset genetic algorithm.

[0150] In this embodiment of the application, for the source node, the position of the source node and the preset sidelobe peak power are substituted into formula (15), and the second optimal excitation level corresponding to the source node is determined by combining the preset genetic algorithm.

[0151] It should be noted that the preset genetic algorithm used can be a multi-objective elite genetic algorithm combined with it to select the optimal excitation level.

[0152] In this embodiment, after determining the optimal excitation level of the cooperating nodes, each cooperating node uses its corresponding excitation level for cooperative signal transmission. That is, the first cooperating node performs cooperative transmission based on the first optimal excitation level; the second cooperating node performs cooperative transmission based on the second optimal excitation level; and the source node performs cooperative transmission based on the third optimal excitation level.

[0153] Optionally, before transmitting the signal to the destination base station based on the first cooperating node, the second cooperating node, and the source node, the process may further include the source node broadcasting control information to the first cooperating node, the second cooperating node, and the source node; wherein, the control information includes time synchronization sequence information, signal transmission data information, and a delay time; during the delay time, if the source node receives feedback information from the first cooperating node, the second cooperating node, and the source node regarding successful reception of signal transmission data information, then it uses the first cooperating node, the second cooperating node, and the source node to transmit the signal; if the source node does not receive feedback information from the first cooperating node, the second cooperating node, and the source node, then the source node rebroadcasts the control information to the first cooperating node, the second cooperating node, and the source node.

[0154] In this embodiment of the application, after determining the first cooperating node, the second cooperating node, and the source node for cooperative transmission, and before using the first cooperating node, the second cooperating node, and the source node for cooperative transmission, the source node S... node Control information M needs to be broadcast to the cooperating nodes. beam_control .

[0155] In this embodiment of the application, the control information includes a time synchronization sequence T. syn Signal transmission data information D message and delay time T delay .

[0156] In this embodiment of the application, it is added to the collaborative node set C. beam_nodes Collaborating nodes in the process need to work during a delay time T. delay Within the time range, to the source node S node Send a feedback message indicating successful reception of the transmitted signal data.

[0157] In this embodiment of the application, if the source node receives feedback information sent by a cooperative node in the cooperative node set within the delay time range, then the cooperative node in the cooperative node set is used for cooperative transmission.

[0158] It should be noted that the source node needs to receive feedback information from all cooperative nodes in the cooperative node set. During cooperative transmission, it needs to utilize all cooperative nodes in the selected cooperative node set to perform cooperative transmission together.

[0159] In this embodiment of the application, if the source node does not receive feedback information from all cooperating nodes within the delay time range, the source node needs to broadcast control information to the cooperating nodes again to determine whether the cooperating nodes can perform cooperative transmission.

[0160] Optionally, after the source node rebroadcasts control information to the first cooperating node, the second cooperating node, and the source node, if the source node does not receive feedback information from the first cooperating node, the second cooperating node, and the source node, it marks the first cooperating node and / or the second cooperating node and / or the source node; determines the desired area corresponding to the marked first cooperating node and / or the second cooperating node and / or the source node; and determines the backup nodes included in the desired area corresponding to the marked first cooperating node and / or the second cooperating node and / or the source node; searches for a target backup node from the backup nodes; and uses the target backup node and other first cooperating nodes, second cooperating nodes, and source nodes other than the marked first cooperating node and / or the second cooperating node and / or the source node to transmit signals.

[0161] In this embodiment, the source node broadcasts control information to the collaborating nodes, but the source node does not receive the feedback information sent by the collaborating nodes. Furthermore, the source node broadcasts control information to the collaborating nodes again, but the source node fails to successfully receive the set C of collaborating nodes. beam_nodes When receiving feedback messages from all collaborating nodes, it is necessary to mark the corresponding collaborating node as faulty and select a target backup node for collaborative transmission.

[0162] In this embodiment, the selection strategy for the target backup node can refer to the selection method for determining the second cooperative node in the second region, that is, determining the desired region corresponding to the marked cooperative node, determining the backup nodes contained in the desired region, and calculating the node value V of the backup node in the desired region corresponding to the marked cooperative node. node Find the target backup node from the backup nodes, replace the marked cooperative node with the found backup node, and use the target backup node and the unmarked cooperative node to perform cooperative transmission.

[0163] In this embodiment of the application, the source node successfully receives the set of cooperating nodes C. beam nodes Feedback messages from all nodes, including C beam_nodes The set of cooperating nodes can also include a replacement target backup node, in which case the set of cooperating nodes will synchronize at time T. syn At that time, electromagnetic signals are transmitted through cooperative beamforming.

[0164] It should be noted that this application is based on a real-world scenario. In practice, most terminal nodes are not densely distributed, which leads to poor performance of traditional virtual array-based node selection algorithms in this scenario, affecting the communication quality of cooperative transmission.

[0165] It is understood that, in the signal transmission method provided in this application embodiment, considering that most terminal nodes are not densely distributed in actual situations, based on the sparse distribution scenario, the communication area covered by the source node is divided into a first region and a second region according to the line connecting the source node and the target base station's transmission direction. A first cooperative node and a second cooperative node for cooperative transmission are found in the first region and the second region respectively. The found first cooperative node and second cooperative node are located in two symmetrical partitions within the communication area, which can not only satisfy signal transmission in the first region, but also satisfy signal transmission in the second region. By cooperating with the source node and the cooperative nodes determined in different regions, the selected cooperative transmission nodes can meet the signal transmission needs of the communication area covered by the source node in the scenario of sparsely distributed terminal nodes. The cooperative transmission has high cooperative performance and high signal communication quality.

[0166] Based on the above embodiments, it can be considered that with the rapid development of 5G and the Internet of Things, the Internet of Everything has become a vision. Faced with the contradiction between the objective demand for massive connections and the weak radio frequency capabilities of IoT terminal nodes, the symmetric partitioning node selection cooperative transmission scheme proposed in this invention is more suitable for scenarios where IoT terminals are sparsely distributed. By selecting suitable nodes to cooperate with each other through a node selection algorithm, it can not only enhance the electromagnetic transmission capability of terminal nodes, but also effectively control network power consumption, extend the life cycle of the terminal network, and reduce the maintenance cost of terminal nodes. It has reference value for cooperative transmission in IoT scenarios.

[0167] Based on the above embodiments, a method provided in this application, such as Figure 6 As shown, the specific steps include:

[0168] Step 1: When the source node sends a signal to the destination base station, obtain the location of the destination base station, the location of the source node, and the communication area covered by the source node; wherein, the communication area contains multiple communication nodes;

[0169] Step 2: Determine a dividing line that passes through the location of the destination base station and the location of the source node; and based on this dividing line, divide the communication area into a first area and a second area; wherein the first area contains the first communication node among multiple communication nodes; and the second area contains the second communication node among multiple communication nodes.

[0170] Step 3: Obtain the total number of cooperating nodes required for signal transmission; and based on the total number, determine the first preset number and the second preset number.

[0171] Step 4: Search for the first cooperative node from the first communication nodes based on a first preset number; and if the first cooperative node is found, search for the second cooperative node from the second communication nodes based on a second preset number.

[0172] Step 5: Determine the optimal excitation levels for the first cooperating node, the second cooperating node, and the source node;

[0173] Step 6: The source node broadcasts control information to the first cooperating node, the second cooperating node, and the source node; within the delay time range, it determines whether the source node has received feedback information on the successful reception of data transmission signals sent by the first cooperating node, the second cooperating node, and the source node.

[0174] Step 7: If yes, the first cooperating node, the second cooperating node, and the source node transmit signals based on the corresponding optimal excitation level; if no, the faulty node among the first cooperating node, the second cooperating node, and the source node is marked; and a backup target node is determined, and the signal transmission data information is transmitted using the target backup node and other cooperating nodes other than the marked cooperating node.

[0175] Based on the above embodiments, another embodiment of this application provides a terminal device 1, such as... Figure 7 As shown, the terminal device includes:

[0176] The acquisition unit 10 is used to acquire the location of the destination base station, the location of the source node, and the communication area covered by the source node when the source node sends a signal to the destination base station; wherein the communication area contains multiple communication nodes.

[0177] The determining unit 11 is used to determine a dividing line that passes through the location of the destination base station and the location of the source node.

[0178] The partitioning unit 12 is used to divide the communication area into a first area and a second area based on the partition line; wherein the first area contains a first communication node among the plurality of communication nodes; and the second area contains a second communication node among the plurality of communication nodes.

[0179] The search unit 13 is used to search for a first preset number of first cooperative nodes from the first communication nodes; and if the first preset number of first cooperative nodes are found, to search for a second preset number of second cooperative nodes from the second communication nodes.

[0180] The transmission unit 14 is used to transmit the signal to the destination base station based on the first cooperating node, the second cooperating node and the source node.

[0181] Optionally, the acquisition unit 10 is also used to acquire the first position of each first communication node.

[0182] Optionally, the search unit 13 is further configured to search for a first preset number of first cooperative nodes from the first communication nodes based on the distance between the first location and the location of the source node.

[0183] Optionally, the acquisition unit 10 is further configured to acquire the positions of the preset number of first cooperative nodes when a preset number of first cooperative nodes are found.

[0184] Optionally, the determining unit 11 is further configured to determine a desired node corresponding to the preset number of first cooperative nodes based on the positions of the preset number of first cooperative nodes and the position of the source node; wherein the number of desired nodes is the same as the number of first cooperative nodes.

[0185] Optionally, the determining unit 11 is further configured to determine a desired region corresponding to each desired node based on the desired node; wherein each desired region contains a plurality of second communication nodes.

[0186] Optionally, the search unit 13 is also used to search for a second preset number of second cooperative nodes from among the multiple second communication nodes contained in each desired area.

[0187] Optionally, the determining unit 11 is further configured to determine the second location and first remaining energy value of each second communication node contained in each desired area, and the location of the desired node.

[0188] Optionally, the determining unit 11 is further configured to determine the distance between each second communication node and the desired node based on the second position and the position of the desired node.

[0189] Optionally, the determining unit 11 is further configured to determine the node value of each second communication node in each desired region based on the distance between each second communication node and the desired node and the first remaining energy value.

[0190] Optionally, the search unit 13 is also configured to sequentially search for the second communication node with the highest node value in each desired region; and determine the second communication node with the highest node value as the second cooperative node.

[0191] Optionally, the acquisition unit 10 is also used to acquire the target base station antenna receiving gain, signal transmission loss gain, system bit error rate, and cooperating node transmit power.

[0192] Optionally, the determining unit 11 is further configured to determine an omnidirectional radiated power threshold based on the base station antenna receiving gain, the signal transmission loss gain, and the system bit error rate.

[0193] Optionally, the determining unit 11 is further configured to determine the total number of cooperative nodes using a preset cooperative node spatial location information function, the cooperative node transmission power, and the omnidirectional radiation power threshold; and to determine a first preset number and a second preset number based on the total number.

[0194] Optionally, the search unit 13 is further configured to search for a first cooperative node from the first communication nodes based on the first preset number; and if the first cooperative node is found, to search for a second cooperative node from the second communication nodes based on the second preset number.

[0195] Optionally, the acquisition unit 10 is also used to acquire the location of the second cooperative node.

[0196] Optionally, the determining unit 11 is further configured to determine the first optimal excitation level corresponding to the first cooperative node by utilizing the position of the first cooperative node, the preset sidelobe peak power, and the preset genetic algorithm.

[0197] Optionally, the determining unit 11 is further configured to determine the second optimal excitation level corresponding to the second cooperative node by utilizing the position of the second cooperative node, the preset sidelobe peak power, and the preset genetic algorithm.

[0198] Optionally, the determining unit 11 is further configured to determine the third optimal excitation level corresponding to the source node by utilizing the position of the source node, the preset sidelobe peak power, and the preset genetic algorithm.

[0199] Optionally, the transmission unit 14 is further configured to, when transmitting signals using the first cooperating node, the second cooperating node, and the source node, transmit the signals based on the first optimal excitation level; the second cooperating node transmits the signals based on the second optimal excitation level; and the source node transmits the signals based on the third optimal excitation level.

[0200] Optionally, terminal device 1 may further include: a broadcast unit;

[0201] The broadcast unit is used by the source node to broadcast control information to the first cooperating node, the second cooperating node, and the source node; wherein the control information includes time synchronization sequence information, signal transmission data information, and delay time.

[0202] The transmission unit 14 is further configured to, within the delay time, if the source node receives feedback information from the first cooperating node, the second cooperating node, and the source node regarding the successful reception of the signal transmission data information, then transmit the signal using the first cooperating node, the second cooperating node, and the source node.

[0203] The broadcast unit is further configured to, if the source node does not receive the feedback information sent by the cooperating node, rebroadcast the control information to the first cooperating node, the second cooperating node, and the source node.

[0204] Optionally, terminal device 1 may further include: a tagging unit;

[0205] A marking unit is used to mark the first cooperating node and / or the second cooperating node and / or the source node if the source node does not receive the feedback information sent by the first cooperating node, the second cooperating node and the source node.

[0206] Optionally, the determining unit 11 is further configured to determine the desired region corresponding to the marked first cooperative node and / or the second cooperative node and / or the source node; and to determine the spare node included in the desired region corresponding to the marked first cooperative node and / or the second cooperative node and / or the source node.

[0207] Optionally, the search unit 13 is also used to search for a target backup node from the backup nodes.

[0208] Optionally, the transmission unit 14 is further configured to transmit signals using the target backup node and other first cooperative nodes, second cooperative nodes and the source node besides the marked first cooperative node and / or second cooperative node and / or the source node.

[0209] This application provides a terminal device that, when a source node sends a signal to a destination base station, acquires the location of the destination base station, the location of the source node, and the communication area covered by the source node; wherein the communication area contains multiple communication nodes; determines a dividing line passing through the location of the destination base station and the location of the source node; and divides the communication area into a first area and a second area based on the dividing line; wherein the first area contains a first communication node among the multiple communication nodes; the second area contains a second communication node among the multiple communication nodes; searches for a first preset number of first cooperating nodes from the first communication nodes; and if the first preset number of first cooperating nodes are found, searches for a second preset number of second cooperating nodes from the second communication nodes; and transmits the signal to the destination base station based on the first cooperating nodes, the second cooperating nodes, and the source node. Therefore, the terminal device proposed in this application, during signal transmission, takes into account that most terminal nodes are not densely distributed in reality. Based on the sparse distribution scenario, the communication area covered by the source node is divided into a first area and a second area according to the line connecting the source node and the target base station's transmission direction. A first cooperative node and a second cooperative node for cooperative transmission are found in the first area and the second area respectively. The found first cooperative node and second cooperative node are located in two symmetrical partitions within the communication area, which can not only satisfy signal transmission in the first area but also in the second area. By cooperating with the source node and the cooperative nodes determined in different areas, the selected cooperative transmission nodes can meet the signal transmission needs of the communication area covered by the source node in the scenario of sparsely distributed terminal nodes. The cooperative transmission has high performance and high communication quality.

[0210] Figure 8 This is a schematic diagram of the composition structure of a terminal device 1 provided in an embodiment of this application. In practical applications, based on the same disclosed concept of the above embodiments, such as... Figure 8 As shown, the terminal device 1 in this embodiment includes a processor 15, a memory 16, and a communication bus 17.

[0211] In specific embodiments, the aforementioned acquisition unit 10, determination unit 11, division unit 12, search unit 13, transmission unit 14, broadcast unit, and tagging unit can be implemented by a processor 15 located on the terminal device 1. The processor 15 can be at least one of the following: Application Specific Integrated Circuit (ASIC), Digital Signal Processor (DSP), Digital Signal Processing Device (DSPD), Programmable Logic Device (PLD), Field Programmable Gate Array (FPGA), CPU, controller, microcontroller, and microprocessor. It is understood that for different devices, the electronic device used to implement the above processor functions can also be other types; this embodiment does not impose specific limitations.

[0212] In this embodiment, the communication bus 17 is used to realize the connection communication between the processor 15 and the memory 16; when the processor 15 executes the running program stored in the memory 16, it implements the following signal transmission method:

[0213] When a source node sends a signal to a destination base station, the location of the destination base station, the location of the source node, and the communication area covered by the source node are obtained; wherein the communication area contains multiple communication nodes; a dividing line is determined that passes through the location of the destination base station and the location of the source node; and based on the dividing line, the communication area is divided into a first area and a second area; wherein the first area contains a first communication node among multiple communication nodes; and the second area contains a second communication node among multiple communication nodes; a first preset number of first cooperating nodes are searched from the first communication nodes; and if the first preset number of first cooperating nodes are found, a second preset number of second cooperating nodes are searched from the second communication nodes; and the signal is transmitted to the destination base station based on the first cooperating nodes, the second cooperating nodes, and the source node.

[0214] Furthermore, the processor 15 is also used to obtain the first location of each first communication node; and to search for a first preset number of first cooperative nodes from the first communication nodes based on the distance between the first location and the location of the source node.

[0215] Furthermore, the processor 15 is also configured to, when a preset number of first cooperative nodes are found, obtain the locations of the preset number of first cooperative nodes; determine the desired nodes corresponding to the preset number of first cooperative nodes based on the locations of the preset number of first cooperative nodes and the location of the source node; wherein the number of desired nodes is the same as the number of first cooperative nodes; determine the desired region corresponding to each desired node based on the desired nodes; wherein each desired region contains multiple second communication nodes; and search for a second preset number of second cooperative nodes from the multiple second communication nodes contained in each desired region.

[0216] Furthermore, the processor 15 is also configured to determine the second location and first remaining energy value of each second communication node contained in each desired region, and the location of the desired node; determine the distance between each second communication node and the desired node based on the second location and the location of the desired node; determine the node value of each second communication node in each desired region based on the distance between each second communication node and the desired node and the first remaining energy value; sequentially search for the second communication node with the largest node value in each desired region; and determine the second communication node with the largest node value as the second cooperative node.

[0217] Furthermore, the processor 15 is also configured to acquire the target base station antenna receiving gain, signal transmission loss gain, system bit error rate, and cooperating node transmit power; determine an omnidirectional radiated power threshold based on the base station antenna receiving gain, the signal transmission loss gain, and the system bit error rate; determine the total number of cooperating nodes using a preset cooperating node spatial location information function, the cooperating node transmit power, and the omnidirectional radiated power threshold; determine a first preset number and a second preset number based on the total number; search for a first cooperating node from the first communication nodes based on the first preset number; and if the first cooperating node is found, search for a second cooperating node from the second communication nodes based on the second preset number.

[0218] Furthermore, the processor 15 is also configured to: acquire the position of the second cooperative node; determine a first optimal excitation level corresponding to the first cooperative node using the position of the first cooperative node, a preset sidelobe peak power, and a preset genetic algorithm; determine a second optimal excitation level corresponding to the second cooperative node using the position of the second cooperative node, a preset sidelobe peak power, and a preset genetic algorithm; determine a third optimal excitation level corresponding to the source node using the position of the source node, a preset sidelobe peak power, and a preset genetic algorithm; when signal transmission is performed using the first cooperative node, the second cooperative node, and the source node, the first cooperative node performs signal transmission based on the first optimal excitation level; the second cooperative node performs signal transmission based on the second optimal excitation level; and the source node performs signal transmission based on the third optimal excitation level.

[0219] Furthermore, the processor 15 is also configured to broadcast control information from the source node to the first cooperating node, the second cooperating node, and the source node; wherein the control information includes time synchronization sequence information, signal transmission data information, and a delay time; within the delay time, if the source node receives feedback information from the first cooperating node, the second cooperating node, and the source node indicating successful reception of the signal transmission data information, then the source node uses the first cooperating node, the second cooperating node, and the source node to transmit the signal; if the source node does not receive the feedback information from the first cooperating node, the second cooperating node, and the source node, then the source node rebroadcasts the control information to the first cooperating node, the second cooperating node, and the source node.

[0220] Furthermore, the processor 15 is also configured to: mark the first cooperating node and / or the second cooperating node and / or the source node if the source node does not receive the feedback information sent by the first cooperating node, the second cooperating node and / or the source node; determine the desired area corresponding to the marked first cooperating node and / or the second cooperating node and / or the source node; determine the backup node included in the desired area corresponding to the marked first cooperating node and / or the second cooperating node and / or the source node; search for a target backup node from the backup nodes; and use the target backup node and other first cooperating nodes, second cooperating nodes and the source node besides the marked first cooperating node and / or the second cooperating node and / or the source node to transmit signals.

[0221] Based on the above embodiments, this application provides a storage medium storing a computer program thereon. The computer-readable storage medium stores one or more programs, which can be executed by one or more processors and applied in a terminal device. The computer program implements the data processing method described above.

[0222] It should be noted that, in this document, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Unless otherwise specified, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes that element.

[0223] Through the above description of the embodiments, those skilled in the art can clearly understand that the methods of the above embodiments can be implemented by means of software plus necessary general-purpose hardware platforms. Of course, they can also be implemented by hardware, but in many cases the former is a better implementation method. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the related technology, can be embodied in the form of a software product. This computer software product is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk) and includes several instructions to cause an image display device (which may be a mobile phone, computer, server, air conditioner, or network device, etc.) to execute the methods described in the various embodiments of this application.

[0224] The above description is merely a specific embodiment of this application, but the scope of protection of this application is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the technical scope disclosed in this application should be included within the scope of protection of this application. Therefore, the scope of protection of this application should be determined by the scope of the claims.

Claims

1. A signal transmission method, characterized in that, The method includes: When a source node sends a signal to a destination base station, the location of the destination base station, the location of the source node, and the communication area covered by the source node are obtained; wherein, the communication area contains multiple communication nodes; A dividing line is determined that passes through the location of the destination base station and the location of the source node; and based on the dividing line, the communication area is divided into an equal first area and a second area; wherein, the first area contains a first communication node among the plurality of communication nodes; and the second area contains a second communication node among the plurality of communication nodes; the dividing line is obtained by connecting the location of the destination base station and the location of the source node to form a line segment, and extending the line segment; Find a first preset number of first cooperative nodes from the first communication nodes; and if the first preset number of first cooperative nodes are found, find a second preset number of second cooperative nodes from the second communication nodes; The signal is transmitted to the destination base station based on the first cooperating node, the second cooperating node, and the source node.

2. The method according to claim 1, characterized in that, The step of searching for a first preset number of first cooperative nodes from the first communication nodes includes: Obtain the first position of each first communication node; Based on the distance between the first location and the location of the source node, a first preset number of first cooperative nodes are searched from the first communication nodes.

3. The method according to claim 1, characterized in that, The step of searching for a second preset number of second cooperative nodes from the second communication node includes: If a preset number of first collaborative nodes are found, the positions of the preset number of first collaborative nodes are obtained; Based on the positions of the preset number of first collaborative nodes and the position of the source node, a desired node corresponding to the preset number of first collaborative nodes is determined; wherein, the number of desired nodes is the same as the number of first collaborative nodes; Based on the desired nodes, a desired region corresponding to each desired node is determined; wherein, each desired region contains multiple second communication nodes; Find a second preset number of second cooperative nodes from the multiple second communication nodes contained in each desired area.

4. The method according to claim 3, characterized in that, The step of searching for a second preset number of second cooperative nodes from a plurality of second communication nodes contained in each desired region includes: Determine the second location and first remaining energy value of each second communication node contained in each desired region, and the location of the desired node; Based on the second location and the location of the desired node, determine the distance between each second communication node and the desired node; Based on the distance between each second communication node and the desired node and the first remaining energy value, the node value of each second communication node in each desired region is determined; The second communication node with the highest node value is sequentially searched in each desired region; and the second communication node with the highest node value is determined as the second cooperative node.

5. The method according to claim 1, characterized in that, The first preset number of first cooperative nodes are searched from the first communication node; In the case that the first preset number of first cooperative nodes have been found, the second preset number of second cooperative nodes are searched from the second communication nodes, including: Obtain the target base station antenna receive gain, signal transmission loss gain, system bit error rate, and cooperating node transmit power; Based on the base station antenna receiving gain, the signal transmission loss gain, and the system bit error rate, the omnidirectional radiated power threshold is determined. The total number of cooperative nodes is determined by using a preset cooperative node spatial location information function, the transmission power of the cooperative nodes, and the omnidirectional radiation power threshold. Based on the total quantity, determine the first preset quantity and the second preset quantity; The first cooperative node is searched from the first communication nodes based on the first preset number; and if the first cooperative node is found, the second cooperative node is searched from the second communication nodes based on the second preset number.

6. The method according to claim 1, characterized in that, The transmission of the signal to the destination base station based on the first cooperating node, the second cooperating node, and the source node includes: Obtain the location of the second collaborating node; The first optimal excitation level corresponding to the first cooperative node is determined by using the location of the first cooperative node, the preset sidelobe peak power, and the preset genetic algorithm. The second optimal excitation level corresponding to the second cooperative node is determined by using the location of the second cooperative node, the preset sidelobe peak power, and the preset genetic algorithm. Using the location of the source node, the preset sidelobe peak power, and the preset genetic algorithm, the third optimal excitation level corresponding to the source node is determined; When signal transmission is performed using the first cooperating node, the second cooperating node, and the source node, the first cooperating node transmits the signal based on the first optimal excitation level; the second cooperating node transmits the signal based on the second optimal excitation level; and the source node transmits the signal based on the third optimal excitation level.

7. The method according to claim 1, characterized in that, Before transmitting the signal to the destination base station based on the first cooperating node, the second cooperating node, and the source node, the method further includes: The source node broadcasts control information to the first cooperating node, the second cooperating node, and the source node; wherein, the control information includes time synchronization sequence information, signal transmission data information, and delay time; During the delay time, if the source node receives feedback information from the first cooperating node, the second cooperating node, and the source node indicating successful reception of the signal transmission data, then the source node uses the first cooperating node, the second cooperating node, and the source node to transmit the signal. If the source node does not receive the feedback information sent by the first cooperating node, the second cooperating node, and the source node, then the source node rebroadcasts the control information to the first cooperating node, the second cooperating node, and the source node.

8. The method according to claim 7, characterized in that, After the source node rebroadcasts the control information to the first cooperating node, the second cooperating node, and the source node, the method further includes: If the source node does not receive the feedback information from the first collaborating node, the second collaborating node, and the source node, it marks the first collaborating node and / or the second collaborating node and / or the source node. Determine the desired region corresponding to the marked first cooperative node and / or the second cooperative node and / or the source node; and determine the spare nodes included in the desired region corresponding to the marked first cooperative node and / or the second cooperative node and / or the source node; Locate the target backup node from the backup nodes; and use the target backup node and other first cooperative nodes, second cooperative nodes and the source node other than the marked first cooperative node and / or second cooperative node and / or the source node to transmit the signal.

9. A terminal device, characterized in that, The terminal device includes: The acquisition unit is used to acquire the location of the destination base station, the location of the source node, and the communication area covered by the source node when the source node sends a signal to the destination base station; wherein the communication area contains multiple communication nodes. A determining unit is used to determine a dividing line that passes through the location of the destination base station and the location of the source node; wherein the dividing line is obtained by connecting the location of the destination base station and the location of the source node to form a line segment, and extending the line segment; A partitioning unit is used to divide the communication area into an equal first region and a second region based on the dividing line; wherein the first region contains a first communication node among the plurality of communication nodes; and the second region contains a second communication node among the plurality of communication nodes. The search unit is configured to search for a first preset number of first cooperative nodes from the first communication nodes; and if the first preset number of first cooperative nodes are found, to search for a second preset number of second cooperative nodes from the second communication nodes. A transmission unit is used to transmit the signal to the destination base station based on the first cooperating node, the second cooperating node, and the source node.

10. A terminal device, characterized in that, The terminal device includes: a processor, a memory, and a communication bus; when the processor executes the running program stored in the memory, it implements the functionality described in claim 1. The method described in any one of the 8 methods.

11. A storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by the processor, it implements as described in claim 1. The method described in any one of the 8 methods.