CN106028395A - Relay selection method giving full consideration to delay influence - Google Patents

Relay selection method giving full consideration to delay influence Download PDF

Info

Publication number
CN106028395A
CN106028395A CN201610297552.2A CN201610297552A CN106028395A CN 106028395 A CN106028395 A CN 106028395A CN 201610297552 A CN201610297552 A CN 201610297552A CN 106028395 A CN106028395 A CN 106028395A
Authority
CN
China
Prior art keywords
node
alternative
via node
relay
represent
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
CN201610297552.2A
Other languages
Chinese (zh)
Other versions
CN106028395B (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.)
Guangxi Normal University
Original Assignee
Guangxi Normal University
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 Guangxi Normal University filed Critical Guangxi Normal University
Priority to CN201610297552.2A priority Critical patent/CN106028395B/en
Publication of CN106028395A publication Critical patent/CN106028395A/en
Application granted granted Critical
Publication of CN106028395B publication Critical patent/CN106028395B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/0231—Traffic management, e.g. flow control or congestion control based on communication conditions
    • H04W28/0236—Traffic management, e.g. flow control or congestion control based on communication conditions radio quality, e.g. interference, losses or delay
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/0278—Traffic management, e.g. flow control or congestion control using buffer status reports
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/08—Load balancing or load distribution
    • 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
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/0289—Congestion control

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention discloses a relay selection method giving full consideration to delay influence. The method comprises the following steps: firstly, measuring a link signal to noise ratio between a source node and each candidate relay node and the link signal to noise ratio between each candidate relay node and a destination node, and feeding back the channel state information and a queue condition (comprising queue length, space size of the memory or the like) in a memory of each candidate relay node to the source node or the destination node; secondly, calculating the delay of each candidate relay node by the source node or the destination node according to the channel state information and the queue condition of each candidate relay node; and finally, selecting a relay for transmitting information by the source node or the destination node. The method disclosed by the invention is conducive to guaranteeing the requirements of different business on the delay and the balance of relay loads, different relay selection policies can be adopted according to the sensitivity of the business on the delay, and the method is conducive to improving the anti-blocking performance of the system.

Description

Take into full account the relay selection method of delay
Technical field
The present invention relates to wireless co-operative communication field, be specifically related to a kind of relay selection side taking into full account delay Method.
Background technology
Collaboration diversity is the effective ways resisting multipath effect in radio communication, assists transmitting terminal by introducing via node And the information communication between receiving terminal, it is possible to obtain diversity gain, significantly improves network throughput and the reliability of information transmission. But current relay selection method mainly considers the via node selecting signal to noise ratio maximum, or considers power consumption, often Have ignored the relaying time delay potential appreciable impact on network performance.When considering relaying latency issue, how at relaying time delay and letter Carry out between road state optimum combination to choose relaying, the most both can guarantee that higher transfer rate, reduced business the most as far as possible Time delay, is to study the key factor that relay selection is necessary, particularly under the background that data service is growing, it appears particularly Important.
In existing relay selection method, representational method has max-max relay selection method, selects source node to arrive Link that between via node, signal to noise ratio is maximum and via node pass to the link that signal to noise ratio between destination node is maximum Defeated；Also has max-link relay selection scheme, at a certain time slot, when the signal to noise ratio of source node to certain via node is including Active node to via node and via node to the signal to noise ratio of destination node link in maximum time, select maximum signal to noise ratio Source node is transmitted to via node link or via node to destination node link.But above method does not all account for Business latency issue at relaying, especially for video conference, Web TV etc. requires high business to network delay, this A little relay selection method are not necessarily suitable for, and are therefore necessary to take into account the impact considering time delay in relay selection.
Summary of the invention
The present invention is directed to existing relay selection method ignore business and queue up at via node the latency issue brought, carry For a kind of relay selection method considering delay.
The present invention first survey calculation source node is to the link signal to noise ratio between each alternative via node, each alternative relaying joint Point to the link signal to noise ratio between destination node is, and by these channel condition informations and each alternative via node memorizer Queue situation (including queue length, storage space size etc.) feed back to source node or destination node；Secondly source node Or destination node is according to the queue situation of channel condition information and alternative via node, calculates the time delay of each alternative via node； Last source node or destination node select the relaying for transmitting information, and relay selection result notifies each relaying joint simultaneously Point.
Invention has a characteristic that
(1) queue length of via node memorizer considered when relay selection and storage space size, be conducive to Ensure that different business is to the requirement of time delay and the equilibrium of relaying load.
(2) according to business, the sensitivity of time delay is taked different relay selection strategies, delay sensitive business is made every effort to Reducing service delay, the via node that business insensitive to time delay then makes residual memory space little is preferentially chosen, and to avoid Traffic congestion, is conducive to improving systematic function.
Detailed description of the invention
The system model of the present invention is by a source node S, destination node D with containing NrelayIndividual DF (decode-and- Forward, decoding forwards) alternative via node composition, these alternative via nodes have certain storage capacity, constitute alternative Via node collection Srelay=1,2 ..., Nrelay}.These alternative via nodes can be duplex relaying, it is also possible to is half-duplex Relaying.Assume not exist between source node and destination node effective directapath.Source node S is to the i-th (i ∈ Srelay) individual alternative Link and the alternative via node of i-th between via node constitute alternative repeated link i to the link between destination node D. Definition source node S is γ to the link signal to noise ratio between the alternative via node of i-thSi, the alternative via node of i-th to purpose saves Link signal to noise ratio between some D is γiD, the equivalent signal-to-noise ratio of i-th alternative repeated link isAccording to The definition of time delay, the time delay T at the definition alternative via node of i-thi=Qi/min{CSi,CiD}.Wherein, QiRepresent that i-th is standby Choose the queue size continuing in node storage space, QtiRepresent i-th alternative via node storage size, CSi=log2(1 +γSi) represent that source node S is to the channel capacity between the alternative via node of i-th, CiD=log2(1+γiD) represent that i-th is standby Via node is selected to arrive the channel capacity between destination node D.
The present invention is divided into three kinds of situations.
Situation 1: the relay selection of delay sensitive business, comprises the following steps that
(1) survey calculation source node S is to link signal to noise ratio γ between the alternative via node of i-thSi, i-th alternative in Continue node to link signal to noise ratio γ between destination node DiD, and these channel condition informations and each alternative via node are deposited Queue situation (including queue length, storage space size etc.) in reservoir feeds back to source node or destination node.
(2) source node or destination node are according to the queue situation of channel condition information and alternative via node, utilize Ti= Qi/min{CSi,CiDCalculate the time delay of each alternative via node.
(3) source node or destination node according toSelect i-th*Individual alternative via node conduct Forwarding the relaying of data, wherein α is sensitive factor and is positive number.
(4) relay selection result is notified each via node.
Situation 2: the relay selection of the insensitive business of time delay, comprises the following steps that
(1) survey calculation source node S is to link signal to noise ratio γ between the alternative via node of i-thSi, i-th alternative in Continue node to link signal to noise ratio γ between destination node DiD, and these channel condition informations and each alternative via node are deposited Queue situation (including queue length, storage space size etc.) in reservoir feeds back to source node or destination node；
(2) source node or destination node according toSelect i-th*Individual alternative via node is made For forwarding the relaying of data, wherein β is the non-sensitive factor and is negative.
(3) relay selection result is notified each via node.
Situation 3: when simultaneously there is time delay sensitive traffic and the insensitive business of time delay at via node, relay selection method Use the method in situation 1.
Calculated below with concrete data, be conducive to fully understanding the solution of the present invention and effect.
Assume: Nrelay=3, system i.e. has 3 DF relaying, in each via node memory space, lines up size: Q1 =2, Q2=3, Q3=4；Via node storage size: Qt1=Qt2=Qt3=5；Source node S is to the chain between via node The signal to noise ratio on road is: γS1=7.9433, γS2=15.8489, γS3=19.9526；Via node is to the link of destination node D Signal to noise ratio is: γ1D=6.3096, γ2D=31.6228, γ3D=15.8489.α=1, β=-1.
Situation 1: the relay selection of delay sensitive business, has step as follows:
(1) survey calculation source node S is to link signal to noise ratio γ between the alternative via node of i-thSi, i-th alternative in Continue node to link signal to noise ratio γ between destination node DiD, and these channel condition informations and each alternative via node are deposited Queue situation (including queue length, storage space size etc.) in reservoir feeds back to source node or destination node.
(2) source node or destination node are according to the queue situation of channel condition information and alternative via node, utilize Ti= Qi/min{CSi,CiDCalculate the time delay of each alternative via node.
According to formula CSi=log2(1+γSi), C can be calculatedS1=3.1608, CS2=4.0746, CS3=4.3891； According to formula CiD=log2(1+γiD), C can be calculated1D=2.8698, C2D=5.0278, C3D=4.0746；Finally according to Formula Ti=Qi/min{CSi,CiDCalculate alternative relaying R1Time delay T1=0.6969, alternative relaying R2Time delay T2= 0.7363, alternative relaying R3Time delay T3=0.9817.
(3) source node or destination node according toSelect i-th*Individual alternative via node is as forwarding number According to relaying, wherein α=1；The equivalent signal-to-noise ratio of each bar repeated link According to calculating The most alternative via node R3Selected In forward data.
(4) relay selection result is notified to each via node.
Situation 2: the relay selection of the insensitive business of time delay, specifically comprises the following steps that
(1) survey calculation source node S is to link signal to noise ratio γ between the alternative via node of i-thSi, i-th alternative in Continue node to link signal to noise ratio γ between destination node DiD, and these channel condition informations and each alternative via node are deposited Queue situation (including queue length, storage space size etc.) in reservoir feeds back to source node or destination node；
(2) source node or destination node according toSelect i-th*Individual alternative via node is as forwarding The relaying of data, wherein β=-1；The equivalent signal-to-noise ratio of each bar repeated link According to calculating The most alternative via node R3Selected Forward data.
(3) relay selection result is notified to each via node.

Claims (2)

1. take into full account that a relay selection method for delay, described method include:
(1) survey calculation source node S is to link signal to noise ratio γ between the alternative via node of i-thSi, i-th alternative relaying joint Point arrives link signal to noise ratio γ between destination node DiD, and by these channel condition informations and each alternative via node memorizer In queue situation feed back to source node or destination node；
(2) source node or destination node are according to the queue situation of channel condition information and alternative via node, utilize formula Ti= Qi/min{CSi,CiD, calculate the time delay of each alternative via node；Wherein: TiRepresent the time delay of the alternative via node of i-th；CSi =log2(1+γSi), the channel capacity between expression source node S to the alternative via node of i-th；CiD=log2(1+γiD), table Show that the alternative via node of i-th is to the channel capacity between destination node D；QiRepresent i-th alternative via node memory space Interior lines up size；
(3) source node or destination node are according to formulaSelect i-th*Individual alternative via node conduct Forward data；Wherein: α is sensitive factor and is positive number；Represent the equivalent signal-to-noise ratio of i-th alternative repeated link,Srelay=1,2 ..., NrelayRepresent alternative via node collection, NrelayRepresent alternative via node Sum.
2. take into full account that a relay selection method for delay, described method include:
(1) survey calculation source node S is to link signal to noise ratio γ between the alternative via node of i-thSi, i-th alternative relaying joint Point arrives link signal to noise ratio γ between destination node DiD, and by these channel condition informations and each via node memorizer Queue situation feeds back to source node or destination node；
(2) source node or destination node are according to formulaSelect i-th*Individual alternative via node As forwarding data；Wherein: β is the non-sensitive factor and is negative；QiRepresent the row in i-th alternative via node memory space Team's size；QtiRepresent i-th alternative via node storage size；Represent the equivalent noise of i-th alternative repeated link Ratio,Srelay=1,2 ..., NrelayRepresent alternative via node collection, NrelayRepresent alternative relaying joint Point sum.
CN201610297552.2A 2016-05-07 2016-05-07 Fully consider the relay selection method of delay Expired - Fee Related CN106028395B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610297552.2A CN106028395B (en) 2016-05-07 2016-05-07 Fully consider the relay selection method of delay

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610297552.2A CN106028395B (en) 2016-05-07 2016-05-07 Fully consider the relay selection method of delay

Publications (2)

Publication Number Publication Date
CN106028395A true CN106028395A (en) 2016-10-12
CN106028395B CN106028395B (en) 2019-04-02

Family

ID=57081373

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610297552.2A Expired - Fee Related CN106028395B (en) 2016-05-07 2016-05-07 Fully consider the relay selection method of delay

Country Status (1)

Country Link
CN (1) CN106028395B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114830732A (en) * 2019-12-31 2022-07-29 华为技术有限公司 Multi-hop path CSI reporting method and related device
CN115348610A (en) * 2022-10-18 2022-11-15 成都市以太节点科技有限公司 Millimeter wave multilink self-adaptive communication method, electronic equipment and storage medium

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101039526A (en) * 2007-04-25 2007-09-19 北京邮电大学 Method for selecting user stay and relay node of central control wireless relay network
CN101790204A (en) * 2010-02-01 2010-07-28 北京邮电大学 Relay selection method giving consideration to channel conditions and traffic states in cooperative communication system
CN104105157A (en) * 2014-08-17 2014-10-15 广西师范大学 Relay selection method based on construction function in cooperative communication system
CN104883212A (en) * 2015-06-08 2015-09-02 北京邮电大学 Data transmission method and apparatus based on cooperative relay and frequency spectrum aggregation
CN105554817A (en) * 2015-12-16 2016-05-04 广西师范大学 Load equalized relay selection method

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101039526A (en) * 2007-04-25 2007-09-19 北京邮电大学 Method for selecting user stay and relay node of central control wireless relay network
CN101790204A (en) * 2010-02-01 2010-07-28 北京邮电大学 Relay selection method giving consideration to channel conditions and traffic states in cooperative communication system
CN104105157A (en) * 2014-08-17 2014-10-15 广西师范大学 Relay selection method based on construction function in cooperative communication system
CN104883212A (en) * 2015-06-08 2015-09-02 北京邮电大学 Data transmission method and apparatus based on cooperative relay and frequency spectrum aggregation
CN105554817A (en) * 2015-12-16 2016-05-04 广西师范大学 Load equalized relay selection method

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
DELI QIAO: "Effective Capacity of Buffer-Aided Full-Duplex Relay Systems With Selection Relaying", 《IEEE TRANSACTIONS ON COMMUNICATIONS》 *
ZHAO TIAN等: "Buffer-Aided Max-Link Relay Selection in Amplify-and-Forward Cooperative Networks", 《IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY》 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114830732A (en) * 2019-12-31 2022-07-29 华为技术有限公司 Multi-hop path CSI reporting method and related device
CN115348610A (en) * 2022-10-18 2022-11-15 成都市以太节点科技有限公司 Millimeter wave multilink self-adaptive communication method, electronic equipment and storage medium

Also Published As

Publication number Publication date
CN106028395B (en) 2019-04-02

Similar Documents

Publication Publication Date Title
US9209887B2 (en) Method and device for controlling relay transmission based on non-reproduction relay mode
CN103052132B (en) Multi-hop relay path selection method and system
CN102355661B (en) Non-regenerative-relay-mode-based relay forwarding control method and device
Moritz et al. Time-switching uplink network-coded cooperative communication with downlink energy transfer
CN103888848B (en) Video transmission routing method based on receiving nodes in vehicular ad hoc network
Nomikos et al. Joint relay‐pair selection for buffer‐aided successive opportunistic relaying
US20140219209A1 (en) Node device and communication method
Kim et al. Quality-aware coding and relaying for 60 GHz real-time wireless video broadcasting
CN101557630A (en) Method for selecting cooperative nodes in wireless communication network
JP2013214974A (en) Power allocation method, system, and apparatus
CN106028395B (en) Fully consider the relay selection method of delay
Chen et al. Near-optimal relay subset selection for two-way amplify-and-forward MIMO relaying systems
Costa et al. A routing mechanism based on the sensing relevancies of source nodes for time-critical applications in visual sensor networks
Le et al. MIMO cooperative communication network design with relay selection and CSI feedback
CN104780565B (en) A kind of fair cooperating relay system of selection
CN104994564B (en) There are the optimization methods of the amplification forwarding relay selection of feedback delay
Mao et al. Joint link selection and relay power allocation for energy harvesting relaying systems
CN104113365B (en) The system of selection of multiple antennas via node in Turbo Detection for Cooperative Communication
CN106658647B (en) A kind of relay selection algorithm based on interference perception
Liu et al. Analog network coding in the generalized high-SNR regime
Aishwarya et al. Relay assisted cooperative communication for wireless sensor networks
Katiyar et al. Outage performance of two-hop multi-antenna co-operative relaying in Rayleigh fading channel
Nage et al. TCP-aware network coding with opportunistic scheduling in wireless mobile ad hoc networks
CN104104423B (en) The removing method and system disturbed between MIMO trunking traffic nodes
Dong et al. Optimal fixed gain linear processing for amplify-and-forward multichannel relaying

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20190402

Termination date: 20210507

CF01 Termination of patent right due to non-payment of annual fee