CN103052132B - Multi-hop relay path selection method and system - Google Patents
Multi-hop relay path selection method and system Download PDFInfo
- Publication number
- CN103052132B CN103052132B CN201110313130.7A CN201110313130A CN103052132B CN 103052132 B CN103052132 B CN 103052132B CN 201110313130 A CN201110313130 A CN 201110313130A CN 103052132 B CN103052132 B CN 103052132B
- Authority
- CN
- China
- Prior art keywords
- path
- hop
- node
- error rate
- bit error
- 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
Links
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a multi-hop relay path selection method and a multi-hop relay path selection system. The method comprises the following steps of: detecting each path which passes a source node, a relay node and a sink node in sequence and the channel capacity and error rate of each path by using the sink node; determining a transmission path set and an optional path set; transmitting information of the optional path set to the source node by using each path in the transmission path set; judging whether an available path exists by using the source node; and if the available path exists, transmitting path selection confirming information to the sink node and transmitting data between the source node and the sink node. According to the method and the system, the single-hop channel capacity and error rate are considered comprehensively, so that the performance of an entire finally selected path is optimal. Moreover, bidirectional performance is considered, so that the bidirectional performance of the selected path can be optimized simultaneously.
Description
Technical field
The present invention relates to LTE evolution (LTE-Advanced, LTE-A) system, especially, is related to a kind of multi hop relay path
System of selection and system.
Background technology
Relaying (Relay) can expand base station range as including the next generation communication candidate technologies including LTE-A,
Local capacity is improved, has caused each side to pay close attention to and study in recent years.The thought of collaboration diversity starts to make relay from simple amplification
The direction for being forwarded to higher level is developed, and 3GPP is organized in classification in the 36-814 documents of its R9 to relay etc. and is described, and
Give its system integration project parameter.
Although using relay as next generation communication candidate criteria, double bounce above relay is not yet introduced and marked 3GPP by it
Standard, great majority research at present is still in the range of double bounce.
Fig. 1 is existing relay model schematics.
As shown in figure 1, at present the application model of relay is usually bikini model in LTE, i.e., in enhanced base station
Select a relay or several parallel between (enhanced NodeB, eNB) and user equipment (User Equipment, UE)
Relay is used as forwarding point.In FIG, the link h1 between eNB and UE is referred to as the link that direct transfers, the link between eNB and relay
H2 is referred to as return link, and the link h3 between relay and UE is referred to as access link.
At year ends 2005, the IEEE802.16e that IEEE is organized to set up proposes the young bird of multi-hop relay with reference to Ad hoc
Shape, discusses and changes through multi-party, the IEEE802.16j of revision in 2009 to the physical layer of double bounce and double bounce above relay extremely
The standard and basic procedure of media access control layer (Medium Access Control, MAC) is described.
At present, the research direction of multi-hop relay mainly includes channel capacity, networking mode and multi-hop relay selection etc..And
In multi-hop relay is selected, the most frequently used foundation mainly include based on distance, based on path loss, based on Signal to Interference plus Noise Ratio or signal to noise ratio,
Based on channel capacity or wherein a few persons consider.
Inventor Jing conscientiously studies discovery, and existing multi-hop relay selects the presence of following technical problem：
(1) thinking model based on ad-hoc networks, with energy to consider standard, often because some node " energy " consumptions
Reelect sub-optimal path to the greatest extent, cause hydraulic performance decline.In fact, overwhelming majority relay is connected to power supply, " energy " need not become it
The most important index of Path selection.
(2) it is double bounce model by multi-hop model abbreviation based on two hop patterns, then selects to calculate according to its relay for selecting
Method is directly selected, but this algorithm has only carried out suboptimization, and whether optimum, next if not accounting for whole piece path
Illustrated by example.
Fig. 2 is the model schematic of local optimum algorithm in prior art.
As shown in Fig. 2 having 2 relay to destination (D) from source (S), it is assumed that each relay is decoding forwarding,
Numeral between line represents the channel capacity of the jump.If the path for being only concerned next-hop is optimum, source S selects R1, R1
It is 1 in the channel capacity of next-hop, and the path channel capacity of multihop path depends on worst one channel capacity jumped, so whole
The channel capacity of paths is up to 1.And another paths S-R2-D, the channel capacity often jumped all is 2, the letter in its whole piece path
Road capacity is 2, is better than path S-R1-D.
As can be seen here, carry out in multi-hop relay at present only considered whether next-hop is optimal path during Path selection,
The performance from overall path is not accounted for.
The content of the invention
The invention solves the problems that a technical problem be to provide a kind of multi-hop relay path selection method and system, Neng Gouyou
Change the whole piece path from source node to destination node, improve the performance in whole piece path.
According to an aspect of the invention, it is proposed that a kind of multi-hop relay path selection method, including destination node RX path
Search message, each paths passed through from source node, via node to destination node according to route searching message detection and every
The channel capacity and the bit error rate of paths；According to the channel capacity and the bit error rate of the every paths for detecting and it is set most
High bit-error and return path number M determine transmission path set and optional path set from each paths for detecting, except biography
Residual paths set, wherein M are confirmed as by the path that destination node is detected outside defeated set of paths and optional path set>0, institute
The highest bit error rate of setting includes the single-hop highest bit error rate and the path highest bit error rate；Using transmission path set Zhong Meitiao roads
Radial direction source node transmits the information of optional path set, wherein, the information of optional path set includes every alternative path node
The channel capacity and the path bit error rate of every alternative path that sequence, destination node are calculated；Source node is according to the transmission road for detecting
The channel capacity and the bit error rate of the every paths in the set of footpath and the highest bit error rate judge whether available path；Exist
In the case of available path, using available path to destination node transmitting path select to confirm message and source node and destination node it
Between transmission data；In the case where there is no available path and not receiving the message that residual paths collection is combined into empty set, using connecing
Every alternative path in the optional path set for receiving is to destination node transmitting path reselection message；Destination node is receiving path
After reselection message, optional path set is updated to into transmission path set, M bars channel capacity is extracted most from residual paths set
Big path constitutes optional path set, and using transmission path set in every paths to source node transmission user data with
The information of optional path set, source node continues to detect available path, until source node detects available path or residual paths
Collection is combined into empty set, and the message that residual paths collection is combined into empty set is returned to source node when residual paths collection is combined into empty set；Do not depositing
In available path and in the case of receiving the message that residual paths collection is combined into empty set, source node broadcasts path search message.
According to a further aspect in the invention, it is also proposed that a kind of multi hop relay path selects system, including source node, Su Jie
Point and multiple via nodes, wherein, destination node, for RX path search message, according to route searching message detection from source
Each paths that node, via node to destination node is passed through and channel capacity and the bit error rate per paths, according to detection
To every paths channel capacity and the bit error rate and the set highest bit error rate and return path number M it is each from what is detected
Transmission path set and optional path set are determined in paths, by destination node in addition to transmission path set and optional path set
The path for detecting is confirmed as residual paths set, wherein M>0, the set highest bit error rate includes the single-hop highest bit error rate
With the path highest bit error rate, using transmission path set in every paths to source node transmit optional path set information,
Wherein, the information of optional path set includes the letter of every alternative path that every alternative path sequence node, destination node are calculated
Road capacity and the bit error rate, after path reselection message is received, are updated to transmission path set, from residue by optional path set
The maximum path of M bars channel capacities is extracted in set of paths and constitutes optional path set, and using transmission path set in it is every
Paths transmit the information of user data and optional path set to source node, when residual paths collection is combined into empty set to source node
Return the message that residual paths collection is combined into empty set；Source node, for the every paths in the transmission path set for detecting
Channel capacity and the bit error rate and the highest bit error rate judge whether available path, in the case where there is available path,
Select to confirm message and the transmission data between source node and destination node to destination node transmitting path using available path, do not depositing
In available path and in the case of not receiving the message that residual paths collection is combined into empty set, using the optional path set for receiving
In every alternative path to destination node transmitting path reselection message, there is no available path and receiving residual paths set
For empty set message in the case of broadcast route search message；Each via node, is arranged between source node and destination node, uses
The data transmitted between source node and destination node in forwarding and message.
Multi-hop relay path selection method and system that the present invention is provided, consider single-hop channel capacity and the bit error rate,
So that the best performance in final selected whole piece path.Additionally, the present invention also considers two-way performance simultaneously, so that
Obtaining performance of the selected path on twocouese can be optimal simultaneously.
Description of the drawings
Accompanying drawing described herein is used for providing a further understanding of the present invention, constitutes the part of the application.Attached
In figure：
Fig. 1 is existing relay model schematics.
Fig. 2 is the model schematic of local optimum algorithm in prior art.
Fig. 3 is multi-hop relay model schematics.
Fig. 4 is the frame structure schematic diagram of double bounce relay.
Fig. 5 is the frame structure schematic diagram of multi-hop relay.As shown in figure 5, illustrating so that three jump as an example.
Fig. 6 is the schematic flow sheet of one embodiment of multi-hop relay path selection method of the present invention.
Fig. 7 is the message flow schematic diagram that multi hop relay path of the present invention selects failure.
Fig. 8 is a multi hop relay path of the present invention message flow schematic diagram chosen successfully.
Fig. 9 is a multi hop relay path schematic diagram of the present invention.
Figure 10 is another multi hop relay path schematic diagram of the invention.
Figure 11 is the message flow schematic diagram that multi hop relay path of the present invention is selected.
Figure 12 is the another multi hop relay path schematic diagram of the present invention.
Figure 13 is downlink resource grid schematic diagram in mimo system.
Figure 14 is N paths relaying schematic diagram.
Figure 15 is the structural representation of one embodiment that multi hop relay path of the present invention selects system.
Figure 16 multi hop relay paths of the present invention select the structural representation of the another embodiment of system.
Specific embodiment
The present invention is described more fully with reference to the accompanying drawings, wherein illustrating the exemplary embodiment of the present invention.This
The exemplary embodiment of invention and its illustrate for explaining the present invention, but do not constitute inappropriate limitation of the present invention.
It is below illustrative to the description only actually of at least one exemplary embodiment, never as to the present invention
And its any restriction applied or use.
Multi-hop relay models involved in the present invention are introduced first.
Fig. 3 is multi-hop relay model schematics.
As shown in figure 3, dotted arrow represents that this is not a direct path, but one through multiple relay and shape
Into path.The all relay set of paths from source node (S) to destination node (D), horizontal dotted line frame are represented in longitudinal dotted line frame
h1Represent the first paths from S to D, R1,iFor i-th relay on the 1st paths, RN,jFor j-th on N paths
relay.Each paths can have identical node, that is to say, that R1,iWith RN,jCan be same relay, simply not go the same way
Mark in the set of footpath is different.The first paths from S to D are assumed altogether through I node, then the path can also be used
Relay sequences are expressed as：(R1,1···,R1,i,···,R1,I)。
In multi-hop relay, if being only amplified forwarding, noise will amplify therewith, and quite a few power is only used for
Transmission noise, causes power dissipation, also increases the bit error rate.Each relay is conducive to using decoding pass-through mode in the present invention
The bit error rate is reduced, meanwhile, the Relay of the present invention is a layer 3relay, and it is nontransparent to user, there is individual cell ID, can carry out
Stochastic accessing and resource request distribution etc..
Next introduces the frame structure of relay.
802.16j is discussed in more detail to the frame structure of multi-hop relay, and the present invention combines LTE-A by multi-hop
Relay frame structures are converted into drag.The model does not consider the link that direct transfers, i.e. the communication between user and base station needs to borrow
Help relay to realize.
By taking TDD mode as an example, 10 subframes are had in a frame, wherein the 1st subframe and the 6th subframe are pilot tone subframe,
Remaining subframe is data transmission subframes.Remaining 8 subframes can be divided in the case where the 1st subframe and the 6th subframe is not considered
Four operation intervals, as shown in Figure 4 and Figure 5, T is interval to send, and R is reception interval, and Idle is idle interval, some reception areas
Between be adjustable to send interval, i.e. after relay receives the information that be transmitted to other relay, by the adjustment of part reception interval
Interval to send, if relay is not received by needing the information for being transmitted to other relay, this part is still reception area
Between.In the same manner, it is adjustable reception interval that some send interval.In fact, this partial section for being adjusted is a kind of protection interval, protect
The size at shield interval can be determined according to the coverage of message transmission rate and relay.
Fig. 4 is the frame structure schematic diagram of double bounce relay.
As shown in figure 4, Relay receives the information that eNB sends in the first operation interval, will receive in the second operation interval
Information be transmitted to UE, the 3rd operation interval receives the information that UE sends, and the 4th operation interval is by the letter from UE for receiving
Breath is transmitted to eNB.
In the case of more than double bounce, when relay receives the information for being transmitted to other relay, frame structure is relative to Fig. 4
To adjust.
Fig. 5 is the frame structure schematic diagram of multi-hop relay.As shown in figure 5, illustrating so that three jump as an example.
In the first operation interval, eNB to relay1 sends data, and not receiving will be transmitted to other relay data
Relay (for example, relay2) is reception interval in this operation interval.But to be transmitted to other relay's when it is received
During data, it is transmission state so as to can be to it in the reception interval of next relay that can will be close to send interval partial adjustment
Data are sent, time delay is reduced.Relay1 in Fig. 5 after the data for receiving eNB transmissions, by it near sending interval part
Time is adjusted to transmission state, and the data is activation that be sent to other relay for receiving is gone out, and for example, relay1 will
Data is activation is to relay2.
In the second operation interval, eNB is idle condition, and relay1 and relay2 is transmission state, but relay2 because
The interval rear end part of first job receives the forwarding data of relay1, therefore the fore-end of the second operation interval is adjusted
It is whole for reception state, i.e. increase a protection interval to ensure to send relay1 the complete reception of data.
In the 3rd operation interval, user enters transmission state, and relay1 and relay2 enters reception state, with the first work
Make that interval working method is identical, when relay2 receives data to relay1 to be forwarded, the rear end of the 3rd operation interval
Partial adjustment is transmission state.
In the 4th operation interval, relay1, relay2 enter transmission state, and eNB is reception state, before the transmission of relay1
End is adjusted to reception state, to ensure the integrity of receiving data.
If transmitting terminal and receiving terminal rate-matched, do not consider message transmission rate, the covering of relay only can need to be considered
Impact of the scope to protection interval.The aerial spread speed of electromagnetic wave is approximately 3 × 108M/s, subframe is 1ms, one
Individual subframe generally comprises 14 OFDMs (Orthogonal Frequency Division in time domain
Multiplexing, OFDM) symbol, when the coverage of relay is more than 15km, if be not added with protection interval can affect at least
1 OFDM symbol, now the protection interval of receiving terminal be just particularly important, protection interval should be 1 OFDM symbol length.When
When the coverage of relay is less than 1km, by taking 1km as an example, propagation delay is 1/3 × 10-5S, can be with if protection interval is not added with
The Cyclic Prefix collision of other subframes, protection interval is about 1/10 OFDM symbol.
Next based on above-mentioned multi-hop relay models and frame structure description explanation embodiments of the invention.
Fig. 6 is the schematic flow sheet of one embodiment of multi-hop relay path selection method of the present invention.
As shown in fig. 6, the embodiment may comprise steps of：
S602, destination node RX path search message, according to route searching message detection from source node, via node to place
Each paths that node is passed through and channel capacity and the bit error rate per paths；
S604, according to the channel capacity and the bit error rate and the set highest bit error rate of the every paths for detecting and returns
Return number of path M and determines transmission path set (it can be appreciated that optimal path set) and alternatively from each paths for detecting
Set of paths (it can be appreciated that sub-optimal path set), is detected in addition to transmission path set and optional path set by destination node
To path can be determined that residual paths set, wherein M>0, the highest bit error rate of setting include the single-hop highest bit error rate and
The highest bit error rate in whole piece path；
S606, using transmission path set in every paths to source node transmit optional path set information, wherein,
It is standby per bar that the information of optional path set includes that every alternative path sequence node (for example, S-R1-R3-D), destination node are calculated
The channel capacity and the bit error rate in routing footpath；
S608, the channel capacity and the bit error rate of every paths of the source node in the transmission path set for detecting and
The highest bit error rate judges whether available path；
S610, in the case where there is available path, selects to confirm message using available path to destination node transmitting path
And between source node and destination node transmission data；
S612, in the case where there is no available path and not receiving the message that residual paths collection is combined into empty set, utilizes
Every alternative path in the optional path set for receiving to destination node transmitting path reselection message, wherein, residual paths collection
The message for being combined into empty set is to detect in the case that residual paths collection is combined into empty set to be sent to source node in destination node, destination node
After path reselection message is received, by optional path set be updated to transmission path set (that is, using optional path set as
New transmission path set), extract from residual paths set the maximum path of M bars channel capacities (if channel capacity is identical,
Then minimum M paths of the path selection bit error rate) optional path set is constituted (that is, from path selection structure in residual paths set
The optional path set of Cheng Xin), and using transmission path set in every paths to source node transmission user data and alternative
The information of set of paths, source node continues to detect whether there is available path, until source node detects available path or residue
Set of paths is empty set, and when residual paths collection is combined into empty set, destination node returns residual paths collection and is combined into disappearing for empty set to source node
Breath；
S614, in the case where there is no available path and receiving the message that residual paths collection is combined into empty set, source node
Broadcast route search message.
The embodiment considers single-hop channel capacity and the bit error rate, so that the property in final selected whole piece path
Can be optimum.Additionally, the present invention also considers two-way performance simultaneously, so that performance of the selected path on twocouese is all
Can be optimal simultaneously.
In an example, the channel capacity of the every paths in step S602 and S608 can be obtained by following step
And the bit error rate：
Present node is estimated single-hop channel capacity first and the single-hop bit error rate and the lowest channel capacity for arranging and
The single-hop highest bit error rate is compared, if the single-hop channel capacity for estimating is more than the lowest channel capacity for arranging and estimates
The single-hop bit error rate for going out is less than the single-hop highest bit error rate, then continue to judge whether present node is the first hop node, otherwise, abandons
The message or data (that is, being unsatisfactory for the requirement of default) of present node are reached, if the first hop node, then by the jump section
The single-hop channel capacity and the single-hop bit error rate that point estimation goes out is sent to next-hop node, if it is not, then each hop node incite somebody to action this
The single-hop channel capacity that the single-hop channel capacity that hop node is estimated is sent with upper hop node is compared, and by both
The single-hop bit error rate that less single-hop channel capacity, the single-hop bit error rate of this hop node and upper hop node send is sent to next
Hop node, wherein, present node is via node；
If last node (that is, source node or destination node) of present node for whole piece path, then will estimate
The single-hop channel capacity that single-hop channel capacity sends with upper hop node is compared, and is held according to less single-hop channel in both
Gauge calculates path channel capacity, and according to the single-hop error rate calculation outbound path bit error rate of each jump.
For example, it is assumed that destination node detects the N paths from source node, nth bar path through I via node, then
Channel capacity C in whole nth bar pathnWith bit error rate PsnRespectively：
Wherein, with regard to channel capacity C of each jumpn,iWith bit error rate Ps of each jumpn,iBy the pin in follow-up embodiment
Specific computing formula is given to specific system model.
The minimum channel capacity phase of final path channel capacity and all jumps in path is can be seen that from the example
Close, the bit error rate in whole piece path is the accumulation of each jump bit error rate, therefore, it can select many of whole piece path performance optimum
Jump path.
In another example, step S604 can be implemented by following step：
The bit error rate of the every paths for detecting is compared with the path highest bit error rate；
The maximum path structure of M bars channel capacity is selected from the path for meeting path highest bit error rate requirement for detecting
Into transmission path set, if channel capacity is identical, the relatively low path of the path selection bit error rate constitutes transmission path set；Lift
Example explanation, it is assumed that return path number M is 2 and meets the path of path highest bit error rate requirement and have 8, then select channel
Maximum front two paths of capacity constitute transmission path set, if channel capacity maximum has 3 paths, path selection is missed
Minimum front 2 paths of code check constitute transmission path set；
The path structure that M bars are not used for transmission data is chosen from the path for meeting path highest bit error rate requirement for detecting
Into optional path set, (that is, meeting in the N paths of highest bit error rate requirement from destination node detection, first selects M bars as biography
Defeated path, then M bars alternately path is chosen from N-M bars), if channel capacity is identical, the path selection bit error rate is relatively low
Path constitute optional path set；Continue above-mentioned example, select 2 alternately paths again from remaining 6 paths,
It is required that the channel capacity of this two paths should be maximum in this 6 paths, if channel capacity is identical, choose two error codes
The minimum path of rate alternately path.
In a further example, step S608 can be implemented by following step：
Source node is compared the bit error rate of the every paths for detecting with the path highest bit error rate；If being less than path
The highest bit error rate, then choose the maximum path of channel capacity as available path, if channel capacity is identical, path selection is missed
The minimum path of code check is used as available path.
In another embodiment of multi-hop relay path selection method of the present invention, via node disappears receiving route searching
After breath, can also first judge current jumping figure whether more than set maximum hop count；If greater than set maximum hop count, then
Route searching message is abandoned, the selection in path is otherwise carried out.
In actual applications, destination node can be base station or user equipment, correspondingly source node can for user equipment or
Base station, below will be described in detail by instantiation.
All using decoding pass-through mode, the relay route capacity for decoding forwarding depends on user most to the via node of the present invention
Little transfer rate and minimum single-hop channel capacity.Each via node all may be used after receiving data carries out single-hop channel estimation
To calculate from upper hop node (that is, a upper transmitting terminal) to the single-hop channel capacity and the single-hop bit error rate of the via node.The
One jumps reached node is preserved and is sent to next-hop by two values (channel capacity of the jump and the bit error rate of the jump)
Node, from second jump from the beginning of, the node of each jump is all contrasted to this hop channel capacity and upper hop channel capacity, retain compared with
Little data, the bit error rate that this is jumped and all bit error rates for receiving are preserved, and are sent to next-hop section as information
Point.The rest may be inferred, and in last node the channel capacity and the bit error rate of each paths are can be obtained by.In the same manner, source node
Path channel capacity and the bit error rate from destination node to source node can also be obtained.
The single-hop highest bit error rate that hypothesis system is arranged is Pssmax, the path highest bit error rate is Pmsmax(wherein, Pmsmax＞
Pssmax), single-hop lowest channel capacity is Cmin, maximum hop count is Imax+1。
Fig. 7 is the message flow schematic diagram that multi hop relay path of the present invention selects failure.
As shown in fig. 7, path selection process when showing source node initiating business request, specifically includes following process：
S702, source node sends service request, starts route searching；
S704, destination node RX path search message, according to detecting from source node Jing difference via nodes to Su Jie
The path of point carries out the Path selection of source node to destination node, if N bars meet desired path (concrete determination methods referring to
Above-described embodiment), then the maximum M paths h of channel capacity are selected from N paths1... hMAs transmission path, then in N-M
The M paths of channel capacity maximum (if channel capacity is identical, the minimum path of the path selection bit error rate) are selected in paths
hM+1... h2MAlternately path, remaining N-2M paths constitute residual paths set.In using transmission path set per bar
Path to source node send optional path set information, specifically include every alternative path sequence node, from source node to
The channel capacity and the bit error rate of the alternative path of destination node；
S706, source node selects available path (concrete according to the measurement result of the transmission path from destination node to source node
System of selection is referring to above-described embodiment), if not selecting available path, using the alternative path in optional path set
hM+1... h2MGravity treatment path request is sent to destination node, can now start transmission data；
S708, destination node is received after gravity treatment path request, and optional path set is updated to into transmission path set, from N-
The M paths of M bars channel capacity maximum (as the identical routing footpath bit error rate of channel capacity is minimum) are chosen in 2M paths as new
Optional path set；Using new M transmission paths hM+1... h2MTo source node transmission data, and by the new alternative road of M bars
Footpath h2M+ 1 ... h3MInformation also return to source node, when residual paths collection is combined into empty set to source node return residual paths collection
It is combined into the message of empty set；
S710, if source node is also not detected by available path and receives the feelings that residual paths collection is combined into the message of empty set
Under condition, source node broadcasts path search message re-executes the Path selection step of above-mentioned S702-S708.
Fig. 8 is a multi hop relay path of the present invention message flow schematic diagram chosen successfully.
As shown in figure 8, path selection process when showing source node initiating business request, specifically includes following process：
S802, source node sends service request, starts route searching；
S804, destination node RX path search message, according to detecting from source node Jing difference via nodes to Su Jie
The path of point carries out the Path selection of source node to destination node, if N bars meet desired path (concrete determination methods referring to
Above-described embodiment), then the maximum M paths h of channel capacity are selected from N paths1... hMAs transmission path, then from N-M
The M paths of channel capacity maximum (if channel capacity is identical, the minimum path of the path selection bit error rate) are selected in paths
hM+1... h2MAlternately path, remaining N-2M paths constitute residual paths set.In using transmission path set per bar
Path to source node send optional path set information, including every alternative path sequence node, from source node to Su Jie
The channel capacity and the bit error rate of the alternative path of point；
S806, source node selects available path (concrete according to the measurement result of the transmission path from destination node to source node
System of selection is referring to above-described embodiment), if an available path can be selected, the available path selected using this is to Su Jie
Point transmitting path selects to confirm message；
S808, carries out bidirectional data transfers on the available path between source node and destination node.
In the message flow shown in Fig. 7 and Fig. 8, the effect of source node, destination node and via node is as follows：
Via node (Relay)：
The message sent between source node (S) and destination node (D) and data are between source node and destination node
Relay is forwarded.If the nth bar path from S to D is by way of relaying Rn,i, in Rn,iPlace, carries out channel estimation and obtains Hn,i, and then
Using Hn,iCalculate channel capacity C of this jumpn,iWith bit error rate Psn,i。
Additionally, via node is also by current jumping figure i and ImaxIt is compared, if current jumping figure i is more than ImaxThen abandoning should
Message or packet, otherwise, continue to judge single-hop bit error rate Ps when previous diven,iWhether single-hop highest bit error rate P is less thanssmax
And when whether the single-hop channel capacity of previous dive is more than lowest channel capacity, if it is, carrying out decoding backward next node turn
Send out, otherwise, abandon the message or packet.
Source node (S)：
Source node S is business promoter, and in this example, source node can be eNodeB, or user equipment.Source
Node can have three functions：Send service request, paging, select transmission path.
Request that S sends or paging reach D by way of all Relay paths from S to D.
Generally, selected according to following standard in the data transfer path that S only need to be returned from D.If from S to D
There are N paths, D returns the data of M paths, channel capacity of the m paths on I relay node, the path to S
It is respectively with the bit error rate：
When bit error rate Ps of the pathsmMore than path highest bit error rate PmsmaxWhen, delete the routing information, i.e. the road
Footpath is unavailable.
Traversal M paths, the single-hop bit error rate and the path bit error rate are respectively less than the highest error code for arranging in every paths
Rate, and in the case that single-hop channel capacity is all higher than lowest channel capacity, source node is using channel capacity as the first sequence bar
Part, using the bit error rate as the second sort criteria, i.e. select the maximum paths of channel capacity first as available path, if
Channel capacity is identical, then select the minimum paths of the bit error rate as available path.Due to multi-hop relay channel capacity with
Jumping figure is related, and jumping figure problem is already had accounted for here, thus also just need not account for separately as condition again.Work as available path
After selecting, path validation information is sent by the path, can be carried out data transmission using the available path afterwards.
If the bit error rate of all return paths from destination node to source node is all higher than highest bit error rate P for arrangingmsmax, then
Alternative path is found in the information returned from destination node, path reselection request is sent by alternative path, if the request is rung
Should, then new routing information is received, the above-mentioned calculating of repetition is compared, if having meeting desired path, selects it to be available path,
And confirmation message is returned, and start data transfer.If the request is responded, but does not finally still meet the available road of requirement
Footpath, then broadcast route search information, request is sought in the path for restarting a new round.
Destination node (D)：
Destination node D is Data receiver, if source node is UE, destination node is eNB, whereas if source node is
ENB, then destination node is UE.
Can be seen that at destination node from the flow process of Fig. 7, the path to receiving is detected, extract the letter of each paths
Breath.If D detects the N paths from S, nth bar path through I relay node, then the channel capacity and mistake on the path
Code check can respectively pass through formula (1) and formula (2) is obtained.
When bit error rate Ps of the pathsnMore than path highest bit error rate PmsmaxWhen, delete the routing information.
Traversal N paths, the single-hop bit error rate and the path bit error rate are respectively less than and set in every paths with source node in the same manner
The highest bit error rate put, and in the case that single-hop channel capacity is all higher than lowest channel capacity, destination node is with channel capacity work
For the first sort criteria, the bit error rate is used as the second sort criteria.The maximum M paths of channel capacity are selected as transmission path
(can be understood as optimal path in first time, subsequently can be understood as sub-optimal path), if channel capacity is identical, selects to miss
The less M paths of code check are used as transmission path.Channel residue met simultaneously in L (L≤(the N-M)) paths of condition holds
The information of the maximum M paths of amount returns to source node as the information of backup path set.
If the Path selection for receiving source node confirms message, receiving data is responded and prepared；If receiving source node
Path reselection message, then backup path set is updated to into transmission path set, while from remaining L- (ri+ 1) × M bars road
(r in footpathiThe path reselection message number of times that expression is received) the maximum path of M bars channel capacity is selected as new backup path
Set, until receiving Path selection confirms message.If not receiving Path selection always to confirm message or receive broadcast letter
Breath, then abandon the existing path list for meeting condition, selects new path from RX path again.
Below above-described embodiment is further illustrated with an instantiation.
Fig. 9 is a multi hop relay path schematic diagram of the present invention.
As shown in figure 9, by taking eNB initiating business requests as an example, it is assumed that single-hop highest bit error rate Pssmax=0.06, path highest
Bit error rate Pmsmax=0.1, lowest channel capacity Cmin=1, maximum hop count Imax+ 1=6, M=2.Meter is successively designated on arrow
The channel capacity of the single-hop for calculating and the bit error rate (implication in follow-up Like is also identical) of single-hop, circular will
Subsequently providing detailed description.
User equipment detects the following downlink path information from eNB directions：
| Set of paths | Channel capacity | The bit error rate | Jumping figure |
| R3,R4 | 2/3 | 0.068 | 3 |
| R1,R2 | 1/3 | 0.059 | 3 |
| R1,R4 | 1/3 | 0.088 | 3 |
Table 1
User equipment selects two paths (R3, R4) and (R1, R2) according to ordering rule, and what is included in return data is alternative
Path is (R1, R4).
ENB detects the following up path information from user equipment direction：
Table 2
Meanwhile, eNB also receives the alternative path information from user equipment：
| Set of paths | Channel capacity | The bit error rate | Jumping figure |
| R1,R4 | 1/3 | 0.088 | 3 |
Table 3
According to the selection principle of above-described embodiment, from table 2 it can be seen that (R4, R3) can be elected to be available path by eNB.
Above-described embodiment selects its optimal path for each user, but there is also some problems.Road in above-described embodiment
Footpath selects to be event driven, i.e. when user has service request or during by base station calling, Path selection event just occurs.Due to
There is life cycle in path, and beyond life cycle, user initiating business request or paged will carry out the choosing of path each time
Select, and the sudden and mobility of customer service so that the frequency of user's Path selection is higher.If a certain regional user compared with
Many, more user has selected the path of at least one intersection point, then on the nodes duplicate paths amount of calculation is very big, and
Actually more than 70% business occurs indoors or user moving range very little, and frequently user's Path selection will save will relaying
The amount of calculation of point is increased, while also increasing user plane overall delay.If the link-quality reliability of final jump, user only needs
Routinely to carry out accessing measurement, without carrying out Path selection every time.
User in following embodiments without participating in the selection in path, in the access of the selection in path by direct service user
Select after node.If user moving speed is slower, its path topology change is relatively slow, and user may still in via node
In service area, via node can carry out Path selection according to last time transmission path, it is not necessary to which setting up connection every time is all carried out
Path selection.
In such a case, it is possible to destination node is set to into base station or via node is accessed, correspondingly source node is arranged
To access via node or base station, user equipment and access via node direct interaction, now, destination node and source node are being carried out
Between Path selection before, user equipment select access via node, it is specific as follows：
User equipment receives the downstream message (for example, pilot frequency information) that each via node of directly interaction sends, root
The descending single-hop channel capacity and the descending single-hop bit error rate for coming from each via node to user equipment is estimated according to downlink information；
By the descending single-hop bit error rate and descending single-hop channel capacity of each via node to user equipment respectively with single-hop most
High bit-error and the lowest channel capacity for arranging are compared, and to the bit error rate and channel capacity requirement is met, (that is, descending single-hop is missed
Code check is more than lowest channel capacity less than the single-hop highest bit error rate and descending single-hop channel capacity) path corresponding to each relaying
Node sends upstream message；
Receiving the via node of upstream message, to estimate user equipment according to upstream message up to the via node
Single-hop channel capacity and the up single-hop bit error rate, and the up single-hop bit error rate for estimating and up single-hop channel capacity are distinguished
It is compared with the single-hop highest bit error rate and lowest channel capacity, meets the bit error rate and channel capacity requirement (that is, up single-hop mistake
Code check is more than lowest channel capacity less than the single-hop highest bit error rate and up single-hop channel capacity) each via node set to user
Preparation send the up single-hop channel capacity and the up single-hop bit error rate of respective path；
User equipment is by corresponding to the maximum path of up single-hop channel capacity and descending single-hop channel capacity sum
After node as via node is accessed, if single-hop channel capacity is with (that is, up single-hop channel capacity is held with descending single-hop channel
Amount sum) it is identical, then by the via node corresponding to the minimum path of the up single-hop bit error rate and descending single-hop bit error rate sum
As access via node.
Figure 10 is another multi hop relay path schematic diagram of the invention.
As shown in Figure 10, UE is directly accessed a neighbouring via node (Rac), and the via node referred to as accesses relaying section
Point, therefore two class via nodes can be included in Figure 10：Common via node and access via node.The access of some user
Via node is probably the common via node of another user.Routing resource between eNB and Rac can adopt above-mentioned
The mode of embodiment is selected.
Figure 11 is the message flow schematic diagram that multi hop relay path of the present invention is selected.
As shown in figure 11, following process is specifically included：
S1102, user equipment receives the information from the directly common via node of interaction, using the letter for receiving
Descending single-hop channel capacity and the descending single-hop bit error rate of the breath measurement from each via node to user terminal；
S1104, user equipment is by the descending single-hop bit error rate for measuring and descending single-hop channel capacity and single-hop highest error code
Rate and lowest channel capacity are compared (due to being only a jump), as long as being less than path most less than the single-hop path highest bit error rate
High bit-error, to meeting the bit error rate and channel capacity requirement (that is, less than the single-hop highest bit error rate and more than lowest channel capacity)
Path in each via node transmitting path select request；
S1106, corresponding each via node is received after the request, estimates user terminal upper to each via node
Row single-hop channel capacity and the up single-hop bit error rate, and by up single-hop channel capacity and the up single-hop bit error rate respectively with it is minimum
Channel capacity and the single-hop highest bit error rate are compared, and each via node for meeting the bit error rate and channel capacity requirement sets to user
Standby feedback meets the up single-hop channel capacity and the up single-hop bit error rate for requiring path；
S1108, it is right with descending single-hop channel capacity sum maximum path institute that user equipment chooses up single-hop channel capacity
The via node answered is sent to access request to access via node, chooses in the case of single-hop channel capacity identical
The row single-hop bit error rate and the corresponding via node of descending single-hop bit error rate sum minimal path are access via node；
S1110, accesses via node and sends response to user equipment, and returns available resource information；
S1112, the transmission data between user equipment and access via node.
In the model shown in Figure 10, the effect of source node, destination node and common via node and access via node is such as
Under：
eNB：
During as source node and destination node, its effect is identical with the effect of destination node with Fig. 7 with source node in Fig. 8.
Common via node：
Its effect is identical with the effect of the via node in Fig. 7 and Fig. 8.
Access via node：
Access via node replace user terminal selecting path, extract routing information, calculate each path the bit error rate and
Channel capacity, under the conditions of certain error rate constraint, is ranked up to it, and sort order is followed successively by channel capacity and the bit error rate.
If common I+1 is jumped from eNB to UE, i-th via node is exactly the access via node of UE, then accessing relaying section
N paths, path of the nth bar path between I-1 via node, eNB and i-th via node can be detected at point
On channel capacity and the bit error rate be respectively：
When bit error rate Ps of the pathsnMore than path highest bit error rate Pmsmax, delete the routing information.
The function phase of source node and destination node in remaining flow process and Fig. 7 and Fig. 8 is same.
User equipment：
It is not involved in the selection in whole piece path, only carries out accessing the selection of via node.Road is initiated in user terminal or eNB
Before the selection course of footpath, one more user's access procedure.
Figure 12 is the another multi hop relay path schematic diagram of the present invention.
Assumed condition is identical with the example in Fig. 9.
First, user equipment selects to access via node, and user equipment detects the message from R5 and R6, calculates descending
Single-hop channel capacity and the descending single-hop bit error rate：
| Via node | Channel capacity | The bit error rate |
| R5 | 2 | 0.02 |
| R6 | 2 | 0.03 |
Table 4
Up single-hop channel capacity and the up single-hop bit error rate that R5, R6 go out to user equipment return measurement：
| Via node | Channel capacity | The bit error rate |
| R5 | 2 | 0.03 |
| R6 | 1 | 0.03 |
Table 5
According to the criterion that channel capacity sum is maximum, the larger R5 of channel capacity is selected to make with reference to table 5 and the user equipment of table 6
To access via node.
Secondly, eNB calculates following paths from R5 to eNB：
| Set of paths | Channel capacity | The bit error rate | Jumping figure |
| R2,R1 | 2/3 | 0.097 | 3 |
| R4,R3 | 1/3 | 0.088 | 3 |
| R4,R1 | 1/3 | 0.097 | 3 |
Table 6
ENB selects two paths (R2, R1) and (R4, R3), the alternative path included in return data according to ordering rule
It is (R4, R1).
Next, calculating following paths from eNB to R5 at R5：
| Set of paths | Channel capacity | The bit error rate | Jumping figure |
| R2,R1 | 1/3 | 0.059 | 3 |
| R4,R3 | 1/3 | 0.068 | 3 |
Table 7
Simultaneously R5 also receives the backup path information from eNB：
| Set of paths | Channel capacity | The bit error rate | Jumping figure |
| R4,R1 | 1/3 | 0.097 | 3 |
Table 8
R5 accesses via node and selects (R2, R1) as available path according to ordering rule.
Next, with explanation as a example by multiple-input and multiple-output (Multi Input Multi Output, MIMO) system model
Channel capacity Cn,iWith bit error rate Psn,iComputational methods.
Mimo system model is introduced first.
Figure 13 is downlink resource grid schematic diagram in mimo system.
As shown in figure 13, X direction is time domain, and y direction is frequency domain, and each blockage represents a resource grains
Son, this is the least unit in LTE and LTE-A.L is numbering of the resource particle in time domain, and a resource particle is corresponding one
OFDM symbol, L represents the sum of OFDM symbol in a time slot；K is numbering of the resource particle on frequency domain, under correspondence LTE-A
Subcarrier in row resource grid, K represents the total number of sub-carriers for data transfer.The part of bold box mark represents a money
Source block, its one time slot of correspondence in time domain, the correspondence 180kHz on frequency domain.MT、MRWith NRIThe radio frequency link of UE is represented respectively
Transmission antenna number, reception antenna number and the transmission number of plies (that is, rank number), and MT、MRWith NRIAll it is positive integer, NRI≤min(MT,
MR).Downstream transmission signals of k-th subcarrier in downlink resource grid within l-th OFDM symbol cycle can be expressed as：
Wherein,
It is pre-coding matrix,
It is channel matrix,
Pre-coding matrix W in formula (7)(k,l)For the data flow on each layer to be mapped to into each antenna.OrderFor equivalent channel matrix, then formula (7) can be expressed as：
Wherein, x(k,l)Represent the data flow on each layer, ExRepresent the average energy of each symbol, x(k,l)Energy be
MT, namely(ε () is represented and is taken expectation).r(k,l)Represent receiving data vector.n(k,l)Represent complex value additivity
White Gaussian noise vector, obeys distribution
Assume to adopt line-of-sight transmission between base station and via node, between base station and user equipment, via node and relaying
Non line of sight transmission is between node, between via node and user equipment.
Figure 14 is N paths relaying schematic diagram.
As shown in figure 14, it is the materialization of Figure 13 institutes representation model, it is assumed that have X via node, common N between eNB and UE
Paths.h1Represent the first paths, h1Through node R1、R2、R3, by h1It is designated as (R1,R2,R3), N paths hNAlso can remember
For hN=(RX-2,RX,RX-1).Different paths can be through same node, such as another paths (R in the figure1,R4,R3) with
h1There are two nodes to overlap.
When transmitting terminal is using diversity is sent, channel capacity is：
Wherein, γ=Ex/N0It is the average signal-to-noise ratio at reception antenna.
When receiving terminal is detected using maximum-ratio combing, it is to the judgement output signal-to-noise ratio of resource particle (k, l)：
When transmitting terminal adopts spatial reuse, channel capacity is：
When receiving terminal adopts squeeze theorem, n-th layer is to the judgement output signal-to-noise ratio of resource particle (k, l)：
Calculate the bit error rate of all resource particles in a time slot：
In above formula,Represent under certain transmission mode, the common n of time slotRIThe bit error rate of layer data,Represent under certain modulation system, when output signal-to-noise ratio isWhen error sign ratio,Table
Show that output signal-to-noise ratio isProbability density, X represents detection mode, and ZF represents squeeze theorem, and div is maximum-ratio combing inspection
Survey.
For the condition error sign ratio under rectangle M-QAM, fading channel is：
Wherein,M is number of constellation points.
Probability density functionIt is calculated as follows：
Wherein, Γ () is Gamma functions, DXIt is the order of diversity of receiver：
As a example by relatively above-mentioned different embodiments performance, the scheme involved by Fig. 3-Figure 10 is referred to as into option A, by Figure 10-
Scheme involved by Figure 12 is referred to as option b, the following is the comparison to the two schemes：
Table 9
It will appreciated by the skilled person that realize the whole and part steps of said method embodiment can pass through
Completing, aforesaid program can be stored in a computing device read/write memory medium the related hardware of programmed instruction, the journey
Sequence upon execution, performs the step of including said method embodiment, and aforesaid storage medium can include ROM, RAM, magnetic disc
It is various with CD etc. can be with the medium of store program codes.
Figure 15 is the structural representation of one embodiment that multi hop relay path of the present invention selects system.
As shown in figure 15, the system 1500 of the embodiment can include source node 1510, destination node 1520 and it is multiple in
After node 1530, wherein,
Destination node 1520, for RX path search message, according to route searching message detection from source node, via node
The each paths passed through to destination node and channel capacity and the bit error rate per paths, according to the every paths for detecting
Channel capacity and the bit error rate and the set highest bit error rate and return path number M determine biography from each paths for detecting
Defeated set of paths and optional path set, the path quilt detected by destination node in addition to transmission path set and optional path set
It is defined as residual paths set, wherein M>0, the set highest bit error rate includes the single-hop highest bit error rate and path highest error code
Rate, using transmission path set in every paths to source node transmit optional path set information, wherein, alternative path collection
The information of conjunction includes the channel capacity and the bit error rate of every alternative path that every alternative path sequence node, destination node are calculated,
After path reselection message is received, optional path set is updated to into transmission path set, from residual paths set M is extracted
The maximum path of bar channel capacity constitutes optional path set, and using transmission path set in every paths to source node biography
The information of defeated user data and optional path set, residual paths set is returned when residual paths collection is combined into empty set to source node
For the message of empty set；
Source node 1510, for the channel capacity and the bit error rate of the every paths in the transmission path set for detecting
And the highest bit error rate judges whether available path, in the case where there is available path, using available path to Su Jie
Point transmitting path selects to confirm message and the transmission data between source node and destination node, there is no available path and do not receiving
In the case of being combined into the message of empty set to residual paths collection, using every alternative path in the optional path set for receiving to
, there is no available path and receiving the situation that residual paths collection is combined into the message of empty set in destination node transmitting path reselection message
Lower broadcast route search message；
Each via node 1530, is arranged between source node and destination node, for forwarding source node and destination node it
Between transmit data and message；
Illustrate, destination node can be base station or user equipment, and correspondingly source node can be user equipment or base station.
In another embodiment that multi hop relay path of the present invention selects system, compared with the embodiment in Figure 15, the reality
Applying the destination node in the system of example can include：
Path detection unit, for RX path search message, according to route searching message detection from source node, relaying section
Each paths that point is passed through to destination node and channel capacity and the bit error rate per paths；
Set of paths determining unit, is connected with path detection unit, for being held according to the channel of the every paths for detecting
Amount determines transmission path with the bit error rate and the set highest bit error rate and return path number M from each paths for detecting
Set and optional path set, are confirmed as in addition to transmission path set and optional path set by the path that destination node is detected
Residual paths set；
Routing information transmitting element, is connected with set of paths determining unit, in using transmission path set per bar
The information of optional path set is transmitted to source node in path；
Set of paths updating block, for after path reselection message is received, optional path set being updated to into transmission
Set of paths, the maximum path of M bars channel capacity is extracted from residual paths set and constitutes optional path set；
Empty set message sending unit, is connected with set of paths updating block, for when residual paths collection is combined into empty set to
Source node returns the message that residual paths collection is combined into empty set.
In the another embodiment that multi hop relay path of the present invention selects system, compared with the embodiment in Figure 15, the reality
Applying the source node in the system of example can include：
Available path judging unit, for according to the channel capacity of every the paths in the transmission path set that detects with
The bit error rate and the highest bit error rate judge whether available path；
Path confirms transmitting element, is connected with available path judging unit, sharp in the case where there is available path
Selected to confirm message and the transmission data between source node and destination node to destination node transmitting path with available path；
Path gravity treatment transmitting element, is connected with available path judging unit, for there is no available path and not receiving
In the case of being combined into the message of empty set to residual paths collection, using every alternative path in the optional path set for receiving to
Destination node transmitting path reselection message；
Broadcast transmitting element, is connected with available path judging unit, for there is no available path and receiving
Residual paths collection is combined into broadcast route search message in the case of the message of empty set.
In an example, in order to calculate the channel capacity and the bit error rate of every paths, each via node be additionally operable to by
Single-hop channel capacity and the single-hop bit error rate and the lowest channel capacity and the single-hop highest bit error rate for arranging that present node is estimated
It is compared；If the single-hop bit error rate that the single-hop channel capacity for estimating is more than lowest channel capacity and estimates is less than single
The highest bit error rate is jumped, then judges whether present node is the first hop node, otherwise, be discarded into the message or number up to present node
According to；If it is, the single-hop channel capacity that the hop node is estimated and the single-hop bit error rate are sent to next-hop node；If no
It is that the single-hop channel capacity that the single-hop channel capacity that then each hop node estimates this hop node sends with upper hop node is entered
Row compares, and the single-hop error code that less single-hop channel capacity, the single-hop bit error rate of this hop node and upper hop node are sent
Rate is sent to next-hop node.
Further, in last node of present node for whole piece path, source node or destination node be additionally operable to by
The single-hop channel capacity that the single-hop channel capacity for estimating sends with upper hop node is compared, according to less single-hop channel
Calculation of capacity outbound path channel capacity, and according to the single-hop error rate calculation outbound path bit error rate.
In an example, set of paths determining unit can include：
First path bit error rate comparing subunit, for the bit error rate of the every paths for detecting and institute's path highest to be missed
Code check is compared；
Transmission path determination subelement, is connected, for from the satisfaction for detecting with first path bit error rate comparing subunit
The maximum path of M bars channel capacity is chosen in the path of path highest bit error rate requirement and constitutes transmission path set, if channel
Capacity is identical, then the relatively low path of the path selection bit error rate constitutes transmission path set；
Alternative path determination subelement, is connected, for from the satisfaction for detecting with first path bit error rate comparing subunit
The path that the channel capacity maximum that M bars are not used for transmission data is chosen in the path of path highest bit error rate requirement constitutes alternative road
Footpath is gathered, if channel capacity is identical, the relatively low path of the path selection bit error rate constitutes optional path set.
In another example, available path judging unit can include：
Second path bit error rate comparing subunit, for by the bit error rate of the every paths for detecting and path highest error code
Rate is compared；
Available path determination subelement, is connected with the second path bit error rate comparing subunit, if for less than path most
High bit-error, then choose the maximum path of channel capacity as available path, if channel capacity is identical, path selection error code
The minimum path of rate is used as available path.
In a further example, each via node is additionally operable to after route searching message is received, and judges that current jumping figure is
It is no if greater than set maximum hop count, then to abandon route searching message more than set maximum hop count, otherwise enter walking along the street
The selection in footpath.
In another example, destination node can be base station or access via node, during correspondingly source node can be to access
After node or base station.
Figure 16 multi hop relay paths of the present invention select the structural representation of the another embodiment of system.
As shown in figure 16, compared with the embodiment in Figure 15, the system 1600 of the embodiment can also include：
User equipment 1610, (relay access nodes can be source node or destination node, in Figure 16 with via node is accessed
In by taking destination node as an example) direct interaction, for select access via node.Specifically, user equipment can include：
Performance estimation unit, for receiving the downstream message sent with each via node of user equipment direct interaction, root
The descending single-hop channel capacity and the descending single-hop bit error rate for coming from each via node to user equipment is estimated according to downstream message；
Bit error rate comparing unit, is connected with performance estimation unit, for by the descending list of each via node to user equipment
Jump the bit error rate and descending single-hop channel capacity is compared respectively with the single-hop highest bit error rate and the lowest channel capacity for arranging, to
Meet each via node corresponding to the path of the bit error rate and channel capacity requirement and send upstream message；
Upper line parameter receiving unit, sets for receiving each via node for meeting the bit error rate and channel capacity requirement to user
Preparation send the up single-hop channel capacity and the up single-hop bit error rate of respective path；
Access via node determining unit, be connected with upper line parameter receiving unit, for by up single-hop channel capacity and
Via node corresponding to the maximum path of descending single-hop channel capacity sum is used as access via node, if single-hop channel holds
Amount and it is identical, then using the up single-hop bit error rate and the descending single-hop bit error rate sum minimum path corresponding to via node as
Access via node.
Each embodiment is described by the way of progressive in this specification, and what each embodiment was stressed is and it
The difference of his embodiment, identical and similar part can be with cross-reference between each embodiment.For system embodiment
For, due to itself and embodiment of the method basic simlarity, so description is fairly simple, related part may refer to embodiment of the method
Partial explanation.
Although being described in detail to some specific embodiments of the present invention by example, the skill of this area
Art personnel it should be understood that above example is merely to illustrate, rather than in order to limit the scope of the present invention.The skill of this area
Art personnel to above example it should be understood that can modify without departing from the scope and spirit of the present invention.This
Bright scope is defined by the following claims.
Claims (21)
1. a kind of multi-hop relay path selection method, it is characterised in that include：
Destination node RX path search message, according to the route searching message detection from source node, via node to the place
Each paths that node is passed through and channel capacity and the bit error rate per paths；
According to the channel capacity and the bit error rate and the set highest bit error rate and return path number M of the every paths for detecting
Transmission path set and optional path set are determined from each paths for detecting, except the transmission path set and described standby
Select and residual paths set, wherein M are confirmed as by the path that the destination node is detected outside set of paths>0, set highest
The bit error rate includes the single-hop highest bit error rate and the path highest bit error rate；
The information of the optional path set is transmitted to the source node using the every paths in the transmission path set, its
In, the information of the optional path set includes the alternative road per bar that every alternative path sequence node, the destination node are calculated
The channel capacity and the bit error rate in footpath；
The channel capacity and the bit error rate of every paths of the source node in the transmission path set for detecting and
The highest bit error rate judges whether available path；
In the case where there is the available path, confirmation is selected to disappear to the destination node transmitting path using the available path
Cease and the transmission data between the source node and the destination node；
In the case where there is no the available path and not receiving the message that residual paths collection is combined into empty set, using receiving
The optional path set in every alternative path to the destination node transmitting path reselection message, the destination node is connecing
After receiving the path reselection message, the optional path set is updated to into transmission path set, from the residual paths collection
The maximum path of M bars channel capacities is extracted in conjunction and constitutes optional path set, and using the transmission path set in per bar
The information of user data and the optional path set is transmitted in path to the source node, and the source node continues can described in detection
With path, until the source node detects the available path or the residual paths collection is combined into empty set, the destination node exists
The message that the residual paths collection is combined into empty set is returned when the residual paths collection is combined into empty set to the source node；
There is no the available path and receiving in the case that the residual paths collection is combined into the message of empty set, the source section
The point broadcast route searching message.
2. multi-hop relay path selection method according to claim 1, it is characterised in that obtain described by following step
Channel capacity and the bit error rate per paths：
The single-hop channel capacity that present node is estimated and the single-hop bit error rate and the lowest channel capacity and the single-hop for arranging
The highest bit error rate is compared；
If the single-hop bit error rate that the single-hop channel capacity for estimating is more than the lowest channel capacity and estimates is less than institute
State the single-hop highest bit error rate, then judge whether present node is the first hop node, otherwise, be discarded into up to present node message or
Data；
If it is, the single-hop channel capacity that the hop node is estimated and the single-hop bit error rate are sent to next-hop node；
If it is not, then the single-hop that the single-hop channel capacity that each hop node estimates this hop node sends with upper hop node
Channel capacity is compared, and less single-hop channel capacity, the single-hop bit error rate of this hop node and upper hop node are sent
The single-hop bit error rate send to next-hop node；
If present node is last node in whole piece path, by the single-hop channel capacity for estimating and upper hop node
The single-hop channel capacity of transmission is compared, and according to less single-hop channel capacity path channel capacity is calculated, and according to every
The one single-hop error rate calculation outbound path bit error rate jumped.
3. multi-hop relay path selection method according to claim 2, it is characterised in that the basis detect per bar
The channel capacity and the bit error rate in path and the set highest bit error rate and return path number M are from each paths for detecting
The step of determining transmission path set and optional path set includes：
The bit error rate of the every paths for detecting is compared with the path highest bit error rate；
Choose the maximum path of M bars channel capacity from the path for meeting the path highest bit error rate requirement for detecting to constitute
The transmission path set, if channel capacity is identical, the relatively low path of the path selection bit error rate constitutes the transmission path
Set；
The channel appearance that M bars are not used for transmission data is chosen from the path for meeting the path highest bit error rate requirement for detecting
The maximum path of amount constitutes the optional path set, if channel capacity is identical, the relatively low path of the path selection bit error rate
Constitute the optional path set.
4. multi-hop relay path selection method according to claim 2, it is characterised in that the source node is according to detecting
The transmission path set in every paths channel capacity and the bit error rate and the highest bit error rate judge whether to deposit
Include the step of available path：
The source node is compared the bit error rate of the every paths for detecting with the path highest bit error rate；
If being less than the path highest bit error rate, the maximum path of channel capacity is chosen as the available path, if
Channel capacity is identical, then the minimum path of the path selection bit error rate is used as the available path.
5. multi-hop relay path selection method according to claim 1, it is characterised in that methods described also includes：
Whether the via node judges current jumping figure more than set maximum jump after the route searching message is received
Number；
If greater than set maximum hop count, then the route searching message is abandoned, otherwise carry out the selection in path.
6. multi-hop relay path selection method according to claim 1, it is characterised in that the via node is using decoding
Pass-through mode down hop node for data forwarding.
7. multi-hop relay path selection method according to claim 1, it is characterised in that the destination node is base station or use
Family equipment, correspondingly the source node is the user equipment or the base station.
8. multi-hop relay path selection method according to claim 1, it is characterised in that the destination node is base station or connects
Enter via node, correspondingly the source node is the access via node or base station, in user equipment and the access
After node direct interaction, methods described also includes：
Before selecting the path between the destination node and the source node, the user equipment selects to access relaying
Node.
9. multi-hop relay path selection method according to claim 8, it is characterised in that the user equipment selects to access
The step of via node, includes：
The user equipment receives the downstream message that each via node of directly interaction sends, and is estimated according to the downstream message
Meter comes from the descending single-hop channel capacity and the descending single-hop bit error rate of each via node to the user equipment；
By the descending single-hop bit error rate and descending single-hop channel capacity of each via node to the user equipment respectively with the list
The lowest channel capacity jumped the highest bit error rate and arrange is compared, right to the path institute for meeting the bit error rate and channel capacity requirement
The each via node answered sends upstream message；
The via node for receiving the upstream message estimates the user equipment to the relaying section according to the upstream message
The up single-hop channel capacity and the up single-hop bit error rate of point, and by the up single-hop bit error rate for estimating and up single-hop channel
Capacity is compared respectively with the single-hop highest bit error rate and lowest channel capacity, meets the bit error rate and channel capacity requirement
Each via node sends the up single-hop channel capacity and the up single-hop bit error rate of respective path to the user equipment；
The user equipment is by corresponding to the maximum path of up single-hop channel capacity and descending single-hop channel capacity sum
After node as the access via node, if single-hop channel capacity with it is identical, by the up single-hop bit error rate and descending list
The via node corresponding to the minimum path of bit error rate sum is jumped as the access via node.
10. a kind of multi hop relay path selects system, it is characterised in that including source node, destination node and multiple via nodes,
Wherein,
The destination node, for RX path search message, according to the route searching message detection from source node, via node
The each paths passed through to the destination node and channel capacity and the bit error rate per paths, according to the every road for detecting
The channel capacity and the bit error rate in footpath and the set highest bit error rate and return path number M are true from each paths for detecting
Transmission path set and optional path set are determined, by the Su Jie in addition to the transmission path set and the optional path set
The path that point is detected is confirmed as residual paths set, wherein M>0, the set highest bit error rate includes single-hop highest error code
Rate and the path highest bit error rate, the alternative road is transmitted using the every paths in the transmission path set to the source node
The information of footpath set, wherein, the information of the optional path set includes every alternative path sequence node, the destination node meter
The channel capacity and the bit error rate of the every alternative path calculated, after the path reselection message is received, by the alternative path
Set is updated to transmission path set, the maximum path of M bars channel capacity is extracted from the residual paths set and is constituted alternatively
Set of paths, and transmit user data and described alternative to the source node using the every paths in the transmission path set
The information of set of paths, returns the residual paths collection and is combined into sky when the residual paths collection is combined into empty set to the source node
The message of collection；
The source node, for the channel capacity and the bit error rate of the every paths in the transmission path set for detecting
And the highest bit error rate judges whether available path, in the case where there is the available path, using it is described can
Selected to confirm message and the transmission data between the source node and the destination node to the destination node transmitting path with path,
In the case where there is no the available path and not receiving the message that residual paths collection is combined into empty set, using the institute for receiving
Every alternative path in optional path set is stated to the destination node transmitting path reselection message, there is no the available road
Footpath and receive in the case that the residual paths collection is combined into the message of empty set and broadcast the route searching message；
Each via node, is arranged between the source node and the destination node, for forwarding the source node with it is described
The data transmitted between destination node and message.
11. multi hop relay paths according to claim 10 select system, it is characterised in that the destination node includes：
Path detection unit, for RX path search message, according to the route searching message detection from source node, relaying section
Each paths that point is passed through to the destination node and channel capacity and the bit error rate per paths；
Set of paths determining unit, is connected with the path detection unit, for being held according to the channel of the every paths for detecting
Amount determines transmission path with the bit error rate and the set highest bit error rate and return path number M from each paths for detecting
Set and optional path set, are detected in addition to the transmission path set and the optional path set by the destination node
Path is confirmed as residual paths set；
Routing information transmitting element, is connected with the set of paths determining unit, for using in the transmission path set
The information of the optional path set is transmitted to the source node per paths；
Set of paths updating block, for after the path reselection message is received, the optional path set being updated to
Transmission path set, the maximum path of M bars channel capacity is extracted from the residual paths set and constitutes optional path set；
Empty set message sending unit, is connected with the set of paths updating block, for being combined into empty set in the residual paths collection
When return the message that the residual paths collection is combined into empty set to the source node.
12. multi hop relay paths according to claim 11 select system, it is characterised in that the source node includes：
Available path judging unit, for according to the channel capacity of every the paths in the transmission path set that detects with
The bit error rate and the highest bit error rate judge whether available path；
Path confirms transmitting element, is connected with the available path judging unit, in the situation that there is the available path
Under, select to confirm message and in the source node and the destination node to the destination node transmitting path using the available path
Between transmission data；
Path gravity treatment transmitting element, is connected with the available path judging unit, for do not exist the available path and
In the case of not receiving the message that residual paths collection is combined into empty set, using the optional path set for receiving in it is standby per bar
The routing radial direction destination node transmitting path reselection message；
Broadcast transmitting element, is connected with the available path judging unit, for do not exist the available path and
Receive in the case that the residual paths collection is combined into the message of empty set and broadcast the route searching message.
13. multi hop relay paths according to claim 12 select system, it is characterised in that each via node is additionally operable to
The single-hop channel capacity that present node is estimated and the single-hop bit error rate and the lowest channel capacity and the single-hop highest for arranging
The bit error rate is compared；If the single-hop that the single-hop channel capacity for estimating is more than the lowest channel capacity and estimates is missed
Code check is less than the single-hop highest bit error rate, then judge whether present node is the first hop node, otherwise, is discarded into reach and works as prosthomere
The message or data of point；If it is, the single-hop channel capacity that the hop node is estimated and the single-hop bit error rate are sent to next
Hop node；If it is not, then what each hop node single-hop channel capacity for estimating this hop node and upper hop node sent
Single-hop channel capacity is compared, and by less single-hop channel capacity, the single-hop bit error rate of this hop node and upper hop node
The single-hop bit error rate of transmission is sent to next-hop node.
14. multi hop relay paths according to claim 13 select systems, it is characterised in that in present node be whole piece road
During last node in footpath, the source node or the destination node are additionally operable to single-hop channel capacity and the upper hop that will be estimated
The single-hop channel capacity that node sends is compared, and according to less single-hop channel capacity path channel capacity, and root are calculated
According to the single-hop error rate calculation outbound path bit error rate of each jump.
15. multi hop relay paths according to claim 14 select system, it is characterised in that the set of paths determines single
Unit includes：
First path bit error rate comparing subunit, for by the bit error rate of the every paths for detecting and the path highest error code
Rate is compared；
Transmission path determination subelement, is connected, for from the satisfaction for detecting with the first path bit error rate comparing subunit
The maximum path of M bars channel capacity is chosen in the path of the path highest bit error rate requirement and constitutes the transmission path set,
If channel capacity is identical, the relatively low path of the path selection bit error rate constitutes transmission path set；
Alternative path determination subelement, is connected, for from the satisfaction for detecting with the first path bit error rate comparing subunit
The path that the channel capacity maximum that M bars are not used for transmission data is chosen in the path of the path highest bit error rate requirement constitutes institute
Optional path set is stated, if channel capacity is identical, the relatively low path of the path selection bit error rate constitutes the alternative path collection
Close.
16. multi hop relay paths according to claim 12 select system, it is characterised in that the available path judges single
Unit includes：
Second path bit error rate comparing subunit, for by the bit error rate of the every paths for detecting and the path highest error code
Rate is compared；
Available path determination subelement, is connected with the second path bit error rate comparing subunit, if for less than the road
The footpath highest bit error rate, then choose the maximum path of channel capacity as the available path, if channel capacity is identical, chooses
The bit error rate minimum path in path is used as the available path.
17. multi hop relay paths according to claim 10 select system, it is characterised in that described each via node is also
For after the route searching message is received, judging whether current jumping figure is more than set maximum hop count, if greater than
Set maximum hop count, then abandon the route searching message, otherwise carries out the selection in path.
18. multi hop relay paths according to claim 10 select system, it is characterised in that each via node is using solution
Code pass-through mode down hop node for data forwarding.
19. multi hop relay paths according to claim 10 select systems, it is characterised in that the destination node be base station or
User equipment, correspondingly the source node is the user equipment or the base station.
20. multi hop relay paths according to claim 10 select systems, it is characterised in that the destination node be base station or
Via node is accessed, correspondingly the source node is the access via node or the base station, the system also includes：
User equipment, with the access via node direct interaction, for selection via node is accessed.
21. multi hop relay paths according to claim 20 select system, it is characterised in that the user equipment includes：
Performance estimation unit, for receiving the downstream message sent with each via node of the user equipment direct interaction, root
Estimate that the descending single-hop channel capacity and descending single-hop that come from each via node to the user equipment are missed according to the downstream message
Code check；
Parameter comparing unit, is connected with the performance estimation unit, for by the descending of each via node to the user equipment
The single-hop bit error rate and descending single-hop channel capacity are carried out respectively with the single-hop highest bit error rate and the lowest channel capacity for arranging
Relatively, upstream message is sent to each via node met corresponding to the path of the bit error rate and channel capacity requirement；
Upper line parameter receiving unit, sets for receiving each via node for meeting the bit error rate and channel capacity requirement to the user
Preparation send the up single-hop channel capacity and the up single-hop bit error rate of respective path；
Access via node determining unit, be connected with the upper line parameter receiving unit, for by up single-hop channel capacity and
Via node corresponding to the maximum path of descending single-hop channel capacity sum is used as the access via node, if channel holds
Amount and it is identical, then using the up single-hop bit error rate and the descending single-hop bit error rate sum minimum path corresponding to via node as
The access via node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110313130.7A CN103052132B (en) | 2011-10-17 | 2011-10-17 | Multi-hop relay path selection method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110313130.7A CN103052132B (en) | 2011-10-17 | 2011-10-17 | Multi-hop relay path selection method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103052132A CN103052132A (en) | 2013-04-17 |
| CN103052132B true CN103052132B (en) | 2017-05-10 |
Family
ID=48064599
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110313130.7A Active CN103052132B (en) | 2011-10-17 | 2011-10-17 | Multi-hop relay path selection method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103052132B (en) |
Families Citing this family (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105830501B (en) * | 2014-05-22 | 2020-01-03 | 华为技术有限公司 | Method and device for selecting wireless transmission path |
| GB201502257D0 (en) * | 2015-02-11 | 2015-04-01 | Nat Univ Ireland | A method of transmitting data between a source node and destination node |
| CN105246120B (en) * | 2015-09-11 | 2018-10-02 | 浙江树人大学 | A kind of data transmission delay and the limited Sink node mobile route distribution selection method of hop count |
| CN105553537B (en) * | 2015-12-08 | 2018-09-07 | 深圳大学 | Best relay position searching method based on cumulative positive feedback variable step and system |
| CN108337701B (en) * | 2017-01-19 | 2021-06-04 | 工业和信息化部电信研究院 | Transmission path switching method |
| CN107018547B (en) * | 2017-03-16 | 2019-07-26 | 中南大学 | It is a kind of based on the cellular downlink throughput optimization method with outer D2D multi-hop relay |
| CN110166268B (en) | 2018-02-13 | 2021-04-06 | 电信科学技术研究院有限公司 | Communication method and device of wireless backhaul network |
| CN110351781A (en) | 2018-04-03 | 2019-10-18 | 维沃移动通信有限公司 | Requesting method, dispatching method and the equipment of relay resource |
| EP3888310A1 (en) | 2018-11-30 | 2021-10-06 | Sony Group Corporation | Spectrum access restriction and re-routing of data |
| CN111405630B (en) * | 2020-03-19 | 2021-10-01 | 深圳市吉祥腾达科技有限公司 | Mesh path selection method and system |
| CN114629835B (en) * | 2021-02-03 | 2023-11-17 | 亚信科技（南京）有限公司 | Route configuration method, device, computer readable storage medium and electronic equipment |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101527947A (en) * | 2008-03-06 | 2009-09-09 | 上海贝尔阿尔卡特股份有限公司 | Method and device for selecting communication path for mobile terminal in wireless relay network |
| CN101562863A (en) * | 2009-06-04 | 2009-10-21 | 北京邮电大学 | Method and device for relay selection |
-
2011
- 2011-10-17 CN CN201110313130.7A patent/CN103052132B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101527947A (en) * | 2008-03-06 | 2009-09-09 | 上海贝尔阿尔卡特股份有限公司 | Method and device for selecting communication path for mobile terminal in wireless relay network |
| CN101562863A (en) * | 2009-06-04 | 2009-10-21 | 北京邮电大学 | Method and device for relay selection |
Non-Patent Citations (1)
| Title |
|---|
| Chaowei Wang等.A Simplified Estimate-and-Forward Scheme for Relay Networks􀁏􀁌􀁉􀁈􀁇􀀃􀀨􀁖.《Vehicular Technology Conference（VTC Fall），2011 IEEE》.2011,全文. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103052132A (en) | 2013-04-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103052132B (en) | Multi-hop relay path selection method and system | |
| Dong et al. | Performance analysis of multihop-diversity-aided multihop links | |
| Yuan et al. | Virtual MIMO-based cross-layer design for wireless sensor networks | |
| KR100920284B1 (en) | Method for cost determination in a multihop communication network | |
| CN104662809B (en) | Method and system for adaptive channel estimation/predictive filter design | |
| KR100839966B1 (en) | Method and system for reporting state of link in a communication system | |
| CN105993186A (en) | System and method for virtual multi-point transceivers | |
| Javaid et al. | Establishing a cooperation-based and void node avoiding energy-efficient underwater WSN for a cloud | |
| CN105745854A (en) | System and method for providing interference characteristics for interference mitigation | |
| CN106900025A (en) | A kind of wireless sensor network clustering routing based on double cluster heads | |
| Javaid et al. | DRADS: depth and reliability aware delay sensitive cooperative routing for underwater wireless sensor networks | |
| Le et al. | Distributed cooperative transmission for underwater acoustic sensor networks | |
| CN105745855A (en) | System and method for providing interference characteristics for interference mitigation | |
| CN101322327A (en) | Scheduling in wireless multi-hop relay network | |
| CN102884741A (en) | Method and apparatus for communication with high interferences | |
| CN106603141B (en) | Relay and antenna joint selection method for full-duplex bidirectional relay system | |
| CN105357731A (en) | Energy-efficient wireless sensor network (WSN) routing protocol design method for use in electromagnetic interference environment | |
| KR20100028059A (en) | Multi-criteria optimization for relaying in multi-hop wireless ad hoc and sensor networks | |
| CN101835238A (en) | Method and device for selecting route in junction network | |
| Ghoreyshi et al. | An underwater routing protocol with void detection and bypassing capability | |
| CN101291169A (en) | Selection method of wireless relay station | |
| CN105432107B (en) | Method and apparatus in cordless communication network | |
| CN106507391B (en) | Interference guidance method in WLAN | |
| Zhang et al. | Space/frequency-division-based full-duplex data transmission method for multihop underwater acoustic communication networks | |
| Yang et al. | Spatial backoff contention resolution for wireless networks |
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 |