CN102186213A - Uplink wireless resource management method based on isomeric relay wireless network framework - Google Patents

Uplink wireless resource management method based on isomeric relay wireless network framework Download PDF

Info

Publication number
CN102186213A
CN102186213A CN2011101154709A CN201110115470A CN102186213A CN 102186213 A CN102186213 A CN 102186213A CN 2011101154709 A CN2011101154709 A CN 2011101154709A CN 201110115470 A CN201110115470 A CN 201110115470A CN 102186213 A CN102186213 A CN 102186213A
Authority
CN
China
Prior art keywords
portable terminal
subcarrier
expression
speed
via node
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN2011101154709A
Other languages
Chinese (zh)
Other versions
CN102186213B (en
Inventor
韩霄
陈惠芳
谢磊
王匡
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Zhejiang University ZJU
Original Assignee
Zhejiang University ZJU
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Zhejiang University ZJU filed Critical Zhejiang University ZJU
Priority to CN2011101154709A priority Critical patent/CN102186213B/en
Publication of CN102186213A publication Critical patent/CN102186213A/en
Application granted granted Critical
Publication of CN102186213B publication Critical patent/CN102186213B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Abstract

The invention relates to an uplink wireless resource management method based on an isomeric relay wireless network framework. The method comprises the following steps of: firstly, selecting an idled mobile terminal e as a relay node; secondly, determining the speed rate and the power of a first hop of a relay link; thirdly, allocating subcarriers to all mobile stations (MS) by a base station (BS); and finally, allocating power to all subcarriers based on a water injection principle. By the method, system resources can be fairly and efficiently utilized, the performance such as throughput, interrupt probability and the like of a system are improved.

Description

Ascending wireless resource management method based on isomery trunked radio network system architecture
Technical field
The invention belongs to the mobile wireless network technical field, be specifically related to a kind of ascending wireless resource management method based on isomery trunked radio network system architecture.
Background technology
Along with the development of wireless multimedia communication, particularly professional at a high speed development such as real-time video communication proposes more and more higher requirement to the speed and the reliability of system.This supports the so high speed and the requirement of reliability with regard to meaning the technology that needs renewal.Yet traditional cellular network possibly can't satisfy above demand.Therefore, (Orthogonal Frequency Division Multiple Access, OFDMA) technology and relaying technique are introduced into radio communication in the OFDM access.
Frequency selective fading is a subject matter in the radio communication.In the multicarrier multi-access systems, (Mobile Station MS) is the subcarrier of deep fade, may decline very little for another one MS for certain portable terminal.OFDMA is exactly a kind of of multicarrier multi-access technology.In the OFDMA technology, each MS can the selective channel condition preferably subchannel carry out transfer of data, because the independence of channel fading between MS, thereby guaranteed that each subcarrier is all used by the more excellent MS of respective channels condition, obtained the multi-user diversity gain on the frequency, so just can satisfy better MS service quality (Quality of Service, QoS).
(Fourth Generation, core technology 4G) has its special advantage to relaying as the 4th third-generation mobile communication.In cellular system, introduce relaying, can improve transmission rate and reliability, increase the area coverage of sub-district, and can improve the service quality of edge customer.Relaying technique can be divided into relaying and the outer relaying of band in the band.The former can be described as cooperating relay again, its can be under the prerequisite that does not increase antenna the implementation space diversity, but because its half-duplex characteristic can be lost spectrum efficiency.Being with outer relaying can be called the isomery relaying again, is to utilize the out-of-band frequency resource of cellular network to carry out relaying.Therefore, performance such as system throughput and outage probability can be greatly improved.
The isomery relaying technique is integrated in the cellular OFDM A network, will be a technology that has prospect.Yet, also do not have the work of this respect up to now.In addition, because after introducing the isomery relaying, traditional radio resource management method will be no longer suitable, therefore how under the prerequisite that guarantees certain fairness, by system resource is distributed, be a technical problem that further needs solution thereby improve throughput of system.
Summary of the invention
The present invention is directed to the deficiency on the prior art, proposed a kind of ascending wireless resource management method based on isomery trunked radio network system architecture.The applied system architecture of this ascending wireless resource management method is based on the OFDMA network and the Ad Hoc network of OFDMA network bands outer (it is outer to be called for short band).
Isomery trunked radio network system architecture among the present invention is based on OFDMA network and the outer Ad Hoc network of band, and in this network system architecture, MS is a bimodulus, and they all have the wave point of OFDMA and Ad Hoc network.Need the MS of transport service can select idle MS to assist it to communicate as its via node.Like this, (Base Station has just had 2 up links between BS): need the MS of transport service and BS by the direct communication of OFDMA network, this is a direct connected link to need the MS of transport service and base station; Need continue the therein assistance of node of the MS of transport service to communicate by letter with BS down, this is a repeated link, first between MS and its via node jump communicate by letter be by with outside Ad Hoc network, it is by the OFDMA network that via node is communicated by letter with second jumping between the BS.
In the isomery trunked radio network system architecture in the present invention, have a BS and MIndividual MS, the set of MS is expressed as
Figure 2011101154709100002DEST_PATH_IMAGE001
, wherein need the MS of transport service to have FIndividual, be expressed as
Figure 604659DEST_PATH_IMAGE002
, idle MS has EIndividual, be expressed as
Figure 2011101154709100002DEST_PATH_IMAGE003
The total bandwidth of OFDMA network is B, the subcarrier number in the network is K, be expressed as
Figure 502821DEST_PATH_IMAGE004
The total bandwidth of Ad Hoc network is B '
At above-mentioned isomery trunked radio network system architecture, the present invention proposes a kind of ascending wireless resource management method of low complex degree, may further comprise the steps:
Step (1) is worked as portable terminal fWhen needing transport service, at first need to select idle portable terminal eAs via node, concrete grammar is as follows:
(a) portable terminal fSend " relay request " message, " relay request " message described here comprises its distance to BS, uses
Figure 2011101154709100002DEST_PATH_IMAGE005
Expression.
(b) after Kong Xian portable terminal is received " relay request " message, according to oneself distance to the base station
Figure 707537DEST_PATH_IMAGE006
, delay a period of time sends relaying again and replys message; Distance
Figure 827809DEST_PATH_IMAGE006
Be divided into L at interval, section time of delay that each is corresponding above-mentioned at interval.To the near more portable terminal of base station distance, time of delay is short more, so just can choose the idle portable terminal nearest from the base station as via node.
(c) portable terminal of transmission " relay request " message fReceive idle portable terminal eFirst " relaying answer " after, just broadcast " relaying selected " information, notify idle portable terminal e, portable terminal fSelected it as via node, and notify other idle portable terminal need not wait for portable terminal again fFinished relay selection.With The indication of expression relay selection, when
Figure 965529DEST_PATH_IMAGE007
=1 o'clock, the expression portable terminal fSelected idle portable terminal eAs its via node; When =0 o'clock, the expression portable terminal fDo not select idle portable terminal eAs its via node.
Step (2) is determined speed and the power that repeated link first is jumped, and concrete grammar is as follows:
(d) at portable terminal of one group of MS( fAnd corresponding via node e) first jump (first jumping and be meant here: from needing the portable terminal of transport service fBy Ad Hoc network, to its corresponding via node eLink), use
Figure 401638DEST_PATH_IMAGE008
Represent the interference of other MS group.Wherein, F 'Expression removes portable terminal fIn addition, other needs the portable terminal of transport service, E 'Expression F 'Corresponding via node, Expression removes portable terminal fIn addition, other needs the portable terminal of transport service F 'Arrive fVia node eChannel power gain,
Figure 341912DEST_PATH_IMAGE010
The expression portable terminal F 'At Ad Hoc network to its via node E 'Transmitting power.
Suppose not have the interference of other MS group, promptly
Figure 2011101154709100002DEST_PATH_IMAGE011
, and the hypothesis portable terminal fRepeated link first speed of jumping Equal the targeted rate upper limit
Figure 2011101154709100002DEST_PATH_IMAGE013
, by the Shannon rate equation
Figure 308524DEST_PATH_IMAGE014
, obtain portable terminal fTo its via node eTransmission power level , wherein
Figure 487832DEST_PATH_IMAGE016
Be fArrive eChannel power gain,
Figure DEST_PATH_IMAGE017
It is the power spectral density of white Gaussian noise.
If
Figure 215486DEST_PATH_IMAGE015
Be less than or equal to portable terminal fMaximum in Ad Hoc network available horsepower
Figure 124536DEST_PATH_IMAGE018
, then
Figure 131806DEST_PATH_IMAGE015
Constant, and
Figure 595148DEST_PATH_IMAGE012
Just equal
Figure 470701DEST_PATH_IMAGE013
If
Figure 968678DEST_PATH_IMAGE015
Greater than portable terminal fMaximum in Ad Hoc network available horsepower
Figure 632003DEST_PATH_IMAGE018
, then order
Figure 379379DEST_PATH_IMAGE015
Equal
Figure 261884DEST_PATH_IMAGE018
, and bring the Shannon rate equation into , obtain
Figure 20893DEST_PATH_IMAGE012
(e) successively other MS group is also carried out and the same operation of step (d), need the portable terminal of transport service thereby drawn all fTo its via node eTransmission power level
Figure 229020DEST_PATH_IMAGE020
(f) to all MS groups, remove in the step (d)
Figure 666955DEST_PATH_IMAGE011
Hypothesis, with what draw previously
Figure 8943DEST_PATH_IMAGE020
, the substitution formula
Figure 215934DEST_PATH_IMAGE008
, just tried to achieve interference value
Figure DEST_PATH_IMAGE021
Still think its speed
Figure 860542DEST_PATH_IMAGE012
Equal
Figure 785772DEST_PATH_IMAGE013
, then by the Shannon rate equation
Figure 416605DEST_PATH_IMAGE022
, obtain power
Figure 274840DEST_PATH_IMAGE015
If Be less than or equal to portable terminal fMaximum in Ad Hoc network available horsepower
Figure 706138DEST_PATH_IMAGE018
, then
Figure 900183DEST_PATH_IMAGE015
Constant, and
Figure 81766DEST_PATH_IMAGE012
Just equal
Figure 68176DEST_PATH_IMAGE013
If
Figure 967999DEST_PATH_IMAGE015
Greater than portable terminal fMaximum in Ad Hoc network available horsepower , then order
Figure 976723DEST_PATH_IMAGE015
Equal
Figure 134035DEST_PATH_IMAGE018
, and bring the Shannon rate equation into
Figure DEST_PATH_IMAGE023
, obtain
(g) repeating step (f) is up to all performance numbers of trying to achieve
Figure 281169DEST_PATH_IMAGE020
All no longer changed, perhaps variable quantity less than
Figure 968502DEST_PATH_IMAGE024
Wherein,
Figure 172081DEST_PATH_IMAGE024
Be a very little value, expression
Figure 780917DEST_PATH_IMAGE015
Variable quantity in twice iteration in front and back.Determine by these
Figure 688830DEST_PATH_IMAGE020
, bring the Shannon rate equation into
Figure DEST_PATH_IMAGE025
, finally determine the speed that all MS group repeated links first are jumped
Figure 387927DEST_PATH_IMAGE026
Step (3) BS gives each MS allocation of subcarriers, and concrete grammar is as follows:
(h) at KSome subcarriers in the individual subcarrier k, suppose that it has distributed to the portable terminal that needs transport service fDirect connected link, pass through formula
Figure DEST_PATH_IMAGE027
, obtain the increment of speed
Figure 887042DEST_PATH_IMAGE028
Wherein,
Figure DEST_PATH_IMAGE029
It is portable terminal fThe present rate of direct connected link, It is portable terminal fObtain current subcarrier kBack direct connected link speed.
Figure DEST_PATH_IMAGE031
Be the subcarrier allocation indication, when
Figure 632461DEST_PATH_IMAGE031
=1 o'clock, the expression subcarrier kDistributed to portable terminal fWhen =0 o'clock, the expression subcarrier kDo not distribute to portable terminal f It is portable terminal fAt subcarrier kOn transmitting power.
Figure DEST_PATH_IMAGE033
It is portable terminal fArrive BS at subcarrier kOn channel power gain.
Figure 406885DEST_PATH_IMAGE034
For capacity difference distance (Capacity gap), can be expressed as
Figure DEST_PATH_IMAGE035
, wherein BER is a bit error rate.
(i) simultaneously, suppose subcarrier kDistributed to portable terminal eThe portable terminal here eIt is the portable terminal that needs transport service fCorresponding via node.Pass through formula , obtain the increment of speed Wherein,
Figure 999464DEST_PATH_IMAGE038
It is portable terminal eTo the present rate of BS, the speed of repeated link second jumping just.
Figure DEST_PATH_IMAGE039
It is portable terminal eObtain current subcarrier kAfter speed.
Figure 840381DEST_PATH_IMAGE040
It is portable terminal eAt subcarrier kOn transmitting power.
Figure DEST_PATH_IMAGE041
It is portable terminal eArrive BS at subcarrier kOn channel power gain.
(j) similar above-mentioned two steps, traveling through all needs transport service and does not reach rate-limit
Figure 52050DEST_PATH_IMAGE013
Portable terminal fAnd corresponding via node, find to make the portable terminal of rate increment maximum, promptly
Figure 636616DEST_PATH_IMAGE042
Or
Figure DEST_PATH_IMAGE043
, give this portable terminal current subcarrier allocation, promptly have
Figure 132188DEST_PATH_IMAGE031
=1 or
Figure 144006DEST_PATH_IMAGE044
=1.
Finish current subcarrier kDistribution after, calculate portable terminal once more fTotal speed
Figure DEST_PATH_IMAGE045
If
Figure 108551DEST_PATH_IMAGE046
, this portable terminal then fCan participate in the distribution of follow-up subcarrier; If , this portable terminal then fNo longer participate in the distribution of follow-up subcarrier.Wherein,
Figure 231228DEST_PATH_IMAGE048
, the expression portable terminal fTotal speed equal direct connected link speed
Figure 348351DEST_PATH_IMAGE029
With repeated link speed sum.And repeated link speed equals the repeated link first hop rate rate With the repeated link second hop rate rate
Figure 531070DEST_PATH_IMAGE038
In, that minimum value
Figure 310808DEST_PATH_IMAGE050
(k) circulate execution in step (h), step (i) and step (j) all reach the targeted rate upper limit up to all MS always , perhaps subcarrier allocation is over, and finishes subcarrier allocation.
Step (4) is given each subcarrier allocation power based on water-filling.Concrete grammar is as follows:
The definition portable terminal mAt subcarrier kOn the channel gain noise ratio be Thereby portable terminal mOptimal power allocation can be expressed as , wherein, , and horizontal plane Selection to guarantee
Figure DEST_PATH_IMAGE055
Wherein, The expression portable terminal mThe maximum of available horsepower in the OFDMA network.
The invention has the advantages that: the present invention is directed to isomery trunked radio network system architecture, the corresponding ascending wireless resource management method that has proposed a kind of low complex degree.This method can be utilized performances such as system resource, the throughput of raising system and outage probability fair, efficiently.
Description of drawings
Fig. 1 is an isomery trunked radio network system architecture;
Fig. 2 is the inventive method flow chart.
Embodiment
The invention will be further described below in conjunction with accompanying drawing.Present embodiment is being to implement under the prerequisite with the technical solution of the present invention, provided detailed execution mode and concrete operating process, but protection scope of the present invention is not limited to following embodiment.
Isomery trunked radio network system architecture as shown in Figure 1, this system architecture in this network system architecture, has a BS and 50 MS based on OFDMA network and the outer Ad Hoc network of band, the set of MS is expressed as
Figure DEST_PATH_IMAGE057
, wherein need the MS of transport service to have 5, be expressed as
Figure 339943DEST_PATH_IMAGE058
, idle MS has 45, is expressed as
Figure DEST_PATH_IMAGE059
MS is a bimodulus, and they all have the wave point of OFDMA and Ad Hoc network.Need the MS of transport service can select idle MS to assist it to communicate as its via node.Like this, (Base Station has just had 2 up links between BS): need the MS of transport service and BS by the direct communication of OFDMA network, this is a direct connected link to need the MS of transport service and base station; Need continue the therein assistance of node of the MS of transport service to communicate by letter with BS down, this is a repeated link, first between MS and its via node jump communicate by letter be by with outside Ad Hoc network, it is by the OFDMA network that via node is communicated by letter with second jumping between the BS.The total bandwidth of OFDMA network is 25MHz, and the subcarrier number in the network is 512, is expressed as The total bandwidth of Ad Hoc network is 40MHz.
At above-mentioned isomery trunked radio network system architecture, the present invention proposes a kind of ascending wireless resource management method of low complex degree, as shown in Figure 2, may further comprise the steps:
Step (1) is worked as portable terminal fWhen needing transport service, at first need to select idle portable terminal eAs via node, concrete grammar is as follows:
(a) portable terminal fSend " relay request " message, " relay request " message described here comprises its distance to BS, uses Expression.
(b) after Kong Xian portable terminal is received " relay request " message, according to oneself distance to the base station , delay a period of time sends " relaying answer " message again.Distance is divided into 1000 intervals, each at interval corresponding time of delay.To the near more portable terminal of base station distance, time of delay is short more, so just can choose the idle portable terminal nearest from the base station as via node.
(c) portable terminal of transmission " relay request " message fReceive idle portable terminal eFirst " relaying answer " after, just broadcast " relaying selected " information, notify idle portable terminal e, portable terminal fSelected it as via node, and notify other idle portable terminal need not wait for portable terminal again fFinished relay selection.
Figure 975751DEST_PATH_IMAGE007
Be the relay selection indication, when
Figure 499136DEST_PATH_IMAGE007
=1 o'clock, the expression portable terminal fSelected idle portable terminal eAs its via node; When
Figure 69926DEST_PATH_IMAGE007
=0 o'clock, the expression portable terminal fDo not select idle portable terminal eAs its via node.
Step (2) is determined speed and the power that repeated link first is jumped, and concrete grammar is as follows:
(d) at portable terminal of one group of MS( fAnd corresponding via node e) first jump (first jumping and be meant here: from needing the portable terminal of transport service fBy Ad Hoc network, to its corresponding via node eLink), use
Figure 311551DEST_PATH_IMAGE008
Represent the interference of other MS group.Wherein, F 'Expression removes portable terminal fIn addition, other needs the portable terminal of transport service, E 'Expression F 'Corresponding via node,
Figure DEST_PATH_IMAGE061
Expression removes portable terminal fIn addition, other needs the portable terminal of transport service F 'Arrive fVia node eChannel power gain,
Figure 383412DEST_PATH_IMAGE062
The expression portable terminal F 'At Ad Hoc network to its via node E 'Transmitting power.
Suppose not have the interference of other MS group, promptly
Figure 417096DEST_PATH_IMAGE011
, and the hypothesis portable terminal fRepeated link first speed of jumping
Figure 17842DEST_PATH_IMAGE012
Equal the targeted rate upper limit , by the Shannon rate equation
Figure 356736DEST_PATH_IMAGE014
, obtain portable terminal fTo its via node eTransmission power level
Figure 589135DEST_PATH_IMAGE015
, wherein
Figure 767306DEST_PATH_IMAGE016
Be fArrive eChannel power gain, It is the power spectral density of white Gaussian noise.In the present embodiment Be made as 10Mbps,
Figure 484092DEST_PATH_IMAGE017
Be made as-174dBm/Hz.
If
Figure 426641DEST_PATH_IMAGE015
Be less than or equal to portable terminal fMaximum in Ad Hoc network available horsepower
Figure 21832DEST_PATH_IMAGE018
, then
Figure 708029DEST_PATH_IMAGE015
Constant, and
Figure 446177DEST_PATH_IMAGE012
Just equal
Figure 559627DEST_PATH_IMAGE013
If
Figure 484858DEST_PATH_IMAGE015
Greater than portable terminal fMaximum in Ad Hoc network available horsepower
Figure 115690DEST_PATH_IMAGE018
, then order Equal
Figure 992696DEST_PATH_IMAGE018
, and bring the Shannon rate equation into
Figure 405223DEST_PATH_IMAGE019
, obtain
Figure 433222DEST_PATH_IMAGE012
, in the present embodiment
Figure 270597DEST_PATH_IMAGE018
Be made as 10mW.
(e) successively other MS group is also carried out and the same operation of step (d), need the portable terminal of transport service thereby drawn all fTo its via node eTransmission power level
Figure 725849DEST_PATH_IMAGE020
(f) to all MS groups, remove in the step (d)
Figure 891251DEST_PATH_IMAGE011
Hypothesis, with what draw previously , the substitution formula
Figure 759030DEST_PATH_IMAGE008
, just tried to achieve interference value
Figure 791708DEST_PATH_IMAGE021
Still think its speed
Figure 913248DEST_PATH_IMAGE012
Equal
Figure 814208DEST_PATH_IMAGE013
, then by the Shannon rate equation
Figure 970383DEST_PATH_IMAGE022
, obtain power
Figure 767437DEST_PATH_IMAGE015
If
Figure 530601DEST_PATH_IMAGE015
Be less than or equal to portable terminal fMaximum in Ad Hoc network available horsepower
Figure 438514DEST_PATH_IMAGE018
, then
Figure 980354DEST_PATH_IMAGE015
Constant, and
Figure 948310DEST_PATH_IMAGE012
Just equal
Figure 44442DEST_PATH_IMAGE013
If
Figure 162570DEST_PATH_IMAGE015
Greater than portable terminal fMaximum in Ad Hoc network available horsepower , then order Equal , and bring the Shannon rate equation into
Figure 452289DEST_PATH_IMAGE023
, obtain
Figure 171983DEST_PATH_IMAGE012
(g) repeating step (f) is up to all performance numbers of trying to achieve
Figure 481742DEST_PATH_IMAGE020
All no longer changed, perhaps variable quantity less than Wherein,
Figure 137031DEST_PATH_IMAGE024
Be a very little value, expression
Figure 383336DEST_PATH_IMAGE015
Variable quantity in twice iteration in front and back, in the present embodiment Be made as 0.000001mW.Determine by these , bring the Shannon rate equation into , finally determine the speed that all MS group repeated links first are jumped
Step (3) BS gives each MS allocation of subcarriers, and concrete grammar is as follows:
(h) at KSome subcarriers in the individual subcarrier k, suppose that it has distributed to the portable terminal that needs transport service fDirect connected link, pass through formula
Figure 313377DEST_PATH_IMAGE027
, obtain the increment of speed
Figure 383794DEST_PATH_IMAGE028
Wherein,
Figure 779003DEST_PATH_IMAGE029
It is portable terminal fThe present rate of direct connected link, It is portable terminal fObtain current subcarrier kBack direct connected link speed. Be the subcarrier allocation indication, when
Figure 276347DEST_PATH_IMAGE031
=1 o'clock, the expression subcarrier kDistributed to portable terminal fWhen
Figure 475247DEST_PATH_IMAGE031
=0 o'clock, the expression subcarrier kDo not distribute to portable terminal f It is portable terminal fAt subcarrier kOn transmitting power.
Figure 668648DEST_PATH_IMAGE033
It is portable terminal fArrive BS at subcarrier kOn channel power gain. For capacity difference distance (Capacity gap), can be expressed as
Figure 566514DEST_PATH_IMAGE035
, wherein BER is a bit error rate, is made as in the present embodiment 10 -3So,
Figure 621057DEST_PATH_IMAGE064
(i) simultaneously, suppose subcarrier kDistributed to portable terminal eThe portable terminal here eIt is the portable terminal that needs transport service fCorresponding via node.Pass through formula , obtain the increment of speed
Figure 449784DEST_PATH_IMAGE037
Wherein,
Figure 724908DEST_PATH_IMAGE038
It is portable terminal eTo the present rate of base station, the speed of repeated link second jumping just.
Figure 899537DEST_PATH_IMAGE039
It is portable terminal eObtain current subcarrier kAfter speed. It is portable terminal eAt subcarrier kOn transmitting power. It is portable terminal eArrive BS at subcarrier kOn channel power gain.
(j) similar above-mentioned two steps, traveling through all needs transport service and does not reach rate-limit
Figure 448964DEST_PATH_IMAGE013
Portable terminal fAnd corresponding via node, find to make the portable terminal of rate increment maximum, promptly
Figure 946942DEST_PATH_IMAGE042
Or
Figure 249747DEST_PATH_IMAGE043
, give this portable terminal current subcarrier allocation, promptly have
Figure 200386DEST_PATH_IMAGE031
=1 or =1.
Finish current subcarrier kDistribution after, calculate portable terminal once more fTotal speed
Figure 91167DEST_PATH_IMAGE045
If
Figure 33715DEST_PATH_IMAGE046
, this portable terminal then fCan participate in the distribution of follow-up subcarrier; If
Figure 2808DEST_PATH_IMAGE047
, this portable terminal then fNo longer participate in the distribution of follow-up subcarrier.Wherein, , the expression portable terminal fTotal speed equal direct connected link speed
Figure 302520DEST_PATH_IMAGE029
With repeated link speed sum.And repeated link speed equals the repeated link first hop rate rate With the repeated link second hop rate rate
Figure 341200DEST_PATH_IMAGE038
In, that minimum value
Figure 96666DEST_PATH_IMAGE050
(k) circulate execution in step (h), step (i) and step (j) all reach the targeted rate upper limit up to all MS always
Figure 158163DEST_PATH_IMAGE013
, perhaps subcarrier allocation is over, and finishes subcarrier allocation.
Step (4) is given each subcarrier allocation power based on water-filling.Concrete grammar is as follows:
The definition portable terminal mAt subcarrier kOn the channel gain noise ratio be
Figure 596841DEST_PATH_IMAGE051
Thereby portable terminal mOptimal power allocation can be expressed as
Figure 9368DEST_PATH_IMAGE052
, wherein,
Figure 37367DEST_PATH_IMAGE053
, and horizontal plane
Figure 750108DEST_PATH_IMAGE054
Selection to guarantee
Figure 939781DEST_PATH_IMAGE055
Wherein,
Figure 246129DEST_PATH_IMAGE056
The expression portable terminal mThe maximum of available horsepower in the OFDMA network, in the present embodiment Be made as 100mW.

Claims (1)

1. based on the ascending wireless resource management method of isomery trunked radio network system architecture, it is characterized in that this method comprises the steps:
Step (1) is worked as portable terminal fWhen needing transport service, at first need to select idle portable terminal eAs via node, concrete grammar is as follows:
(a) portable terminal fSend relay request message, described relay request message contains portable terminal fTo the distance of base station, use
Figure 2011101154709100001DEST_PATH_IMAGE002
Expression;
(b) after Kong Xian portable terminal is received relay request message, according to oneself distance to the base station
Figure 2011101154709100001DEST_PATH_IMAGE004
, delay a period of time sends relaying again and replys message; Distance
Figure 323945DEST_PATH_IMAGE004
Be divided into L at interval, section time of delay that each is corresponding above-mentioned at interval;
(c) portable terminal of transmission relay request message fReceive idle portable terminal eFirst relaying reply message after, just broadcast the selected message of a relaying, notify idle portable terminal e, portable terminal fSelected it as via node, and notify other idle portable terminal need not wait for portable terminal again fFinished relay selection; With
Figure 2011101154709100001DEST_PATH_IMAGE006
The indication of expression relay selection, when =1 o'clock, the expression portable terminal fSelected idle portable terminal eAs its via node; When
Figure 760053DEST_PATH_IMAGE006
=0 o'clock, the expression portable terminal fDo not select idle portable terminal eAs its via node;
Step (2) is determined speed and the power that repeated link first is jumped, and concrete grammar is as follows:
(d) jump at first of one group of portable terminal, use
Figure 2011101154709100001DEST_PATH_IMAGE008
Represent the interference of other portable terminal group; Wherein, F 'Expression removes portable terminal fIn addition, other needs the portable terminal of transport service, E 'Expression F 'Corresponding via node,
Figure 2011101154709100001DEST_PATH_IMAGE010
Expression removes portable terminal fIn addition, other needs the portable terminal of transport service F 'Arrive fVia node eChannel power gain,
Figure 2011101154709100001DEST_PATH_IMAGE012
The expression portable terminal F 'At Ad Hoc network to its via node E 'Transmitting power;
Suppose not have the interference of other portable terminal group, promptly
Figure DEST_PATH_IMAGE014
, and the hypothesis portable terminal fRepeated link first speed of jumping
Figure DEST_PATH_IMAGE016
Equal the targeted rate upper limit
Figure DEST_PATH_IMAGE018
, by the Shannon rate equation
Figure DEST_PATH_IMAGE020
, obtain portable terminal fTo its via node eTransmission power level , wherein
Figure DEST_PATH_IMAGE024
Be fArrive eChannel power gain,
Figure DEST_PATH_IMAGE026
It is the power spectral density of white Gaussian noise;
If
Figure 192172DEST_PATH_IMAGE022
Be less than or equal to portable terminal fMaximum in Ad Hoc network available horsepower
Figure DEST_PATH_IMAGE028
, then
Figure 551609DEST_PATH_IMAGE022
Constant, and
Figure 565308DEST_PATH_IMAGE016
Just equal
Figure 174144DEST_PATH_IMAGE018
If
Figure 816478DEST_PATH_IMAGE022
Greater than portable terminal fMaximum in Ad Hoc network available horsepower
Figure 827159DEST_PATH_IMAGE028
, then order
Figure 795115DEST_PATH_IMAGE022
Equal
Figure 360089DEST_PATH_IMAGE028
, and bring the Shannon rate equation into
Figure DEST_PATH_IMAGE030
, obtain
(e) successively other portable terminal group is also carried out and the same operation of step (d), need the portable terminal of transport service thereby drawn all fTo its via node eTransmission power level
Figure DEST_PATH_IMAGE032
(f), remove in the step (d) to all portable terminal groups Hypothesis, with what draw previously
Figure 262689DEST_PATH_IMAGE032
, the substitution formula
Figure 846117DEST_PATH_IMAGE008
, just tried to achieve interference value Still think its speed Equal
Figure 18789DEST_PATH_IMAGE018
, then by the Shannon rate equation
Figure DEST_PATH_IMAGE036
, obtain power
Figure 797389DEST_PATH_IMAGE022
If
Figure 868113DEST_PATH_IMAGE022
Be less than or equal to portable terminal fMaximum in Ad Hoc network available horsepower
Figure 141094DEST_PATH_IMAGE028
, then Constant, and
Figure 461534DEST_PATH_IMAGE016
Just equal
Figure 222817DEST_PATH_IMAGE018
If
Figure 79914DEST_PATH_IMAGE022
Greater than portable terminal fMaximum in Ad Hoc network available horsepower
Figure 243042DEST_PATH_IMAGE028
, then order
Figure 894603DEST_PATH_IMAGE022
Equal
Figure 939920DEST_PATH_IMAGE028
, and bring the Shannon rate equation into
Figure DEST_PATH_IMAGE038
, obtain
Figure 803971DEST_PATH_IMAGE016
(g) repeating step (f) is up to all performance numbers of trying to achieve All no longer change, perhaps variable quantity less than
Figure DEST_PATH_IMAGE040
Wherein
Figure 627756DEST_PATH_IMAGE040
Be a very little value, expression
Figure 894789DEST_PATH_IMAGE022
Variable quantity in twice iteration in front and back; Determine by these
Figure 562531DEST_PATH_IMAGE032
, bring the Shannon rate equation into
Figure DEST_PATH_IMAGE042
, finally determine the speed that all portable terminal group repeated links first are jumped
Figure DEST_PATH_IMAGE044
Each portable terminal allocation of subcarriers is given in step (3) base station, and concrete grammar is as follows:
(h) at KSome subcarriers in the individual subcarrier k, suppose subcarrier kDistributed to the portable terminal that needs transport service fDirect connected link, pass through formula
Figure DEST_PATH_IMAGE046
, obtain the increment of speed
Figure DEST_PATH_IMAGE048
Wherein,
Figure DEST_PATH_IMAGE050
It is portable terminal fThe present rate of direct connected link,
Figure DEST_PATH_IMAGE052
It is portable terminal fObtain current subcarrier kBack direct connected link speed,
Figure DEST_PATH_IMAGE054
Be the subcarrier allocation indication, when
Figure 588999DEST_PATH_IMAGE054
=1 o'clock, the expression subcarrier kDistributed to portable terminal fWhen
Figure 316784DEST_PATH_IMAGE054
=0 o'clock, the expression subcarrier kDo not distribute to portable terminal f,
Figure DEST_PATH_IMAGE056
It is portable terminal fAt subcarrier kOn transmitting power,
Figure DEST_PATH_IMAGE058
It is portable terminal fArrive BS at subcarrier kOn channel power gain; Be the capacity difference distance, can be expressed as
Figure DEST_PATH_IMAGE062
, wherein BER is a bit error rate;
(i) simultaneously, suppose subcarrier kDistributed to portable terminal eThe portable terminal here eIt is the portable terminal that needs transport service fCorresponding via node; Pass through formula , obtain the increment of speed
Figure DEST_PATH_IMAGE066
Wherein
Figure DEST_PATH_IMAGE068
It is portable terminal eTo the present rate of BS, the speed of repeated link second jumping just,
Figure DEST_PATH_IMAGE070
It is portable terminal eObtain current subcarrier kAfter speed,
Figure DEST_PATH_IMAGE072
It is portable terminal eAt subcarrier kOn transmitting power,
Figure DEST_PATH_IMAGE074
It is portable terminal eArrive BS at subcarrier kOn channel power gain;
(j) traveling through all needs transport service and does not reach rate-limit
Figure 884163DEST_PATH_IMAGE018
Portable terminal fAnd corresponding via node, find to make the portable terminal of rate increment maximum, promptly
Figure DEST_PATH_IMAGE076
Or
Figure DEST_PATH_IMAGE078
, give this portable terminal current subcarrier allocation, promptly have =1 or
Figure DEST_PATH_IMAGE080
=1;
Finish current subcarrier kDistribution after, calculate portable terminal once more fTotal speed If
Figure DEST_PATH_IMAGE084
, this portable terminal then fCan participate in the distribution of follow-up subcarrier; If
Figure DEST_PATH_IMAGE086
, this portable terminal then fNo longer participate in the distribution of follow-up subcarrier; Wherein,
Figure DEST_PATH_IMAGE088
, the expression portable terminal fTotal speed equal direct connected link speed
Figure 738035DEST_PATH_IMAGE050
With repeated link speed sum, and repeated link speed equals the repeated link first hop rate rate
Figure DEST_PATH_IMAGE090
With the repeated link second hop rate rate
Figure 636721DEST_PATH_IMAGE068
In, that minimum value
Figure DEST_PATH_IMAGE092
(k) circulate execution in step (h), step (i) and step (j) all reach the targeted rate upper limit up to all portable terminals always , perhaps subcarrier allocation is over, and finishes subcarrier allocation;
Step (4) is given each subcarrier allocation power based on water-filling, and concrete grammar is as follows:
The definition portable terminal mAt subcarrier kOn the channel gain noise ratio be
Figure DEST_PATH_IMAGE094
Thereby portable terminal mOptimal power allocation can be expressed as
Figure DEST_PATH_IMAGE096
, wherein, , and horizontal plane Selection to guarantee
Figure DEST_PATH_IMAGE102
, wherein
Figure DEST_PATH_IMAGE104
The expression portable terminal mThe maximum of available horsepower in the OFDMA network.
CN2011101154709A 2011-05-05 2011-05-05 Uplink wireless resource management method based on isomeric relay wireless network framework Active CN102186213B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2011101154709A CN102186213B (en) 2011-05-05 2011-05-05 Uplink wireless resource management method based on isomeric relay wireless network framework

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2011101154709A CN102186213B (en) 2011-05-05 2011-05-05 Uplink wireless resource management method based on isomeric relay wireless network framework

Publications (2)

Publication Number Publication Date
CN102186213A true CN102186213A (en) 2011-09-14
CN102186213B CN102186213B (en) 2013-10-23

Family

ID=44572269

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2011101154709A Active CN102186213B (en) 2011-05-05 2011-05-05 Uplink wireless resource management method based on isomeric relay wireless network framework

Country Status (1)

Country Link
CN (1) CN102186213B (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103297210A (en) * 2012-02-24 2013-09-11 中国移动通信集团公司 Method, system and device for realizing multi-carriers in relay transmission system
CN104602296A (en) * 2013-11-01 2015-05-06 中国移动通信集团北京有限公司 Method and device for allocating uplink bandwidth
CN105142151A (en) * 2014-05-27 2015-12-09 华为技术有限公司 Method of communication in aggregation system, equipment and system
CN105916198A (en) * 2016-04-15 2016-08-31 东南大学 Energy-efficiency-fairness-based resource distribution and power control method in heterogeneous network
CN110213801A (en) * 2018-02-28 2019-09-06 成都鼎桥通信技术有限公司 Heterogeneous network communication method and apparatus

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1812283A (en) * 2005-01-26 2006-08-02 北京邮电大学 Power distributing method for two-jumping multi-antenna relay system
CN101557641A (en) * 2009-05-07 2009-10-14 浙江大学 Subcarrier and power distribution method applicable to cellular relay system
CN101697637A (en) * 2009-10-22 2010-04-21 上海交通大学 Resource allocation method in OFDMA system

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1812283A (en) * 2005-01-26 2006-08-02 北京邮电大学 Power distributing method for two-jumping multi-antenna relay system
CN101557641A (en) * 2009-05-07 2009-10-14 浙江大学 Subcarrier and power distribution method applicable to cellular relay system
CN101697637A (en) * 2009-10-22 2010-04-21 上海交通大学 Resource allocation method in OFDMA system

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
应必娣,陈惠芳等: "低能耗无线传感器网络路由算法", 《传感技术学报》 *

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103297210A (en) * 2012-02-24 2013-09-11 中国移动通信集团公司 Method, system and device for realizing multi-carriers in relay transmission system
CN104602296A (en) * 2013-11-01 2015-05-06 中国移动通信集团北京有限公司 Method and device for allocating uplink bandwidth
CN104602296B (en) * 2013-11-01 2018-03-23 中国移动通信集团北京有限公司 The distribution method and device of a kind of upstream bandwidth
CN105142151A (en) * 2014-05-27 2015-12-09 华为技术有限公司 Method of communication in aggregation system, equipment and system
CN105916198A (en) * 2016-04-15 2016-08-31 东南大学 Energy-efficiency-fairness-based resource distribution and power control method in heterogeneous network
CN105916198B (en) * 2016-04-15 2019-05-31 东南大学 Resource allocation and Poewr control method based on efficiency justice in a kind of heterogeneous network
CN110213801A (en) * 2018-02-28 2019-09-06 成都鼎桥通信技术有限公司 Heterogeneous network communication method and apparatus
CN110213801B (en) * 2018-02-28 2023-08-15 成都鼎桥通信技术有限公司 Heterogeneous network communication method and equipment

Also Published As

Publication number Publication date
CN102186213B (en) 2013-10-23

Similar Documents

Publication Publication Date Title
Zhao et al. NOMA-based D2D communications: Towards 5G
Wu et al. Recent advances in energy-efficient networks and their application in 5G systems
CN104284407B (en) Poewr control method based on full duplex relaying in the cellular network of embedded D2D
CN102625252B (en) Time-divided transmission method capable of avoiding interference for D2D multi-casting communication system
CN104105158A (en) Relay selection method based on D2D relay communication
CN103260244B (en) D2D uplink resource multiplexing mode switching method in a kind of cellular system
CN104717755A (en) Downlink frequency spectrum resource distribution method with D2D technology introduced in cellular network
CN102664855B (en) Orthogonal frequency division multiplexing (OFDM)-based channel assignment method in two-layer network
CN104703270B (en) User's access suitable for isomery wireless cellular network and power distribution method
CN102186213B (en) Uplink wireless resource management method based on isomeric relay wireless network framework
CN107222907A (en) The cellular network transmission method of auxiliary is relayed based on up non-orthogonal multiple
CN105491510A (en) Service unloading method for resource sharing in dense heterogeneous cellular network
Ekti et al. Joint user association and data-rate allocation in heterogeneous wireless networks
Zhengwen et al. Research on relay selection in device-to-device communications based on maximum capacity
CN101702825A (en) Method for optimizing downlink OFDMA cellular system
CN102056305B (en) User grouping and resource allocation method for wireless relay network
CN102740236A (en) Method for cooperative multicast among users based on energy efficiency
Muhammed et al. Resource allocation for energy efficiency in NOMA enhanced small cell networks
CN103281695B (en) A kind of hop relay network frequency spectrum planing method
CN102256366B (en) Multi-user multiple input multiple output (MIMO) resource scheduling method under carrier aggregation scene
CN102932127B (en) Multi-base-station cooperative communication method of time division-long term evolution (TD-LTE) spread spectrum orthogonal frequency division multiplexing (OFDM) system
CN102202413B (en) Method for dispatching resources by combining network coding and user pairing
Selvam et al. Green point energy-efficient analysis of non-orthogonal multiple access (NOMA) over OFDMA
Arora et al. Performance enhancement of wireless network by adopting downlink non-orthogonal multiple access technique
Wang et al. A semi-distributed resource allocation scheme for OFDMA relay-enhanced downlink systems

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant