CN108092756A - Carrier wave resource allocation method and device based on wideband OFDM power line communication - Google Patents

Carrier wave resource allocation method and device based on wideband OFDM power line communication Download PDF

Info

Publication number
CN108092756A
CN108092756A CN201711430070.0A CN201711430070A CN108092756A CN 108092756 A CN108092756 A CN 108092756A CN 201711430070 A CN201711430070 A CN 201711430070A CN 108092756 A CN108092756 A CN 108092756A
Authority
CN
China
Prior art keywords
mrow
msub
node
bandwidth
cluster head
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
CN201711430070.0A
Other languages
Chinese (zh)
Other versions
CN108092756B (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.)
BEIJING ZHONGCHENHONGCHANG TECHNOLOGY Co Ltd
Original Assignee
BEIJING ZHONGCHENHONGCHANG TECHNOLOGY Co Ltd
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 BEIJING ZHONGCHENHONGCHANG TECHNOLOGY Co Ltd filed Critical BEIJING ZHONGCHENHONGCHANG TECHNOLOGY Co Ltd
Priority to CN201711430070.0A priority Critical patent/CN108092756B/en
Publication of CN108092756A publication Critical patent/CN108092756A/en
Application granted granted Critical
Publication of CN108092756B publication Critical patent/CN108092756B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/0001—Arrangements for dividing the transmission path
    • H04L5/0003—Two-dimensional division
    • H04L5/0005—Time-frequency
    • H04L5/0007—Time-frequency the frequencies being orthogonal, e.g. OFDM(A), DMT
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B3/00—Line transmission systems
    • H04B3/54—Systems for transmission via power distribution lines
    • H04B3/542—Systems for transmission via power distribution lines the information being in digital form
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0058—Allocation criteria
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0058—Allocation criteria
    • H04L5/0071—Allocation based on fairness other than the proportional kind
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0058—Allocation criteria
    • H04L5/0076—Allocation utility-based

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Power Engineering (AREA)
  • Cable Transmission Systems, Equalization Of Radio And Reduction Of Echo (AREA)
  • Nitrogen And Oxygen Or Sulfur-Condensed Heterocyclic Ring Systems (AREA)

Abstract

A kind of carrier wave resource allocation method and device based on wideband OFDM power line communication, including at least one cluster head node CL, each M leafy node LF of cluster head Node connectednessm, first, carrier resource is sold to the M leafy node by cluster head node as the auctioner of carrier resource, and the bandwidth for distributing to cluster head node is Btot；Secondly, the M leafy node obtains the channel of transmission data, leafy node LF as bidder by the carrier resource for the cluster head node that contends with one othermThe bandwidth tender price of submission is bm；Then, cluster head node is according to leafy node LFmThe bandwidth tender price b of submissionmDistribute to leafy node LFmBandwidth Bm.The distribution method and device of the present invention, solves carrier wave distributional equity and maximum resource utilization in wideband OFDM power line communication, and realizes preferable resource-sharing between cluster head node and leafy node so that the utilization rate of carrier wave reaches maximum.

Description

Carrier wave resource allocation method and device based on wideband OFDM power line communication
Technical field
The present invention relates to field of power line communication, and in particular to a kind of carrier resource based on wideband OFDM power line communication Distribution method and device.
Background technology
Power line carrier (Power Line Carrier, PLC) communication technology is a kind of distinctive communication party of electric system Formula, i.e., using existing power line, the method that signal transmission is carried out by carrier system.Now, power line communication is electrically to build Mainstream technology, energy data collection system based on this is widely adopted in many cities of China.Telepak Using multiple technologies such as ad Hoc wireless network, GPRS, CDMA, optical fiber, dialing, local channel road uses RS-485, low pressure narrowband PLC, low pressure broadband PLC, micro power consumption wireless communication etc..Wherein, low-voltage powerline carrier communication is using low-voltage distribution wire as letter Cease a kind of specific communication mode that transmission medium carries out the transmission such as data or voice, the extensive decision of power line network coverage It is with sizable potential utility value.And low pressure broadband power line communication is just widely closed being proposed since it Note.
Broadband power line communication is operated in 1MHz-30MHz frequency ranges, be mainly used in internet high speed access, smart home, Video monitoring etc..Therefore, the concentration release of smart home, intelligent grid construction demand has also promoted power line carrier significantly Development.The maximum feature of broadband power line carrier communication network is that it can directly use existing power infrastructures, Without setting up network again.But due to impedance mismatch at the branched structure and node of power grid so that power line communication channel With significant multipath characteristics, and Orthogonal Frequency Division Multiplexing (Orthogonal Frequency Division Multiplexing OFDM) technology can effectively overcome channel multi-path time delay, and the availability of frequency spectrum is high, suitable for electric line communication system.Therefore, broadband OFDM power line communication networks can easily obtain the unrivaled superiority of other data communication networks.It is inheriting electric power On the basis of the reliability height and coverage rate height of network, there is the advantages that input cost is low, maintenance is simple, scrap build is simple. So with the popularization of this technology, challenge is thereupon.
In wideband OFDM power line communication carrier resource distribution at this stage, there are the bandwidth resources point based on relaying auction Match somebody with somebody, but the program only discusses the situation that a collector corresponds to an ammeter, does not consider that growing ammeter needs The contradiction summed between limited carrier resource.Bandwidth resource allocation also based on VCG auctions, concentrator should be in network A degree of QoS guarantee is provided in terms of fairness, still, based on the method for VCG without considering fair performance, this is in resource allocation It is clearly undesirable in environment.
The content of the invention
The object of the present invention is to provide a kind of carrier wave resource allocation method and device based on wideband OFDM power line communication, Based on the carrier resource sharing method of auction frame, the carrier resource in communication network is maximally utilized.
To solve the above problems, the first aspect of the present invention provides a kind of carrier wave based on wideband OFDM power line communication Resource allocation methods, including at least one cluster head node CL, each M leafy node LF of cluster head Node connectednessm, wherein m ∈ M= { 1,2 ..., M }, M is natural number；Method of the distribution method based on auction, includes the following steps：
1) carrier resource is sold to the M leafy node by cluster head node as the auctioner of carrier resource, is distributed to The bandwidth of cluster head node is Btot；
2) the M leafy node obtains transmission number as bidder by the carrier resource for the cluster head node that contends with one other According to channel, leafy node LFmThe bandwidth tender price of submission is bm, the bmRepresent leafy node LFmIt is expected for oneself data The maximum bandwidth of transmission；
3) cluster head node is according to leafy node LFmThe bandwidth tender price b of submissionmDistribute to leafy node LFmBandwidth be Bm：
Wherein, β is that the bandwidth of cluster head node lays in price, and the cluster head is used for for ensureing the residue of certain spectral bandwidth The data transmission of node.
Further, it is assumed that the bandwidth B that cluster head node retainsremFor：
Wherein BreqIt is the required most small band of quality of service requirement that can ensure cluster head node to concentrator transmission data It is wide；
The setting of the bandwidth deposit price β of the cluster head node will meet above-mentioned formula (2), and band is distributed in cluster head node Width is to the cluster head node minimum bandwidth to be kept after leafy node：
B is the bandwidth tender price vector b=(b of leafy node herein1,…bm…,bM), suffered by be constrained to：
According in formula (3), the β that cluster head node is set meets following formula：
Further, according to Nash Equilibrium principle, leafy node LFmFind optimum bandwidth tender price bmSo that the leaf The income of node reaches maximum, and the income is that the income distributed the bandwidth of the leafy node and brought is given according to cluster head node The difference between the expense of cluster head node is paid with the leafy node；At this point, optimum bandwidth tender price bmSet B be leaf The optimal response set of node, is determined by following formula：
Wherein, rmFor the income for the transmission rate that leafy node per unit bandwidth is realized；kmSubcarrier is obtained for leafy node The spectrum efficiency of data is transmitted afterwards；P is the unit bandwidth price that cluster head node charges to leafy node, defines two extremely The lower and upper limit value of price, i.e. p meets following constraint respectively：
Further, the income R of the leafy nodemIt is as follows：
Rm=rmkmBm (9)
Leafy node LFmPay the expense C of cluster head nodemIt represents as follows：
Cm=pbm (10)
Then for the bandwidth B of given distributionm, leafy node LFmIncome Um(bm) and bmRelation it is as follows：
Um(bm)=Rm[Bm(bm)]-Cm(bm) (11)。
Another aspect provides a kind of carrier resource distributor based on wideband OFDM power line communication, It is characterized in that, including at least one cluster head node CL, each M leafy node LF of cluster head Node connectednessm, wherein m ∈ M=1, 2 ..., M }, M is natural number；Cluster head node is the auctioner of carrier resource, and carrier resource is sold to the M leaf knot Point, the bandwidth for distributing to cluster head node are Btot；
The M leafy node is bidder, and transmission data are obtained by the carrier resource for the cluster head node that contends with one other Channel, leafy node LFmThe bandwidth tender price of submission is bm, the bmRepresent leafy node LFmIt is expected to pass for oneself data Defeated maximum bandwidth；
Cluster head node is according to leafy node LFmThe bandwidth tender price b of submissionmDistribute to leafy node LFmBandwidth be Bm：
Wherein, β is that the bandwidth of cluster head node lays in price, and the cluster head is used for for ensureing the residue of certain spectral bandwidth The data transmission of node.
Further, it is assumed that the bandwidth B that cluster head node retainsremFor：
Wherein BreqIt is the required most small band of quality of service requirement that can ensure cluster head node to concentrator transmission data It is wide；
The setting of the bandwidth deposit price β of the cluster head node will meet above-mentioned formula (2), and band is distributed in cluster head node Width is to the cluster head node minimum bandwidth to be kept after leafy node：
B is the bandwidth tender price vector b=(b of leafy node herein1,…bm…,bM), suffered by be constrained to：
According in formula (3), the β that cluster head node is set meets following formula：
Further, according to Nash Equilibrium principle, leafy node LFmFind optimum bandwidth tender price bmSo that the leaf The income of node reaches maximum, and the income is that the income distributed the bandwidth of the leafy node and brought is given according to cluster head node The difference between the expense of cluster head node is paid with the leafy node；At this point, optimum bandwidth tender price bmSet B be leaf The optimal response set of node, is determined by following formula：
Wherein, rmFor the income for the transmission rate that leafy node per unit bandwidth is realized；kmSubcarrier is obtained for leafy node The spectrum efficiency of data is transmitted afterwards；P is the unit bandwidth price that cluster head node charges to leafy node, defines two extremely The lower and upper limit value of price, i.e. p meets following constraint respectively：
Further, the income R of the leafy nodemIt is as follows：
Rm=rmkmBm (9)
Leafy node LFmPay the expense C of cluster head nodemIt represents as follows：
Cm=pbm (10)
Then for the bandwidth B of given distributionm, leafy node LFmIncome Um(bm) and bmRelation it is as follows：
Um(bm)=Rm[Bm(bm)]-Cm(bm) (11)。
In conclusion the present invention provides a kind of carrier wave resource allocation method and dress based on wideband OFDM power line communication It puts, including at least one cluster head node CL, each M leafy node LF of cluster head Node connectednessm, first, cluster head node is as load Carrier resource is sold to the M leafy node by the auctioner of ripple resource, and the bandwidth for distributing to cluster head node is Btot；Secondly, The M leafy node obtains the channel of transmission data as bidder by the carrier resource for the cluster head node that contends with one other, Leafy node LFmThe bandwidth tender price of submission is bm, the bmRepresent leafy node LFmIt is expected for oneself data transmission most Big bandwidth；Then, cluster head node is according to leafy node LFmThe bandwidth tender price b of submissionmDistribute to leafy node LFmBandwidth Bm。
The above-mentioned technical proposal of the present invention has following beneficial technique effect：
Consider different demands of the ammeter as leafy node, solve the public affairs that carrier wave distributes in wideband OFDM power line communication Levelling and maximum resource utilization, and realize preferable resource-sharing between cluster head node and leafy node so that carrier wave Utilization rate reaches maximum.
Description of the drawings
Fig. 1 is wideband OFDM power line communication scene graph；
Fig. 2 is wideband OFDM power line communication structure chart.
Reference numeral：
1：Concentrator；2：Collector；3：Ammeter；4：Cluster head node；5：Leafy node.
Specific embodiment
Understand to make the object, technical solutions and advantages of the present invention clearer, With reference to embodiment and join According to attached drawing, the present invention is described in more detail.It should be understood that these descriptions are merely illustrative, and it is not intended to limit this hair Bright scope.In addition, in the following description, the description to known features and technology is omitted, to avoid this is unnecessarily obscured The concept of invention.
Wideband OFDM power line communication network is mainly made of concentrator, collector and ammeter node three parts.It is this to open up After flutterring structure, tree topology can be modeled as：Wherein, concentrator is equivalent to major node, that is, the root node set；And collector As cluster head node, ammeter is as leafy node.Communication in system mainly based on uplink business data, is led to by ammeter node Collector is crossed to concentrator report power information, emergency report etc., and a collector corresponds to multiple ammeters, therefore report Data volume it is very big, in order to keep communication quality and growing ammeter demand, therefore, except flexibly and effectively routeing association View, leafy node can be used for the carrier resource of data transmission also most important.Different ammeters can due to the specific requirements of oneself It can need to obtain different carrier resources from cluster head node there.
In view of wideband OFDM power line communication, after cluster head node has obtained certain carrier resource, just face How by these carrier resources to leafy node effectively distributed the problem of.Actual wideband OFDM power line communication scene For model as shown in Figure 1, wherein the first level is concentrator 1, the second level is collector 2, and third layer grade is ammeter 3.
In order to solve the problems, such as the distribution of the carrier resource of wideband OFDM power line communication with sharing, the present invention proposes one kind Based on the carrier resource sharing method of auction frame, target is the carrier resource maximally utilized in communication network.This novelty Distribution method primarily to carrier resource obtained by collector and ammeter is carried out maximizing shared and utilized.
The present invention only considers bandwidth resource allocation problem on the premise of assuming that clustering routing has been chosen, will be in network The carrier resource of cluster head node be divided into subcarrier and carry out auction modeling, by inch of candle distribute to the leaf under the cluster head node Node, wherein：Cluster head node competes with one another for obtaining as the seller (while also serving as auctioner), leafy node as buyer The subcarrier of cluster head node.The carrier resource assignment problem model of wideband OFDM power line communication is as shown in Fig. 2, in a cluster head There are multiple leafy node LF below node CLm。
Each the cluster head node of this network structure suitable for wideband OFDM power line communication whole network, the present invention in only Specific designing scheme is discussed by taking a cluster head node as an example.
Consider the single system shown in above problem model, it is assumed that only one of which cluster head node is responsible for sub- distribution Carrier resource is represented that the bandwidth resources that wherein broadband power line communication system distributes to cluster head node are B by CLtot.With cluster head What node was connected has one group of M leafy node LF for wanting the shared carrier resource for distributing to cluster head nodem, wherein m ∈ M= {1,2,...,M}.In this system, it will be assumed that the whole network can pass through leafy node LFm(m ∈ M) shares cluster head node band Wide a part of Bm(Bm≤Btot) improve the efficiency that frequency spectrum uses.At the same time, cluster head node should also retain a certain amount of band Wide BremTo ensure the performance of their own.The bandwidth constraint retained by cluster head node is provided by equation below：
Wherein BreqBe can ensure cluster head node to concentrator transmission data service quality (QoS) require it is required Minimum bandwidth.Cluster head node CL charges to the leafy node of frequency spectrum with the price of per unit bandwidth p.After the distribution, leaf Child node can carry out data sending in the frequency spectrum distributed, to enhance transmission performance.Leafy node LFmThe income of (m ∈ M) The r of transmission rate can be realized by per unit bandwidthmIt represents.
The problem of carrier resource of wideband OFDM power line communication is distributed with sharing is established as auctioning, wherein leafy node It bids for the bandwidth for distributing to cluster head node.Auction is substantially a kind of non-cooperative game, and wherein player is bidder, Strategy is bid, and it is the function of submitting a tender to distribute and pay.In order to characterize the friendship between cluster head node and multiple leafy nodes Mutual behavior, we have proposed following simple auction rules：
Information：Each leafy node LFm(m ∈ M) knows the income r of its achievable transmission rate of per unit bandwidthm, and And also know that it obtains the spectrum efficiency k of transmission data after subcarrierm.Cluster head node is in all leaf knots of forward direction of auction beginning Point announces unit bandwidth price p, wherein p ＞ 0.Cluster head node will submit a deposit price β to ensure certain frequency spectrum simultaneously Residue carrys out the data transmission for oneself.So the setting of β needs to meet formula (1).Cluster head node will be kept after the distribution Minimum bandwidth provide it is as follows：
B is the bid vector of the i.e. leafy node of criterion of bidding herein, and the constraints of scope can define afterwards.Cluster head Node CL can be total (i.e. M) by obtaining leafy node before auction starts, and the safest strategy of cluster head node is β is set so thatFrom (2), we obtain under this strategy, and the β that cluster head node should be set meets Following formula：
It submits a tender：First, the vectorial b=(b that criterion is the bid comprising leafy node that bid are defined1,…bm…,bM), institute It is constrained to be：
Leafy node LFm(m ∈ M) submits bid bm, represent that leafy node it is expected the maximum belt for oneself data transmission It is wide.
Distribution：Cluster head node distributes a B according to the following formula to a leafy nodemBandwidth：
Payment：Leafy node LFmThe expense that (m ∈ M) pays cluster head node represents：
Cm=pbm (6)
Income is cleared：The bandwidth of given distribution, leafy node LFmThe income of (m ∈ M) is as follows：
Rm=rmkmBm (7)
Leafy node LFm(m ∈ M) is by selecting the criterion b that bidsmTo maximize its income, income and bmRelation such as Shown in lower：
Um(bm)=Rm[Bm(bm)]-Cm(bm) (8)
Auction process is modeled as a non-cooperative game, desired the result is that reaching Nash Equilibrium, you can to find optimal Criterion of bidding bmSo that leafy node LFmThe income of (m ∈ M) reaches maximum.The set of criteria B that bids of definition at this time is leaf The optimal response set of node：
Unit bandwidth price p simultaneously, defines two extreme prices, i.e. the bound scope of p, and value meets following constraint：
On the premise of (10) and (11) formula is met, the optimal response function of existence anduniquess：
The computing of bracket is existing knowwhy in above formula, and concrete operation is with reference to as follows：
In conclusion a kind of above-mentioned carrier wave resource allocation method based on wideband OFDM power line communication provided by the invention And device, it solves carrier wave distributional equity and maximum resource utilization in wideband OFDM power line communication, and realizes cluster Preferable resource-sharing between head node and leafy node so that the utilization rate of carrier wave reaches maximum.
It should be appreciated that the above-mentioned specific embodiment of the present invention is used only for exemplary illustration or explains the present invention's Principle, without being construed as limiting the invention.Therefore, that is done without departing from the spirit and scope of the present invention is any Modification, equivalent substitution, improvement etc., should all be included in the protection scope of the present invention.In addition, appended claims purport of the present invention Covering the whole variations fallen into scope and border or this scope and the equivalents on border and repairing Change example.

Claims (8)

1. a kind of carrier wave resource allocation method based on wideband OFDM power line communication, which is characterized in that including at least one cluster Head node CL, each M leafy node LF of cluster head Node connectednessm, wherein m ∈ M={ 1,2 ..., M }, M is natural number；This point Method of the method for completing the square based on auction, includes the following steps：
1) carrier resource is sold to the M leafy node by cluster head node as the auctioner of carrier resource, distributes to cluster head The bandwidth of node is Btot；
2) the M leafy node obtains transmission data as bidder by the carrier resource for the cluster head node that contends with one other Channel, leafy node LFmThe bandwidth tender price of submission is bm, the bmRepresent leafy node LFmIt is expected for oneself data transmission Maximum bandwidth；
3) cluster head node is according to leafy node LFmThe bandwidth tender price b of submissionmDistribute to leafy node LFmBandwidth be Bm：
<mrow> <msub> <mi>B</mi> <mi>m</mi> </msub> <mo>=</mo> <mfrac> <msub> <mi>b</mi> <mi>m</mi> </msub> <mrow> <munder> <mo>&amp;Sigma;</mo> <mrow> <mi>j</mi> <mo>&amp;Element;</mo> <mi>M</mi> </mrow> </munder> <msub> <mi>b</mi> <mi>j</mi> </msub> <mo>+</mo> <mi>&amp;beta;</mi> </mrow> </mfrac> <msub> <mi>B</mi> <mrow> <mi>t</mi> <mi>o</mi> <mi>t</mi> </mrow> </msub> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>1</mn> <mo>)</mo> </mrow> </mrow>
Wherein, β is that the bandwidth of cluster head node lays in price, and the leader cluster node is used for for ensureing the residue of certain spectral bandwidth Data transmission.
2. according to the method described in claim 1, it is characterized in that：
Assuming that the bandwidth B that cluster head node retainsremFor：
<mrow> <mo>(</mo> <msub> <mi>B</mi> <mrow> <mi>r</mi> <mi>e</mi> <mi>m</mi> </mrow> </msub> <mo>=</mo> <msub> <mi>B</mi> <mrow> <mi>t</mi> <mi>o</mi> <mi>t</mi> </mrow> </msub> <mo>-</mo> <munder> <mo>&amp;Sigma;</mo> <mrow> <mi>m</mi> <mo>&amp;Element;</mo> <mi>M</mi> </mrow> </munder> <msub> <mi>B</mi> <mi>m</mi> </msub> <mo>)</mo> <mo>&amp;GreaterEqual;</mo> <msub> <mi>B</mi> <mrow> <mi>r</mi> <mi>e</mi> <mi>q</mi> </mrow> </msub> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>2</mn> <mo>)</mo> </mrow> </mrow>
Wherein BreqIt is the required minimum bandwidth of quality of service requirement that can ensure cluster head node to concentrator transmission data；
The setting of the bandwidth deposit price β of the cluster head node will meet above-mentioned formula (2), be given in cluster head node bandwidth allocation The cluster head node minimum bandwidth to be kept is after leafy node：
<mrow> <munder> <mi>min</mi> <mi>b</mi> </munder> <msub> <mi>B</mi> <mrow> <mi>r</mi> <mi>e</mi> <mi>m</mi> </mrow> </msub> <mo>=</mo> <msub> <mi>B</mi> <mrow> <mi>r</mi> <mi>e</mi> <mi>q</mi> </mrow> </msub> <mo>=</mo> <mfrac> <mrow> <msub> <mi>&amp;beta;B</mi> <mrow> <mi>t</mi> <mi>o</mi> <mi>t</mi> </mrow> </msub> </mrow> <mrow> <msub> <mi>MB</mi> <mrow> <mi>t</mi> <mi>o</mi> <mi>t</mi> </mrow> </msub> <mo>+</mo> <mi>&amp;beta;</mi> </mrow> </mfrac> <mo>&gt;</mo> <mn>0</mn> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>3</mn> <mo>)</mo> </mrow> </mrow>
B is the bandwidth tender price vector b=(b of leafy node herein1,…bm…,bM), suffered by be constrained to：
<mrow> <mi>b</mi> <mo>&amp;Element;</mo> <msub> <mi>b</mi> <mi>R</mi> </msub> <mo>=</mo> <mo>{</mo> <mi>b</mi> <mo>|</mo> <mn>0</mn> <mo>&amp;le;</mo> <msub> <mi>b</mi> <mi>m</mi> </msub> <mo>&amp;le;</mo> <msub> <mi>B</mi> <mrow> <mi>t</mi> <mi>o</mi> <mi>t</mi> </mrow> </msub> <mo>,</mo> <mo>&amp;ForAll;</mo> <mi>m</mi> <mo>&amp;Element;</mo> <mi>M</mi> <mo>}</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>4</mn> <mo>)</mo> </mrow> </mrow>
According in formula (3), the β that cluster head node is set meets following formula：
<mrow> <mi>&amp;beta;</mi> <mo>=</mo> <mfrac> <mrow> <msub> <mi>B</mi> <mrow> <mi>r</mi> <mi>e</mi> <mi>q</mi> </mrow> </msub> <msub> <mi>MB</mi> <mrow> <mi>t</mi> <mi>o</mi> <mi>t</mi> </mrow> </msub> </mrow> <mrow> <msub> <mi>B</mi> <mrow> <mi>t</mi> <mi>o</mi> <mi>t</mi> </mrow> </msub> <mo>-</mo> <msub> <mi>B</mi> <mrow> <mi>r</mi> <mi>e</mi> <mi>q</mi> </mrow> </msub> </mrow> </mfrac> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>5</mn> <mo>)</mo> </mrow> <mo>.</mo> </mrow>
3. according to the method described in claim 2, it is characterized in that：
According to Nash Equilibrium principle, leafy node LFmFind optimum bandwidth tender price bmSo that the income of the leafy node reaches Maximum, the income are that income and the leafy node pair for distributing that the bandwidth of the leafy node is brought are given according to cluster head node To the difference between the expense of cluster head node；At this point, optimum bandwidth tender price bmSet B be leafy node optimal response Set, is determined by following formula：
<mrow> <mi>B</mi> <mo>=</mo> <msubsup> <mrow> <mo>&amp;lsqb;</mo> <msqrt> <mfrac> <mrow> <msub> <mi>r</mi> <mi>m</mi> </msub> <msub> <mi>k</mi> <mi>m</mi> </msub> <msub> <mi>B</mi> <mrow> <mi>t</mi> <mi>o</mi> <mi>t</mi> </mrow> </msub> <mrow> <mo>(</mo> <munder> <mo>&amp;Sigma;</mo> <mrow> <mi>j</mi> <mo>&amp;NotEqual;</mo> <mi>m</mi> </mrow> </munder> <msub> <mi>b</mi> <mi>j</mi> </msub> <mo>+</mo> <mi>&amp;beta;</mi> <mo>)</mo> </mrow> </mrow> <mi>p</mi> </mfrac> </msqrt> <mo>-</mo> <mrow> <mo>(</mo> <munder> <mo>&amp;Sigma;</mo> <mrow> <mi>j</mi> <mo>&amp;NotEqual;</mo> <mi>m</mi> </mrow> </munder> <msub> <mi>b</mi> <mi>j</mi> </msub> <mo>+</mo> <mi>&amp;beta;</mi> <mo>)</mo> </mrow> <mo>&amp;rsqb;</mo> </mrow> <mn>0</mn> <msub> <mi>B</mi> <mrow> <mi>t</mi> <mi>o</mi> <mi>t</mi> </mrow> </msub> </msubsup> <mo>,</mo> <mn>0</mn> <mo>&amp;le;</mo> <msub> <mi>b</mi> <mi>j</mi> </msub> <mo>&amp;le;</mo> <msub> <mi>B</mi> <mrow> <mi>t</mi> <mi>o</mi> <mi>t</mi> </mrow> </msub> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>6</mn> <mo>)</mo> </mrow> </mrow>
Wherein, rmFor the income for the transmission rate that leafy node per unit bandwidth is realized；kmIt is passed after obtaining subcarrier for leafy node The spectrum efficiency of transmission of data；P is the unit bandwidth price that cluster head node charges to leafy node, defines two extreme valencys The lower and upper limit value of lattice, i.e. p meets following constraint respectively：
<mrow> <munder> <msub> <mi>p</mi> <mi>m</mi> </msub> <mo>&amp;OverBar;</mo> </munder> <mo>=</mo> <mfrac> <mrow> <msub> <mi>r</mi> <mi>m</mi> </msub> <msub> <mi>k</mi> <mi>m</mi> </msub> <msub> <mi>B</mi> <mrow> <mi>t</mi> <mi>o</mi> <mi>t</mi> </mrow> </msub> <mo>{</mo> <mrow> <mo>(</mo> <mi>M</mi> <mo>-</mo> <mn>1</mn> <mo>)</mo> </mrow> <msub> <mi>B</mi> <mrow> <mi>t</mi> <mi>o</mi> <mi>t</mi> </mrow> </msub> <mo>+</mo> <mi>&amp;beta;</mi> <mo>}</mo> </mrow> <msup> <mrow> <mo>(</mo> <msub> <mi>MB</mi> <mrow> <mi>t</mi> <mi>o</mi> <mi>t</mi> </mrow> </msub> <mo>+</mo> <mi>&amp;beta;</mi> <mo>)</mo> </mrow> <mn>2</mn> </msup> </mfrac> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>7</mn> <mo>)</mo> </mrow> </mrow>
<mrow> <mover> <msub> <mi>p</mi> <mi>m</mi> </msub> <mo>&amp;OverBar;</mo> </mover> <mo>=</mo> <mfrac> <mrow> <msub> <mi>r</mi> <mi>m</mi> </msub> <msub> <mi>k</mi> <mi>m</mi> </msub> <msub> <mi>B</mi> <mrow> <mi>t</mi> <mi>o</mi> <mi>t</mi> </mrow> </msub> </mrow> <mi>&amp;beta;</mi> </mfrac> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>8</mn> <mo>)</mo> </mrow> <mo>.</mo> </mrow>
4. according to the method described in claim 3, it is characterized in that：
The income R of the leafy nodemIt is as follows：
Rm=rmkmBm (9)
Leafy node LFmPay the expense C of cluster head nodemIt represents as follows：
Cm=pbm (10)
Then for the bandwidth B of given distributionm, leafy node LFmIncome Um(bm) and bmRelation it is as follows：
Um(bm)=Rm[Bm(bm)]-Cm(bm) (11)。
5. a kind of carrier resource distributor based on wideband OFDM power line communication, which is characterized in that including at least one cluster Head node CL, each M leafy node LF of cluster head Node connectednessm, wherein m ∈ M={ 1,2 ..., M }, M is natural number；
Cluster head node is the auctioner of carrier resource, and carrier resource is sold to the M leafy node, distributes to cluster head node Bandwidth be Btot；
The M leafy node is bidder, and the letter of transmission data is obtained by the carrier resource for the cluster head node that contends with one other Road, leafy node LFmThe bandwidth tender price of submission is bm, the bmRepresent leafy node LFmIt is expected for oneself data transmission Maximum bandwidth；
Cluster head node is according to leafy node LFmThe bandwidth tender price b of submissionmDistribute to leafy node LFmBandwidth be Bm：
<mrow> <msub> <mi>B</mi> <mi>m</mi> </msub> <mo>=</mo> <mfrac> <msub> <mi>b</mi> <mi>m</mi> </msub> <mrow> <munder> <mo>&amp;Sigma;</mo> <mrow> <mi>j</mi> <mo>&amp;Element;</mo> <mi>M</mi> </mrow> </munder> <msub> <mi>b</mi> <mi>j</mi> </msub> <mo>+</mo> <mi>&amp;beta;</mi> </mrow> </mfrac> <msub> <mi>B</mi> <mrow> <mi>t</mi> <mi>o</mi> <mi>t</mi> </mrow> </msub> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>1</mn> <mo>)</mo> </mrow> </mrow>
Wherein, β is that the bandwidth of cluster head node lays in price, and the leader cluster node is used for for ensureing the residue of certain spectral bandwidth Data transmission.
6. device according to claim 5, it is characterised in that：
Assuming that the bandwidth B that cluster head node retainsremFor：
<mrow> <mo>(</mo> <msub> <mi>B</mi> <mrow> <mi>r</mi> <mi>e</mi> <mi>m</mi> </mrow> </msub> <mo>=</mo> <msub> <mi>B</mi> <mrow> <mi>t</mi> <mi>o</mi> <mi>t</mi> </mrow> </msub> <mo>-</mo> <munder> <mo>&amp;Sigma;</mo> <mrow> <mi>m</mi> <mo>&amp;Element;</mo> <mi>M</mi> </mrow> </munder> <msub> <mi>B</mi> <mi>m</mi> </msub> <mo>)</mo> <mo>&amp;GreaterEqual;</mo> <msub> <mi>B</mi> <mrow> <mi>r</mi> <mi>e</mi> <mi>q</mi> </mrow> </msub> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>2</mn> <mo>)</mo> </mrow> </mrow>
Wherein BreqIt is the required minimum bandwidth of quality of service requirement that can ensure cluster head node to concentrator transmission data；
The setting of the bandwidth deposit price β of the cluster head node will meet above-mentioned formula (2), be given in cluster head node bandwidth allocation The cluster head node minimum bandwidth to be kept is after leafy node：
<mrow> <munder> <mi>min</mi> <mi>b</mi> </munder> <msub> <mi>B</mi> <mrow> <mi>r</mi> <mi>e</mi> <mi>m</mi> </mrow> </msub> <mo>=</mo> <msub> <mi>B</mi> <mrow> <mi>r</mi> <mi>e</mi> <mi>q</mi> </mrow> </msub> <mo>=</mo> <mfrac> <mrow> <msub> <mi>&amp;beta;B</mi> <mrow> <mi>t</mi> <mi>o</mi> <mi>t</mi> </mrow> </msub> </mrow> <mrow> <msub> <mi>MB</mi> <mrow> <mi>t</mi> <mi>o</mi> <mi>t</mi> </mrow> </msub> <mo>+</mo> <mi>&amp;beta;</mi> </mrow> </mfrac> <mo>&gt;</mo> <mn>0</mn> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>3</mn> <mo>)</mo> </mrow> </mrow>
B is the bandwidth tender price vector b=(b of leafy node herein1,…bm…,bM), suffered by be constrained to：
<mrow> <mi>b</mi> <mo>&amp;Element;</mo> <msub> <mi>b</mi> <mi>R</mi> </msub> <mo>=</mo> <mo>{</mo> <mi>b</mi> <mo>|</mo> <mn>0</mn> <mo>&amp;le;</mo> <msub> <mi>b</mi> <mi>m</mi> </msub> <mo>&amp;le;</mo> <msub> <mi>B</mi> <mrow> <mi>t</mi> <mi>o</mi> <mi>t</mi> </mrow> </msub> <mo>,</mo> <mo>&amp;ForAll;</mo> <mi>m</mi> <mo>&amp;Element;</mo> <mi>M</mi> <mo>}</mo> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>4</mn> <mo>)</mo> </mrow> </mrow>
According in formula (3), the β that cluster head node is set meets following formula：
<mrow> <mi>&amp;beta;</mi> <mo>=</mo> <mfrac> <mrow> <msub> <mi>B</mi> <mrow> <mi>r</mi> <mi>e</mi> <mi>q</mi> </mrow> </msub> <msub> <mi>MB</mi> <mrow> <mi>t</mi> <mi>o</mi> <mi>t</mi> </mrow> </msub> </mrow> <mrow> <msub> <mi>B</mi> <mrow> <mi>t</mi> <mi>o</mi> <mi>t</mi> </mrow> </msub> <mo>-</mo> <msub> <mi>B</mi> <mrow> <mi>r</mi> <mi>e</mi> <mi>q</mi> </mrow> </msub> </mrow> </mfrac> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>5</mn> <mo>)</mo> </mrow> <mo>.</mo> </mrow>
7. device according to claim 6, it is characterised in that：
According to Nash Equilibrium principle, leafy node LFmFind optimum bandwidth tender price bmSo that the income of the leafy node reaches Maximum, the income are that income and the leafy node pair for distributing that the bandwidth of the leafy node is brought are given according to cluster head node To the difference between the expense of cluster head node；At this point, optimum bandwidth tender price bmSet B be leafy node optimal response Set, is determined by following formula：
<mrow> <mi>B</mi> <mo>=</mo> <msubsup> <mrow> <mo>&amp;lsqb;</mo> <msqrt> <mfrac> <mrow> <msub> <mi>r</mi> <mi>m</mi> </msub> <msub> <mi>k</mi> <mi>m</mi> </msub> <msub> <mi>B</mi> <mrow> <mi>t</mi> <mi>o</mi> <mi>t</mi> </mrow> </msub> <mrow> <mo>(</mo> <munder> <mo>&amp;Sigma;</mo> <mrow> <mi>j</mi> <mo>&amp;NotEqual;</mo> <mi>m</mi> </mrow> </munder> <msub> <mi>b</mi> <mi>j</mi> </msub> <mo>+</mo> <mi>&amp;beta;</mi> <mo>)</mo> </mrow> </mrow> <mi>p</mi> </mfrac> </msqrt> <mo>-</mo> <mrow> <mo>(</mo> <munder> <mo>&amp;Sigma;</mo> <mrow> <mi>j</mi> <mo>&amp;NotEqual;</mo> <mi>m</mi> </mrow> </munder> <msub> <mi>b</mi> <mi>j</mi> </msub> <mo>+</mo> <mi>&amp;beta;</mi> <mo>)</mo> </mrow> <mo>&amp;rsqb;</mo> </mrow> <mn>0</mn> <msub> <mi>B</mi> <mrow> <mi>t</mi> <mi>o</mi> <mi>t</mi> </mrow> </msub> </msubsup> <mo>,</mo> <mn>0</mn> <mo>&amp;le;</mo> <msub> <mi>b</mi> <mi>j</mi> </msub> <mo>&amp;le;</mo> <msub> <mi>B</mi> <mrow> <mi>t</mi> <mi>o</mi> <mi>t</mi> </mrow> </msub> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>6</mn> <mo>)</mo> </mrow> </mrow>
Wherein, rmFor the income for the transmission rate that leafy node per unit bandwidth is realized；kmIt is passed after obtaining subcarrier for leafy node The spectrum efficiency of transmission of data；P is the unit bandwidth price that cluster head node charges to leafy node, defines two extreme valencys The lower and upper limit value of lattice, i.e. p meets following constraint respectively：
<mrow> <munder> <msub> <mi>p</mi> <mi>m</mi> </msub> <mo>&amp;OverBar;</mo> </munder> <mo>=</mo> <mfrac> <mrow> <msub> <mi>r</mi> <mi>m</mi> </msub> <msub> <mi>k</mi> <mi>m</mi> </msub> <msub> <mi>B</mi> <mrow> <mi>t</mi> <mi>o</mi> <mi>t</mi> </mrow> </msub> <mo>{</mo> <mrow> <mo>(</mo> <mi>M</mi> <mo>-</mo> <mn>1</mn> <mo>)</mo> </mrow> <msub> <mi>B</mi> <mrow> <mi>t</mi> <mi>o</mi> <mi>t</mi> </mrow> </msub> <mo>+</mo> <mi>&amp;beta;</mi> <mo>}</mo> </mrow> <msup> <mrow> <mo>(</mo> <msub> <mi>MB</mi> <mrow> <mi>t</mi> <mi>o</mi> <mi>t</mi> </mrow> </msub> <mo>+</mo> <mi>&amp;beta;</mi> <mo>)</mo> </mrow> <mn>2</mn> </msup> </mfrac> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>7</mn> <mo>)</mo> </mrow> </mrow>
<mrow> <mover> <msub> <mi>p</mi> <mi>m</mi> </msub> <mo>&amp;OverBar;</mo> </mover> <mo>=</mo> <mfrac> <mrow> <msub> <mi>r</mi> <mi>m</mi> </msub> <msub> <mi>k</mi> <mi>m</mi> </msub> <msub> <mi>B</mi> <mrow> <mi>t</mi> <mi>o</mi> <mi>t</mi> </mrow> </msub> </mrow> <mi>&amp;beta;</mi> </mfrac> <mo>-</mo> <mo>-</mo> <mo>-</mo> <mrow> <mo>(</mo> <mn>8</mn> <mo>)</mo> </mrow> <mo>.</mo> </mrow>
8. device according to claim 7, it is characterised in that：
The income R of the leafy nodemIt is as follows：
Rm=rmkmBm (9)
Leafy node LFmPay the expense C of cluster head nodemIt represents as follows：
Cm=pbm (10)
Then for the bandwidth B of given distributionm, leafy node LFmIncome Um(bm) and bmRelation it is as follows：
Um(bm)=Rm[Bm(bm)]-Cm(bm) (11)。
CN201711430070.0A 2017-12-26 2017-12-26 Carrier resource allocation method and device based on broadband OFDM power line communication Active CN108092756B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201711430070.0A CN108092756B (en) 2017-12-26 2017-12-26 Carrier resource allocation method and device based on broadband OFDM power line communication

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201711430070.0A CN108092756B (en) 2017-12-26 2017-12-26 Carrier resource allocation method and device based on broadband OFDM power line communication

Publications (2)

Publication Number Publication Date
CN108092756A true CN108092756A (en) 2018-05-29
CN108092756B CN108092756B (en) 2021-07-09

Family

ID=62179151

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201711430070.0A Active CN108092756B (en) 2017-12-26 2017-12-26 Carrier resource allocation method and device based on broadband OFDM power line communication

Country Status (1)

Country Link
CN (1) CN108092756B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109962874A (en) * 2019-04-09 2019-07-02 北京中宸泓昌科技有限公司 A kind of method and system of burst frame detection and Timing Synchronization based on Wi-SUN system

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080298284A1 (en) * 2007-05-31 2008-12-04 International Business Machines Corporation Market-driven variable price offerings for bandwidth-sharing ad hoc networks
US20110029347A1 (en) * 2009-07-31 2011-02-03 Kozat Ulas C Method for wireless network virtualization through sequential auctions and conjectural pricing
CN102065481A (en) * 2010-11-26 2011-05-18 西安电子科技大学 Auction theory-based power distribution method in relay communication
CN103415074A (en) * 2013-07-12 2013-11-27 南京邮电大学 Auction theory-based wireless cooperative relaying network relaying bandwidth resource allocation method
US20160087912A1 (en) * 2014-09-24 2016-03-24 International Business Machines Corporation Dynamic storage bandwidth allocation
CN107370616A (en) * 2017-03-10 2017-11-21 南京航空航天大学 5G cellular network virtual resources distribution mechanisms based on combination Double Auction
CN107484174A (en) * 2017-07-10 2017-12-15 广东工业大学 The double-deck auction research of cooperative cognitive radio network resources

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080298284A1 (en) * 2007-05-31 2008-12-04 International Business Machines Corporation Market-driven variable price offerings for bandwidth-sharing ad hoc networks
US20110029347A1 (en) * 2009-07-31 2011-02-03 Kozat Ulas C Method for wireless network virtualization through sequential auctions and conjectural pricing
CN102065481A (en) * 2010-11-26 2011-05-18 西安电子科技大学 Auction theory-based power distribution method in relay communication
CN103415074A (en) * 2013-07-12 2013-11-27 南京邮电大学 Auction theory-based wireless cooperative relaying network relaying bandwidth resource allocation method
US20160087912A1 (en) * 2014-09-24 2016-03-24 International Business Machines Corporation Dynamic storage bandwidth allocation
CN107370616A (en) * 2017-03-10 2017-11-21 南京航空航天大学 5G cellular network virtual resources distribution mechanisms based on combination Double Auction
CN107484174A (en) * 2017-07-10 2017-12-15 广东工业大学 The double-deck auction research of cooperative cognitive radio network resources

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
JIANWEI HUANG: "Auction-based spectrum sharing", 《MOBILE NETWORKS AND APPLICATIONS》 *
张津华: "基于拍卖理论的无线协作中继网络资源分配算法研究", 《中国优秀硕士学位论文全文数据库工程科技辑》 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109962874A (en) * 2019-04-09 2019-07-02 北京中宸泓昌科技有限公司 A kind of method and system of burst frame detection and Timing Synchronization based on Wi-SUN system

Also Published As

Publication number Publication date
CN108092756B (en) 2021-07-09

Similar Documents

Publication Publication Date Title
CN102291722B (en) Spectrum sharing method based on auction theory and compensation stimulation
CN104639307B (en) Resource allocation methods in wireless network virtualization
CN103929819B (en) Cognitive radio network slave user combination price-fixing and resource distributing method
CN101662327B (en) Multiple frequency band share method of cognitive radio
CN107370616A (en) 5G cellular network virtual resources distribution mechanisms based on combination Double Auction
CN102316465A (en) Frequency spectrum gaming distribution method in cognitive wireless network
CN106341893A (en) Resource distribution method and apparatus
CN103281703A (en) Cognitive radio network spectrum allocation method based on game theory
CN108990067A (en) A kind of energy efficiency controlling method applied to super-intensive heterogeneous network
CN107124756A (en) Fair Poewr control method based on Stackelberg games in a kind of cognition network
CN107249190A (en) Cell micro-base station spectrum auction method based on neutral net and temporal evolution
CN106230737B (en) A kind of software definition network-building method of state aware
CN104639631B (en) SDN resource transaction methods based on MAS price negotiations
CN109089266B (en) Multi-channel dynamic spectrum allocation method for preventing Sybil attack and computer program
CN108092756A (en) Carrier wave resource allocation method and device based on wideband OFDM power line communication
CN107483355A (en) The online scene low bandwidth overhead flow scheduling scheme at data-oriented center
CN110519697A (en) A kind of D2D user&#39;s communication pattern selection method based on position limitation and VCG auction
CN104796992A (en) Bandwidth allocation and pricing method of heterogeneous network
CN109413617A (en) Car networking transmission method based on small cell assistance
CN115907988A (en) Frequency spectrum block chain transaction mechanism and transaction method based on assistance of wireless environment diagram
CN107483365A (en) A kind of power telecom network maximization of utility resource allocation methods of QoS drivings
CN107733630A (en) A kind of carrier wave resource allocation method and device based on broadband PLC
CN112235838B (en) Multi-mode terminal self-adaptive switching method in power wireless heterogeneous network
CN102413470A (en) Channel auction method
CN106412921B (en) The grouping spectrum auction method of heterogeneous network comprising Home eNodeB

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant