CN104320839B - The relay selection method of Multi-source multi-relay wireless network minimum power - Google Patents

The relay selection method of Multi-source multi-relay wireless network minimum power Download PDF

Info

Publication number
CN104320839B
CN104320839B CN201410567230.6A CN201410567230A CN104320839B CN 104320839 B CN104320839 B CN 104320839B CN 201410567230 A CN201410567230 A CN 201410567230A CN 104320839 B CN104320839 B CN 104320839B
Authority
CN
China
Prior art keywords
mrow
msub
node
via node
user
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.)
Active
Application number
CN201410567230.6A
Other languages
Chinese (zh)
Other versions
CN104320839A (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.)
Qingdao Huashi Intelligent Technology Co ltd
Original Assignee
Zhejiang University of Technology ZJUT
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 Zhejiang University of Technology ZJUT filed Critical Zhejiang University of Technology ZJUT
Priority to CN201410567230.6A priority Critical patent/CN104320839B/en
Publication of CN104320839A publication Critical patent/CN104320839A/en
Application granted granted Critical
Publication of CN104320839B publication Critical patent/CN104320839B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/04—TPC
    • H04W52/38—TPC being performed in particular situations
    • H04W52/46—TPC being performed in particular situations in multi hop networks, e.g. wireless relay networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

A kind of relay selection method of Multi-source multi-relay wireless network minimum power, comprises the following steps：1) each via node is perceived from sending node to its own, and the maximum transmit power of channel gain and the via node then is notified into sending node to the channel gain of destination node from its own；2) each source node calculates the minimum transmit power of source node and via node in the case where meeting outage probability；3) for cordless communication network, each user needs the overall transmission power minimum for selecting a via node to make whole system；4) outage probability according to user i to destination node D channel, calculate in the case where ensureing that channel does not interrupt, source node i and via node j minimum transmit power；5) via node that user i selections make benefit maximum helps oneself transfer information.For the present invention under rayleigh fading channel, source node selects via node as to minimize the via node of system overall transmission power.

Description

The relay selection method of Multi-source multi-relay wireless network minimum power
Technical field
The invention belongs to the communications field, selects suitable via node total to optimize especially for Multi-source multi-relay network The method of system transmit power.
Background technology
In wireless broadband services, communication for coordination, which is considered as one, can improve the effective of spectrum efficiency and space diversity Technology.The model of most of communication for coordination is all that the letter from source node to destination node is forwarded by single or multiple via nodes Breath.In these after in network, amplification forwarding and decoding forwarding are two kinds of the most frequently used trunk protocols.For junction network, no Same source node and the transmit power of via node are also incomplete same, if source node energy when being communicated with destination node Enough select suitable via node, then the spectrum efficiency and energy efficiency of whole network will greatly improve.Therefore, grind Study carefully how source node chooses via node so that total transmit power minimum is extremely significant for maximizing system benefit.
The content of the invention
In order to overcome, the total transmit power of existing Multi-source multi-relay nodes is larger, computational complexity is high, to hard The higher deficiency of part equipment requirement, the present invention provides one kind in decode-and-forward relay network, for the letter of Rayleigh fading be present How via node is chosen to minimize overall transmission power, maximize the Multi-source multi-relay wireless network power of system benefit most in road The relay selection method of smallization.
The technical solution adopted for the present invention to solve the technical problems is：
A kind of relay selection method of Multi-source multi-relay wireless network minimum power, the described method comprises the following steps：
1) each via node is perceived from source node to its own, and from its own to the channel gain of receiving node, Then the maximum transmit power of channel gain and the via node is notified into source node；The channel perceived by via node is believed The power noise that breath and via node and receiving node receive, it is as follows to obtain associated SNR：
Constraints is：pi≤SourcePI, max,
pj≤RelayPJ, max
Wherein, each parameter definition is as follows in formula：
γj(pi)：The signal to noise ratio that via node j is received；
pi：The transmit power of source node i；
gI, j：From source node i to via node j channel gain；
fI, j：Simulation is from source node i to via node j Rayleigh fading；
nj：The noise power that via node j is received；
SourcePI, max：The maximum transmit power of source node i；
γD(pj)：The signal to noise ratio that destination node D is received；
pj：Via node j transmit power；
gJ, D：From via node j to destination node D channel gain；
fJ, D：Simulation is from via node j to destination node D Rayleigh fading；
nD：The noise power that destination node D is received；
RelayPJ, max：Via node j maximum transmit power；
2) source node selects all satisfactory via nodes, and so-called satisfactory via node should meet two Condition：First, the signal to noise ratio drawn in formula (1) should be more than a threshold gamma；Second, the link provided by via node Outage probability should be less than a threshold value beta；
Constraints is：γj(pi)≥γ
γD(pj)≥γ
Oij≤β
Wherein, each parameter definition is as follows in formula：
Oij：The outage probability of the link of source node i and via node j compositions；
γ：The threshold value of signal to noise ratio.The point that node signal to noise ratio is more than the threshold value is just selected；
β：The threshold value of outage probability, the outage probability that via node provides link are just selected when being less than the threshold value；
3) for needing one relaying of selection with n user, the cordless communication network of m via node, each user Node makes the overall transmission power of whole system minimum.So the present invention is, select under a kind of via node method of salary distribution C satisfactions Formula：
Constraints is：Oij≤ β,
0≤pi≤SourcePI, max,
0≤pj≤RelayPJ, max,
cij∈ { 0,1 }.
Wherein, C be one distribution array, cijRepresent user i selection via nodes j. Represent a user A via node can only be selected,Represent that a via node is at most selected by a user；
Define a mapping α：When { 1 ..., n } → { 1 ..., m }, i.e., and if only if user i selection via node j, α (i)=j.In addition, use θijExpression-(pi+pj), thus the minimization problem can be converted to maximization problems：
Constraints is：Oij≤ β,
cij∈ { 0,1 }.
4) outage probability according to user i to destination node D channel, situation about not interrupted in guarantee channel is calculated Under, source node i and via node j minimum transmit power.For user i, if So source node i can not possibly be communicated by channel (i, j) and destination node D, so in this case by the power of source node i It is set to infinitely great with via node j power sum；In the case of, meet all It is required that via node be divided into two classes.If User i and via node k minimum transmit power is respectively
IfSo By above formula, each user node obtains the work(for all channels for reaching destination node Rate；
5) assume that each via node has a price price in moment tj(t), user is if it is intended to select the relaying Node, it is necessary to pay the price, the via node that user i selections make benefit maximum helps oneself transfer information；Define θij- pricej(t) benefits of the user i using relaying j is represented, if user i selection relaying j, should meet
If the via node selected by each user meets above-mentioned condition, then this distribution state is exactly a kind of equal Weighing apparatus state.Distribution now is exactly the distribution for making overall transmission power minimum.
Further, in the step 5), if multiple users go for an identical relaying, but they throw every time Timestamp does not increase the price of oneself but, and will make to bid infinitely goes on, in order to avoid such case, it will be assumed that competing every time Valency must be by bid at least one very little of increase on the occasion of ∈.So if final distribution meets
It is also believed that it is at equilibrium.
Further, methods described is further comprising the steps of：6) all users can form a net by wireless connection Network, if two users are connected, then they are exactly neighborhood, and user i is N in all neighbours of ti(t).With neighbour Pricing information can be exchanged between the user of relation by occupying.Each user's iteration performs distributed auction algorithm, according to local information Independent selection via node.Comprise the following steps that：
For user i, most starting, it possesses an initial distribution αi(t) ∈ { 1 ..., m }, the valency of all relayings Lattice priceij>=0 and highest bidder (t)
Step 6.1：User i receives the pricing information of all relayings and corresponding maximum bid in t from neighbor node Person.I compares price and the highest bidder of renewal relaying according to the information received and the information being locally stored：
Step 6.2：IfAndSo renewal point With αi(t+1)∈argmax1≤k≤m{βik-pik(t+1) }, by via node αi(t+1) maximum bidder is set to i, and updates it Price Wherein,It is User i optimal benefit value,It is user i suboptimum benefit value；
Step 6.3：IfRemain in that original distribution, i.e. αi(t+1)：= αi(t)。
All user node iteration perform step 6.1-6.3, and a via node, Zhi Daosuo are selected according to local information The via node for having user node to select meets (6), even if the distribution that the distribution system overall transmission power now obtained is minimum.
The present invention technical concept be：First, the transmit power of different source nodes and via node is different, therefore It can consider using their transmit power as a kind of controllable network resource, realize that total transimission power is minimum.In other words, wish Hope by selecting suitable via node forwarding information to make overall transmission power minimum.Then, we use a kind of distributed algorithm Each user node is set independently to select via node according to the information being locally stored.
Beneficial effects of the present invention are mainly manifested in：For whole network system, suitable via node is selected not only Total power consumption can be reduced, and the system benefit of network can be increased；In addition, avoid centralization using distributed algorithm Individual node energy resource consumption is excessive in algorithm, can effectively extend network life.
Brief description of the drawings
Fig. 1 is the network system schematic diagram for having N number of user and M via node.
Fig. 2 is the minimum transmission power for asking Multi-source multi-relay wireless network to meet every channel under minimal disruption probability scenarios Flow chart.
Fig. 3 is the flow chart of distributed auction algorithm.
Embodiment
The present invention is described in further detail below in conjunction with the accompanying drawings.
Reference picture 1, Fig. 2 and Fig. 3, a kind of relay selection method of Multi-source multi-relay wireless network minimum power, Overall transmission power can be reduced by carrying out this method, increase system benefit.The present invention is based on N number of user and M via node Network system (as shown in Figure 1).In relay network system, the via node that different source nodes is not waited by transmit power will Information is transmitted to destination node.Invention is directed to the suitable via node of selection of Multi-source multi-relay network proposition so that overall transmission power Minimum method has following steps (shown in such as Fig. 2, Fig. 3)：
1) each via node is perceived from source node to its own, and from its own to the channel gain of receiving node, Then the maximum transmit power of channel gain and the via node is notified into source node；The channel perceived by via node is believed The power noise that breath and via node and receiving node receive, it is as follows to obtain associated SNR：
Constraints is：pi≤SourcePI, max,
pj≤RelayPJ, max
Wherein, each parameter definition is as follows in formula：
γj(pi)：The signal to noise ratio that via node j is received；
pi：The transmit power of source node i；
gI, i：From source node i to via node j channel gain；
fI, j：Simulation is from source node i to via node j Rayleigh fading；
nj：The noise power that via node j is received；
SourcePI, max：The maximum transmit power of source node i；
γD(pj)：The signal to noise ratio that destination node D is received；
pj：Via node j transmit power；
gJ, D：From via node j to destination node D channel gain；
fJ, D：Simulation is from via node j to destination node D Rayleigh fading；
nD：The noise power that destination node D is received；
RelayPJ, max：Via node j maximum transmit power；
2) source node selects all satisfactory via nodes, and so-called satisfactory via node should meet two Condition：First, the signal to noise ratio drawn in formula (1) should be more than a threshold gamma；Second, the link provided by via node Outage probability should be less than a threshold value beta.
Constraints is：γj(pi)≥γ
γD(pj)≥γ
Oij≤β
Wherein, each parameter definition is as follows in formula：
Oij：The outage probability of the link of source node i and via node j compositions；
γ：The threshold value of signal to noise ratio.The point that node signal to noise ratio is more than the threshold value is just selected；
β：The threshold value of outage probability, the outage probability that via node provides link are just selected when being less than the threshold value；
3) for needing one relaying of selection with n user, the cordless communication network of m via node, each user Node makes the overall transmission power of whole system minimum.So the present invention is, select under a kind of via node method of salary distribution C satisfactions Formula：
Constraints is：Oij≤ β,
0≤pi≤SourcePI, max,
0≤pj≤RelayPJ, max,
cij∈ { 0,1 }.
Wherein, C be one distribution array, cijRepresent user i selection via nodes j. Represent a user A via node can only be selected,Represent that a via node is at most selected by a user.
Define a mapping α：When { 1 ..., n } → { 1 ..., m }, i.e., and if only if user i selection via node j, α (i)=j.In addition, use θijExpression-(pi+pj), thus the minimization problem can be converted to maximization problems：
Constraints is：Oij≤ β,
cij∈ { 0,1 }.
4) outage probability according to user i to destination node D channel, situation about not interrupted in guarantee channel is calculated Under, source node i and via node j minimum transmit power.For user i, if So source node i can not possibly be communicated by channel (i, j) and destination node D, so in this case by the power of source node i It is set to infinitely great with via node j power sum.In the case of, conformed to all The via node asked is divided into two classes.If User i and via node k minimum transmit power is respectively
IfSo By above formula, each user node can obtain all channels for reaching destination node Power.
5) assume that each via node has a price price in moment tj(t), user is if it is intended to select the relaying Node, it is necessary to pay the price.The via node that user i selections make benefit maximum helps oneself transfer information.We define θij-pricej(t) benefits of the user i using relaying j is represented.If user i selection relaying j, should meet
If the via node selected by each user meets above-mentioned condition, then this distribution state is exactly a kind of equal Weighing apparatus state.Distribution now is exactly the distribution for making overall transmission power minimum.But if multiple users go for a phase The price of oneself is not increased but with relaying, but when they submit a tender every time, will make to bid infinitely goes on, in order to avoid this Kind situation, it will be assumed that bidding every time must be by bid at least one very little of increase on the occasion of ∈.So if final distribution is full Foot
It is also believed that it is at equilibrium.
6) all users can form a network by wireless connection, if two users are connected, then they are exactly Neighborhood, user i are N in all neighbours of ti(t).Price letter can be exchanged between user with neighborhood Breath.Each user's iteration performs distributed auction algorithm, according to the selection via node of local information independence.Specific steps are such as Under：
For user i, most starting, it possesses an initial distribution αi(t) ∈ { 1 ..., m }, the valency of all relayings Lattice priceij>=0 and highest bidder (t)
Step 6.1：User i receives the pricing information of all relayings and corresponding maximum bid in t from neighbor node Person.I compares price and the highest bidder of renewal relaying according to the information received and the information being locally stored：
Step 6.2：IfAndSo renewal point With αi(t+1)∈argmax1≤k≤m{βik-pik(t+1) }, by via node αi(t+1) maximum bidder is set to i, and updates it Price Wherein,It is User i optimal benefit value,It is user i suboptimum benefit value；
Step 6.3：IfRemain in that original distribution, i.e. αi(t+1)：= αi(t)。
All user node iteration perform step 6.1-6.3, and a via node, Zhi Daosuo are selected according to local information The via node for having user node to select meets formula (6), even if point that the distribution system overall transmission power now obtained is minimum Match somebody with somebody.
The present embodiment is conceived to when source node sends information to destination node by via node, suitable by selecting Via node realize overall transmission power is minimized.Our work can reduce the total transimission power of junction network, save Internet resources, increase network trap, improve the performance of whole network.

Claims (3)

  1. A kind of 1. relay selection method of Multi-source multi-relay wireless network minimum power, it is characterised in that：Methods described includes Following steps：
    1) each via node is perceived from source node to its own, and from its own to the channel gain of receiving node, then The maximum transmit power of channel gain and the via node is notified into source node；The channel information that is perceived by via node and The noise power that via node and receiving node receive, it is as follows to obtain associated SNR：
    <mrow> <mtable> <mtr> <mtd> <mrow> <msub> <mi>&amp;gamma;</mi> <mi>j</mi> </msub> <mrow> <mo>(</mo> <msub> <mi>p</mi> <mi>j</mi> </msub> <mo>)</mo> </mrow> <mo>=</mo> <mfrac> <mrow> <msub> <mi>p</mi> <mi>i</mi> </msub> <msub> <mi>g</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msub> <msub> <mi>f</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msub> </mrow> <msub> <mi>n</mi> <mi>j</mi> </msub> </mfrac> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <msub> <mi>&amp;gamma;</mi> <mi>D</mi> </msub> <mrow> <mo>(</mo> <msub> <mi>p</mi> <mi>j</mi> </msub> <mo>)</mo> </mrow> <mo>=</mo> <mfrac> <mrow> <msub> <mi>p</mi> <mi>j</mi> </msub> <msub> <mi>g</mi> <mrow> <mi>j</mi> <mo>,</mo> <mi>D</mi> </mrow> </msub> <msub> <mi>f</mi> <mrow> <mi>j</mi> <mo>,</mo> <mi>D</mi> </mrow> </msub> </mrow> <msub> <mi>n</mi> <mi>D</mi> </msub> </mfrac> </mrow> </mtd> </mtr> </mtable> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>1</mn> <mo>)</mo> </mrow> </mrow>
    Constraints is：pi≤SourcePi,max,
    pj≤RelayPj,max
    Wherein, each parameter definition is as follows in formula：
    γj(pi)：The signal to noise ratio that via node j is received；
    pi：The transmit power of source node i；
    gi,j：From source node i to via node j channel gain；
    fi,j:Simulation is from source node i to via node j Rayleigh fading；
    nj：The noise power that via node j is received；
    SourcePi,max：The maximum transmit power of source node i；
    γD(pj)：The signal to noise ratio that destination node D is received；
    pj：Via node j transmit power；
    gj,D：From via node j to destination node D channel gain；
    fj,D:Simulation is from via node j to destination node D Rayleigh fading；
    nD：The noise power that destination node D is received；
    RelayPj,max：Via node j maximum transmit power；
    2) source node selects all satisfactory via nodes, and so-called satisfactory via node should meet two bars Part：First, the signal to noise ratio drawn in formula (1) should be more than or equal to a threshold gamma；Second, the outage probability of via node should A threshold value beta should be less than or equal to
    <mrow> <mtable> <mtr> <mtd> <mrow> <msub> <mi>O</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mo>=</mo> <mn>1</mn> <mo>-</mo> <mi>Pr</mi> <mi>o</mi> <mi>b</mi> <mrow> <mo>(</mo> <msub> <mi>&amp;gamma;</mi> <mi>j</mi> </msub> <mo>(</mo> <msub> <mi>p</mi> <mi>i</mi> </msub> <mo>)</mo> <mo>&amp;GreaterEqual;</mo> <mi>&amp;gamma;</mi> <mo>,</mo> <msub> <mi>&amp;gamma;</mi> <mi>D</mi> </msub> <mo>(</mo> <msub> <mi>p</mi> <mi>D</mi> </msub> <mo>)</mo> <mo>&amp;GreaterEqual;</mo> <mi>D</mi> <mo>)</mo> </mrow> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>=</mo> <mn>1</mn> <mo>-</mo> <mi>Pr</mi> <mi>o</mi> <mi>b</mi> <mrow> <mo>(</mo> <msub> <mi>&amp;gamma;</mi> <mi>j</mi> </msub> <mo>(</mo> <msub> <mi>p</mi> <mi>i</mi> </msub> <mo>)</mo> <mo>&amp;GreaterEqual;</mo> <mi>&amp;gamma;</mi> <mo>)</mo> </mrow> <mi>Pr</mi> <mi>o</mi> <mi>b</mi> <mrow> <mo>(</mo> <msub> <mi>&amp;gamma;</mi> <mi>D</mi> </msub> <mo>(</mo> <msub> <mi>p</mi> <mi>D</mi> </msub> <mo>)</mo> <mo>&amp;GreaterEqual;</mo> <mi>&amp;gamma;</mi> <mo>)</mo> </mrow> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <mo>=</mo> <mn>1</mn> <mo>-</mo> <mi>exp</mi> <mrow> <mo>(</mo> <mo>-</mo> <mfrac> <mrow> <msub> <mi>n</mi> <mi>i</mi> </msub> <mi>&amp;gamma;</mi> </mrow> <mrow> <msub> <mi>g</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msub> <msub> <mi>p</mi> <mi>i</mi> </msub> </mrow> </mfrac> <mo>)</mo> </mrow> <mi>exp</mi> <mrow> <mo>(</mo> <mo>-</mo> <mfrac> <mrow> <msub> <mi>n</mi> <mi>D</mi> </msub> <mi>&amp;gamma;</mi> </mrow> <mrow> <msub> <mi>g</mi> <mrow> <mi>j</mi> <mo>,</mo> <mi>D</mi> </mrow> </msub> <msub> <mi>p</mi> <mi>j</mi> </msub> </mrow> </mfrac> <mo>)</mo> </mrow> </mrow> </mtd> </mtr> </mtable> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>2</mn> <mo>)</mo> </mrow> </mrow>
    Constraints is:γj(pi)≥γ
    γD(pj)≥γ
    Oij≤β
    Wherein, each parameter definition is as follows in formula：
    Oij：The outage probability of the link of source node i and via node j compositions；
    γ：The threshold value of signal to noise ratio, the point that node signal to noise ratio is more than the threshold value are just selected；
    β：The threshold value of outage probability, the outage probability of via node are just selected when being less than the threshold value；
    3) for needing to select a via node with n user, the cordless communication network of m via node, each user Make the overall transmission power of whole system minimum, select a kind of via node method of salary distribution C to meet following formula：
    <mrow> <mi>min</mi> <msubsup> <mi>&amp;Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>n</mi> </msubsup> <msubsup> <mi>&amp;Sigma;</mi> <mrow> <mi>j</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>m</mi> </msubsup> <mrow> <mo>(</mo> <msub> <mi>p</mi> <mi>i</mi> </msub> <mo>+</mo> <msub> <mi>p</mi> <mi>j</mi> </msub> <mo>)</mo> </mrow> <msub> <mi>c</mi> <mi>ij</mi> </msub> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>3</mn> <mo>)</mo> </mrow> </mrow>
    Constraints is：Oij≤β,
    0≤pi≤SourcePI,max,
    0≤pj≤RelayPj,max,
    <mrow> <msubsup> <mi>&amp;Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>n</mi> </msubsup> <msub> <mi>c</mi> <mi>ij</mi> </msub> <mo>=</mo> <mn>1</mn> <mo>,</mo> <mi>i</mi> <mo>=</mo> <mn>1,2</mn> <mo>,</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>,</mo> <mi>n</mi> <mo>,</mo> </mrow>
    <mrow> <msubsup> <mi>&amp;Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>n</mi> </msubsup> <msub> <mi>c</mi> <mi>ij</mi> </msub> <mo>&amp;le;</mo> <mn>1</mn> <mo>,</mo> <mi>j</mi> <mo>=</mo> <mn>1,2</mn> <mo>,</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>,</mo> <mi>m</mi> <mo>,</mo> </mrow>
    cij∈{0,1}
    Wherein, C be one distribution array, cij=1 represents user i selection via node j,Represent a user A via node can only be selected,Represent that a via node is at most selected by a user；
    Define a mapping α:When { 1 ..., n } → { 1 ..., m }, i.e., and if only if user i selection via node j, α (i)=j, In addition, use βijExpression-(pi+pj), the minimization problem is thus converted into maximization problems：
    <mrow> <mi>max</mi> <msubsup> <mi>&amp;Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>n</mi> </msubsup> <msubsup> <mi>&amp;Sigma;</mi> <mrow> <mi>j</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>m</mi> </msubsup> <msub> <mi>&amp;beta;</mi> <mi>ij</mi> </msub> <msub> <mi>c</mi> <mi>ij</mi> </msub> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>4</mn> <mo>)</mo> </mrow> </mrow>
    Constraints is：Oij≤β,
    <mrow> <msubsup> <mi>&amp;Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>n</mi> </msubsup> <msub> <mi>c</mi> <mi>ij</mi> </msub> <mo>=</mo> <mn>1</mn> <mo>,</mo> <mi>i</mi> <mo>=</mo> <mn>1,2</mn> <mo>,</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>,</mo> <mi>n</mi> <mo>,</mo> </mrow>
    <mrow> <msubsup> <mi>&amp;Sigma;</mi> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>n</mi> </msubsup> <msub> <mi>c</mi> <mi>ij</mi> </msub> <mo>&amp;le;</mo> <mn>1</mn> <mo>,</mo> <mi>j</mi> <mo>=</mo> <mn>1,2</mn> <mo>,</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>,</mo> <mi>m</mi> <mo>,</mo> </mrow>
    cij∈{0,1}
    4) outage probability according to user i to destination node D channel, calculate in the case where ensureing that channel does not interrupt, The minimum transmit power of source node i and via node j, for user i, ifThat Source node i can not possibly be communicated by channel (i, j) and destination node, thus in this case by the power of source node i with Via node j power sum is set to infinitely great,In the case of, met the requirements all Via node be divided into two classes, if User i and via node j minimum transmit power is respectively
    <mrow> <mtable> <mtr> <mtd> <mrow> <msub> <mi>p</mi> <mi>i</mi> </msub> <mo>=</mo> <mo>-</mo> <mfrac> <mi>&amp;gamma;</mi> <mrow> <mi>ln</mi> <mrow> <mo>(</mo> <mn>1</mn> <mo>-</mo> <mi>&amp;beta;</mi> <mo>)</mo> </mrow> </mrow> </mfrac> <mrow> <mo>(</mo> <msqrt> <mfrac> <msub> <mi>n</mi> <mi>j</mi> </msub> <msub> <mi>g</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msub> </mfrac> </msqrt> <mo>+</mo> <msqrt> <mfrac> <msub> <mi>n</mi> <mi>D</mi> </msub> <msub> <mi>g</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>D</mi> </mrow> </msub> </mfrac> </msqrt> <mo>)</mo> </mrow> <msqrt> <mfrac> <msub> <mi>n</mi> <mi>j</mi> </msub> <msub> <mi>g</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msub> </mfrac> </msqrt> <mo>,</mo> </mrow> </mtd> </mtr> <mtr> <mtd> <mrow> <msub> <mi>p</mi> <mi>j</mi> </msub> <mo>=</mo> <mo>-</mo> <mfrac> <mi>&amp;gamma;</mi> <mrow> <mi>ln</mi> <mrow> <mo>(</mo> <mn>1</mn> <mo>-</mo> <mi>&amp;beta;</mi> <mo>)</mo> </mrow> </mrow> </mfrac> <mrow> <mo>(</mo> <msqrt> <mfrac> <msub> <mi>n</mi> <mi>j</mi> </msub> <msub> <mi>g</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>j</mi> </mrow> </msub> </mfrac> </msqrt> <mo>+</mo> <msqrt> <mfrac> <msub> <mi>n</mi> <mi>D</mi> </msub> <msub> <mi>g</mi> <mrow> <mi>i</mi> <mo>,</mo> <mi>D</mi> </mrow> </msub> </mfrac> </msqrt> <mo>)</mo> </mrow> <msqrt> <mfrac> <msub> <mi>n</mi> <mi>D</mi> </msub> <msub> <mi>g</mi> <mrow> <mi>j</mi> <mo>,</mo> <mi>D</mi> </mrow> </msub> </mfrac> </msqrt> <mo>,</mo> </mrow> </mtd> </mtr> </mtable> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>5</mn> <mo>)</mo> </mrow> </mrow>
    IfSo By above formula, each user node can obtain arrival The power of all channels of destination node；
    5) assume that each via node has a price price in moment tj(t), user is if it is intended to select the via node, Have to pay the price, the via node that user i selections make benefit maximum helps oneself transfer information, defines βij-pricej (t) benefits of the user i using relaying j is represented, if user i selection relaying j, should meet
    βij-pricej(t)=max1≤k≤m{βik-pricek(t)}；
    If the via node selected by each user meets above-mentioned condition, then this distribution state is exactly a kind of balanced shape State, distribution now is exactly the distribution for making overall transmission power minimum.
  2. 2. a kind of relay selection method of Multi-source multi-relay wireless network minimum power as claimed in claim 1, its feature It is：In the step 5), if multiple users go for an identical relaying, it is assumed that bidding will submit a tender extremely every time Reduce plus very little on the occasion of ∈, so, if final distribution meets
    βij-pricej(t)≥max1≤k≤m{βik-pricek(t) }-∈, (6)
    It is considered at equilibrium.
  3. 3. a kind of relay selection method of Multi-source multi-relay wireless network minimum power as claimed in claim 2, its feature It is：Methods described is further comprising the steps of：
    6) all users form a network by wireless connection, if two users are connected, then and they are exactly neighborhood, User i is N in all neighbours of ti(t) pricing information, each user's iteration, are exchanged between the user with neighborhood Distributed auction algorithm is performed, according to the selection via node of local information independence, is comprised the following steps that：
    For user i, most starting, it possesses an initial distribution αi(t) ∈ { 1 ..., m }, the price of all relayings priceij>=0 and highest bidder b (t)ij；
    Step 6.1：User i receives the pricing information of all relayings and corresponding maximum bidder, i in t from neighbor node Compare price and the highest bidder of renewal relaying according to the information received and the information being locally stored：
    <mrow> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>+</mo> <mn>1</mn> <mo>)</mo> </mrow> <mo>:</mo> <mo>=</mo> <msub> <mi>max</mi> <mrow> <mi>k</mi> <mo>&amp;Element;</mo> <msub> <mi>N</mi> <mrow> <mi>i</mi> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> </msub> </mrow> </msub> <mo>{</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>}</mo> <mo>,</mo> </mrow>
    <mrow> <msub> <mi>b</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>+</mo> <mn>1</mn> <mo>)</mo> </mrow> <mo>:</mo> <mo>=</mo> <msub> <mi>max</mi> <mrow> <mi>k</mi> <mo>&amp;Element;</mo> <msub> <mi>argmax</mi> <mrow> <mi>z</mi> <mo>&amp;Element;</mo> <msub> <mi>N</mi> <mrow> <mi>i</mi> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> </msub> </mrow> </msub> <mo>{</mo> <msub> <mi>p</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>,</mo> <msub> <mi>p</mi> <mrow> <mi>z</mi> <mi>j</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>}</mo> <mo>&amp;Element;</mo> <msub> <mi>N</mi> <mrow> <mi>i</mi> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> </msub> </mrow> </msub> <mo>{</mo> <msub> <mi>b</mi> <mrow> <mi>k</mi> <mi>j</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>}</mo> <mo>;</mo> </mrow>
    Step 6.2：IfAndSo renewal distribution αi(t +1)∈argmax1≤k≤mβik-pik(t+1), by via node αi(t+1) maximum bidder is set to i, and updates its price Wherein, It is user i optimal benefit value,It is user i suboptimum benefit value；
    Step 6.3：IfRemain in that original distribution, i.e. αi(t+1):=αi(t)；
    All user node iteration perform step 6.1-6.3, and a via node is selected according to local information, until institute is useful The via node of family node selection meets formula (6), even if the distribution that the distribution system overall transmission power now obtained is minimum.
CN201410567230.6A 2014-10-22 2014-10-22 The relay selection method of Multi-source multi-relay wireless network minimum power Active CN104320839B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410567230.6A CN104320839B (en) 2014-10-22 2014-10-22 The relay selection method of Multi-source multi-relay wireless network minimum power

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410567230.6A CN104320839B (en) 2014-10-22 2014-10-22 The relay selection method of Multi-source multi-relay wireless network minimum power

Publications (2)

Publication Number Publication Date
CN104320839A CN104320839A (en) 2015-01-28
CN104320839B true CN104320839B (en) 2017-12-29

Family

ID=52375988

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410567230.6A Active CN104320839B (en) 2014-10-22 2014-10-22 The relay selection method of Multi-source multi-relay wireless network minimum power

Country Status (1)

Country Link
CN (1) CN104320839B (en)

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105430709B (en) * 2015-12-11 2018-12-28 重庆邮电大学 The relay selection and power distribution method of multi-source multi-target wireless network
CN107181549B (en) * 2017-07-06 2020-05-08 河南理工大学 Relay selection method under non-ideal condition
CN108566665B (en) * 2018-03-12 2020-09-01 清华大学 Relay selection method and network equipment
CN110351885B (en) * 2019-06-29 2020-10-30 中国人民解放军军事科学院国防科技创新研究院 Wireless distributed cooperative network opportunistic channel access method based on threshold measurement
CN111641453B (en) * 2020-06-08 2021-08-10 西安电子科技大学 Adaptive protocol selection method based on serial relay free space optical communication system

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102238685A (en) * 2010-05-06 2011-11-09 华为技术有限公司 Method and equipment for relay node selection and power distribution in wireless relay network

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130294331A1 (en) * 2012-05-03 2013-11-07 Mediatek Singapore Pte. Ltd. Method for Distributed Relay Discovery and Data Forwarding

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102238685A (en) * 2010-05-06 2011-11-09 华为技术有限公司 Method and equipment for relay node selection and power distribution in wireless relay network

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
基于中断概率的协作通信中继选择与功率分配算法;孙立悦等;《通信学报》;20131025;第34卷(第10期);84-91 *

Also Published As

Publication number Publication date
CN104320839A (en) 2015-01-28

Similar Documents

Publication Publication Date Title
CN104320839B (en) The relay selection method of Multi-source multi-relay wireless network minimum power
CN105451343B (en) A kind of more junction network resource allocation methods based on energy acquisition
CN104702396B (en) Cooperation based on effectiveness relays the federated resource distribution method of cognitive system more
CN108601088A (en) A kind of collaboration communication method and system based on non-orthogonal multiple access
Xia et al. Joint user selection and transceiver design for cell-free with network-assisted full duplexing
CN105744629B (en) A kind of time-optimized distribution method of energy acquisition relay system based on relay selection
CN103916912B (en) Wireless Heterogeneous Networks are based on the node cooperation motivational techniques of non-cooperative game
JP2016521482A (en) System and method for sparse beamforming design
CN105191465A (en) Method and apparatus for resource sharing for device-to-device and cellular communications in multicell network
CN107509243A (en) Bandwidth and power joint control method based on descending non-orthogonal multiple access system
CN104168573B (en) Interference elimination method based on sub-clustering interference alignment under Femtocell networks
CN105007541B (en) Telescopic video flowable state multi code Rate of Chinese character multicast optimization transmission method
Liu et al. Full-duplex aided user virtualization for mobile edge computing in 5G networks
CN104244437A (en) Dynamic relaying incentive fair-share dispatching method for cooperative downlink transmission
Guo et al. A QoS-oriented high-efficiency resource allocation scheme in wireless multimedia sensor networks
Tang et al. Contract-based incentive mechanism for cooperative NOMA systems
CN104202788A (en) Relay node selection method for minimizing end-to-end sending power in Rayleigh fading channel
Popovski et al. Interference spins: Scheduling of multiple interfering two-way wireless links
CN103944618B (en) Extensive MISO collaborations efficiency sending method
Jian et al. Energy-efficient user association with load-balancing for cooperative IIoT network within B5G era
CN107172674A (en) Relay selection and power distribution method based on game theory in a kind of intelligent grid
CN104540203A (en) Performance optimizing method for wireless body area network based on independent sets
CN105025565B (en) Full duplex bidirectional relay system power optimization method under asymmetric rate
CN105873216A (en) Resource allocation method for jointly optimizing energy efficiency and spectral efficiency by heterogeneous network multipoint collaboration
CN110677176A (en) Combined compromise optimization method based on energy efficiency and spectrum efficiency

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
CB03 Change of inventor or designer information

Inventor after: Qian Liping

Inventor after: Wu Hang

Inventor after: Chen Qingzhang

Inventor before: Wu Hang

Inventor before: Qian Liping

Inventor before: Chen Qingzhang

CB03 Change of inventor or designer information
GR01 Patent grant
GR01 Patent grant
TR01 Transfer of patent right

Effective date of registration: 20191211

Address after: 325038 Room 204, building B, Yungu, Nanyang Avenue, Yaoxi street, Longwan District, Wenzhou City, Zhejiang Province

Patentee after: Wenzhou Qibo Intellectual Property Service Co.,Ltd.

Address before: 310018 Room 1004-1006, 17 Block 57, Baiyang Street Science Park Road, Hangzhou Economic and Technological Development Zone, Zhejiang Province

Patentee before: Zhejiang Qibo Intellectual Property Operation Co.,Ltd.

Effective date of registration: 20191211

Address after: 310018 Room 1004-1006, 17 Block 57, Baiyang Street Science Park Road, Hangzhou Economic and Technological Development Zone, Zhejiang Province

Patentee after: Zhejiang Qibo Intellectual Property Operation Co.,Ltd.

Address before: The city Zhaohui six districts Chao Wang Road Hangzhou City, Zhejiang province 310014 18

Patentee before: Zhejiang University of Technology

TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20200410

Address after: 266100 A 169, Songling Road, software park, Laoshan District, Qingdao, Shandong, 211

Patentee after: Qingdao Huashi Intelligent Technology Co.,Ltd.

Address before: 325038 Room 204, building B, Yungu, Nanyang Avenue, Yaoxi street, Longwan District, Wenzhou City, Zhejiang Province

Patentee before: Wenzhou Qibo Intellectual Property Service Co.,Ltd.

TR01 Transfer of patent right