CN103517366B - Relay node distribution method based on green energy saving in cooperative communication - Google Patents
Relay node distribution method based on green energy saving in cooperative communication Download PDFInfo
- Publication number
- CN103517366B CN103517366B CN201310478195.6A CN201310478195A CN103517366B CN 103517366 B CN103517366 B CN 103517366B CN 201310478195 A CN201310478195 A CN 201310478195A CN 103517366 B CN103517366 B CN 103517366B
- Authority
- CN
- China
- Prior art keywords
- node
- business stream
- channel
- business
- 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.)
- Active
Links
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
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
Provided is a relay node distribution method based on green energy saving in cooperative communication. Currently, relay nodes are distributed only based on the consideration of energy efficiency gain of the introduced relay nodes, existing potential interference is ignored when the relay nodes are introduced, and resources are not used to the maximum degree. According to the method, energy efficiency gain and interference expenditure are balanced comprehensively, and consideration of system overall performance is achieved. Under the situation that the same sending power is used, larger system capacity is obtained, and accordingly system energy efficiency is improved, and the effect of green energy saving is achieved.
Description
Technical field
The present invention relates to cooperative communication technology field, particularly to the distribution of collaboration communication via node in distributed network
Method.
Background technology
Green communications be energy-saving and emission-reduction, environmental protection theory the communications industry embodiment.Rapidly sending out with the communications industry
Exhibition, communication is while penetrating into people's life, also increasingly apparent with the phenomenon of being discord of society, environment.Resource excessively using, huge
Big energy consumption and pollution etc., cause people more and more to pay close attention to.Particularly in today of energy worsening shortages, how to save energy
Source, reducing energy consumption become a hot issue of communication industry research.Collaboration communication can lift wireless network performance effectively, passes through
Application collaboration communication, source node can forward data by other idle node, thus real in the case of without outfit multiple antennas
Existing space diversity gain, reduces equipment complexity and cost.
In mobile communication system, the thinking of green energy conservation has following 2 kinds.First, system sends under general power in identical,
Lift channel capacity by effectively distributing via node, thus lift system efficiency.
Second, system reaches identical power system capacity by reducing transmit power, is equally reached the effect of energy-conservation.
When source node is to destination node transmission information, due to reasons such as distance, channel fadings, transfer rate may not reach
Perfect condition.Help forward the information of source node if there are suitable via node, tend to lift transmission performance.And it is logical to cooperate
The performance of letter can more reasonably configure resource with the distribution close relation of via node, effective allocation algorithm.
Based on this, document：Guo T,Carrasco R.Cooperative Relay-Based Auto-Rate MAC
for Multirate Wireless Networks[J].IEEE.Trans on Wireless
Communications.2009,12(12):5938-5947 proposes a kind of instantaneous channel state information according to measurement and distributes
Method CRBAR (cooperative relay-based auto rate) of via node.Document Cao B, Feng G, Li
Y.A Game Theoretic Approach for Cooperative Transmission Strategy in Wireless
Networks.2012.12（7）：1710-1715. is directed to selecting collaboration and relays the Business Stream race problem bringing it is proposed that being based on
The trunk node selection of betting model.
The gain angle that above two method is only brought from deployment via node considers, only from the node needing cooperation or
Person's business flow angle is set out, and have ignored thing followed extra interference after introduction via node, or even have selected and bring interference big
In the via node of gain, thus the efficiency obtaining after causing to take cooperation is more worse than when direct transferring on the contrary.
Content of the invention
The problems referred to above existing for prior art, we have proposed a kind of via node distribution side based on green energy conservation
Method, considers gain and the extra interference that cooperative node brings, thus selecting suitable via node, reasonably distribution money
Source.Under taking same transmit power, lift system capacity, thus efficiency gets a promotion, has reached green energy conservation purpose.
The technical scheme that the present invention solves the above problems is：To need to take the source node of cooperation and cooperation can be provided
Via node is respectively defined as the both parties in auction；Each wheel auction one via node that is to say, that auction wheel number
It is equal to the number of the via node that cooperation can be provided；The via node of each wheel auction is that the available efficiency of each source node increases
As respective Buying Offer, the efficiency that the interference that this via node is caused to Business Stream in interference range brings reduces to be made benefit
For Offering Price.It may appear that following two situation during auction：One, in the auction of this wheel, all of Buying Offer is respectively less than
Offering Price is then auctioned unsuccessfully, shows that the cooperative node of this wheel auction is not involved in cooperating, and exits all ensuing auctions.
Two, if this wheel has multiple source node quotations more than charge, then the quotation of these source nodes is compared, maximum quoter's epicycle
Win in auction, and it also will move out ensuing all auctions.
Following technological means are specifically adopted to realize：A kind of via node distribution side based on green energy conservation in collaboration communication
Method, it is characterised in that obtaining Network Traffic and idle relay nodal information, these Business Streams and via node is put respectively
In needing to take the Business Stream pond of cooperation and idle relay node pool；Channel capacity when being direct transferred according to each Business StreamIndustry
Channel capacity after business stream takes the cooperation of j-th cooperative node isNode transmit power P, calls formula：Calculate Buying Offer；According to taking in via node interference range before cooperation
Business Stream direct transfers channel capacityTake the Business Stream G in cooperative node interference range after cooperationjChannel capacityCall formula： Calculate Offering Price；According to idle relay section
Point number determines auction wheel number, and report successively by the independent via node that every wheel is auctioned for institute's Business Stream taking cooperation in need
Valency；More than cooperative node charge, this cooperative node is as the via node of maximum quote service stream for quotation as maximum in Business Stream；As
Less than cooperative node charge, then this cooperative node is not involved in the cooperation of epicycle Business Stream to the maximum quotation of Business Stream；Until Business Stream
All Business Streams in pond and idle relay node pool and cooperative node all compare end, complete the distribution of collaboration communication interior joint.
Channel capacity when described each Business Stream direct transfersAccording to formula：
Obtain, wherein W is channel width, σ2It is channel white noise, P is node transmit power,It is that source node arrives destination node
Channel fading coefficient,Represent the source node s in the set of Business Stream in k-th via node interference range of this wheelj,(j=
1,2,Lkj) arrive destination node dj,(j=1,2,Lkj) channel fading coefficient.
Business Stream takes the channel capacity after cooperationAccording to formula： Obtain.Wherein W is channel width, σ2It is channel white noise, P is node transmit power,
It is the channel fading coefficient that source node arrives destination node,It is source node s respectivelyiTo via node rj, relaying
Node rjTo diChannel fading coefficient.Business Stream in idle relay node interference range direct transfers channel capacityAccording to
Formula：Calculate,（f1,f2,L,GjRepresenting should
Business Stream set in idle relay node interference range）.Wherein W is channel width,Represent source node si(i=1,2Lm)
To destination node di(i=1,2Lm) channel fading coefficient.Represent Gk, source node s in (k=1,2, Ln)j,(j=1,2,
Lkj) arrive destination node dj,(j=1,2,Lkj) channel fading coefficient, σ2Represent channel white noise.When this via node replaces other
When Business Stream forwards data, the Business Stream G in cooperative node interference rangejChannel capacity according to formula：Calculate.Wherein, W is channel width,For
Source node si(i=1,2Lm) arrive destination node dj(j=1,2Lm) channel fading coefficient.Represent k-th relaying section of this wheel
Source node s in the set of Business Stream in point interference rangej,(j=1,2,Lkj) arrive destination node dj,(j=1,2,Lkj) channel
Fading coefficients, σ2Represent channel white noise,Represent source node respectively to via node, via node is to purpose section
The channel fading coefficient of point.
The relay node distribution method of prior art only from need cooperation node or Business Stream from the point of view of, with
And the brought performance boost of Business Stream to single or a certain small range, but have ignored what via node after taking cooperation brought
The impact to whole network for the interference, or even source node have selected during the cooperative node cooperation bringing interference bigger than gain so that net
Network performance is deteriorated on the contrary, from obtained from via node allocative decision it is impossible to make power system capacity reach maximization.However, being based on
The relay node distribution method of green energy conservation is to introduce, in comprehensive measurement, gain and the expense that via node brings, by construction
Both parties and quotation charge, finally according to distributed auction, each wheel auction can find optimum via node thus
Make power system capacity obtain the lifting of maximum, therefore obtain bigger than original algorithm in the case of using identical transmit power
Capacity boost, reaches green energy conservation purpose.
Brief description
Fig. 1 is inventive algorithm flow chart；
Fig. 2 Business Stream mates figure with cooperative node.
Specific embodiment
Below in conjunction with accompanying drawing and instantiation, the enforcement of the present invention is described specifically.
Assume that the Business Stream having N bar to need cooperation and M idle relay node are uniformly distributed in a network at random, Business Stream
The via node being suitable for is selected to forward data.Business stream source node and idle relay node transmit power are P.Fig. 1 show
The relay distribution algorithm flow chart of the present invention.Netinit, obtains the Business Stream needing to take cooperation in network and idle relay
Nodal information.Calculate the buyer of each wheel, the quotation charge of the seller, auctioned according to rule, finally give best match pair
Number.
The efficiency gain that via node is brought for Business Stream is as the quotation in auction, its interference to other Business Streams
Expense is as the charge in auction.
First, channel capacity when each Business Stream direct transfers is equal to（1≤i≤N, N represent that the business of cooperation taken by needs
Stream）, the channel capacity after Business Stream takes cooperation is equal toAccording to formula Obtain
Buying Offer.Wherein, P is node transmit power.Via node Relayj（1≤j≤M, M represented in the free time that can provide cooperation
Continue node）The Business Stream channel capacity that direct transfers in interference range is（f1,f2,L,fk∈Gj,GjRepresent RelayjInterference model
Business Stream set in enclosing）, work as RelayjWhen being selected as via node forwarding data, the Business Stream G in its interference rangej
Channel capacity beTherefore, according to formula：Obtain Offering Price.
To idle relay node initializing, via node is randomly ordered.Then carried out successively according to the order having sorted
Auction is that is to say, that auction wheel number is divided according to idle relay node number.Each wheel the industry taking cooperation in need
The independent via node to the auction of this wheel of business stream is offered.Auction the condition must successfully being fulfilled for：
1. Buying Offer have to be larger than zero, and after that is, Business Stream takes cooperation, Energy Efficiency Ratio is big when direct transferring；
2. Buying Offer is more than Offering Price, that is, after introducing via node, the gain efficiency brought is dry more than what it brought
Disturb expense.If all quotations of epicycle are respectively less than asked a price, represent that this cooperative node of epicycle is not suitable for participating in cooperation, if a certain industry
Business abortive lot is sold successfully, will move out ensuing auction.
Specifically include following steps：
1. network is initialized first, obtains the information needing the Business Stream and idle relay node cooperating in network,
And Business Stream and idle relay node are respectively placed in Business Stream pond to be allocated（Buyer）With idle relay pond（The seller）In,
Wherein assume that buyer's quantity is equal to m, seller's quantity is equal to n.
2. will be randomly ordered for the via node in idle relay node pool, clapped successively according to randomly ordered good order
Sell, often wheel is only auctioned to a via node.If, jth wheel（1≤j≤n, n are idle relay nodes）, this wheel free time
Via node carries out auctioning buyer's quotation and being calculated as follows that seller asks a price：
（1）Buying Offer calculates：
Obtain channel capacity when each Business Stream direct transfers first
（1≤i≤NN, NN are remaining Business Stream, NN≤m in Business Stream pond）W is channel width,Represent source node si(i=1,
2Lm) arrive destination node dj(j=1,2Lm) channel fading coefficient.Represent Gk, source node s in (k=1,2, Ln)j,(j=
1,2,Lkj) arrive destination node dj,(j=1,2,Lkj) channel fading coefficient, σ2Represent channel white noise, GkRepresent k-th of this wheel
The set of Business Stream in via node interference range.
Each Business Stream calculates the via node Relay of successfully auctionjChannel capacity after cooperation can be providedWherein W is channel width, σ2Represent that channel is white
Noise, p is node transmit power,Represent Gk, source node s in (k=1,2, Ln)j,(j=1,2,Lkj) arrive destination node
dj,(j=1,2,Lkj) channel fading coefficient,Represent source node respectively to via node, via node is to purpose
The channel fading coefficient of node, therefore can obtain needing to take the Business Stream of cooperation
（2）Offering Price calculates：
The Business Stream channel capacity that direct transfers calculating first in the idle relay node interference range of this wheel auction is（f1,f2,L,GjRepresent this idle relay node
Business Stream set in interference range）, wherein W is channel width,Represent source node si(i=1,2Lm) arrive destination node
di(i=1,2Lm) channel fading coefficient.Represent Gk, source node s in (k=1,2, Ln)j,(j=1,2,Lkj) arrive purpose
Node dj,(j=1,2,Lkj) channel fading coefficient, σ2Represent channel white noise.
When this via node replaces other Business Streams to forward data, the Business Stream G in its interference rangejChannel capacity beWhereinRepresent via node rj(j=1,
2Lm) arrive destination node di,(i=1,2,Lkj) channel fading coefficient.Idle relay node therefore can be obtained
Assume there is m bar Business Stream in buyer's business pond, have n via node in seller pond, currently carry out in j-th
Continue the dealing of node.
May know that the Business Stream capacity that direct transfers is according to definition aboveAfter taking this via node, cooperation capacity isTherefore, obtain the efficiency gain that via node is that each Business Stream brings and offer beThis wheel relays
After node j is used, in interference range, the capacity of Business Stream isIt is not selected as in interference range before cooperative node
Capacity isTherefore obtaining via node to the interference that whole network is brought is
Quotation is compared, takes out maximum quotation.If the quotation of this maximum is more than charge, the then Business Stream of maximum quotation
Obtain epicycle auction, that is, as its cooperative node, this Business Stream exits ensuing auction to via node j.If maximum quotation
Less than asking a price, then epicycle via node j is not involved in cooperating, and exits next all of auction.By that analogy, up to buyer
In pond or seller pond, number stops for 0.
The flow chart being illustrated in figure 2 auction process in the present invention.
Obtain the quotation to the via node that epicycle is auctioned for the remaining each Business Stream in Business Stream pond first, and each business is divided
Interference expense during this via node is not taken to be Offering Price.Quotation is removed less than zero Business Stream, is not involved in competition auction,
Ensure Business Stream take this relay node cooperation after Energy Efficiency Ratio big when direct transferring.Then remaining Business Stream is offered, by emitting
Bubble ranking method selects the quotation of maximum.If the quotation of this maximum, less than buyer's charge, represents and takes this idle relay node to bring
Interference expense be more than gain, then this via node be not involved in cooperate；If the quotation of this maximum is more than buyer's charge, this via node
Business Stream for maximum quotation provides cooperation, and this coupling is opposite in conclusion of the business match-pool, and the Business Stream of this conclusion of the business will move out
Ensuing auction.
The present invention, in via node assignment problem, considers gain and the expense that via node brings, it is to avoid from
One-sided when considering that cooperation brings gain to carry out via node distribution, actually power system capacity is not as Theoretical Calculation and manages like that
Think, or even occur that interference expense is more than the situation of gain.Therefore the present invention can be in the situation taking same transmit power
The bigger power system capacity of lower acquisition, thus being lifted well, reaches the purpose of green energy conservation to system energy efficiency.
Claims (1)
1. in collaboration communication a kind of relay node distribution method based on green energy conservation it is characterised in that obtain network in business
Stream and idle relay nodal information, these Business Streams and via node are respectively placed in Business Stream pond and the sky needing to take cooperation
Not busy via node pond；Channel capacity when being direct transferred according to each Business StreamAfter Business Stream takes j-th cooperative node cooperation
Channel capacity beNode transmit power P, calls formula：Calculate buyer's report
Valency；Direct transferred channel capacity according to the Business Stream in idle relay node interference range before cooperationCooperative node after cooperation
Business Stream G in interference rangejChannel capacityCall formula：
Calculate Offering Price；Obtain the quotation to the via node that epicycle is auctioned for the remaining each Business Stream in Business Stream pond, and each business
Take interference expense during this via node to be Offering Price respectively, quotation is removed less than zero Business Stream, by remaining business
Maximum quotation is selected in stream quotation sequence, and such as the quotation of this maximum is less than buyer's charge, the then corresponding via node of this maximum quotation
It is not involved in cooperating, if the quotation of this maximum is more than buyer's charge, corresponding via node provides cooperation for the Business Stream of maximum quotation,
And coupling is opposite in conclusion of the business match-pool, the Business Stream of this conclusion of the business exits ensuing auction；According to idle relay node
Number determines auction wheel number, and offer successively by the independent via node that every wheel is auctioned for institute's Business Stream taking cooperation in need；
If the quotation of maximum traffic stream is more than via node charge, this via node provides cooperation for the Business Stream of maximum quotation；As business
Less than via node charge, then this via node is not involved in the cooperation of epicycle Business Stream to the maximum quotation of stream；Until Business Stream pond and
All Business Streams in idle relay node pool and via node all compare end, complete the distribution of collaboration communication interior joint, described
Channel capacity when each Business Stream direct transfersAccording to formula：Obtain,
Wherein W is channel width, σ2It is channel white noise, P is node transmit power,It is that the channel of source node to destination node declines
Fall coefficient,Represent the source node s in the set of Business Stream in k-th via node interference range of this wheelj, (j=1,2 ...
kj) arrive destination node dj, (j=1,2 ... kj) channel fading coefficient, Business Stream takes the channel capacity after cooperationRoot
According to formula：Obtain, wherein, W is channel strip
Width,For source node si(i=1,2 ... m) arrives destination node dj(j=1,2 ... channel fading coefficient m),Representing should
Take turns the source node s in the set of Business Stream in k-th via node interference rangej, (j=1,2 ... kj) arrive destination node dj,(j
=1,2 ... kj) channel fading coefficient, σ2Represent channel white noise, Represent source node respectively to via node,
To the channel fading coefficient of destination node, the Business Stream in idle relay node interference range direct transfers channel capacity via nodeAccording to formula：Calculate, wherein W is channel width,
Represent source node si(i=1,2 ... m) arrives destination node dj(p represents the transmission work(of node for j=1,2 ... channel fading coefficient m)
Rate,Represent Gk, (k=1,2 ... the source node s in n)j, (j=1,2 ... kj) arrive destination node dj, (j=1,2 ... kj)
Channel fading coefficient, σ2Represent channel white noise.When this via node replaces other Business Streams to forward data, cooperative node is done
Business Stream G in the range of disturbingjChannel capacity according to formula：
Wherein W is channel width,Represent source node si(i=1,2 ... m) arrives destination node djThe channel fading of (j=1,2 ... m)
Coefficient, p represents the transmit power of node,Represent Gk, (k=1,2 ... the source node s in n)j, (j=1,2 ... kj) arrive mesh
Node dj, (j=1,2 ... kj) channel fading coefficient, σ2Represent channel white noise,Represent via node rj(j=1,
2 ... m) to destination node di, (i=1,2 ... kj) channel fading coefficient.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310478195.6A CN103517366B (en) | 2013-10-14 | 2013-10-14 | Relay node distribution method based on green energy saving in cooperative communication |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310478195.6A CN103517366B (en) | 2013-10-14 | 2013-10-14 | Relay node distribution method based on green energy saving in cooperative communication |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103517366A CN103517366A (en) | 2014-01-15 |
| CN103517366B true CN103517366B (en) | 2017-02-15 |
Family
ID=49899186
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310478195.6A Active CN103517366B (en) | 2013-10-14 | 2013-10-14 | Relay node distribution method based on green energy saving in cooperative communication |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103517366B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107436602B (en) * | 2017-07-05 | 2020-06-12 | 深圳大学 | Position control method and device of mobile equipment based on single-bit feedback |
| CN111586792B (en) * | 2020-05-29 | 2022-06-10 | 青岛亿联客信息技术有限公司 | Relay setting method, device, equipment and storage medium of mesh lighting system |
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 |
| CN101588627A (en) * | 2009-06-23 | 2009-11-25 | 北京邮电大学 | Optimal joint distribution method for power of source and relaying nodes in collaborative communication |
-
2013
- 2013-10-14 CN CN201310478195.6A patent/CN103517366B/en active Active
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 |
| CN101588627A (en) * | 2009-06-23 | 2009-11-25 | 北京邮电大学 | Optimal joint distribution method for power of source and relaying nodes in collaborative communication |
Non-Patent Citations (1)
| Title |
|---|
| 绿色节能的分布式中继分配算法;李云，陈权，刘期烈，曹傧;《西安电子科技大学学报》;20131009(第2期);159-164 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103517366A (en) | 2014-01-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112737837B (en) | Method for allocating bandwidth resources of unmanned aerial vehicle cluster under high dynamic network topology | |
| Wang et al. | Quality-optimized joint source selection and power control for wireless multimedia D2D communication using Stackelberg game | |
| Li et al. | A truthful double auction for device-to-device communications in cellular networks | |
| CN104660394B (en) | A kind of frequency spectrum resource allocation method based on utility function and price mechanism | |
| CN107249217A (en) | The Joint Task unloading of ad hoc mobile cloud network and resource allocation methods | |
| WO2023040022A1 (en) | Computing and network collaboration-based distributed computation offloading method in random network | |
| CN106341893A (en) | Resource distribution method and apparatus | |
| CN101827418A (en) | Energy optimization-based cognitive radio multicast routing method | |
| CN110381161B (en) | Game theory-based resource scheduling method in power Internet of things system | |
| CN108009024A (en) | Distributed game task discharging method in Ad-hoc cloud environments | |
| Zhang et al. | A double auction mechanism for virtual resource allocation in SDN-based cellular network | |
| Cui et al. | A virtual network embedding algorithm based on virtual topology connection feature | |
| CN103582105B (en) | A kind of large scale scale heterogeneous cellular network maximizes the optimization method of system benefit | |
| CN108990067A (en) | A kind of energy efficiency controlling method applied to super-intensive heterogeneous network | |
| CN103517366B (en) | Relay node distribution method based on green energy saving in cooperative communication | |
| CN104902574B (en) | A kind of day line options and power distribution method based on efficiency | |
| CN101657019B (en) | Method for allotting idle channels in radio network | |
| Dai et al. | An energy-efficient edge offloading scheme for UAV-assisted internet of things | |
| Ren et al. | Wireless Network Virtualization Resource Sharing Based on Dynamic Resource Allocation Algorithm. | |
| CN104780565B (en) | A kind of fair cooperating relay system of selection | |
| CN107911843B (en) | Node access method for load balancing of energy capture sensor network | |
| CN107820295A (en) | A kind of distributed relay resource allocation methods based on user's request | |
| CN103987119A (en) | Channel resource coloring and distribution method based on double-layer interference graph | |
| Zhou et al. | Joint user grouping, sparse beamforming, and subcarrier allocation for D2D underlaid cache-enabled C-RANs with rate splitting | |
| CN104079333B (en) | The double-deck heterogeneous network down collaboration transmission method of energy efficient |
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 |