Priority multicast configuration method and system for relay side equipment

Abstract

The invention provides a priority multicast configuration method and system for relay side equipment, and the method comprises the steps: obtaining the correlation factor data of a relay, and calculating the weight value of the relay based on the correlation factor data; if the relay with the maximum weight value does not exist in the preset multicast tree, a path adding step is executed, and the path adding step comprises the steps of obtaining a related path from the relay to the multicast tree, adding the related path and the relay to the multicast tree, and moving out the relay; and repeatedly executing the judgment step until a preset ending condition is met, obtaining a final multicast tree, and completing the priority multicast configuration of the relay side equipment. According to the priority multicast configuration method and system for the relay side equipment provided by the invention, the relay with the maximum weight value is selected each time to carry out the path adding step, so that the transmission efficiency of relay signals is improved, the end condition is preset, the infrastructure of the multicast tree is quickly and effectively established, and the priority multicast configuration of the relay side equipment is realized.

Description

Technical Field

[0001] The present invention relates to the technical field of power distribution communication, and in particular to a priority multicast configuration method for relay side equipment. Background Art

[0002] In the field of power communication, multicast technology plays a vital role. With the rapid development of information technology, more and more application scenarios require efficient multicast communication to meet the needs of large-scale data transmission. When facing complex network environments and a large number of users, traditional multicast methods often encounter problems such as low transmission efficiency, serious waste of resources, and large signal interference. On the relay side, the existing multicast configuration method is difficult to fully consider the impact of various factors on communication quality, resulting in limited coverage and poor user experience. If the traditional unicast method is adopted, it will greatly occupy network bandwidth resources and increase network load. Multicast technology can effectively solve this problem, send data to multiple receivers at the same time, and improve the utilization rate of network resources. Multicast can play an important role in the data acquisition and monitoring system of the power system, the relay upgrade protection system, and the distributed energy management in the smart grid. With the continuous development and improvement of the intelligence level of the power system, multicast technology will be more widely used.

[0003] Relay multicast is of great significance in modern communications. The one-to-many feature of multicast has important application value in the relay of power systems. It can realize rapid fault information dissemination, coordinated control, collective upgrade, strengthen the management of distributed energy, and improve the effect of video monitoring and remote maintenance. In a complex communication environment, the transmission distance and coverage of signals are often limited. The introduction of relays can effectively expand the coverage of signals and improve the reliability and stability of communication systems. Relay multicast realizes efficient data transmission to multiple receiving ends based on relays. Through relay multicast, information from the sender can be transmitted to multiple users at the same time, greatly improving the efficiency of data transmission.

[0004] However, there are some problems with the existing relay multicast methods. For example, when selecting relay nodes, the priority of the nodes and the combined influence of various factors are often not fully considered, resulting in the construction of the multicast tree being not optimized enough, affecting the communication quality and efficiency; in an environment with large signal interference, relay multicast may be seriously affected, reducing the reliability of data transmission. Therefore, a method for constructing a multicast tree is urgently needed for optimization and adjustment. Summary of the invention

[0005] The present invention aims to provide a priority multicast configuration method and system for relay-side equipment to solve the above-mentioned technical problems, and can quickly and effectively establish the basic architecture of the multicast tree, ensure that the multicast tree can always cover the associated factors of the relay and maintain high-quality signal transmission quality, and realize the priority multicast configuration of the relay-side equipment.

[0006] In order to solve the above technical problems, the present invention provides a priority multicast configuration method for relay side equipment, comprising the following steps:

[0007] Acquire the associated factor data of the relay, and calculate the weight value of the relay based on the associated factor data;

[0008] If the relay with the largest weight value does not exist in the preset multicast tree, a path adding step is performed, wherein the path adding step is: obtaining a relevant path from the relay to the multicast tree, adding the relevant path and the relay to the multicast tree, and removing the relay;

[0009] The above determination steps are repeated until the preset end condition is met, the final multicast tree is obtained, and the priority multicast configuration of the relay side equipment is completed.

[0010] In the above scheme, by selecting the relay with the largest weight value to perform the path adding step each time, the transmission efficiency of the relay signal is improved, and the end condition is preset to quickly and effectively establish the basic architecture of the multicast tree, thereby realizing the priority multicast configuration of the relay side equipment.

[0011] Furthermore, the associated factor data of the relay is obtained, and the weight value of the relay is calculated based on the associated factor data. The specific calculation process satisfies the following formula:

[0012]

[0013] Where: W represents the weight value of the relay, N represents the number of covered users, N max represents the maximum number of users covered by all relays; S represents the number of connected terminals within a period of time, S max represents the maximum number of consecutive terminals in all relays within a period of time; B represents bandwidth resources, B max It represents the maximum value of bandwidth resources among all relays; α, β, and λ represent the weight coefficients corresponding to the number of covered users, stability, and bandwidth resources of the relay, respectively, and α+β+λ=1.

[0014] Optionally, after calculating the weight values ​​of the relays, a priority queue is formed according to the size relationship of the weight values, and the relay with the largest weight value is selected based on the priority queue.

[0015] In the above scheme, the weight value is calculated by considering multiple factors such as the number of covered users, stability, bandwidth resources, etc., and performing a comprehensive evaluation, among which: the number of covered users reflects the scale of users that the relay can serve, and the larger the number, the higher the weight value; stability ensures that the relay can work continuously and stably, reducing the risk of signal interruption; bandwidth resources determine the data flow that the relay can carry, thereby ensuring that the relay can maintain high-quality signal transmission quality.

[0016] Furthermore, if the relay with the largest weight value does not exist in the preset multicast tree, a path adding step is executed, and the path adding step is: obtaining the relevant path from the relay to the multicast tree, adding the relevant path and the relay to the multicast tree, and removing the relay, including: if the relay with the largest weight value does not exist in the preset multicast tree, performing path search based on the relay and the multicast tree to obtain the relevant path; adding the relevant path and the relay to the multicast tree, and removing the relay.

[0017] In the above scheme, the relay with the largest weight value is selected each time for path search, and the relay and related paths are added to the multicast tree, which can quickly establish the infrastructure of the multicast tree and ensure that the signal can be transmitted from the sender through a reliable relay.

[0018] Optionally, if the relay with the largest weight is already in the multicast tree, the relay is directly removed.

[0019] Optionally, the weight values ​​are arranged from high to low to form a priority queue. Based on the priority queue, the first relay is selected as the first relay each time. If the first relay does not exist in the preset multicast tree, the path adding step is executed, specifically: first obtain the relevant path from the first relay to the multicast tree, add the relevant path and the first relay to the multicast tree, and remove the first relay from the priority queue; if the first relay is already in the multicast tree, directly remove the first relay from the priority queue.

[0020] In the above scheme, a priority queue is constructed from high to low according to the weight value, so that when building a multicast tree, a relay with better performance can be selected first, laying the foundation for efficient construction of the multicast tree; when a relay is already in the multicast tree, the relay is directly removed to avoid repeated selection of relays already in the tree, ensuring that each selected relay is new and can bring more connections and coverage to the multicast tree.

[0021] Furthermore, adding the relevant path and the relay to the multicast tree and removing the relay also includes: if there are several relevant paths, selecting the shortest relevant path that does not exceed the preset interference threshold, adding the shortest relevant path and the relay to the multicast tree, and removing the relay.

[0022] In the above scheme, when there are multiple relevant paths leading to the multicast tree, the shortest relevant path that does not exceed the preset interference threshold is selected and added to the multicast tree through the preset interference threshold. This can reduce the impact of interference on the signal, ensure signal quality, reduce the delay of signal transmission, and improve transmission efficiency.

[0023] Furthermore, if the relay with the largest weight value does not exist in the preset multicast tree, a path search is performed based on the relay and the multicast tree to obtain relevant paths, including: building a search area based on the relay and the multicast tree and a preset path threshold; and obtaining relevant paths based on the path search algorithm and the search area.

[0024] In the above scheme, by constructing a search area to limit the path search range and using an efficient path search algorithm to search for the path from the relay to the multicast tree in the search area, all possible paths can be found quickly and accurately, and the efficiency of path search is significantly improved.

[0025] Furthermore, if the relay with the largest weight value does not exist in the preset multicast tree, a path adding step is executed, and the path adding step is: obtaining the relevant path from the relay to the multicast tree, adding the relevant path and the relay to the multicast tree, and removing the relay, and also includes: introducing a real-time monitoring mechanism to monitor the relay interference data in the multicast tree in real time. If the interference data of a certain relay exceeds the preset interference threshold, a path search is performed on the relay to obtain the current relevant path, and the current relevant path replaces the relevant path of the relay in the multicast tree.

[0026] In the above scheme, the relay interference situation in the multicast tree is continuously monitored through a real-time monitoring mechanism, and an interference threshold is preset to ensure that the relay interference situation in the multicast tree is within the set range. When it exceeds the set range, replacement adjustment is performed, thereby realizing timely detection and processing of relay signal interference problems, ensuring that the multicast tree is always kept in the best state.

[0027] Furthermore, if the relay with the largest weight value does not exist in the preset multicast tree, a path adding step is executed, and the path adding step is: obtaining the relevant path from the relay to the multicast tree, adding the relevant path and the relay to the multicast tree, and removing the relay, and also includes: setting a regular inspection mechanism to obtain the status data and interference intensity of the relay in the multicast tree. If the status data of the relay in the multicast tree does not meet the preset normal state, or the interference intensity does not meet the preset normal intensity, the relay is removed from the multicast tree.

[0028] Optionally, a periodic check mechanism is triggered at a preset time interval to perform a comprehensive check on the multicast tree, including relay status data (whether there is a failure, overall performance, whether there are new relays that can be added) and interference intensity to further optimize the multicast tree and ensure that it is always in the best condition.

[0029] In the above scheme, by adding a regular inspection mechanism, dynamic adjustment of the multicast tree is achieved, potential problems are discovered and solved in time, the reliability and stability of the multicast tree are guaranteed, and the system can run continuously and stably.

[0030] Furthermore, the above judgment steps are repeated until the preset end condition is met, the final multicast tree is obtained, and the priority multicast configuration of the relay side equipment is completed, including: when no relay that can be added to the multicast tree is found, the preset end condition is met, the final multicast tree is obtained, and the priority multicast configuration of the relay side equipment is completed.

[0031] In the above scheme, the above determination steps are repeatedly performed until no relay that can be added to the multicast tree is found, so as to ensure that all possible relays are considered before the multicast tree construction process is terminated.

[0032] Furthermore, the above judgment steps are repeated until the preset end condition is met, the final multicast tree is obtained, and the priority multicast configuration of the relay side equipment is completed. It also includes: introducing an early end condition mechanism. When the relay in the multicast tree meets the preset end condition when covering all preset user requirements, the final multicast tree is obtained to complete the priority multicast configuration of the relay side equipment.

[0033] In the above scheme, an early termination condition mechanism is introduced. When the relays in the multicast tree meet the requirements of covering all preset users, the process is terminated in advance to obtain the final multicast tree, thereby avoiding unnecessary calculation and waste of resources. Especially when the user demand is relatively small or the relay resources are limited, the optimal multicast tree configuration can be quickly determined, thereby improving the response speed of the system.

[0034] In the above scheme, by calculating the relay weight value, each time the relay with the largest weight value that does not exist in the preset multicast tree is selected to perform the path adding step, the transmission efficiency of the relay signal is improved, and it is ensured that the signal will be transmitted from the sending end through a reliable relay; a real-time monitoring mechanism is introduced and an interference threshold is set to minimize signal interference and ensure signal quality; an early termination condition mechanism and a regular inspection mechanism are introduced to ensure that the multicast tree adapts to the dynamic changes of the network environment; and finally a flexible and efficient multicast tree construction method is realized, so that the multicast tree always covers user needs and maintains high-quality signal transmission quality.

[0035] The present invention also provides a system for priority multicast configuration of relay side equipment, which is used to implement the above-mentioned priority multicast configuration method for relay side equipment, including:

[0036] A relay weight calculation module, used to obtain the associated factor data of the relay and calculate the weight value of the relay based on the associated factor data;

[0037] A relay adding module, for executing a path adding step if the relay with the largest weight value does not exist in the preset multicast tree, wherein the path adding step is: obtaining a relevant path from the relay to the multicast tree, adding the relevant path and the relay to the multicast tree, and removing the relay;

[0038] The multicast tree construction module is used to repeatedly execute the above judgment steps until the preset end condition is met, obtain the final multicast tree, and complete the priority multicast configuration of the relay side equipment.

[0039] In the above scheme, the relay weight calculation module comprehensively considers the associated factor data of the receiving relay and calculates the weight value, so that the relay adding module gives priority to the relay with better performance; during the multicast tree construction process, the relay adding module continuously takes out the relay with the highest weight and finds the relevant path to add it to the multicast tree, ensuring that the signal starts to propagate from a reliable relay and quickly establishes the infrastructure; the multicast tree construction module repeats the judgment operation of the relay adding module and sets the preset end condition to realize the multicast tree construction while avoiding resource waste and improving the system response speed, and finally realizes a flexible and efficient multicast tree construction method, so that the multicast tree always covers user needs and maintains high-quality signal transmission quality. BRIEF DESCRIPTION OF THE DRAWINGS

[0040] Figure 1 A schematic flow chart of a method for priority multicast configuration of relay-side equipment provided in one embodiment of the present invention;

[0041] Figure 2 A schematic diagram of a multicast tree and path selection algorithm provided by an embodiment of the present invention;

[0042] Figure 3 A schematic diagram of a search area for path finding provided by an embodiment of the present invention;

[0043] Figure 4 A flowchart of a method for generating a priority multicast tree for relay-side equipment is provided in accordance with an embodiment of the present invention. DETAILED DESCRIPTION

[0044] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0045] Embodiment 1:

[0046] See also Figure 1This embodiment provides a method for priority multicast configuration of relay side equipment, comprising the following steps:

[0047] Acquire the associated factor data of the relay, and calculate the weight value of the relay based on the associated factor data;

[0048] If the relay with the largest weight value does not exist in the preset multicast tree, a path adding step is performed, wherein the path adding step is: obtaining a relevant path from the relay to the multicast tree, adding the relevant path and the relay to the multicast tree, and removing the relay;

[0049] The above determination steps are repeated until the preset end condition is met, the final multicast tree is obtained, and the priority multicast configuration of the relay side equipment is completed.

[0050] In the specific implementation process, the relay with the largest weight value is selected each time to perform the path addition step, thereby improving the transmission efficiency of the relay signal, and presetting the end condition to quickly and effectively establish the basic architecture of the multicast tree, thereby realizing the priority multicast configuration of the relay side equipment.

[0051] Furthermore, the associated factor data of the relay is obtained, and the weight value of the relay is calculated based on the associated factor data. The specific calculation process satisfies the following formula:

[0052]

[0053] Where: W represents the weight value of the relay, N represents the number of covered users, N max represents the maximum number of users covered by all relays; S represents the number of connected terminals within a period of time, S max represents the maximum number of consecutive terminals in all relays within a period of time; B represents bandwidth resources, B max It represents the maximum value of bandwidth resources among all relays; α, β, and λ represent the weight coefficients corresponding to the number of covered users, stability, and bandwidth resources of the relay, respectively, and α+β+λ=1.

[0054] Optionally, after calculating the weight values ​​of the relays, a priority queue is formed according to the size relationship of the weight values, and the relay with the largest weight value is selected based on the priority queue.

[0055] In the specific implementation process, the number of covered users reflects the service scope and potential influence of the relay. By taking the ratio of N to Nmax for normalization and then multiplying it by the logarithmic function log2(N+1), when the number of covered users is small, the weight growth is relatively slow, and when the number of covered users is large, the weight growth rate is faster, highlighting the importance of relays with a large number of users, so as to ensure that relays with a high number of users and high bandwidth receive higher priority. After the bandwidth resource B is normalized with Bmax, it is multiplied by 2 / (1+e-B / 10 ) In this part, when the bandwidth resources are small, the weight increases relatively slowly. As the bandwidth resources increase, the weight increases faster, highlighting the advantages of high-bandwidth relays. By comprehensively evaluating these factors, a weight value is calculated for each receiving relay, and then the weight values ​​are sorted from high to low to form a priority queue.

[0056] In the specific implementation process, when selecting relay nodes, if the priority of the nodes and the combined influence of various factors are not fully considered, the construction of the multicast tree will not be optimized enough, affecting the communication quality and efficiency; in addition, in an environment with large signal interference, the relay multicast may be seriously affected, reducing the reliability of data transmission. Therefore, by comprehensively considering multiple factors such as the number of covered users, stability, bandwidth resources, and performing a comprehensive evaluation to calculate the weight value, it is ensured that the relay can maintain high-quality signal transmission quality. Among them: the number of covered users reflects the scale of users that the relay can serve, and the more the number, the higher the weight value; stability ensures that the relay can work continuously and stably, reducing the risk of signal interruption; bandwidth resources determine the data flow that the relay can carry.

[0057] Furthermore, if the relay with the largest weight value does not exist in the preset multicast tree, a path adding step is executed, and the path adding step is: obtaining the relevant path from the relay to the multicast tree, adding the relevant path and the relay to the multicast tree, and removing the relay, including: if the relay with the largest weight value does not exist in the preset multicast tree, performing path search based on the relay and the multicast tree to obtain the relevant path; adding the relevant path and the relay to the multicast tree, and removing the relay.

[0058] In the specific implementation process, each time the relay with the largest weight value is selected for path search, and the relay and related paths are added to the multicast tree, which can quickly establish the infrastructure of the multicast tree and ensure that the signal can be transmitted from the sender through a reliable relay.

[0059] Optionally, if the relay with the largest weight is already in the multicast tree, the relay is directly removed.

[0060] Optionally, the weight values ​​are arranged from high to low to form a priority queue. Based on the priority queue, the first relay is selected as the first relay each time. If the first relay does not exist in the preset multicast tree, the path adding step is executed, specifically: first obtain the relevant path from the first relay to the multicast tree, add the relevant path and the first relay to the multicast tree, and remove the first relay from the priority queue; if the first relay is already in the multicast tree, directly remove the first relay from the priority queue.

[0061] In the specific implementation process, a priority queue is constructed from high to low according to the weight value, so that when building the multicast tree, the relay with better performance can be given priority, laying the foundation for efficient construction of the multicast tree; when the relay is already in the multicast tree, it is directly removed to avoid repeated selection of the relay already in the tree, ensuring that the relay selected each time is new and can bring more connections and coverage to the multicast tree.

[0062] Furthermore, adding the relevant path and the relay to the multicast tree and removing the relay also includes: if there are several relevant paths, selecting the shortest relevant path that does not exceed the preset interference threshold, adding the shortest relevant path and the relay to the multicast tree, and removing the relay.

[0063] In the specific implementation process, when there is only one relevant path, the relevant path and relay are added to the multicast tree. This situation is relatively simple and direct, and the multicast tree can be expanded quickly. When there are multiple relevant paths leading to the multicast tree, the shortest relevant path that does not exceed the preset interference threshold is selected and added to the multicast tree through the preset interference threshold. This can reduce the impact of interference on the signal, ensure signal quality, reduce the delay of signal transmission, and improve transmission efficiency.

[0064] Optionally, the preset interference threshold takes into account both signal interference strength and adjacent channel interference. The signal-to-noise ratio (SINR) is used to measure signal quality. The signal-to-noise ratio must be greater than or equal to 25dB, which means that the ratio of signal to noise must be high enough to ensure signal clarity and reliability; at the same time, the adjacent channel power ratio (ACPR) of the first adjacent channel must be greater than or equal to 45dBc, and the adjacent channel power ratio of the second adjacent channel must be greater than or equal to 50dBc. The adjacent channel power ratio is used to evaluate adjacent channel interference to ensure that the interference of adjacent channels is within an acceptable range. The shortest related path is selected from the related paths whose interference is less than the threshold requirement to join the multicast tree to ensure the signal quality and stability of the multicast tree.

[0065] In the specific implementation process, the signal to interference plus noise ratio (SINR): Signal to Interference plusNoise Ratio, refers to the ratio of the strength of the received useful signal to the strength of the received interference signal (noise and interference); it can be simply understood as the "signal-to-noise ratio". Adjacent Channel Power Ratio (ACPR): Adjacent Channel Power Ratio, refers to the ratio of the average power of the adjacent frequency channel to the average power of the currently used channel. The adjacent channel power ratio (Adjacent Channel Power Ratio) is a common indicator for measuring the linearity of the transmission system. It can be used to describe the out-of-band spectrum distortion characteristics of the signal caused by the nonlinear distortion of the power amplifier, that is, the degree of leakage of the main power to the adjacent channel.

[0066] In the specific implementation process, refer to Figure 2 The multicast tree and path selection diagram shown in the figure can generate a multicast tree with the lowest interference. (a) is a network prototype. Nodes 1 and 2 both cover the receiver 4, so the receiver has two paths to choose from when joining the multicast tree. As shown in (b), relay node 2 has two neighbors in the tree, while relay node 1 in the path shown in (c) has only one neighbor. Therefore, the path shown in (b) will have large interference, so the path shown in (c) is selected.

[0067] Furthermore, if the relay with the largest weight value does not exist in the preset multicast tree, a path search is performed based on the relay and the multicast tree to obtain relevant paths, including: building a search area based on the relay and the multicast tree and a preset path threshold; and obtaining relevant paths based on the path search algorithm and the search area.

[0068] In the specific implementation process, by constructing a search area to limit the path search range, using an efficient path search algorithm, and searching for the path from the relay to the multicast tree within the constructed search area, all possible paths can be found quickly and accurately, and the efficiency of path search is significantly improved.

[0069] Optionally, when constructing a search region, such as Figure 3 As shown in the figure, the starting point node and the target node are connected as the x-axis, and the axis perpendicular to the x-axis is used as the y-axis to form a rectangular coordinate system. Two preset path thresholds Q1 and Q2 are set. With the starting node as the center, the distance Q2 is extended from the target node along the positive direction of the x-axis, the distance Q2 is extended from the starting node along the negative direction of the x-axis, and the distance Q1 / 2 is extended from the starting node along the positive and negative directions of the y-axis to construct a rectangular search area; and the Dijkstra algorithm is used to find the path in the constructed rectangular search area. Since the search area is limited, the efficiency of the algorithm will be significantly improved.

[0070] Optionally, the path finding algorithm selects Dijkstra algorithm, which is an algorithm for finding the shortest path between nodes, proposed by Dutch computer scientist Edsger W.Dijkstra in 1956. The basic steps of Dijkstra algorithm are as follows: Initialization, set the distance of the starting point to 0, set the distance of all other vertices to infinity (indicates that it has not been determined yet), and create a set to store the vertices whose shortest paths have been determined; select the unvisited vertex closest to the starting point, and select the vertex with the smallest distance value among the unvisited vertices. If all vertices have been visited, the algorithm ends; update the distance of neighbor vertices, calculate the distance of all neighbor vertices of the current vertex, and see if the neighbor vertex can be reached closer through the current vertex. If it is indeed closer, update the distance value of the neighbor vertex; repeat the above process until all vertices have been visited or there are no more vertices whose distances can be updated. This algorithm is very suitable for solving the single-source shortest path problem in weighted directed or undirected graphs, that is, starting from a given starting node, find the shortest path to all other nodes.

[0071] Furthermore, if the relay with the largest weight value does not exist in the preset multicast tree, a path adding step is executed, and the path adding step is: obtaining the relevant path from the relay to the multicast tree, adding the relevant path and the relay to the multicast tree, and removing the relay, and also includes: introducing a real-time monitoring mechanism to monitor the relay interference data in the multicast tree in real time. If the interference data of a certain relay exceeds the preset interference threshold, a path search is performed on the relay to obtain the current relevant path, and the current relevant path replaces the relevant path of the relay in the multicast tree.

[0072] During the specific implementation process, the relay interference situation in the multicast tree is continuously monitored through a real-time monitoring mechanism, and an interference threshold is preset to ensure that the relay interference situation in the multicast tree is within the set range. When it exceeds the set range, replacement and adjustment are performed, so as to timely discover and deal with relay signal interference problems, ensuring that the multicast tree is always kept in the best state.

[0073] Furthermore, if the relay with the largest weight value does not exist in the preset multicast tree, a path adding step is executed, and the path adding step is: obtaining the relevant path from the relay to the multicast tree, adding the relevant path and the relay to the multicast tree, and removing the relay, and also includes: setting a regular inspection mechanism to obtain the status data and interference intensity of the relay in the multicast tree. If the status data of the relay in the multicast tree does not meet the preset normal state, or the interference intensity does not meet the preset normal intensity, the relay is removed from the multicast tree.

[0074] Optionally, a periodic check mechanism is triggered at a preset time interval to perform a comprehensive check on the multicast tree, including relay status data (whether there is a failure, overall performance, whether there are new relays that can be added) and interference intensity to further optimize the multicast tree and ensure that it is always in the best condition.

[0075] In the specific implementation process, by adding a regular inspection mechanism, dynamic adjustment of the multicast tree is achieved, potential problems are discovered and resolved in a timely manner, the reliability and stability of the multicast tree are guaranteed, and the system can run continuously and stably.

[0076] In the specific implementation process, although the real-time monitoring mechanism and the periodic inspection mechanism have similarities, the two are triggered in different ways. The real-time monitoring mechanism continuously monitors the interference of the relays that have been added to the tree, while the periodic inspection mechanism is triggered according to a pre-set time interval. In addition, the monitoring content and scope are also different. The real-time monitoring mechanism mainly focuses on the interference of the relays that have been added to the tree. For example, by monitoring the signal interference strength, adjacent channel interference and other parameters directly related to signal quality, interference problems can be discovered and resolved in a timely manner to ensure clear and reliable signal transmission. The periodic inspection mechanism usually conducts a comprehensive inspection of the multicast tree, including the status of the relay (whether there is a fault), the overall performance, whether there are new relays that can be added to further optimize the multicast tree, etc., to ensure that it is always in the best state.

[0077] Furthermore, the above judgment steps are repeated until the preset end condition is met, the final multicast tree is obtained, and the priority multicast configuration of the relay side equipment is completed, including: when no relay that can be added to the multicast tree is found, the preset end condition is met, the final multicast tree is obtained, and the priority multicast configuration of the relay side equipment is completed.

[0078] In a specific implementation process, the above determination steps are repeatedly performed until no relay that can be added to the multicast tree is found, so as to ensure that all possible relays are considered before terminating the multicast tree construction process.

[0079] Furthermore, the above judgment steps are repeated until the preset end condition is met, the final multicast tree is obtained, and the priority multicast configuration of the relay side equipment is completed. It also includes: introducing an early end condition mechanism. When the relay in the multicast tree meets the preset end condition when covering all preset user requirements, the final multicast tree is obtained to complete the priority multicast configuration of the relay side equipment.

[0080] During the specific implementation process, an early termination condition mechanism is introduced. When the relays in the multicast tree meet the requirements of covering all preset users, the process is terminated in advance to obtain the final multicast tree, avoiding unnecessary calculation and resource waste. Especially when user demand is relatively small or relay resources are limited, the optimal multicast tree configuration can be determined quickly to improve the response speed of the system.

[0081] The present embodiment provides a method for priority multicast configuration of relay-side equipment, which calculates the relay weight value, selects the relay with the largest weight value that does not exist in the preset multicast tree each time, and performs the path adding step, thereby improving the transmission efficiency of the relay signal, ensuring that the signal will be transmitted from the sending end through a reliable relay, introducing a real-time monitoring mechanism and setting an interference threshold to minimize signal interference and ensure signal quality, and introducing an early termination condition mechanism and a regular inspection mechanism to ensure that the multicast tree adapts to dynamic changes in the network environment. These measures work together to ensure that the multicast tree can maintain the optimal state in a dynamically changing environment and provide high-quality services, ultimately realizing a flexible and efficient multicast tree construction method.

[0082] Embodiment 2:

[0083] This embodiment provides a specific process of multicast configuration, which is used to implement a method for priority multicast configuration for relay side equipment provided in Embodiment 1, such as Figure 4 As shown, the specific steps include:

[0084] Start, receive relay;

[0085] First, the weight value W is calculated by comprehensively considering factors such as the number of covered users, stability, and bandwidth resources, and the priority queue is formed by sorting the weight values ​​from high to low. Each time, the first relay in the queue is selected as the first relay;

[0086] Perform path search based on the first relay and multicast tree to obtain relevant paths;

[0087] When there are multiple (m) related paths, the shortest related path among the m related paths that meets the preset interference threshold (SINR>=25dB, ACPR of the first adjacent channel>=45dBc, ACPR of the second channel>=50dBc) is selected and added to the multicast tree. When there is only a single related path, it is directly added to the multicast tree and the first relay is removed from the priority queue.

[0088] End, get the multicast tree.

[0089] The present embodiment provides a specific process of multicast configuration. The receiving relay comprehensively considers multiple factors, including the number of users covered by the relay, the stability of the connection, and bandwidth resources, and determines the priority of the relay by calculating the weight value W. In the process of building a multicast tree, the relay is first selected based on the priority queue, and then the shortest relevant path that meets the preset interference threshold is screened and added to the multicast tree, so as to realize fast and efficient construction of the multicast tree.

[0090] Embodiment three:

[0091] The present invention also provides a system for priority multicast configuration of relay side equipment, which is used to implement the above-mentioned priority multicast configuration method for relay side equipment, including:

[0092] A relay weight calculation module, used to obtain the associated factor data of the relay and calculate the weight value of the relay based on the associated factor data;

[0093] A relay adding module, for executing a path adding step if the relay with the largest weight value does not exist in the preset multicast tree, wherein the path adding step is: obtaining a relevant path from the relay to the multicast tree, adding the relevant path and the relay to the multicast tree, and removing the relay;

[0094] The multicast tree construction module is used to repeatedly execute the above judgment steps until the preset end condition is met, obtain the final multicast tree, and complete the priority multicast configuration of the relay side equipment.

[0095] During the specific implementation process, the relay weight calculation module comprehensively considers the associated factor data of the receiving relay and calculates the weight value, so that the relay adding module can give priority to the relay with better performance; during the multicast tree construction process, the relay adding module continuously takes out the relay with the highest weight and finds the relevant path to add it to the multicast tree, ensuring that the signal starts to propagate from a reliable relay and quickly establishes the infrastructure; the multicast tree construction module repeats the judgment operation of the relay adding module and sets the preset end condition to realize the multicast tree construction while avoiding resource waste and improving the system response speed, and finally realizes a flexible and efficient multicast tree construction method, so that the multicast tree always covers user needs and maintains high-quality signal transmission quality.

[0096] Optionally, the relay weight calculation module comprehensively considers the number of users covered by the receiving relay, stability, bandwidth resources and other factors to calculate the weight value to form a priority queue, so that when building a multicast tree, relays with better performance can be given priority. For example, a large number of covered users can serve a larger number of users, strong stability reduces the risk of interruption, and abundant bandwidth resources determine the data carrying capacity. The priority queue formed by comprehensive evaluation lays the foundation for efficient construction of multicast trees.

[0097] Optionally, in the process of building a multicast tree, the multicast tree construction module continuously extracts the relay with the highest weight and finds the shortest path to add it to the tree, ensuring that the signal starts to propagate from a reliable relay and quickly establishes the infrastructure. At the same time, it avoids repeatedly selecting relays that are already in the tree, ensuring that each selection is a new relay to increase connectivity and coverage. For multiple paths, the shortest path with the least interference is selected from the paths that meet the interference threshold, effectively reducing signal interference and ensuring signal quality and transmission efficiency. By setting a reasonable interference threshold, using the signal-to-noise ratio and adjacent channel power ratio as the measurement criteria, the signal interference strength and adjacent channel interference are controlled to ensure the stability of the multicast tree signal quality.

[0098] Optionally, add a conditional judgment module, a real-time monitoring module and a periodic inspection module to ensure that the multicast tree can adapt to the dynamic changes of the network environment: the conditional judgment module is used to introduce an early termination condition judgment mechanism to end the process in advance when user needs are met, avoid resource waste, and improve system response speed; the real-time monitoring module is used to implement a real-time monitoring mechanism, continuously monitor relay interference, and handle problems in a timely manner to ensure the optimal state of the multicast tree; the periodic inspection module is used to implement a periodic inspection mechanism, regularly conduct a comprehensive inspection of the multicast tree, dynamically adjust the structure, ensure reliability and stability, and promptly discover and solve potential problems.

[0099] The system for priority multicast configuration of relay-side equipment provided in this embodiment cooperates with the relay weight calculation module, the relay addition module and the multicast tree construction module to finally realize a flexible and efficient multicast tree construction method, so that the multicast tree always covers user needs and maintains high-quality signal transmission quality, and adds a real-time monitoring module to minimize signal interference and ensure signal quality. It also adds an early termination condition module and a regular inspection module to ensure that the multicast tree adapts to dynamic changes in the network environment. The quality inspection of different modules works together to ensure that the multicast tree can maintain the optimal state in a dynamically changing environment and provide high-quality services, and finally realizes a flexible and efficient multicast tree construction system.

[0100] The above is a preferred embodiment of the present invention. It should be pointed out that a person skilled in the art can make several improvements and modifications without departing from the principle of the present invention. These improvements and modifications are also considered to be within the scope of protection of the present invention.

Claims

1. A priority multicast configuration method for relay side equipment, characterized in that: The following steps are involved: Acquire the associated factor data of the relay, and calculate the weight value of the relay based on the associated factor data; If the relay with the largest weight value does not exist in the preset multicast tree, a path adding step is performed, wherein the path adding step is: obtaining a relevant path from the relay to the multicast tree, adding the relevant path and the relay to the multicast tree, and removing the relay; The above determination steps are repeated until the preset end condition is met, the final multicast tree is obtained, and the priority multicast configuration of the relay side equipment is completed.

2. A priority multicast configuration method for relay side equipment according to claim 1, characterized in that: The obtaining of the associated factor data of the relay and the calculation of the weight value of the relay based on the associated factor data, the specific calculation process satisfies the following formula: Where: W represents the weight value of the relay, N represents the number of covered users, N max represents the maximum number of users covered by all relays; S represents the number of connected terminals within a period of time, S max represents the maximum number of consecutive terminals in all relays within a period of time; B represents bandwidth resources, B max It represents the maximum value of bandwidth resources among all relays; α, β, and λ represent the weight coefficients corresponding to the number of covered users, stability, and bandwidth resources of the relay, respectively, and α+β+λ=1.

3. A priority multicast configuration method for relay side equipment according to claim 1, characterized in that: If the relay with the largest weight value does not exist in the preset multicast tree, a path adding step is performed, and the path adding step is: obtaining a relevant path from the relay to the multicast tree, adding the relevant path and the relay to the multicast tree, and removing the relay, including: If the relay with the largest weight value does not exist in the preset multicast tree, a path search is performed based on the relay and the multicast tree to obtain a relevant path; Add the relevant paths and the relay to the multicast tree, and remove the relay.

4. A priority multicast configuration method for relay side equipment according to claim 3, characterized in that: The adding of the relevant path and the relay to the multicast tree and removing the relay also includes: if there are several relevant paths, selecting the shortest relevant path that does not exceed the preset interference threshold, adding the shortest relevant path and the relay to the multicast tree, and removing the relay.

5. A priority multicast configuration method for relay side equipment according to claim 3, characterized in that: If the relay with the largest weight value does not exist in the preset multicast tree, performing path search based on the relay and the multicast tree to obtain the relevant path includes: Building a search area based on relay and multicast trees and preset path thresholds; Get relevant paths based on the path finding algorithm and search area.

6. A priority multicast configuration method for relay side equipment according to claim 3, characterized in that: If the relay with the largest weight value does not exist in the preset multicast tree, a path adding step is executed, and the path adding step is: obtaining the relevant path from the relay to the multicast tree, adding the relevant path and the relay to the multicast tree, and removing the relay, and also includes: introducing a real-time monitoring mechanism to monitor the relay interference data in the multicast tree in real time. If the interference data of a certain relay exceeds the preset interference threshold, a path search is performed on the relay to obtain the current relevant path, and the current relevant path replaces the relevant path of the relay in the multicast tree.

7. A priority multicast configuration method for relay side equipment according to claim 3, characterized in that: If the relay with the largest weight value does not exist in the preset multicast tree, a path adding step is executed, and the path adding step is: obtaining the relevant path from the relay to the multicast tree, adding the relevant path and the relay to the multicast tree, and removing the relay. It also includes: setting a regular inspection mechanism to obtain the status data and interference intensity of the relay in the multicast tree. If the status data of the relay in the multicast tree does not meet the preset normal state, or the interference intensity does not meet the preset normal intensity, the relay is removed from the multicast tree.

8. A priority multicast configuration method for relay side equipment according to claim 1, characterized in that: The above-mentioned judgment steps are repeatedly executed until the preset end condition is met, the final multicast tree is obtained, and the priority multicast configuration of the relay side equipment is completed, including: when the preset end condition cannot be found to join the multicast tree, the preset end condition is met, the final multicast tree is obtained, and the priority multicast configuration of the relay side equipment is completed.

9. A priority multicast configuration method for relay side equipment according to claim 8, characterized in that: The above-mentioned judgment steps are repeatedly executed until the preset end condition is met, the final multicast tree is obtained, and the priority multicast configuration of the relay side equipment is completed. It also includes: introducing an early end condition mechanism, when the relay in the multicast tree meets the preset end condition when covering all preset user requirements, the final multicast tree is obtained, and the priority multicast configuration of the relay side equipment is completed.

10. A system for priority multicast configuration of relay side equipment, characterized in that: A method for configuring priority multicast for relay side equipment according to any one of claims 1 to 9, comprising: A relay weight calculation module, used to obtain the associated factor data of the relay and calculate the weight value of the relay based on the associated factor data; A relay adding module, for executing a path adding step if the relay with the largest weight value does not exist in the preset multicast tree, wherein the path adding step is: obtaining a relevant path from the relay to the multicast tree, adding the relevant path and the relay to the multicast tree, and removing the relay; The multicast tree construction module is used to repeatedly execute the above judgment steps until the preset end condition is met, obtain the final multicast tree, and complete the priority multicast configuration of the relay side equipment.

Images