A multi-hop relay network path selection system that comprehensively considers transmission quality and energy consumption balance

Abstract

The present invention discloses a multi-hop relay network path selection system that comprehensively considers transmission quality and energy consumption balance, and relates to the field of multi-hop relay network technology. The technical key points are: by clustering the deployed relay nodes, relay nodes with similar positions are used as mutually replaceable spare nodes, and their roles in transmission quality and energy consumption balance are comprehensively considered. Transmission quality-energy consumption balance relationship variables are introduced to characterize different requirements for multi-hop relay network transmission in different scenarios, and the optimal relay node can be selected as the transmission path according to different requirements. The algorithm can improve the transmission quality of the multi-hop relay network, balance the energy consumption of each relay node, and can realize rapid adjustment of the transmission path according to different requirements for multi-hop relay network transmission in different scenarios.

Description

Technical Field

[0001] The present invention relates to the technical field of multi-hop relay networks, and in particular to a multi-hop relay network path selection system that comprehensively considers transmission quality and energy consumption balance. Background Art

[0002] A multi-hop relay network is a communication technology that transmits data through multiple relay nodes, aiming to expand coverage and improve network performance. A multi-hop relay network mainly includes a base station BS (Base Station), multiple relay nodes RS (RelayStation) and user UE. Generally, the transmission signal is sent by the base station BS, relayed in sequence by several relay nodes RS, and finally received by the user UE. The purpose of using the relay node RS is to reprocess the signal of the base station BS or the upper-level relay node RS before sending it out to achieve the effect of wireless signal relay. Since the relay node covers a wide area, different transmission paths usually exist at the same time. Therefore, it is necessary to select the best transmission path from these different transmission paths to transmit the signal. That is, select the appropriate relay node RS as the relay path to achieve the effect of enhancing signal quality and user experience.

[0003] At present, domestic and foreign researchers have been focusing on the algorithm of multi-hop relay network path selection as a research hotspot and conducting research in multiple directions to meet the network communication needs in different scenarios. Although the problems of energy consumption balance of relay nodes, node clustering, cluster head election, etc. have been solved, there are few studies on comprehensively considering the transmission quality and energy consumption balance requirements, and quickly adjusting the transmission path according to the different requirements for transmission in different scenarios. There is no algorithm proposed to solve the path selection problem by clustering first and then optimizing.

[0004] To this end, the present invention aims to provide a multi-hop relay network path selection system that comprehensively considers transmission quality and energy consumption balance to solve the above problems. Summary of the invention

[0005] The purpose of the present invention is to solve the above problems and to provide a multi-hop relay network path selection system that comprehensively considers transmission quality and energy consumption balance, comprehensively considers and meets the two requirements of transmission quality and energy consumption balance, and selects a path that meets the transmission quality and energy consumption balance requirements through an algorithm, which can effectively improve the transmission quality of the multi-hop relay network and balance the energy consumption of each relay node.

[0006] In order to achieve the above object, the technical solution of the present invention is as follows:

[0007] The present invention provides a multi-hop relay network path selection system that comprehensively considers transmission quality and energy consumption balance, and the system comprises a path module and an energy consumption module;

[0008] The path module organizes the relay nodes RS into a relay node set U, and the points in U are divided into n different sets according to their distribution positions. , randomly select an unvisited data point P from U, the neighborhood radius of P Contains at least data points, then P is the core point, and the point P and its distance is no more than All points as a set , will be collected Marked as a cluster, we can finally get the cluster divided by U ;

[0009] The clusters divided by U , respectively calculate The centroid ,

[0010]

[0011] in, and Centroid The horizontal and vertical coordinates of Cluster All points included, m is a cluster The number of points included, using the centroid Representative cluster The distribution position of the clusters, the centroid points of all clusters form a set C;

[0012] According to the base station BS, user UE and centroid The signal transmission path is planned. The signal is sent by the base station BS and passes through several cluster centroids. The signal is relayed in sequence and finally received by the user UE; the signal in the path module is sent by the base station BS, and the second-hop relay node selects the nearest cluster centroid ; The signal is relayed by the k-th hop node The next hop relay node selects the nearest cluster centroid or user UE; repeat the above steps until a transmission path is found so that the signal is sent by the base station BS and passes through several cluster centroids in turn Relayed and finally received by the user UE.

[0013] The energy consumption module selects a cluster Establish a candidate node matrix from the points in For each candidate node AS, measure the signal-to-noise ratio SINR of the signal received from the previous relay node and the remaining energy E of the candidate node AS, and sort them from large to small to obtain the signal-to-noise ratio sorting number matrix And energy consumption balance sorting number matrix ;

[0014] Compute Cluster Priority Matrix , , , Elements in the priority matrix is the priority parameter, corresponding to the candidate node matrix Alternative Nodes The priority of , priority parameter The smaller the value, the more candidate nodes In cluster The higher the priority in the cluster, the The node with the highest priority in is the selected node SS. ,if ,but Cluster The selected node ;

[0015] The cluster centroids in the path obtained by the path module Replace with the corresponding selected node , and finally obtain the selected multi-hop path: the signal is sent by the base station BS and passes through several selected nodes in turn Relayed and finally received by the user UE.

[0016] S1. In a multi-hop relay network, the deployed relay nodes RS can be regarded as multiple points with different positions on a plane, forming a relay node set U. Cluster analysis is performed on the relay node set U, and the points in the relay node set U are divided into n different sets according to their distribution positions. . (n is a natural number)

[0017] S101, assigning parameters according to the distribution position of the midpoint of the relay node set U , ; is the radius of the neighborhood, is the minimum number of data points in the neighborhood.

[0018] Neighborhood: p and q are both data points in U, , then the object p in the data set U The neighborhood is represented by :

[0019]

[0020] in, is the distance between point p and point q.

[0021] S102. Set all the points in the relay node set U as unvisited.

[0022] S103. Randomly select an unvisited data point P from the relay node set U.

[0023] S104、If P The neighborhood contains at least data points, then P is determined to be the core point. All points as a set (t is the ordinal number of the set, ).

[0024] S105, for All points in are checked to see if they are core points.

[0025] S106: If a new core point is detected, add the new core point and all points within a certain distance from it to the set. , repeat step S105.

[0026] If no new core point is detected, the collection After the division is completed, the collection Mark it as a cluster and Set all points in as visited.

[0027] S107, repeat steps S103 to S106 until all points in the relay node set U are traversed, and finally the clusters divided by the relay node set U are obtained. .

[0028] S2, the clusters divided by the relay node set U , respectively calculate The centroid .

[0029]

[0030] in, and Centroid The horizontal and vertical coordinates of Cluster All points included, m is a cluster Contains the number of points.

[0031] Use centroid Representative cluster The centroids of all clusters form a set C.

[0032]

[0033] S3, according to the base station BS, user UE and centroid The signal transmission path is planned. The signal is sent by the base station BS and passes through several cluster centroids. It is relayed in sequence and finally received by the user UE.

[0034] S301, the signal is sent by the base station BS, and the second-hop relay node selects the nearest cluster centroid .

[0035] S302, the signal is transmitted by the k-th hop relay node The next hop relay node selects the nearest cluster centroid Or user UE. (k is a natural number not exceeding n)

[0036] S303, repeat step S302 until a transmission path is found so that the signal sent by the base station BS passes through several cluster centroids in sequence Relay, and finally received by the user UE. (v is a natural number not exceeding n)

[0037] S4. According to the different requirements of transmission quality of multi-hop relay transmission and balancing the energy consumption of each relay node, the transmission quality-energy consumption balance relationship variable is given

[0038]

[0039] The closer it is to 1, the higher the transmission quality is. , this transmission has the highest quality; The closer to -1, the more the transmission can balance the energy consumption of the relay node. , this transmission can best balance the energy consumption of the relay nodes.

[0040] S5. Set up cluster The point in the middle is the alternative station (AS):

[0041]

[0042] Cluster One of them, .

[0043] Cluster For all points in The number of midpoints.

[0044] According to the alternative node AS (Alternative Station), establish an alternative node matrix .

[0045] S6. For each candidate node AS, measure the signal-to-noise ratio SINR of the signal received from the previous relay node and the remaining energy E of the candidate node AS.

[0046] First, for ,Will The candidate nodes AS in the SINR are sorted from large to small according to the SINR, and the SINR sorting number matrix is ​​obtained.

[0047]

[0048] SNR sorting number matrix In The candidate node matrix The corresponding candidate node in In cluster The signal-to-noise ratio sorting sequence.

[0049] Secondly, The candidate nodes AS in the energy balance sorting matrix are sorted from large to small according to the remaining energy E.

[0050]

[0051] Energy consumption balance sorting number matrix In The candidate node matrix The corresponding candidate node in The energy balance sorting sequence in the cluster.

[0052] S7, Compute Cluster Priority Matrix

[0053]

[0054] The priority matrix One of them, . l is The number of elements in .

[0055] Priority Matrix Elements in is the priority parameter, corresponding to the candidate node matrix Alternative Nodes priority.

[0056] Priority Parameters for One of them, .

[0057] Priority Parameters The smaller the value, the more candidate nodes are. In cluster The higher the priority.

[0058] cluster The node with the highest priority is the selected node SS (Selected Station).

[0059] for ,if ,but Cluster The selected node .

[0060] S8, the path obtained in the third step "signal is sent by the base station BS and passes through several cluster centroids in sequence The "cluster centroid" in the relay and finally received by the user UE " is replaced by the corresponding selected node The final selected multi-hop path is obtained: the signal is sent by the base station BS and passes through several selected nodes in turn. Relayed and finally received by the user UE.

[0061] Compared with the prior art, this solution has the following beneficial effects:

[0062] 1. The present invention comprehensively considers and meets the two requirements of transmission quality and energy consumption balance, and selects a path that meets the transmission quality and energy consumption balance requirements through an algorithm, which can effectively improve the transmission quality of the multi-hop relay network and balance the energy consumption of each relay node;

[0063] 2. The present invention sets a transmission quality-energy consumption balance relationship variable in the algorithm process, and adjusts the coordinated relationship between the transmission quality of the network and the energy consumption balance of each relay node through the variable, so as to realize rapid adjustment of the transmission path according to different requirements for multi-hop relay network transmission in different scenarios;

[0064] 3. The present invention uses the DBSCAN algorithm to perform cluster analysis on multiple deployed relay nodes. It does not need to specify the number of clusters and can divide clusters of any shape. It has strong adaptability to the scale of relay nodes, can fully meet the transmission quality and energy consumption balance requirements, and improve signal transmission efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0065] Figure 1 is an algorithm flow chart of the system in an embodiment of the present invention;

[0066] Figure 2 This is the algorithm flow of the system in the embodiment of the present invention. Figure 1 The subsequent flow chart. DETAILED DESCRIPTION

[0067] In order to enable those skilled in the art to better understand the solution of the present invention, the technical solution of the present invention will be further described in detail below in conjunction with the embodiments of the present invention and the accompanying drawings. 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 should fall within the scope of protection of the present invention.

[0068] It should be noted that, in the absence of conflict, the embodiments and features in the embodiments of the present invention can be combined with each other. The present invention will be described in detail below in conjunction with the embodiments.

[0069] Example:

[0070] In mobile communication networks, multi-hop relay network transmission is an important technology for enhancing network coverage and signal quality. In multi-hop relay network transmission, path selection plays a vital role. The multi-hop relay network mainly includes a base station BS (Base Station), multiple relay nodes RS (Relay Station) and user UE. Generally, the transmission signal is sent by the base station BS, relayed in sequence by several relay nodes RS, and finally received by the user UE. The purpose of using the relay node RS is to reprocess the signal of the base station BS or the upper-level relay node RS before sending it out to achieve wireless signal relay. The multi-hop relay transmission of the signal requires planning the transmission path, that is, selecting the appropriate relay node RS as the relay path to achieve the effect of enhancing network coverage and signal quality.

[0071] S1. In a multi-hop relay network, the deployed relay nodes RS can be regarded as multiple points with different positions on a plane, forming a relay node set U. Cluster analysis is performed on the relay node set U, and the points in the relay node set U are divided into n different sets according to their distribution positions. . (n is a natural number)

[0072] S101, assigning parameters according to the distribution position of the midpoint of the relay node set U , , is the radius of the neighborhood, is the minimum number of data points in the neighborhood.

[0073] Neighborhood: p and q are both data points in U, , then the object p in the data set U The neighborhood is represented by :

[0074]

[0075] in, is the distance between point p and point q.

[0076] S102. Set all the points in the relay node set U as unvisited.

[0077] S103. Randomly select an unvisited data point P from the relay node set U.

[0078] S104、If P The neighborhood contains at least data points, then P is determined to be the core point. All points as a set (t is the ordinal number of the set, ).

[0079] S105, for All points in are checked to see if they are core points.

[0080] S106: If a new core point is detected, add the new core point and all points within a certain distance from it to the set. , repeat step S105.

[0081] If no new core point is detected, the collection After the division is completed, the collection Mark it as a cluster and Set all points in as visited.

[0082] S107, repeat steps S103 to S106 until all points in the relay node set U are traversed, and finally the clusters divided by the relay node set U are obtained. .

[0083] S2, the clusters divided by the relay node set U , respectively calculate The centroid .

[0084]

[0085] in, and Centroid The horizontal and vertical coordinates of Cluster All points included, m is a cluster Contains the number of points.

[0086] Use centroid Representative cluster The centroids of all clusters form a set C.

[0087]

[0088] S3, according to the base station BS, user UE and centroid The signal transmission path is planned. The signal is sent by the base station BS and passes through several cluster centroids. It is relayed in sequence and finally received by the user UE.

[0089] S301, the signal is sent by the base station BS, and the second-hop relay node selects the nearest cluster centroid .

[0090] S302, the signal is transmitted by the k-th hop relay node The next hop relay node selects the nearest cluster centroid Or user UE. (k is a natural number not exceeding n)

[0091] S303, repeat step S302 until a transmission path is found so that the signal sent by the base station BS passes through several cluster centroids in sequence Relay, and finally received by the user UE. (v is a natural number not exceeding n)

[0092] S4. According to the different requirements of transmission quality of multi-hop relay transmission and balancing the energy consumption of each relay node, the transmission quality-energy consumption balance relationship variable is given

[0093]

[0094] The closer it is to 1, the higher the transmission quality is. , this transmission has the highest quality; The closer to -1, the more the transmission can balance the energy consumption of the relay node. , this transmission can best balance the energy consumption of the relay nodes.

[0095] S5. Set up cluster The point in the middle is the alternative station (AS):

[0096]

[0097] Cluster One of them, .

[0098] Cluster For all points in The number of midpoints.

[0099] According to the alternative node AS (Alternative Station), establish an alternative node matrix .

[0100] S6. For each candidate node AS, measure the signal-to-noise ratio SINR of the signal received from the previous relay node and the remaining energy E of the candidate node AS.

[0101] First, for ,Will The candidate nodes AS in the SINR are sorted from large to small according to the SINR, and the SINR sorting number matrix is ​​obtained.

[0102]

[0103] SNR sorting number matrix In The candidate node matrix The corresponding candidate node in In cluster The signal-to-noise ratio sorting sequence.

[0104] Secondly, The candidate nodes AS in the energy balance sorting matrix are sorted from large to small according to the remaining energy E.

[0105]

[0106] Energy consumption balance sorting number matrix In The candidate node matrix The corresponding candidate node in The energy balance sorting sequence in the cluster.

[0107] S7, Compute Cluster Priority Matrix

[0108]

[0109] The priority matrix One of them, . l is The number of elements in .

[0110] Priority Matrix Elements in is the priority parameter, corresponding to the candidate node matrix Alternative Nodes priority.

[0111] Priority Parameters for One of them, .

[0112] Priority Parameters The smaller the value, the more candidate nodes are. In cluster The higher the priority.

[0113] cluster The node with the highest priority is the selected node SS (Selected Station).

[0114] for ,if ,but Cluster The selected node .

[0115] S8, the path obtained in the third step "signal is sent by the base station BS and passes through several cluster centroids in sequence The "cluster centroid" in the relay and finally received by the user UE " is replaced by the corresponding selected node The final selected multi-hop path is obtained: the signal is sent by the base station BS and passes through several selected nodes in turn. Relayed and finally received by the user UE.

[0116] The above specific embodiments are merely explanations of the present invention and are not limitations of the present invention. After reading this specification, those skilled in the art may make modifications to the embodiments without any creative contribution as needed. However, such modifications are protected by the patent law as long as they are within the scope of the claims of the present invention.

Claims

1. A multi-hop relay network path selection system that comprehensively considers transmission quality and energy consumption balance, characterized by: The system includes a path module and an energy consumption module; The path module organizes the relay nodes RS into a relay node set U, and the points in U are divided into n different sets according to their distribution positions. , randomly select an unvisited data point P from U, the neighborhood radius of P Contains at least data points, then P is the core point, and the point P and its distance is no more than All points as a set , will be collected Marked as a cluster, we can finally get the cluster divided by U ; The clusters divided by U , respectively calculate The centroid , ； in, and Centroid The horizontal and vertical coordinates of Cluster All points included, m is a cluster The number of points included, using the centroid Representative cluster The distribution position of all clusters is composed of the centroid points of ; According to the base station BS, user UE and centroid The signal transmission path is planned. The signal is sent by the base station BS and passes through several cluster centroids. Relayed in sequence, and finally received by the user UE; The energy consumption module selects a cluster Establish a candidate node matrix from the points in For each candidate node AS, measure the signal-to-noise ratio SINR of the signal received from the previous relay node and the remaining energy E of the candidate node AS, and sort them from large to small to obtain the signal-to-noise ratio sorting number matrix And energy consumption balance sorting number matrix ; Compute Cluster Priority Matrix , , ； Elements in the priority matrix is the priority parameter, corresponding to the candidate node matrix Alternative Nodes The priority of , priority parameter The smaller the value, the more candidate nodes In cluster The higher the priority in the cluster, the The node with the highest priority in is the selected node ,for ,like ,but Cluster The selected node ; The cluster centroids in the path obtained by the path module Replace with the corresponding selected node , and finally the selected multi-hop path is obtained: the signal is transmitted from the base station Issued, passing through several selected nodes in turn Relay, and finally by user take over.

2. A multi-hop relay network path selection system that comprehensively considers transmission quality and energy consumption balance as described in claim 1, characterized in that: The signal in the path module is transmitted by the base station The second-hop relay node selects the nearest cluster centroid ; The signal is relayed by the k-th hop node The next hop relay node selects the nearest cluster centroid or user UE; Repeat the above steps until a transmission path is found so that the signal sent by the base station BS passes through several cluster centroids in sequence. Relayed and finally received by the user UE.

3. A method for implementing the above-mentioned multi-hop relay network path selection system that comprehensively considers transmission quality and energy consumption balance, characterized by: The method comprises the following steps: S1. The relay nodes RS in the multi-hop relay network are regarded as multiple points with different positions on a plane, forming a relay node set U. Cluster analysis is performed on the relay node set U, and the points in the relay node set U are divided into n different sets according to their distribution positions. ; S101, assigning parameters according to the distribution position of the midpoint of the relay node set U , ; is the radius of the neighborhood, is the minimum number of data points in the neighborhood; Neighborhood: , then the object p in the data set U The neighborhood is represented by : ； in, is the distance between point p and point q; S102, setting all points in the relay node set U as unvisited; S103, randomly select an unvisited data point P from the relay node set U; S104, if P The neighborhood contains at least data points, then P is determined to be the core point; point P and its distance is no more than All points as a set ; S105, for All points in , check whether they are core points; S106: If a new core point is detected, add the new core point and all points within a certain distance from it to the set. , repeat step S105; If no new core point is detected, the collection After the division is completed, the collection Mark it as a cluster and All points in are set as visited; S107, repeat steps S103 to S106 until all points in the relay node set U are traversed, and finally the clusters divided by the relay node set U are obtained. ; S2, the clusters divided by the relay node set U , respectively calculate The centroid ; ； in, and Centroid The horizontal and vertical coordinates of Cluster All points included, Cluster The number of included points; Use centroid Representative cluster The distribution position of the clusters; the centroid points of all clusters form a set C; ； S3, according to the base station BS, user UE and centroid The signal transmission path is planned. The signal is sent by the base station BS and passes through several cluster centroids. Relayed in sequence, and finally received by the user UE; S301, the signal is sent by the base station BS, and the second-hop relay node selects the nearest cluster centroid ; S302, the signal is transmitted by the k-th hop relay node The next hop relay node selects the nearest cluster centroid or user UE; S303, repeat step S302 until a transmission path is found so that the signal sent by the base station BS passes through several cluster centroids in sequence Relay, and finally received by the user UE; S4. According to the different requirements of transmission quality of multi-hop relay transmission and balancing the energy consumption of each relay node, the transmission quality-energy consumption balance relationship variable is given ; ； The closer it is to 1, the higher the transmission quality is. , this transmission has the highest quality; The closer to -1, the more the transmission can balance the energy consumption of the relay node. When , this transmission can best balance the energy consumption of the relay nodes; S5. Set up cluster The points in are candidate nodes AS: ； Cluster One of them, ; Cluster For all points in The number of midpoints; According to the candidate node AS, establish the candidate node matrix ; S6. For each candidate node AS, measure the signal-to-noise ratio SINR of the signal received from the previous relay node and the remaining energy E of the candidate node AS; First, for ,Will The candidate nodes AS in the sequence are sorted from large to small according to the signal-to-noise ratio SINR, and the signal-to-noise ratio sorting number matrix is ​​obtained; ; SNR sorting number matrix In The candidate node matrix The corresponding candidate node in In cluster SNR sorting number; Secondly, The candidate nodes AS in the array are sorted from large to small according to the remaining energy E, and the energy consumption balance sorting number matrix is ​​obtained; ; Energy consumption balance sorting number matrix In The candidate node matrix The corresponding candidate node in Energy consumption balance sorting sequence number in the cluster; S7, Compute Cluster Priority Matrix ; ; The priority matrix One of them, ; l is The number of elements in Priority Matrix Elements in is the priority parameter, corresponding to the candidate node matrix Alternative Nodes Priority; Priority Parameters for One of them, ; Priority Parameters The smaller the value, the more candidate nodes are. In cluster The higher the priority; cluster The node with the highest priority in is the selected node SS; for ,like ,but Cluster The selected node ; S8, the path " signal obtained in S3 is sent by the base station BS and passes through several cluster centroids in sequence Relay, and finally received by the user UE" in the "cluster centroid " is replaced by the corresponding selected node ; Get the final selected multi-hop path: the signal is sent by the base station BS and passes through several selected nodes in turn Relayed and finally received by the user UE.

Images