CN103906072B - The implementation method of nearly excellent frequency spectrum resource dynamically distributes based on index mechanism - Google Patents
The implementation method of nearly excellent frequency spectrum resource dynamically distributes based on index mechanism Download PDFInfo
- Publication number
- CN103906072B CN103906072B CN201410168440.8A CN201410168440A CN103906072B CN 103906072 B CN103906072 B CN 103906072B CN 201410168440 A CN201410168440 A CN 201410168440A CN 103906072 B CN103906072 B CN 103906072B
- Authority
- CN
- China
- Prior art keywords
- user
- channel
- rent
- group
- grouping
- 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
Abstract
A kind of implementation method of the nearly excellent frequency spectrum resource dynamically distributes based on index mechanism of wireless communication technology field, corresponding conflict graph is made to the value of wireless network node by collecting the channel of channel number that user submitted and each user and user grouping is carried out, then utilization index mechanism gives in each user grouping the user for obtaining channel to determine that rent is used, the final rent for obtaining channel user in each user grouping again determines the user of the acquisition channel in group, then the last user grouping for obtaining channel is determined according to the number of the number of channel and user grouping.The present invention is directed to channel resource management problem in wireless network; difference privacy is incorporated, by the way of index mechanism is to determining that rent is used in group, the purpose of protection privacy of user is reached; it is simultaneously approximate to maximize overall income, certain guarantee is provided for overall income.
Description
Technical field
The present invention relates to a kind of method in radio network technique field, and in particular to a kind of difference privacy that combines
Frequency spectrum resource allocation method.
Background technology
With the fast development of Wireless Telecom Equipment, shared channel resources turn into a kind of scarce resource in network.In order to
The data transfer on Radio Link is adapted to, follow-on wireless application needs more channels to provide service for it.But pass
The method of channel management of system causes emerging wireless network application to face the predicament that channel resource is used.Federal Communication committee member
Channel resource is all divided into multiple wave bands and is licensed to some region, particular business group by meeting and Chinese radio administration
Knit or wireless application is used.Traditional Channel distribution mode can not meet the channel resource demand increased rapidly.One
Aspect, the overwhelming majority is allocated the frequency range of radio communication, and the allocated wireless channel cannot be utilized sufficiently；
On the other hand, channel allocation mechanism at this stage does not account for the overall income of system mostly, and this causes the overall receipts of system
Benefit is impaired, by influence available bandwidth and end-to-end handling capacity.It in addition, there will be channel distribution and do not account for channel to wireless network
The privacy of the value of node, this can equally influence available bandwidth and end to end handling capacity.
Difference privacy is proposed to solve the individual privacy protection problem in database first.Answered first in 2007
Use in Mechanism Design, be used to take precautions against many people and gang up to destroy others' interests.From first Application in 2007, difference privacy was not
Have be applied to be network frequency spectrum resource distribution in improve the handling capacity of available bandwidth and network end-to-end.
The content of the invention
The deficiency that the present invention exists for existing channel distribution mechanism, proposes a kind of nearly excellent frequency spectrum money based on index mechanism
The implementation method of source dynamically distributes, is determined, simultaneously by the way that difference privacy is introduced into guard channel to the value of wireless network node
Overall income is taken into account into raising distribution and carries out incentive so that exponential distribution is deferred to the expense for obtaining channel user, made
Obtain overall income to maximize, while meeting difference privacy.While overall income is approximately maximized, channel pair is not only protected
The value privacy of wireless network node, while providing certain guarantee to overall income.The present invention is suitable for wireless network
Channel resource allocation problem, especially to channel to the exigent system of the privacy of the value of wireless network node have compared with
Good secret protection effect.
The present invention is achieved by the following technical solutions, and the present invention comprises the following steps：
The first step, the user as demand channel submit itself required for channel number and channel to wireless network node
Value.
Described channel maintains secrecy each other to the value of wireless network node for each user, and user is reasonable
's.
Valency of the channel of second step, the channel number n that collection user is submitted and each user to wireless network node
Value b1, b2... bn, according to each user position and its signal to noise ratio, each user, any a line are represented with a point
The conflicting between two users is represented, i.e., cannot send or receive simultaneously signal, make corresponding conflict graph；Last root
User is divided into λ group, i.e. G={ g with group technology according to conflict graph1、g2……、gλ}。
Described group technology includes but is not limited to coloring algorithm, is specially：By the conflict graph drawn, according to dyeing
Algorithm assigns to the user being connected each other without side in one group；The problem of grouping algorithm is related to is np complete problem,
Therefore the mechanism is applied to any one grouping algorithm.
3rd step, utilization index mechanismTo each user grouping gκThe middle user for obtaining channel determines that rent is used, tool
Body step is：
3.1) value P of the channel to wireless network node of all users in group is listedκ={ bi|i∈gκ, wherein：User
Value set of the channel of submission to wireless network node
3.2) P is chosenκIn group of all values to calculate the group respectively in income, i.e., to rent p ∈ Pk, have：
Target：Wherein：gk∈ G, p ∈ Pk
Restrictive condition：p∈Pk(1)；
3.3) income in the group according to corresponding to each possible rent p obtained in 3.2)Carry out equal
One changes, and is converted into the probability that each possible rent is chosen as final rentThen according to the probability
Determine that final rent is used, the rent for finally giving the user that channel is obtained in each user grouping is used
Described index mechanism refers to：Each possible rent is chosen as the possibility and p sheets of last rent with p
Income exponentially increases in corresponding group of body, i.e.,：
4th step, the final rent for obtaining channel user determined by the 3rd step in each user grouping are usedReally
Determine the user of the acquisition channel in group, then determined finally to obtain channel according to the number of the number of channel and user grouping
User grouping, specific steps include：
4.1) the corresponding m channel of λ user grouping obtained according to second step is judged：As λ≤m, all λ
User grouping is the user grouping for obtaining channel, otherwise will obtain the use of channel according to income in group come λ group before determining
Family is grouped；
4.2) according to each user grouping gKIncomeSize, by user point
Group rearrangement, i.e. G ':g‘1≤g‘2≤…≤g’K≤…≤g’λ；
4.3) as the user grouping g for obtaining channelKInterior final rent isThen according to the reasonability of user, i.e.,
User will not pay carrys out leased channel to the expense of the value of wireless network node more than oneself channel, therefore for all i ∈
gκ, whenThen user i obtains the channel, and otherwise user i can not obtain channel；So that it is determined that finally obtaining the use of channel
Family.
Technique effect
Compared with prior art, its advantage includes the present invention：It can be effectively protected and participate in frequency spectrum resource distribution system
The channel of user is to the value privacy of wireless network node, and the user for taking precautions against fraction mutually gangs up, so as to avoid overall income
By compared with major injury；Secondly, this method can approximately maximize overall income, and providing one to overall income preferably protects
Barrier.
Brief description of the drawings
Fig. 1 is the inventive method schematic diagram.
Fig. 2 is index mechanism of the present inventionWorkflow.
Conflict situations schematic diagrames of the Fig. 3 for 6 users in embodiment in a network.
Fig. 4 is by the conflict graph that is drawn in embodiment according to Fig. 3.
Embodiment
Embodiments of the invention are elaborated below, the present embodiment is carried out lower premised on technical solution of the present invention
Implement, give detailed embodiment and specific operating process, but protection scope of the present invention is not limited to following implementations
Example.
Embodiment 1
As shown in figure 1, the present embodiment comprises the following steps：
The first step, user submit information
UserThe data that i ∈ N are submitted include the number of channel needed for userAnd user is to list
Value of the channel of individual channel to wireless network nodeWherein biRepresent i-th of user to each channel
Channel is to the value of wireless network node, riThe number of channel needed for representing i-th of user.
In the present embodiment, as shown in figure 4, for the benefit of stating, it is assumed that
Second step, packet：Suitable signal to noise ratio is used in the present embodiment, and the collision domain of user is set to 425 meters.Root
According to signal to noise ratio and collision domain, the conflict graph of user grouping is drawn, as shown in Figure 4.
In the present embodiment, user is divided into by multiple user groupings not conflicted mutually using coloring algorithm.Shown in Fig. 4,
There are a variety of methods being grouped, the present invention is grouped using coloring algorithm.There are a variety of knots being grouped as seen from Figure 4
Really, such as G={ g1,g2,g3, wherein g1={ A, D, F }, g2={ C, E }, g3={ B }, or can also be divided into g1={ C, D, F }, g2
={ A, E }, g3={ B }.Grouping set G is divided into λ group, it is seen that λ=3 in the present embodiment.
3rd step, determine rent use.Utilization index mechanismTo the user charge that channel is obtained in each user grouping
With.
Described index mechanismEffect be：Input the letter that existing grouping set G and user are submitted in second step
Value set of the road to wireless network nodeExport the expense for the user that channel is obtained in each user grouping
With
In the present embodiment, G={ g1,g2,g3, it is sake of clarity, g in processing the present embodiment1={ A, D, F }, g2=C,
E }, g3={ B }.The present embodiment is G={ g in the input of the 3rd step1,g2,g3AndIndex mechanismPin
To any one group gkIt is operated with following three step:
1) value P of the channel to wireless network node of all users in group is listedk={ bi|i∈gk}。
In the present embodiment, with g1Exemplified by state index mechanismThe course of work.
In the present embodiment, Pκ=P1={ 0.1,0.3,0.3 }
2) P is chosenκIn group of all values to calculate the group respectively in income.
Single group described of income, i.e., to arbitrary p ∈ Pk,
Target：Wherein：gk∈ G, p ∈ Pk
Restrictive condition：p∈Pk(1)；
In the present embodiment, each income is calculated as below in the correspondence group of possible rent：
3) income in the group corresponding to each possible expense p calculated according to 2), to determine each user
Rent in packet is used.The method that the present invention is used is index mechanism, i.e., each possible rent is chosen as last rent with p
It is that income exponentially increases in corresponding group with the p with the probability of expense.It is expressed as
Specific method is：Each possible rent is uniformed with income in corresponding group, be converted into it is each can
Energy rent is chosen as the probability of final rent；Then select random number, fall corresponding interval, according to the interval come
Determine that final rent is used.
In the present embodiment, income is 0.3 and 0.6 respectively in the group corresponding to opportunity cost 0.1 and 0.3.Due to renting
Expense be withIt is directly proportional, therefore also has relation with the coefficient ∈ of setting, the positioning of ∈ spans (0,1].∈ is set herein
It is set to 0.5, therefore accordinglyValue be e respectively0.15And e0.3, then it is chosen as last rent corresponding to user A, D and F
Probability is respectivelyWithNext, between generation 0 to 1
Random number, if fallingThen select bAUsed for last rent.If fallingThen select bDFor user grouping gκThe interior user for obtaining channel
Last rent use.If falling in rest interval, b is selectedFUsed for last rent.It can be seen that, channel is to wireless network node
Value bDAnd bFThe probability for being chosen as last rent is equal, but compares bAThe probability for electing last rent as will
Greatly.It is assumed that finally have selected bDUsed for last rent, i.e.,And return to what last rent use was obtained
Income in group
4th step, obtained in each user grouping determined by the 3rd step channel user final rent be used for it is true
Determine the user of the acquisition channel in group.The last use for obtaining channel is determined according to the number of the number of channel and user grouping
Family is grouped.
The method that described determination obtains channel user packet is as follows：According to all users are divided into λ group in second step,
Channel m, as λ≤m, all λ user groupings are the user grouping for obtaining channel, otherwise, will according to income in organizing come
It is determined that user grouping of the preceding λ group for acquisition channel.
In the present embodiment, there are 2 idle channels, from second step, G={ g1,g2,g3, and g1={ A, D, F }, g2
={ C, E }, g3={ B }, therefore only two user groupings can obtain channel.Specifically solution is：Will be other two
User grouping g2And g3Operated in the way of the 3rd step, select last rent and useWithAnd return to last rent
Income in group corresponding to expenseWith
Described is as follows come the method for determining to obtain the user grouping of channel according to income in group：Each user grouping gk's
Income isAccording to the income size of each user grouping by the user in grouping set
Packet requeues to select the last user grouping for obtaining channel:G′:g‘1≤g‘2≤…≤g’K≤…≤g’λ.According to G '
Just the last user grouping for obtaining channel can be determined.
In the present embodiment, G' can be obtained according to calculating:g2≤g3≤g1, should be by two therefore in embodiment
Channel distribution is to g1And g3Two user groupings.
The method that the user of channel is obtained in described determination group is as follows：Assuming that obtaining the user grouping g of channelκIt is interior most
Whole rent isThe value more than channel to wireless network node then will not be paid according to the reasonability of user, i.e. user
Expense carry out leased channel.Therefore for all i ∈ gκIf,User i be obtain channel user, otherwise user i without
Method obtains channel.
In the present embodiment, the user grouping for obtaining channel is g1And g3.For g1, due to bDIt is that final rent is used, shows
The user for so obtaining channel in this set is D and F, and due to bA＜ bD, user A there is no channel.For g3, due to only
One user B, therefore final rent must be bB, therefore in g3In, a unique user B is the user for obtaining channel.
The progress for the technical performance that the present embodiment has and the lifting of experimental data index are shown：First, this reality
Value privacy information of the channel to wireless network node that example preferably protects frequency spectrum resource to distribute participant is applied, secondly, this
Embodiment approximately maximises overall income, and certain guarantee is provided for overall income.
Claims (3)
1. a kind of implementation method of the nearly excellent frequency spectrum resource dynamically distributes based on index mechanism, it is characterised in that including following step
Suddenly：
The first step, the user as demand channel submit itself required for channel number and channel to the valency of wireless network node
Value；
The channel of second step, the channel number that collection user is submitted and each user is to the value of wireless network node, root
According to each user position and its signal to noise ratio, each user is represented with a point, any a line represent two users it
Between conflicting, i.e., cannot send or receive simultaneously signal, make corresponding conflict graph；Finally according to conflict graph packet
User is divided into several user groupings by method；
3rd step, utilization index mechanism give in each user grouping the user for obtaining channel to determine that rent is used, and are specially：
3.1) value P of the channel to wireless network node of all users in group is listedκ={ bi|i∈gκ, wherein：User submits
Value set of the channel to wireless network nodeEach user grouping is gκ, n submits by user
Channel number；
3.2) P is chosenkIn group of all values to calculate the group respectively in income, i.e., to rent p ∈ Pk, have：
Target is：Restrictive condition is：
p∈Pk(1)；
3.3) income in the group according to corresponding to each possible rent p obtained in 3.2),Uniformed, turned
The probability that each possible rent is chosen as final rent is turned to, then random number is selected in the range of [0,1], when this
Scold at random at interval, determine that final rent is used according to the interval, finally give and channel is obtained in each user grouping
The rent of user is usedWherein：λ is user grouping number；
4th step, the final rent for obtaining channel user determined by the 3rd step in each user grouping are determined in group
Acquisition channel user, the last user for obtaining channel is then determined according to the number of the number of channel and user grouping
Packet.
2. according to the method described in claim 1, it is characterized in that, described group technology includes coloring algorithm, is specially：Pass through
The conflict graph drawn, assigns to the user being connected each other without side in one group according to coloring algorithm.
3. according to the method described in claim 1, it is characterized in that, the 4th described step is specifically included：
4.1) the corresponding m channel of λ user grouping obtained according to second step is judged：As λ≤m, all λ users
Packet is the user grouping for obtaining channel, otherwise will obtain the user point of channel according to income in group come λ group before determining
Group；
4.2) according to each user grouping gkIncomeSize, by user grouping again
Sequence, i.e. G ':g‘1≤g‘2≤…≤g’K≤…≤g’λ；
4.3) as the user grouping g for obtaining channelkInterior final rent isThen according to the reasonability of user, i.e. user not
It can pay and carry out leased channel to the expense of the value of wireless network node more than oneself channel, therefore for all i ∈ gk, whenThen user i obtains the channel, and otherwise user i can not obtain channel；So that it is determined that finally obtaining the user of channel.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410168440.8A CN103906072B (en) | 2014-04-24 | 2014-04-24 | The implementation method of nearly excellent frequency spectrum resource dynamically distributes based on index mechanism |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410168440.8A CN103906072B (en) | 2014-04-24 | 2014-04-24 | The implementation method of nearly excellent frequency spectrum resource dynamically distributes based on index mechanism |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103906072A CN103906072A (en) | 2014-07-02 |
| CN103906072B true CN103906072B (en) | 2017-08-15 |
Family
ID=50997178
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410168440.8A Active CN103906072B (en) | 2014-04-24 | 2014-04-24 | The implementation method of nearly excellent frequency spectrum resource dynamically distributes based on index mechanism |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103906072B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104796901B (en) * | 2015-04-21 | 2018-04-10 | 上海交通大学 | The implementation method of distributed frequency spectrum Resource dynamic allocation |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101064955A (en) * | 2006-04-28 | 2007-10-31 | 北京三星通信技术研究有限公司 | Device and method for allocating channel resource |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7565144B2 (en) * | 2004-11-01 | 2009-07-21 | Nokia Corporation | Method, system and mobile station for handing off communications from a cellular radio access network to an unlicensed mobile access network |
-
2014
- 2014-04-24 CN CN201410168440.8A patent/CN103906072B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101064955A (en) * | 2006-04-28 | 2007-10-31 | 北京三星通信技术研究有限公司 | Device and method for allocating channel resource |
Non-Patent Citations (2)
| Title |
|---|
| SMALL: A Strategy-Proof Mechanism for Radio Spectrum Allocation;Fan Wu等;《IEEE》;20111231;第I-III节 * |
| The Exponential Mechanism for Social Welfare: Private, Truthful, and Nearly Optimal;Zhiyi Huang等;《arXiv:1204.1255v2 [cs.GT]》;20121110;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103906072A (en) | 2014-07-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103929819B (en) | Cognitive radio network slave user combination price-fixing and resource distributing method | |
| CN106161405B (en) | Privacy protectable information based on Homomorphic Encryption Scheme calculates safely implementation method | |
| WO2020133326A1 (en) | Blockchain generation method and system, and computer storage medium and electronic device | |
| CN101662783B (en) | Frequency spectrum distribution method based on graph theory in cognitive radio system | |
| Wu et al. | Towards privacy preservation in strategy-proof spectrum auction mechanisms for noncooperative wireless networks | |
| CN103260166A (en) | Distributed cognition wireless network spectrum allocation method based on coalition games | |
| CN112492603B (en) | Multistage dynamic spectrum sharing method based on block chain technology | |
| Wang et al. | A truthful QoS-aware spectrum auction with spatial reuse for large-scale networks | |
| CN107257499A (en) | Method for secret protection and video recommendation method in a kind of video recommendation system | |
| CN107484178A (en) | A kind of two-way frequency spectrum distributing method of approximate auctioneer's maximum revenue | |
| Wu et al. | A strategy-proof auction mechanism for adaptive-width channel allocation in wireless networks | |
| Zhao et al. | Joint subchannel and power allocation in multiuser OFDM systems with minimal rate constraints | |
| Wang et al. | THEMIS: Collusion-resistant and fair pricing spectrum auction under dynamic supply | |
| CN103906072B (en) | The implementation method of nearly excellent frequency spectrum resource dynamically distributes based on index mechanism | |
| CN108924797B (en) | D2D network security transmission method with social awareness | |
| CN104320772B (en) | D2D communication nodes clustering method and device based on degree of belief and physical distance | |
| CN102883326A (en) | Method for distributing frequency spectrum resources in cognitive network | |
| CN108921514A (en) | A kind of enterprise mobile working system Internet-based | |
| CN110222092B (en) | Multi-party statistical query method based on differential privacy protection technology | |
| Fossati et al. | A mood value for fair resource allocations | |
| CN107645776A (en) | The method for releasing and device of a kind of share spectrum resources | |
| Zhang et al. | SPECIAL: A strategy-proof and efficient multi-channel auction mechanism for wireless networks | |
| CN103634916B (en) | Method for channel allocation and device | |
| Huang et al. | Game theory for spectrum sharing | |
| Zhu et al. | Optimal pricing strategies in cognitive radio networks with multiple spectrums |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |