CN112839344A - Relay node deployment optimization method for multi-hop relay network - Google Patents

Relay node deployment optimization method for multi-hop relay network Download PDF

Info

Publication number
CN112839344A
CN112839344A CN202110433720.7A CN202110433720A CN112839344A CN 112839344 A CN112839344 A CN 112839344A CN 202110433720 A CN202110433720 A CN 202110433720A CN 112839344 A CN112839344 A CN 112839344A
Authority
CN
China
Prior art keywords
relay
hop
relay network
network
node
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202110433720.7A
Other languages
Chinese (zh)
Other versions
CN112839344B (en
Inventor
邹玉龙
谢飞
朱佳
李斌
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nanjing University of Posts and Telecommunications
Original Assignee
Nanjing University of Posts and Telecommunications
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Nanjing University of Posts and Telecommunications filed Critical Nanjing University of Posts and Telecommunications
Priority to CN202110433720.7A priority Critical patent/CN112839344B/en
Publication of CN112839344A publication Critical patent/CN112839344A/en
Application granted granted Critical
Publication of CN112839344B publication Critical patent/CN112839344B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/18—Network planning tools
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/18—Complex mathematical operations for evaluating statistical data, e.g. average values, frequency distributions, probability functions, regression analysis
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/02—Arrangements for optimising operational condition

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Data Mining & Analysis (AREA)
  • General Physics & Mathematics (AREA)
  • Mathematical Optimization (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Theoretical Computer Science (AREA)
  • Mathematical Physics (AREA)
  • Computational Mathematics (AREA)
  • Pure & Applied Mathematics (AREA)
  • Mathematical Analysis (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • Operations Research (AREA)
  • Probability & Statistics with Applications (AREA)
  • Evolutionary Biology (AREA)
  • Algebra (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • Databases & Information Systems (AREA)
  • Software Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Radio Relay Systems (AREA)

Abstract

The invention discloses a relay node deployment optimization method for a multi-hop relay network, and aims to solve the problem of relay node deployment in the multi-hop relay network in the prior art. It includes: obtaining a relay node joint optimization model based on the interrupt probability of the multi-hop relay network; and generating an optimization problem according to the joint optimization model of the relay nodes, and calculating a relay node deployment scheme of the multi-hop relay network according to the optimization problem. The method can reduce the interruption probability of the multi-hop relay network to the maximum extent and ensure the reliability of data transmission.

Description

Relay node deployment optimization method for multi-hop relay network
Technical Field
The invention relates to a relay node deployment optimization method for a multi-hop relay network, and belongs to the technical field of wireless communication.
Background
As the density of users in wireless communication networks continues to increase, communication systems are moving towards higher rates, greater capacity, wider coverage, and lower cost. Compared with the traditional single-hop communication network, the multi-hop communication can effectively resist the large-scale fading of user transmission and the interference of high transmitting power to other users, the relay is applied to the communication network, the signal coverage can be effectively expanded, a reliable and stable communication link can be established, and the long-distance unstable transmission becomes more stable and effective. In a multi-hop relay network, the deployment of relays is crucial to the stability of a communication system, and the more relays used by the system, the better the channel quality of a single hop is relative to the direct communication of a source node and a destination node, but when the number of hops increases, more time slots must be spent on transmission, thereby causing the reduction of spectrum efficiency. Therefore, more and more scholars begin to study the influence of the number of hops on the communication performance of the multihop relay network, and it is important for wireless communication to improve the communication performance by effectively deploying relay nodes in the multihop relay network.
Disclosure of Invention
In order to solve the problem of relay node deployment in the multi-hop relay network, the invention provides a relay node deployment optimization method facing the multi-hop relay network, which takes the interrupt probability of the multi-hop relay network as an optimization target and improves the communication quality of the multi-hop relay network by jointly optimizing the relay number and the deployment position.
In order to solve the technical problems, the invention adopts the following technical means:
the invention provides a relay node deployment optimization method facing a multi-hop relay network, which comprises the following steps:
obtaining a relay node joint optimization model based on the interrupt probability of the multi-hop relay network;
and generating an optimization problem according to the joint optimization model of the relay nodes, and calculating a relay node deployment scheme of the multi-hop relay network according to the optimization problem.
Further, the method for calculating the interruption probability of the multi-hop relay network comprises the following steps:
calculating the channel capacity of each hop according to the channel parameters of the multi-hop relay network, wherein the calculation formula is as follows:
Figure DEST_PATH_IMAGE001
（1）
wherein the content of the first and second substances,C m representing a multihop relay networkmThe channel capacity of the hop is determined,m=1,2,…,M，Mfor the number of hops of a multi-hop relay network,h m representing a multihop relay networkmThe instantaneous channel fading coefficients of the hops,
Figure 108078DEST_PATH_IMAGE002
representing a multihop relay networkmThe signal-to-noise ratio of the hop;
calculating the channel capacity of the multi-hop relay network according to the channel capacity of each hop, wherein the calculation formula is as follows:
Figure DEST_PATH_IMAGE003
（2）
wherein the content of the first and second substances,Crepresenting the channel capacity of the multihop relay network;
according to channel capacityCAnd data transmission rate of multi-hop relay networkRCalculating the interruption probability of the multi-hop relay network, wherein the calculation formula is as follows:
Figure 166164DEST_PATH_IMAGE004
（3）
wherein the content of the first and second substances,
Figure DEST_PATH_IMAGE005
indicating the outage probability of a multi-hop relay network,
Figure 86847DEST_PATH_IMAGE006
in order to perform the probability calculation,
Figure DEST_PATH_IMAGE007
representing a multihop relay networkmAverage channel gain of the hop.
Further, the expression of the joint optimization model of the relay node is as follows:
Figure 882721DEST_PATH_IMAGE008
（4）
wherein the content of the first and second substances,
Figure DEST_PATH_IMAGE009
，
Figure 838039DEST_PATH_IMAGE010
representing a multihop relay networkmThe path length of the hop transmission.
Further, the optimization problem includes a relay location optimization problem and a relay node number optimization problem.
Further, the operation of calculating the relay node deployment scheme of the multihop relay network through the optimization problem is as follows:
the number of the relay nodes is given, the relay position optimization problem is calculated by utilizing a Lagrange multiplier method, and the optimal deployment position of each relay node in the multi-hop relay network is obtained;
calculating the optimization problem of the number of the relay nodes by using an optimization algorithm based on the optimal deployment position of the relay nodes to obtain the optimal relay number in the multi-hop relay network;
and forming a relay node deployment scheme by using the optimal relay number and the optimal deployment position of each relay node.
Further, the number of relay nodes is set asM-1, then the expression of the relay location optimization problem is as follows:
Figure DEST_PATH_IMAGE011
（5）
wherein the content of the first and second substances,Mfor the number of hops of a multi-hop relay network,Rfor the data transmission rate of the multi-hop relay network,
Figure 332605DEST_PATH_IMAGE002
representing a multihop relay networkmThe signal-to-noise ratio of the hop,
Figure 68480DEST_PATH_IMAGE010
representing multiple hopsFirst of relay networkmThe length of the path over which the transmission is hopped,m=1,2,…,M，
Figure 205063DEST_PATH_IMAGE012
in order to be a coefficient of the path loss,Lthe Euclidean distance from a source node to a destination node in the multi-hop relay network.
Further, the firstmThe method for acquiring the optimal deployment position of each relay node comprises the following steps:
calculating the relay position optimization problem by using a Lagrange multiplier method to obtain the second time in the multi-hop relay networkmThe optimum Euclidean distance of a hop is
Figure DEST_PATH_IMAGE013
The calculation formula is as follows:
Figure 749308DEST_PATH_IMAGE014
（6）
wherein the content of the first and second substances,
Figure DEST_PATH_IMAGE015
representing a multihop relay networkiThe signal-to-noise ratio of the hop,i=1,2,…,M；
determining the optimal deployment position of the relay node on a connecting line of a source node and a destination node according to the KT condition;
according to the optimal Euclidean distance
Figure 414776DEST_PATH_IMAGE013
The positions of the source node and the destination node are obtained on the connecting line of the source node and the destination nodemThe optimal deployment position of each relay node.
Further, the expression of the relay node number optimization problem is as follows:
Figure 372368DEST_PATH_IMAGE016
（7）
wherein the content of the first and second substances,Mfor the number of hops of a multi-hop relay network,
Figure 578221DEST_PATH_IMAGE005
indicating the outage probability of a multi-hop relay network,Lfor the euclidean distance from the source node to the destination node in the multihop relay network,
Figure 180235DEST_PATH_IMAGE012
in order to be a coefficient of the path loss,Rfor the data transmission rate of the multi-hop relay network,
Figure 813341DEST_PATH_IMAGE015
representing a multihop relay networkiThe signal-to-noise ratio of the hop,i=1,2,…,M。
further, the optimization algorithm adopts a search algorithm.
The following advantages can be obtained by adopting the technical means:
the invention provides a relay node deployment optimization method facing a multi-hop relay network, which is characterized in that the total interrupt probability of the multi-hop relay network is used as an optimization target, the relay node deployment problem is converted into an interrupt probability optimization problem, and a relay node deployment scheme which enables the interrupt probability of a multi-hop communication system to be minimum is obtained by solving the optimization problem. In the optimization process, the invention jointly optimizes the number and the deployment positions of the relay nodes, can obtain the optimal relay number and the optimal relay positions on the premise of knowing the positions of the source node and the destination node, can reduce the interruption probability of the multi-hop relay network to the maximum extent, ensures the reliability of data transmission and effectively improves the communication quality of the multi-hop relay network.
Drawings
Fig. 1 is a flowchart illustrating steps of a method for optimizing the deployment of a relay node for a multihop relay network according to the present invention;
fig. 2 is a system model diagram of a multi-hop relay network according to an embodiment of the present invention;
FIG. 3 is a graph comparing the outage probability of the method of the present invention with that of the conventional equidistant deployment method in the embodiment of the present invention.
Detailed Description
The technical scheme of the invention is further explained by combining the accompanying drawings as follows:
the invention provides a relay node deployment optimization method facing a multi-hop relay network, as shown in fig. 1, specifically comprising the following steps:
a, obtaining a relay node joint optimization model based on the interrupt probability of a multi-hop relay network;
and B, generating an optimization problem according to the joint optimization model of the relay nodes, and calculating a relay node deployment scheme of the multi-hop relay network according to the optimization problem.
The system model of the multi-hop relay network in the embodiment of the invention is shown in fig. 2, the multi-hop relay network is composed of a source node, a destination node and a plurality of relay nodes, information sent by the source node reaches the destination node through the forwarding of the plurality of relay nodes, and one-time information transmission is completed; information is transmitted from one node to another as a hop. All nodes in the multi-hop relay network in the embodiment of the invention are provided with single antennas, the relays transmit information by adopting a decoding and forwarding method, and all channels are modeled as Rayleigh fading channels. Under the condition that the positions of a source node and a destination node are determined, the method takes the interruption probability of a communication link as an optimization target, and calculates the optimal relay node number and the position of each relay node under the existing condition so as to minimize the interruption probability of the multi-hop communication link.
The specific operation of step a is as follows:
step A01, determining the positions of the source node and the destination node, and then calculating the channel capacity of each hop according to the channel parameters of the multi-hop relay network, wherein the calculation formula is as follows:
Figure 727071DEST_PATH_IMAGE001
（8）
wherein the content of the first and second substances,C m representing a multihop relay networkmThe channel capacity of the hop is determined,m=1,2,…,M，Mfor the number of hops of a multi-hop relay network,h m representing a multihop relay networkmHopped instantaneous channel fadingThe coefficient of the drop is determined,
Figure 471036DEST_PATH_IMAGE002
representing a multihop relay networkmThe signal-to-noise ratio of the hop,
Figure DEST_PATH_IMAGE017
，
Figure 249593DEST_PATH_IMAGE018
is shown asmThe transmit power of a hop is determined,
Figure DEST_PATH_IMAGE019
is shown asmPower of additive white gaussian noise of the hop.
Step a02, because the relay nodes transmit information in a decoding and forwarding manner, the whole multi-hop relay network contains M hops, there are M channel capacities correspondingly, and the minimum value of the M channel capacities is the channel capacity of the multi-hop relay network. Obtaining the channel capacity of the multi-hop relay network according to the channel capacity of each hop, wherein the calculation formula is as follows:
Figure 991284DEST_PATH_IMAGE003
（9）
wherein the content of the first and second substances,Crepresenting the channel capacity of the multihop relay network.
Step A03, according to channel capacityCAnd data transmission rate of multi-hop relay networkRCalculating the interrupt probability of the multi-hop relay network, wherein the specific calculation process is as follows:
Figure 923468DEST_PATH_IMAGE020
（10）
wherein the content of the first and second substances,
Figure 205545DEST_PATH_IMAGE005
indicating the outage probability of a multi-hop relay network,
Figure 906784DEST_PATH_IMAGE006
in order to perform the probability calculation,
Figure 616114DEST_PATH_IMAGE007
representing a multihop relay networkmThe average channel gain of the hop(s),
Figure DEST_PATH_IMAGE021
，
Figure 238857DEST_PATH_IMAGE022
representing a multihop relay networkmThe path length of the hop transmission.
When the channel capacity of the communication link is below R, the communication is considered to be interrupted.
Step A04, the method of the invention takes the interrupt probability of the multi-hop relay network as the objective function, and performs the joint optimization to the number and the deployment position of the relay to obtain the joint optimization model of the relay node, and the specific expression is as follows:
Figure DEST_PATH_IMAGE023
（11）
wherein the content of the first and second substances,
Figure 527887DEST_PATH_IMAGE024
。
in step B, the present invention performs target optimization based on the number of relay nodes and the deployment positions of the relay nodes, respectively, the optimization problems include a relay position optimization problem and a relay node number optimization problem, and the specific operations of calculating the relay node deployment scheme of the multihop relay network through the optimization problems are as follows:
and B01, setting the number of the relay nodes, and calculating the relay position optimization problem by using a Lagrange multiplier method to obtain the optimal deployment position of each relay node in the multi-hop relay network.
Set the number of relay nodes asM1, then the expression of the relay location optimization problem is as follows:
Figure DEST_PATH_IMAGE025
（12）
wherein the content of the first and second substances,
Figure 286895DEST_PATH_IMAGE026
in order to be a coefficient of the path loss,
Figure DEST_PATH_IMAGE027
，Lthe Euclidean distance from a source node to a destination node in the multi-hop relay network.
Equation (12) can be equated with:
Figure 901548DEST_PATH_IMAGE028
（13）
according to the formula (13), the set of autovariables of the constraint conditions of the relay position optimization problem is a convex set, and the hese matrix of the objective function is:
Figure DEST_PATH_IMAGE029
（14）
the Hatheri matrix of the target function is a positive definite matrix, so that the target function is a convex function, and the problem of relay position optimization can be proved to be a convex optimization problem.
Solving the relay position optimization problem by utilizing a Lagrange multiplier method, and setting a Lagrange multiplier vector as
Figure 746007DEST_PATH_IMAGE030
Then the lagrange function can be expressed as:
Figure DEST_PATH_IMAGE031
（15）
wherein the content of the first and second substances,
Figure 573148DEST_PATH_IMAGE032
representing a multihop relay networkiThe path length of the hop transmission.
The KT condition is:
Figure DEST_PATH_IMAGE033
（16）
according to KT condition, the optimal relay deployment position is on the connecting line of the source node and the destination node, and the first relay deployment position is in the multi-hop relay networkmThe optimum Euclidean distance of a hop is
Figure 717822DEST_PATH_IMAGE034
The calculation formula is as follows:
Figure DEST_PATH_IMAGE035
（17）
wherein the content of the first and second substances,
Figure 255374DEST_PATH_IMAGE036
representing a multihop relay networkiThe signal-to-noise ratio of the hop,i=1,2,…,M。
according to the optimal Euclidean distance
Figure 649447DEST_PATH_IMAGE034
The positions of the source node and the destination node can be obtained on the connection line of the source node and the destination nodemThe optimal deployment position of each relay node.
And step B02, calculating the optimization problem of the number of the relay nodes by using an optimization algorithm based on the optimal deployment position of the relay nodes to obtain the optimal relay number in the multi-hop relay network.
Under the condition that the optimal deployment position of the relay node is known, the number of the relay nodes is further optimized, and the expression of the optimization problem of the number of the relay nodes is as follows:
Figure DEST_PATH_IMAGE037
（18）
in the embodiment of the invention, the optimization algorithm adopts a search algorithm, and the specific operations are as follows:
(1) record the optimal hop count as
Figure 545858DEST_PATH_IMAGE038
Minimum interruption probability is noted
Figure DEST_PATH_IMAGE039
；
(2) For theMThe multi-hop relay network calculates the break end probability according to the formula (10), and the break probability is recorded as
Figure 545038DEST_PATH_IMAGE040
；
(3) Initialization
Figure DEST_PATH_IMAGE041
；
（4）for
Figure 767072DEST_PATH_IMAGE042
do
（5）if
Figure DEST_PATH_IMAGE043
then
（6）
Figure 851703DEST_PATH_IMAGE044
；
（7）
Figure DEST_PATH_IMAGE045
；
（8） elseif
Figure 286227DEST_PATH_IMAGE046
then
（9） break；
（10） end if
（11）end for
(12) Outputting minimum probability of interruption
Figure 936651DEST_PATH_IMAGE039
And optimal hop count
Figure 595165DEST_PATH_IMAGE038
；
(13) According to the optimal hop count
Figure 963830DEST_PATH_IMAGE038
The optimal relay number can be obtained
Figure 998782DEST_PATH_IMAGE038
-1。
And step B03, forming a relay node deployment scheme by using the optimal relay number and the optimal deployment position of each relay node.
The embodiment of the invention provides a simulation experiment to verify the effect of the method of the invention:
one example of the invention is realized on a computer by using MATLAB language simulation, wireless channels are set to be mutually independent in a simulation experiment, and channels among nodes are subject to Rayleigh fading. Power of additive white gaussian noise
Figure 503712DEST_PATH_IMAGE047
The value is-110 dBm, the path loss coefficient
Figure 333128DEST_PATH_IMAGE048
The value is 4.
Fig. 3 is a comparison graph of the interruption probability of the method of the present invention and the conventional equidistant deployment method, and it can be seen from the graph that the interruption probability of the method of the present invention is significantly lower than that of the conventional equidistant deployment method at the same data transmission rate, so that the method of the present invention can significantly reduce the interruption probability of the multi-hop relay network and improve the reliability of data transmission.
The above description is only a preferred embodiment of the present invention, and it should be noted that, for those skilled in the art, several modifications and variations can be made without departing from the technical principle of the present invention, and these modifications and variations should also be regarded as the protection scope of the present invention.

Claims (9)

1. A relay node deployment optimization method facing a multi-hop relay network is characterized by comprising the following steps:
obtaining a relay node joint optimization model based on the interrupt probability of the multi-hop relay network;
and generating an optimization problem according to the joint optimization model of the relay nodes, and calculating a relay node deployment scheme of the multi-hop relay network according to the optimization problem.
2. The method for optimizing the deployment of the relay nodes facing the multi-hop relay network according to claim 1, wherein the method for calculating the outage probability of the multi-hop relay network comprises the following steps:
calculating the channel capacity of each hop according to the channel parameters of the multi-hop relay network, wherein the calculation formula is as follows:
Figure DEST_PATH_IMAGE002
wherein the content of the first and second substances,C m representing a multihop relay networkmThe channel capacity of the hop is determined,m=1,2,…,M，Mfor the number of hops of a multi-hop relay network,h m representing a multihop relay networkmThe instantaneous channel fading coefficients of the hops,
Figure DEST_PATH_IMAGE004
representing a multihop relay networkmThe signal-to-noise ratio of the hop;
calculating the channel capacity of the multi-hop relay network according to the channel capacity of each hop, wherein the calculation formula is as follows:
Figure DEST_PATH_IMAGE006
wherein the content of the first and second substances,Crepresenting the channel capacity of the multihop relay network;
according to channel capacityCAnd data transmission rate of multi-hop relay networkRCalculating the interrupt probability of the multi-hop relay networkThe formula is as follows:
Figure DEST_PATH_IMAGE008
wherein the content of the first and second substances,
Figure DEST_PATH_IMAGE010
indicating the outage probability of a multi-hop relay network,
Figure DEST_PATH_IMAGE012
in order to perform the probability calculation,
Figure DEST_PATH_IMAGE014
representing a multihop relay networkmAverage channel gain of the hop.
3. The method for optimizing the deployment of the relay nodes facing the multi-hop relay network according to claim 2, wherein the expression of the joint optimization model of the relay nodes is as follows:
Figure DEST_PATH_IMAGE016
wherein the content of the first and second substances,
Figure DEST_PATH_IMAGE018
，
Figure DEST_PATH_IMAGE020
representing a multihop relay networkmThe path length of the hop transmission.
4. The method of claim 1, wherein the optimization problem comprises a relay location optimization problem and a relay node number optimization problem.
5. The method for optimizing the deployment of the relay nodes facing the multi-hop relay network according to claim 1 or 4, wherein the operation of calculating the deployment scheme of the relay nodes of the multi-hop relay network by the optimization problem is as follows:
the number of the relay nodes is given, the relay position optimization problem is calculated by utilizing a Lagrange multiplier method, and the optimal deployment position of each relay node in the multi-hop relay network is obtained;
calculating the optimization problem of the number of the relay nodes by using an optimization algorithm based on the optimal deployment position of the relay nodes to obtain the optimal relay number in the multi-hop relay network;
and forming a relay node deployment scheme by using the optimal relay number and the optimal deployment position of each relay node.
6. The method as claimed in claim 5, wherein the number of relay nodes is set asM-1, then the expression of the relay location optimization problem is as follows:
Figure DEST_PATH_IMAGE022
wherein the content of the first and second substances,Mfor the number of hops of a multi-hop relay network,Rfor the data transmission rate of the multi-hop relay network,
Figure 472544DEST_PATH_IMAGE004
representing a multihop relay networkmThe signal-to-noise ratio of the hop,
Figure 594084DEST_PATH_IMAGE020
representing a multihop relay networkmThe length of the path over which the transmission is hopped,m=1,2,…,M，
Figure DEST_PATH_IMAGE024
in order to be a coefficient of the path loss,Lthe Euclidean distance from a source node to a destination node in the multi-hop relay network.
7. The method of claim 6, wherein the first step is to optimize the deployment of the relay nodes in the multihop relay networkmThe method for acquiring the optimal deployment position of each relay node comprises the following steps:
calculating the relay position optimization problem by using a Lagrange multiplier method to obtain the second time in the multi-hop relay networkmThe optimum Euclidean distance of a hop is
Figure DEST_PATH_IMAGE026
The calculation formula is as follows:
Figure DEST_PATH_IMAGE028
wherein the content of the first and second substances,
Figure DEST_PATH_IMAGE030
representing a multihop relay networkiThe signal-to-noise ratio of the hop, i=1,2,…,M；
determining the optimal deployment position of the relay node on a connecting line of a source node and a destination node according to the KT condition;
according to the optimal Euclidean distance
Figure 771075DEST_PATH_IMAGE026
The positions of the source node and the destination node are obtained on the connecting line of the source node and the destination nodemThe optimal deployment position of each relay node.
8. The method for optimizing the deployment of the relay nodes facing the multi-hop relay network according to claim 5, wherein the expression of the relay node number optimization problem is as follows:
Figure DEST_PATH_IMAGE032
wherein the content of the first and second substances,Mfor the number of hops of a multi-hop relay network,
Figure 802616DEST_PATH_IMAGE010
indicating the outage probability of a multi-hop relay network,Lfor the euclidean distance from the source node to the destination node in the multihop relay network,
Figure 68512DEST_PATH_IMAGE024
in order to be a coefficient of the path loss,Rfor the data transmission rate of the multi-hop relay network,
Figure 411769DEST_PATH_IMAGE030
representing a multihop relay networkiThe signal-to-noise ratio of the hop,i=1,2,…,M。
9. the method of claim 5, wherein the optimization algorithm is a search algorithm.
CN202110433720.7A 2021-04-22 2021-04-22 Relay node deployment optimization method for multi-hop relay network Active CN112839344B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110433720.7A CN112839344B (en) 2021-04-22 2021-04-22 Relay node deployment optimization method for multi-hop relay network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110433720.7A CN112839344B (en) 2021-04-22 2021-04-22 Relay node deployment optimization method for multi-hop relay network

Publications (2)

Publication Number Publication Date
CN112839344A true CN112839344A (en) 2021-05-25
CN112839344B CN112839344B (en) 2021-07-20

Family

ID=75929829

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110433720.7A Active CN112839344B (en) 2021-04-22 2021-04-22 Relay node deployment optimization method for multi-hop relay network

Country Status (1)

Country Link
CN (1) CN112839344B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113993138A (en) * 2021-11-15 2022-01-28 北京信息科技大学 Wireless relay deployment method of SCMA (sparse code multiple access) network

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103647733A (en) * 2013-12-06 2014-03-19 镇江坤泉电子科技有限公司 Relay-node-number selection algorithm based on interruption probability in cellular-cell downlink
CN106788620A (en) * 2016-12-02 2017-05-31 哈尔滨工程大学 A kind of distributed relay selection for minimizing outage probability and user power allocation method
CN108156613A (en) * 2017-11-26 2018-06-12 南京邮电大学 A kind of relay node distribution method in unmanned plane relay multi-hop communication system

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103647733A (en) * 2013-12-06 2014-03-19 镇江坤泉电子科技有限公司 Relay-node-number selection algorithm based on interruption probability in cellular-cell downlink
CN106788620A (en) * 2016-12-02 2017-05-31 哈尔滨工程大学 A kind of distributed relay selection for minimizing outage probability and user power allocation method
CN108156613A (en) * 2017-11-26 2018-06-12 南京邮电大学 A kind of relay node distribution method in unmanned plane relay multi-hop communication system

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
SAMI BAROUDI等: "Performance Enhancement of Multi-hop Wireless systems by optimizing The Number and Location of Relays", 《2015INTERNATIONAL WIRELESS COMMUNICATION AND MOBILE COMPUTING CONFERENCE(IWCMC)》 *
韦薇: "《中国优秀硕士学位论文数据库 信息科技辑》", 15 February 2019 *
黄清: "AF协同通信系统最优多跳中继位置", 《广东通信技术》 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113993138A (en) * 2021-11-15 2022-01-28 北京信息科技大学 Wireless relay deployment method of SCMA (sparse code multiple access) network
CN113993138B (en) * 2021-11-15 2023-06-30 北京信息科技大学 Wireless relay deployment method of SCMA network

Also Published As

Publication number Publication date
CN112839344B (en) 2021-07-20

Similar Documents

Publication Publication Date Title
CN109714817B (en) Communication system power allocation method using NOMA and D2D groups
CN108848563B (en) Energy-efficiency-based resource allocation method for downlink of cooperative NOMA (non-orthogonal multiple access) system
CN103533613B (en) A kind of amplification forwarding relay selection method under out-of-date channel information
CN109525984B (en) Method for improving safety rate of untrusted relay energy-carrying communication system
CN114024640B (en) Robust relay node selection method in full duplex energy collection relay system
Chamkhia et al. Performance analysis of relay selection schemes in underlay cognitive networks with decode and forward relaying
CN112839344B (en) Relay node deployment optimization method for multi-hop relay network
CN111132236B (en) Multi-unmanned aerial vehicle self-organizing network MPR node selection method based on improved OLSR protocol
CN110602759B (en) Optimal dynamic power segmentation method suitable for energy-carrying communication system
Yin et al. Outage probability of full-duplex cognitive relay networks with partial relay selection
Shah et al. Handling asymmetry in power heterogeneous ad hoc networks: A cross layer approach
David et al. Network coding for TCP throughput enhancement over a multi-hop wireless network
Khuntia et al. Device-to-device communication aided by two-way relay underlaying cellular network
CN109982407B (en) Relay selection-based safe transmission system and method in NOMA system
Schwieger et al. Power and energy consumption for multi-hop protocols: A sensor network point of view
Wen et al. Asynchronous distributed optimization via dual decomposition for delay-constrained flying ad hoc networks
Kompella et al. Revisiting the optimal scheduling problem
CN115276768A (en) Unmanned aerial vehicle time delay minimization method integrating interference mitigation and resource allocation
CN110381561B (en) Safe transmission method based on energy efficiency in cache-assisted multi-relay transmission system
CN110430566B (en) Two-hop multi-relay network secure transmission method based on energy collection
Park et al. Power allocation for multi-hop transmission using unsaturated full-duplex relay network model
He et al. Metric-Based Cooperative Routing in Multihop Ad Hoc Networks.
Yan et al. Feasibility of multipath construction in mmwave backhaul
Yamao et al. Cross-layer multi-hopping scheme for efficient and reliable transmission in fading environment
CN109219026B (en) D2D transmission method based on energy capture and interference cancellation in uplink relay network

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
EE01 Entry into force of recordation of patent licensing contract

Application publication date: 20210525

Assignee: NANJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS NANTONG INSTITUTE Co.,Ltd.

Assignor: NANJING University OF POSTS AND TELECOMMUNICATIONS

Contract record no.: X2021980013917

Denomination of invention: A relay node deployment optimization method for multi hop relay network

Granted publication date: 20210720

License type: Common License

Record date: 20211202

EE01 Entry into force of recordation of patent licensing contract