CN101808328A - A kind of half distributed via node distribution method - Google Patents
A kind of half distributed via node distribution method Download PDFInfo
- Publication number
- CN101808328A CN101808328A CN 201010131779 CN201010131779A CN101808328A CN 101808328 A CN101808328 A CN 101808328A CN 201010131779 CN201010131779 CN 201010131779 CN 201010131779 A CN201010131779 A CN 201010131779A CN 101808328 A CN101808328 A CN 101808328A
- Authority
- CN
- China
- Prior art keywords
- information source
- via node
- node
- information
- feasible
- 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.)
- Pending
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention proposes a kind of half distributed via node distribution method, has the via node assignment problem that multiple source, many relayings collaboration communication network are faced in order to solution, mainly comprise: via node r (r ∈ { 1, ... .R}, R are the total number of via node in the network) determine its feasible information source set Γ
rVia node r pair set Γ
rIn information source ordering obtain gathering Γ
r Last, and with Γ
r LastFeedback information give the master controller of network; Master controller is that information source is distributed via node according to feedback information.
Description
Technical field
The present invention relates to wireless communication field, is to solve the effective ways with multiple source, many relayings collaboration communication network trunk node assignment problem.
Background technology
As everyone knows, the power of received signal is along with the increase of transmission range is exponential damping, and under the certain situation of transmitting power, the signal to noise ratio of Cell Edge User is lower, so the information rate that can reach is less.The very high information rate of the 4th third-generation mobile communication system requirements provides reliable service to the user, and therefore further raising user's the information rate especially information rate of Cell Edge User will be the major issue that radio communication faces.The collaboration communication technology can address the above problem, and by via node forwarding information between user and base station, can enlarge the rate of information throughput of cell coverage area and raising Cell Edge User effectively.Therefore, the collaboration communication technology is the hot issue of communication circle research always, and wherein the distribution of via node is the matter of utmost importance that faces in the cooperation communication system.The distribution decision user of via node with which via node cooperates, the branch timing of the underway node that continues, and optimization aim is generally the capacity that improves network under the prerequisite that guarantees fairness.The allocation algorithm of via node mainly contains centralized algorithm and half distributed algorithm.For centralized algorithm, it has a master controller, and needs whole channel informations, but works as network node more for a long time, and the complexity of this class algorithm is too high, and is also infeasible in practical communication.Compare with centralized algorithm, half distributed algorithm also needs a master controller, but master controller only need be known partial channel knowledge, and can adopt the lower via node allocation algorithm of complexity.In recent years the research of relaying nodes-distributing method was mainly carried out under the scene of single information source, many via nodes, at the achievement in research of the multiple source that has more general meaning, many junction networks also fewer.
Summary of the invention
The present invention proposes a kind of half distributed via node distribution method, and main contents are as follows:
The via node of collaboration communication network is determined the method for its feasible information source set.Consider classical decoding-forward pass (DF, Decode-and-Forward) relaying model: comprise an information source s, via node r and destination node d.Information source s is that unit sends data with the frame, and every frame comprises two time slots.At the 1st time slot of every frame, the s photos and sending messages, r and d receive information, and via node r deciphers the information that first time slot receives.At the 2nd time slot, via node r carries out decoding information to issue destination node d behind the repeated encoding.In above-mentioned model, the expression formula of the maximum information speed of unit bandwidth is:
β wherein
SrThe channel gain of expression from the information source to the via node, β
SdBe the channel gain of information source to destination node, β
RdThe expression via node is to the channel gain of destination node, σ
2Variance for white Gaussian noise.P
s, P
rThe transmitting power of representing information source and via node respectively.The present invention does not consider the power division problem, and it is identical to establish in the network each node transmitting power, promptly satisfies P
s=P
r=P.If information source adopts direct transmission mode, promptly do not adopt the collaboration communication technology, all time slots are all distributed to information source with power, then Ci Shi maximum information speed can be represented:
It should be noted that and use via node r that the maximum information speed between information source and destination node is improved, under the certain situation of transmitting power, select for use some via node can make maximum information speed decline between information source-destination node on the contrary.Therefore, if via node r is feasible to information source s, need to satisfy
Promptly
Wherein
Be the emission signal to noise ratio.Can get via node r behind the abbreviation to the feasible condition of information source s is:
Via node is feasible to information source, promptly with respect to directly transmission information of information source to destination node, use this via node can improve maximum information speed between information source and destination node.In multiple source, many relayings collaboration communication network, each via node is determined its feasible information source set according to above-mentioned condition.If the set of information source is S in the network, then for via node r, its feasible information source set Γ
rCan obtain by following operation:
C wherein
n s, C
m sFor for information source s, two decision thresholds whether via node is feasible.
Via node is to the sort method of the information source in its feasible information source set.For via node r, use the size of maximum information speed between the information source-destination node that can reach behind this via node that the information source in its feasible information source set is carried out descending according to information source, the feasible information source set Γ in back finally obtains sorting
r LastAt set Γ
r LastIn, the information source that comes the front has the priority of higher this via node of use.
Multiple source, many relayings collaboration communication network trunk nodes-distributing method.Master controller (generally at the destination node place) is defined as the order that information source is distributed via node according to the channel condition between each information source and the destination node, is preferably the little information source of respective channel gain and distributes via node.Because each via node can only be served an information source node, so the situation of information source competition via node in multiple source, many relayings collaborative network, may occur, for the little information source priority allocation via node of channel gain, can guarantee the fairness between information source to a certain extent.The Γ that the master controller utilization obtains from each via node
r LastInformation, successively information source is distributed via node, for certain information source, concrete distribution method is as follows: check the priority of this information source in the feasible information source set of all via nodes, select the highest set of priority of living in, corresponding with it via node is distributed to this information source; If there is not such set, then this information source is selected directly transmission; If there are a plurality of such set, then the pairing via node of set of gesture minimum in these set is distributed to this information source, when the number of the set of gesture minimum greater than 1 the time, the set of a gesture minimum of random choose and the via node that it is corresponding are distributed to this information source.
Description of drawings
The flow process of obtaining and sort of the feasible information source set of each via node in Fig. 1 the invention process;
The operating process of network center's controller in Fig. 2 the invention process;
Fig. 3 the present invention carries the performance simulation of via node allocation algorithm.
Embodiment
Information source in the collaboration communication network and via node are numbered 1,2 respectively ... S, 1,2 ... R, S wherein, R represents the number of information source in the network and the number of via node respectively.
For a collaborative network with multiple source, many relayings, based on above process, each via node can be determined its feasible information source set.
Network center's controller is followed successively by information source and distributes via node, is mainly finished by following steps:
Feasible information source set after the ordering that step 201, master controller send according to each via node, structure utility matrix F
S * R=[f
I, j], f
I, jExpression is the numbering of the information source of i for the feasible priority of via node j.If f
I, j=0, the number of then representing the information source that this via node is feasible is less than j, if F
S * RIn element be zero, all information sources in the collaborative network are selected directly to transmit.
Step 203: when an information source that is numbered s is distributed via node, master controller search effectiveness square
If f
I, j=s battle array F
S * R, obtain set omega according to following criterion
s: then f
I, j∈ Ω
s
Step 204: if the Ω that obtains
sBe sky, then the transmission means of this information source optimum is selected direct transmission exactly, skips to step 203, and next information source is distributed via node.If Ω
sBe not empty, find out set omega earlier
sThe element of middle line label minimum, divide following two kinds of situation discussion: 1, if only there is an element to meet above-mentioned requirements, then that it is corresponding via node is distributed to this information source, skips to step 205; 2, if there are a plurality of elements to meet above-mentioned requirements, then select the via node of feasible information source cardinality minimum in the pairing via node of these elements this moment, it is distributed to this information source, skip to step 205, if this moment, a plurality of via nodes satisfied the condition of feasible information source cardinality minimum, one of picked at random is distributed to this information source in the node that then continues in these, skips to step 205.
Step 205: if via node r is distributed to information source s, master controller upgrades utility matrix F
S * R, with F
S * RIn corresponding to the element zero setting in the row of via node r, then search F
S * RIn whether also have value be the element of s, as if there being such element f
I, j(1≤i≤S, 1≤j≤R) (may exist a plurality of) then carry out following operation: if i＜S and f
I+1, j≠ 0, then
Otherwise f
I, j=0.
Step 206: upgrade the F that obtains
S * RIf in have nonzero element, master controller according to before to the ordering of information source, get back to step 203, and according to F
S * RBegin to distribute via node for next information source; Otherwise master controller is finished via node and is distributed.
Performance evaluation
The collaboration communication network that has only a destination node is adopted in emulation, and this network coverage radius is 500m.Destination node is positioned at the center of housing estate place, and information source is random distribution in the scope of distance destination node [450m 500m], and via node is random distribution in the whole coverage of sub-district.Channel gain between two nodes is by path loss and decline decision, promptly
D wherein
Ij -γThe expression node i, the path loss between the j, d
IjThe expression node i, the distance between the j, γ is the path loss factor, is set to 2 in emulation.Fading coefficients ζ
IjThe obedience variance is 1 rayleigh distributed.
The algorithm that is used to contrast in the emulation is the algorithm based on fairness, promptly is preferably the information source that channel gain is little between information source-destination node and distributes via node.In that being carried out via node, certain information source divides timing, the centralised allocation algorithm utilizes global information, distribute to the best via node of this information source service quality (promptly use behind this via node between information source-destination node the increment maximum of maximum information speed), and the Random assignment algorithm random choose via node feasible to this information source.
Fig. 3 is 20 for the via node number, and information source number is that 50 o'clock power system capacity recruitments are with the variation tendency of launching signal to noise ratio.As seen from Figure 3, when the emission signal to noise ratio was low, the present invention put forward the performance of via node distribution method near centralized via node distribution method.This is because for the multiple source network, and when the emission signal to noise ratio was low, it is even more serious that information source is fought for the phenomenon of via node, and this moment, via node just became scarce resource.And via node distribution method proposed by the invention can well be utilized each via node, thus when signal to noise ratio is low better performances, therefore, be suitable for improving the rate of information throughput of Cell Edge User.
Claims (4)
1. one and half distributed via node distribution methods is characterized in that:
Information source in the collaboration communication network and via node are numbered 1 respectively, 2...S, 1,2...R, S wherein, R represents the total number of information source in the network and the total number of via node respectively, the destination node of information transmission is d, and via node adopts decoding-forward pass (DF, Decode and Forward) repeater mode;
Via node is determined the set of its feasible information source, for via node r (r ∈ 1 ... .R}), its feasible information source set Γ
rObtain by following process:
Wherein S is the set of information source in the network, β
SrBe the channel gain between information source s and via node r, β
RdBe the channel gain between via node r and destination node d,
With
For via node r two decision thresholds whether feasible, at C to information source s
n sWith C
m sExpression formula in, β
SdBe the channel gain between information source s and destination node d, SNR is the emission signal to noise ratio of information source and via node in the network;
Via node is to the information source ordering in its feasible information source set: via node uses the size of the maximum information speed between information source-destination node behind this via node that information source is carried out descending according to information source, the information source that comes the front has the priority of higher this via node of use, at last, via node feeds back to master controller with its feasible information source set and sequencing information thereof;
Master controller utilizes the sequencing information of the feasible information source set of each via node feedback, structure utility matrix F
S * R=[f
I, j], f
I, jThe feasible information source set of expression via node j medium priority is the information source of i, if f
I, j=0, represent that then the feasible information source number of this via node is less than j;
Master controller is defined as the order that information source is distributed via node: master controller distributes the sequencing of via node according to the size decision of the channel gain between information source and the destination node to information source, preferentially the little information source of channel gain is distributed via node;
Master controller is according to utility matrix F
S * RSuccessively information source is distributed via node, when information source is distributed via node, at first check the Sort Priority of information source in the feasible information source set of each via node, select the highest set of priority of living in, divide following three kinds of situation discussion: A) if there is not such set, then information source is selected directly transmission B) if only there is such set, then will gather corresponding via node and distribute to information source C) if there are a plurality of such set, then the pairing via node of set of gesture minimum in these set is distributed to information source, when the number of the set of gesture minimum greater than 1 the time, the set of a gesture minimum of random choose and the via node that it is corresponding are distributed to information source;
After via node r distributed to information source s, master controller reply utility matrix was upgraded, at first with utility matrix F
S * RIn corresponding to the element zero setting in the row of via node r, then search F
S * RIn whether have value to be the element of s, if there is such element f
I, j(1≤i≤S, 1≤j≤R) (may exist a plurality of) then carries out with for i≤m≤S-1 f
M, j=f
M+1, jFollowing operation: if i＜S and f
I+1, j≠ 0, then; Otherwise f
I, j=0; End f
S, j=0
If the utility matrix F after upgrading
S * RIn have nonzero element, master controller begins next information source is distributed via node according to the utility matrix after upgrading, otherwise master controller is finished via node and distributed.
2. according to the described a kind of half distributed via node distribution method of claim 1, it is characterized in that, when the information source of via node in feasible information source set to it sorts, can also use behind this via node between information source-destination node the size of maximum information speed recruitment that information source is carried out descending according to information source, the information source that comes the front has the priority of higher this via node of use.
3. according to the described a kind of half distributed via node distribution method of claim 1, it is characterized in that the present invention also is applicable to the collaboration communication network that adopts amplification-forward pass (AF, Amplify and Forward) repeater mode, this moment is thresholding C accordingly
n sWith C
m sShould satisfy:
Wherein
4. according to the described a kind of half distributed via node distribution method of claim 1, it is characterized in that, master controller is when being defined as the order of information source distribution via node, can also guarantee the requirement of fairness between information source according to the requirement (QoS, Quality of Service) of information source service quality or other.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201010131779 CN101808328A (en) | 2010-03-25 | 2010-03-25 | A kind of half distributed via node distribution method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201010131779 CN101808328A (en) | 2010-03-25 | 2010-03-25 | A kind of half distributed via node distribution method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101808328A true CN101808328A (en) | 2010-08-18 |
Family
ID=42609900
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201010131779 Pending CN101808328A (en) | 2010-03-25 | 2010-03-25 | A kind of half distributed via node distribution method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101808328A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102006654A (en) * | 2010-12-24 | 2011-04-06 | 朱义君 | Method and system for power allocation in multi-relay cooperative communication |
| CN102281179A (en) * | 2011-06-27 | 2011-12-14 | 上海安达通信息安全技术股份有限公司 | VPN tunnel relay acceleration technology |
| CN104168604A (en) * | 2014-08-28 | 2014-11-26 | 重庆邮电大学 | Transmission strategy method based on Nash equilibrium in cooperative communication |
| CN106921975A (en) * | 2015-12-28 | 2017-07-04 | 北京智芯微电子科技有限公司 | A kind of relay transmission method and device based on 230M radio communication private networks |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101282199A (en) * | 2008-04-14 | 2008-10-08 | 北京邮电大学 | Method for self-adaption selection of relay strategy for multi-relay collaboration communication |
| CN101656987A (en) * | 2008-08-19 | 2010-02-24 | 上海华为技术有限公司 | Method and base station for selecting relay node in orthogonal frequency division multiaddress cooperation cellular system |
-
2010
- 2010-03-25 CN CN 201010131779 patent/CN101808328A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101282199A (en) * | 2008-04-14 | 2008-10-08 | 北京邮电大学 | Method for self-adaption selection of relay strategy for multi-relay collaboration communication |
| CN101656987A (en) * | 2008-08-19 | 2010-02-24 | 上海华为技术有限公司 | Method and base station for selecting relay node in orthogonal frequency division multiaddress cooperation cellular system |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102006654A (en) * | 2010-12-24 | 2011-04-06 | 朱义君 | Method and system for power allocation in multi-relay cooperative communication |
| CN102281179A (en) * | 2011-06-27 | 2011-12-14 | 上海安达通信息安全技术股份有限公司 | VPN tunnel relay acceleration technology |
| CN104168604A (en) * | 2014-08-28 | 2014-11-26 | 重庆邮电大学 | Transmission strategy method based on Nash equilibrium in cooperative communication |
| CN106921975A (en) * | 2015-12-28 | 2017-07-04 | 北京智芯微电子科技有限公司 | A kind of relay transmission method and device based on 230M radio communication private networks |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105375955B (en) | A kind of cooperation transmission method in letter energy simultaneous interpretation junction network | |
| CN103716853B (en) | A kind of self adaptation many relay selection methods in terminal direct connection communication system | |
| CN102083217A (en) | Resource distribution method and device for multi-relay orthogonal frequency division multiplexing system | |
| CN104105217A (en) | Method of allocating resources for communication among multiple device-to-devices (D2D) and device | |
| CN102638872A (en) | Relay selection method based on load balancing in cooperation relay network | |
| CN112073974B (en) | Unauthorized spectrum edge access and anti-interference method and device for cooperative terminal communication | |
| CN105263143A (en) | Self-adaptive time slot allocation method according to node density and loads in self-organizing network | |
| CN103118414A (en) | Wireless access control and timeslot allocation method applicable to ultra-wideband | |
| CN103826196A (en) | Cross-layer optimization design method in multi-source multi-sink device-to-device relay communication system | |
| CN101207621A (en) | Power distribution method for reducing interruption probability in AF-DSTC collaboration communication protocol | |
| CN103167587B (en) | A kind of relay node selecting method of relaying cooperation mobile communication system | |
| CN113794984B (en) | Multi-station multi-machine space downlink time slot space division multiplexing distribution system | |
| CN104618959A (en) | Method and system for achieving aeronautical network MAC (multiple access control) protocols | |
| CN101998612B (en) | Resource distribution method and device for two-hop multi-relay orthogonal frequency division multiplexing system | |
| CN104822170B (en) | A kind of cooperating relay system of selection based on node type | |
| CN102196587B (en) | Wireless-resource-dispatching method during multi-cell cooperation in relay-aided communication system | |
| CN101702825A (en) | Method for optimizing downlink OFDMA cellular system | |
| CN101808328A (en) | A kind of half distributed via node distribution method | |
| CN104994582A (en) | Wireless network scheduling method based on serial interference cancellation and power control | |
| CN102761883B (en) | Multi-hop broadband wireless communication system and wireless node device thereof | |
| CN107124217A (en) | A kind of multiple resources optimized algorithm for many relayed OFDM systems of DF for making full use of time slot transmission information | |
| CN104105208A (en) | Same-frequency full duplex scheduling method and device | |
| Pyun et al. | Downlink resource allocation scheme for smart antenna based V2V2I communication system | |
| CN102457350B (en) | Data transmission method and system | |
| CN104838714A (en) | Base station and user scheduling method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20100818 |