CN103260166B - Distributed cognition wireless network is based on the frequency spectrum distributing method of Game with Coalitions - Google Patents
Distributed cognition wireless network is based on the frequency spectrum distributing method of Game with Coalitions Download PDFInfo
- Publication number
- CN103260166B CN103260166B CN201310120637.XA CN201310120637A CN103260166B CN 103260166 B CN103260166 B CN 103260166B CN 201310120637 A CN201310120637 A CN 201310120637A CN 103260166 B CN103260166 B CN 103260166B
- Authority
- CN
- China
- Prior art keywords
- value
- user
- time
- frequency range
- alliance
- 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.)
- Expired - Fee Related
Links
- 238000001228 spectrum Methods 0.000 title claims abstract description 88
- 238000000034 method Methods 0.000 title claims abstract description 55
- 230000019771 cognition Effects 0.000 title claims abstract description 22
- 230000008569 process Effects 0.000 claims description 27
- 230000005540 biological transmission Effects 0.000 claims description 22
- 239000011159 matrix material Substances 0.000 claims description 15
- 238000001514 detection method Methods 0.000 claims description 8
- 230000004927 fusion Effects 0.000 claims description 7
- 238000012360 testing method Methods 0.000 claims description 7
- 230000006399 behavior Effects 0.000 claims description 4
- 238000013475 authorization Methods 0.000 claims description 3
- 238000013277 forecasting method Methods 0.000 claims description 3
- 230000013011 mating Effects 0.000 claims description 3
- 230000007812 deficiency Effects 0.000 description 7
- 230000006870 function Effects 0.000 description 6
- 230000001149 cognitive effect Effects 0.000 description 4
- 238000004891 communication Methods 0.000 description 4
- 241000854291 Dianthus carthusianorum Species 0.000 description 2
- 230000008859 change Effects 0.000 description 2
- 230000003750 conditioning effect Effects 0.000 description 2
- 239000013598 vector Substances 0.000 description 2
- 230000003044 adaptive effect Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000010348 incorporation Methods 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 230000008447 perception Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000005316 response function Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention discloses the frequency spectrum distributing method of a kind of distributed cognition wireless network based on Game with Coalitions, mainly solves prior art distributes idle frequency range problem in the thought that cognition wireless network can not make full use of synthesization and overall local.Its method step is: detect idle frequency range, calculate time user utility value, set up Stable coalitions, select league administrator, fused data, renewal time users to trust value, distribute idle frequency range, upgrade time users to trust value.The present invention, fully in conjunction with the feature of cognition wireless network, uses the value of utility of trust value, participation value and requirements integrating representation time user, improves time satisfaction of user to idle frequency range and the service quality of network; Secondary user is divided into alliance and carries out frequency spectrum resource distribution, improve the utilance of idle frequency range and the fairness of spectrum allocation may; By upgrading time users to trust value, reduce malice time user to the negative effect of network.
Description
Technical field
The invention belongs to communication technical field, further relate to the as required frequency spectrum distributing method of the distributed cognition radio network in cognition wireless network field based on Game with Coalitions.The present invention can according to the requirements of secondary user, participation value, trust value and the physical attribute of authorizing frequency range, the method of incorporation engineering optimization method and Game with Coalitions, dynamic conditioning time user obtains the probability of frequency spectrum, thus make the distribution of cognition wireless network frequency spectrum resource and use more flexible, efficiently, fair.
Background technology
In recent years, due to the finiteness of frequency spectrum resource, and most of frequency spectrum is assigned to authorized user, causes frequency spectrum resource now rare.In fact, large quantity research shows to authorize frequency range to be idle in plenty of time section, and uncommitted user uses, and this is the waste to limited spectrum resources in some sense.In order to make these idle frequency spectrums be fully utilized, there has been proposed the concept of cognitive infinite network to improve the utilance of radio spectrum resources.Wherein have and authorize the user of frequency spectrum to be called authorized user, the user renting frequency spectrum is called time user.
Spectrum allocation may refers to that idle frequency spectrum is distributed to one or more users with it to the demand of channel by the number of basis time user, and main purpose is effectively selected by an adaptive strategy and utilized idle frequency spectrum.In cognition network, in order to obtain the authority of access idle frequency spectrum, all users must carry out the idle period of perception mandate frequency spectrum by cooperation.When authorizing frequency spectrum idle, obtain the local information that the secondary user renting authority can rent this band transmissions time user under the prerequisite not affecting primary user.Utilize dynamic frequency spectrum deployment strategy, effectively can improve the flexibility of radio communication, avoid the conflict between primary user and secondary user.
Southeast China University propose patent application " a kind of based on frequency spectrum distributing method in the cognitive sensor network cluster of cooperative game " (application number 201110340011.0 application publication number CN102413473A) disclose in a kind of cognition wireless network based on cooperative game bunch in frequency spectrum distributing method, concrete steps are: first cognitive nodes by bunch in local control channel the channel condition information perceived is sent to cluster head, cluster head utilizes these information, sets up channel idle matrix.Secondly, sub-channel matrix, node priority weight vectors, public instruction vector constructing system utility function is utilized.Finally, adding two constraintss, obtaining optimum sub-channel matrix by maximizing system utility function.The deficiency that this patent application exists is: first, and in the method model bunch is static, can not according to the state variation of secondary user dynamic conditioning.Secondly, secondary User Priority adopted when setting up utility function only considers the conditions of demand of user to channel, does not carry out the priority of the secondary user of Comprehensive Assessment according to the credibility of time user and the contribution etc. of secondary user to network.
The patent application " spectrum shared game playing method based on demand factor " (application number 201110106065.0 application publication number CN102186177A) that Nanjing Univ. of Posts and Telecommunications proposes discloses in a kind of cognitive radio system and takes precautions against based on the spectrum shared game playing of demand factor, concrete steps are: first frequency spectrum share problem model is turned to Cournot model, and build need-based time user's game utility function.Secondly, the spectrum number that time user shares is calculated.Finally, the solution procedure of frequency spectrum optimal response function is discussed.The deficiency that this patent application exists is: first, only considered demand and the bid of time user, but considers the credibility of time user, if secondary user is the illegal user of overbid, then the primary user that do not affect against cognition net communicates this original intention.Secondly, only considered time user in demand function to the requirement of frequency spectrum quantity, consider the different difference in actual use of channel quality, the phenomenon that time user may be caused to have got frequency spectrum but cannot communicate, finally, the fairness problem of not homogeneous user in spectrum allocation may process is not considered.
Summary of the invention
The present invention is directed to the deficiencies in the prior art, the frequency spectrum distributing method of a kind of distributed cognition wireless network based on Game with Coalitions is proposed, adopt the method for Game with Coalitions, on the basis of trust value, introducing time user's participation value and requirements carry out frequency spectrum resource distribution, can ensure that the frequency spectrum that time user obtains is all available, improve the utilance of frequency spectrum in net, ensure that the fairness between time user, improve satisfaction and the enthusiasm of time user simultaneously.
To achieve these goals, concrete steps of the present invention comprise as follows:
(1) idle frequency spectrum is detected
1a) initial value of the secondary users to trust value participating in spectrum allocation may process is first set as 0.5, the initial value of secondary user's participation value is set as 0;
1b) secondary user by the data-storing of other user transmission that accepts in self memory space;
1c) secondary scanning input needs the data content end of transmission, obtains the bandwidth of transmission needed for data, transmits the power needed for data and the time of transmission needed for data;
1d) secondary user uses its own antenna, detects the radio signal energy of authorized user frequency range; When the authorization user signal energy detected is greater than detection threshold value, authorized user takies frequency range, and the state value of frequency range occupied in local band table is set as 0 by secondary user; Otherwise frequency range is idle condition, the state value of local band table hollow ideler frequency section is set as 1 by secondary user;
1e) secondary user adopts test signal method, obtains the largest tolerable power of idle frequency range;
1f) secondary user adopts time forecasting methods, obtains the free time of idle frequency range;
1g) secondary user inquires about frequency spectrum list, obtains the bandwidth of idle frequency range.
(2) time user utility value is calculated
2a) calculate the requirements of time user according to the following formula:
Wherein, N represents the requirements of time user, and b represents that time user transmits the bandwidth needed for data, and p represents that time user transmits the power needed for data, and d represents that time user transmits the time needed for data;
Simple method 2b) is used to calculate the value of utility of time user.
(3) Stable coalitions is set up
3a) each user is set as an alliance;
3b) calculate the overall utility value of each alliance according to the following formula;
Wherein, S represents the overall utility value of each alliance, and ∑ represents summation symbol, and k represents the number of time user in each alliance, and i represents any positive integer between 1 to k, and V represents the value of utility of time user in each alliance;
3c) often adjacent alliance is merged into an alliance, according to step 3b) overall utility value formula, calculate the overall utility value of alliance after merging;
3d) judge the overall utility value merging rear alliance, whether be less than the overall utility value participating in merging one of them alliance in alliance, if be less than, then cancel merging; Otherwise, perform step 3e);
3e) be split into an alliance by merging the secondary user that in the rear alliance containing at least two users, trust value is the highest, by another alliance that remaining secondary user in alliance before division is split into, according to step 3b) overall utility value formula, calculate the overall utility value of the rear each alliance of division;
3f) judge the overall utility value of the Liang Ge alliance of division gained, whether be all less than the overall utility value of the front alliance of division, if be all less than, then cancel division; Otherwise, perform step 3g);
3g) repeat step 3c), step 3d), step 3e), step 3f), until all alliances all cannot continue merge or division;
3h) calculate the mean value of all user's request values in each alliance, using the requirements of mean value as each user in current state alliance.
(4) league administrator is selected
To each alliance, the secondary user that in selection alliance, trust value is the highest is as the manager of this alliance.
(5) data fusion
5a) local band table is sent to league administrator by each user;
5b) league administrator calculates the state value of all local band table Mid Frequencies according to fusion formula, and by state value stored in network band table;
5c) network band table is sent to all users in alliance by league administrator.
(6) time users to trust value is upgraded
Each time user contrasts frequency range state value corresponding with it in the state value of local band table Mid Frequency and the network band table of league administrator transmission; When the state value of the local band table Mid Frequency of secondary user is with when in the network band table that league administrator sends, the state value of corresponding band is not identical, using 0.5 times of the trust value of secondary user's previous state trust value as the secondary user of current state.
(7) idle frequency range is distributed
7a) calculate the matching degree of time user and idle frequency range according to the following formula:
Wherein, Y represents the matching degree of time user and idle frequency range, B represents the bandwidth of idle frequency range, b represents that time user transmits the bandwidth needed for data, Q represents the largest tolerable power of idle frequency range, p represents that time user transmits the power needed for data, and D represents the free time of idle frequency range, and d represents that time user transmits the time needed for data;
7b) judge whether matching degree Y is greater than 0.5, if so, represent time user and idle frequency band match, perform step 7c); Otherwise, represent that time user is not mated with idle frequency range, perform step 7d);
7c) idle frequency allocation is given the secondary user that in the secondary user of mating with it, trust value is the highest;
7d) repeat step 7a), step 7b), step 7c), until available free frequency range all distributes to time user.
(8) time users to trust value is upgraded
8a) the idle band transmissions data that are being assigned to of secondary user, the power of reality and time during record transmission data;
If time of reality and power part are less than required time and power, then using 1.5 times of secondary users to trust values as current state of in step (6) users to trust value when 8b) secondary user transmits data; Otherwise, using 0.5 times of secondary users to trust value as current state of in step (6) users to trust value;
8c) repeat step (1) to step (8), until all do not need the data transmitted in all secondary users.
The present invention compared with prior art has the following advantages:
First, the present invention adopts time user to transmit bandwidth needed for data, power and time, calculate the requirements of time user, overcome requirements in prior art and only considered time user to the requirement of number of frequency bands, do not consider the deficiency of the different difference in actual use of band quality, make to invention increases the service quality of network to secondary user.
Second, the present invention is according to the trust value of secondary user, requirements and participation value calculate the value of utility of time user, ensureing that the secondary user that trust value is high can obtain on the basis of idle frequency range high probability, the not high user of trust value is encouraged to improve by playing an active part in frequency spectrum the probability that oneself obtains frequency spectrum, overcome in prior art the demand and bid that only considered time user, but the deficiency of the credibility of time user is not considered, make to invention increases the reliability that time user obtains idle frequency spectrum, improve the probability that the secondary user adding cognition wireless network for the first time obtains idle frequency range.
3rd, the present invention adopts simple method to optimize the value of utility of time user, what make the trust value of not homogeneous user, participation value and requirements has different weights, overcome in prior art the secondary User Priority adopted when setting up utility function and only consider the conditions of demand of user to channel, do not carry out the deficiency of the priority of Comprehensive Assessment time user according to the credibility of time user and the contribution etc. of secondary user to network, make the integrality and the reliability that invention increases time user utility value.
4th, the present invention adopts the value of utility of time user to calculate the overall utility value of alliance, Stable coalitions is formed by the merging between alliance or division, overcome in prior art the deficiency of the fairness not considering not homogeneous user in spectrum allocation may process, make the income that invention increases cognition wireless network, improve the fairness of cognition wireless network.
Accompanying drawing explanation
Fig. 1 is flow chart of the present invention;
Fig. 2 is the flow chart that the present invention sets up Stable coalitions step;
Fig. 3 is the structural representation of Stable coalitions of the present invention.
Embodiment
Below in conjunction with accompanying drawing, the present invention is described further.
Application scenarios of the present invention is cognition wireless network, and in network, time user is in same geographical position, and adopt distributed group net mode, without base station, secondary user uses idle frequency range by respective demand application, after being assigned to idle frequency range, carries out data communication.
With reference to accompanying drawing 1, concrete steps of the present invention are described below:
Step 1, detects idle frequency spectrum.
The initial value of the secondary users to trust value participating in spectrum allocation may is first set as 0.5, the initial value of secondary user's participation value is set as 0.
The trust value of secondary user represents the credibility of its behavior, is to weigh time whether believable standard of user behavior, and it constantly changes in the process of each spectrum allocation may.The participation value of secondary user represents that time user participates in the number of times of spectrum allocation may and the ratio of user's spectrum allocation may total degree, and it changes along with the number of times of spectrum allocation may and the number of times of time user's participation.
The data-storing that other user accepted is transmitted by secondary user is in self memory space, and scanning needs the end of the data content of transmission, obtains bandwidth, power and the time of transmitting needed for data.The value of these three parameters determines the requirement of secondary user's for idle frequency range, and based on these three parameters, secondary user can select the idle frequency range being applicable to transmission desired data.
Secondary user uses its own antenna, detects the radio signal energy of authorized user frequency range; When the authorization user signal energy detected is greater than detection threshold value, represent that authorized user takies frequency range, the state value of frequency range occupied in local band table is set as 0 by secondary user; Otherwise expression frequency range is idle condition, the state value of local band table hollow ideler frequency section is set as 1 by secondary user.Detection threshold value is the difference that the transmitting power of authorized user deducts free-space propagation loss, and free-space propagation loss value is obtained by following formulae discovery:
L＝32.44+20lgr+20lgu
Wherein, L represents free-space propagation loss value, and lg represents and asks log, and r represents the distance of time user and authorized user, and u represents the frequency of detection frequency range.
Local band table record time user detects the result of frequency range, is expressed as the matrix of 2 × n, the number of the frequency range of n detected by time user, the 1st line display frequency spectrum designation of matrix, the state value of the 2nd behavior representation frequency range of matrix.
Secondary user sends the test signal of variable power to the idle frequency range that frequency range state value is 1, and signal power evenly increases in time, until power reach test signal can the maximum critical value of normal transmission, obtain the largest tolerable power of idle frequency range.
Secondary user calculates the average of continuous 5 the spectrum allocation may process Mid Frequency free times before this spectrum allocation may, using the frequency range free time of this average as this spectrum allocation may, if frequency range participates in the number of times of spectrum allocation may less than 5 times, is then set as that in this assigning process, time user transmits the time needed for data the free time of frequency range.
Secondary user inquires about frequency spectrum list, obtains the bandwidth of idle frequency range.
Step 2, calculates time user utility value.
Secondary user uses following formula to calculate self-demand value:
Wherein, N represents the requirements of time user, and b represents that time user transmits the bandwidth needed for data, and p represents that time user transmits the power needed for data, and d represents that time user transmits the time needed for data.
Secondary user, according to self requirements, trust value and participation value, uses simple method to calculate the value of utility of time user, the steps include:
The first step, the weight that trust value, requirements and participation value that secondary user calculates self are shared in value of utility, its formula is as follows:
Wherein, max represents maximizing symbol, h represents the secondary users to trust value of current state, q represents the weight that the secondary users to trust value of current state is shared in value of utility, N represents the secondary user's request value of current state, w represents the weight that the secondary user's request value of current state is shared in value of utility, and J represents secondary user's participation value of current state, and e represents the weight that secondary user's participation value of current state is shared in value of utility.
Second step, the weight shared in value of utility according to tried to achieve secondary users to trust value, requirements and participation value, calculate value of utility, its formula is as follows:
V＝h×q+N×w+J×e
Wherein, V represents the secondary user utility value of current state in this spectrum allocation may process, h represents the secondary users to trust value of current state in this spectrum allocation may process, q represents the weight that the secondary users to trust value of current state in this spectrum allocation may process is shared in value of utility, N represents the secondary user's request value of current state in this spectrum allocation may process, w represents the weight that the secondary user's request value of current state in this spectrum allocation may process is shared in value of utility, J represents secondary user's participation value of current state in this spectrum allocation may process, e represents the weight that secondary user's participation value of current state in this spectrum allocation may process is shared in value of utility.
Step 3, sets up Stable coalitions.
With reference to accompanying drawing 2, this step specific implementation process is as follows:
3a) alliance's initialization, is set as an alliance by each user.
3b) according in alliance number of users and each user utility value, according to the overall utility value of each alliance of overall utility value formulae discovery, its overall utility value formula is as follows:
Wherein, S represents the overall utility value of each alliance, and ∑ represents summation symbol, and k represents the number of time user in each alliance, and i represents any positive integer between 1 to k, and V represents the value of utility of time user in each alliance.
3c) often adjacent alliance is merged into an alliance, according to overall utility value formula, calculates the overall utility value of alliance after merging.Judge the overall utility value of alliance after merging, whether be greater than the overall utility value participating in merging one of them alliance in alliance, if be greater than, then retain the alliance after merging, in the alliance of company after merging, comprise all secondary users participating in the alliance merged.Perform step 3c); Otherwise, then cancel merging, return the state before this adjacent alliance merging, perform step 3d).
3d) be split into an alliance by merging the secondary user that in the rear alliance containing at least two users, trust value is the highest, by another alliance that remaining secondary user in alliance before division is split into, according to overall utility value formula, calculate the overall utility value of the rear each alliance of division.Judge the overall utility value of the Liang Ge alliance of division gained, whether be greater than the overall utility value of the front alliance of division, if be all greater than, then retain the alliance after division, perform step 3c); Otherwise, then cancel division, turn back to the state before the division of this alliance, perform step 3e).
3e) when all alliances all cannot continue to merge or divide, reach Stable coalitions.
The structure of Stable coalitions is with reference to accompanying drawing 3.Fig. 3 comprises three circles, represents alliance 1 respectively, alliance 2 and alliance 3, and alliance 1 comprises four users, and alliance 2 comprises four users, and alliance 3 comprises three users, can direct communication between secondary user.The secondary user that in each alliance, trust value is the highest is as alliance leader.Secondary number of users in embodiments of the present invention in three alliance's numbers and each alliance does not change.
3f) by the mean value of all user's request values in each alliance, as the requirements of each user in current state alliance.
Step 4, selects league administrator.
To each alliance, the secondary user that in selection alliance, trust value is the highest is as the manager of this alliance.After league administrator is selected, be constant in a spectrum allocation may process, next assigning process reselects according to the trust value after time user's change.
Step 5, data fusion.
Each time local band table is sent to league administrator by user.The manager of each alliance calculates the state value of all local band table Mid Frequencies according to following fusion formula, and by state value stored in network band table, the result that network band table record data merge, be expressed as the matrix of 2 × m, m is the number of frequency range; 1st line display frequency spectrum designation of matrix, the state value of the 2nd line display frequency range of matrix.
Wherein, y
xrepresent the frequency range state of network band table Mid Frequency x, x ∈ 1,2,3 ..., M}, M represent the number of frequency range,
with
represent that the frequency range state of frequency range x is secondary user's collection of 0 and 1 respectively.
Network band table is sent to all users in alliance by league administrator, to make in alliance all users can both to obtain in alliance all users and the state of all frequency ranges detected to obtain, state value be 0 frequency range be available idle frequency range.
Step 6, upgrades time users to trust value.
Each time user contrasts frequency range state value corresponding with it in the state value of local band table Mid Frequency and the network band table of league administrator transmission; When the state value of the local band table Mid Frequency of secondary user is with when in the network band table that league administrator sends, the state value of corresponding band is not identical, namely this user is inaccurate for the detection of frequency range state, flase drop is there occurs time likely, also be likely the result that malicious user deliberately have modified detection, no matter be which kind of situation above-mentioned, this user does not really complete the task of detecting frequency range, using 0.5 times of the trust value of secondary user's previous state trust value as current state time user.
Step 7, distributes idle frequency range.
According to the order that each whole alliance value of utility is descending between alliance, in alliance according to secondary users to trust value by high order on earth, mate idle frequency range.Secondary user, according to matching degree formula, calculates the matching degree of this user and idle frequency range, and its matching degree formula is as follows:
Wherein, Y represents the matching degree of time user and idle frequency range, B represents the bandwidth of idle frequency range, b represents that time user transmits the bandwidth needed for data, Q represents the largest tolerable power of idle frequency range, p represents that time user transmits the power needed for data, and D represents the free time of idle frequency range, and d represents that time user transmits the time needed for data.
Judge whether matching degree Y is greater than 0.5, if so, represent time user and idle frequency band match; Otherwise, represent that time user is not mated with idle frequency range.
The secondary user that in the secondary user of mating with it, trust value is the highest is given by idle frequency allocation.The secondary user obtaining idle frequency range no longer participates in assigning process subsequently.
Repeat step 7, until available free frequency range all distribute to suitable secondary user.
Step 8, upgrades time users to trust value.
The idle frequency range that secondary user is assigned to, uses certain power delivery data, records power and the actual required time of transmission data of reality during transmission data.
If time of reality and power are all less than required time and power, then using 1.5 times of secondary users to trust values as current state of in step 6 users to trust value when secondary user transmits data; Otherwise, using 0.5 times of secondary users to trust value as current state of in step 6 users to trust value.Trust value after renewal is as the initial value of during next spectrum allocation may users to trust value.
Repeat step 1 to step 8, until all do not need the data transmitted in all users.
Claims (6)
1. distributed cognition wireless network is based on a frequency spectrum distributing method for Game with Coalitions, comprises the steps:
(1) idle frequency spectrum is detected:
1a) initial value of the secondary users to trust value participating in spectrum allocation may process is first set as 0.5, the initial value of secondary user's participation value is set as 0;
1b) secondary user by the data-storing of other user transmission that accepts in self memory space;
1c) secondary scanning input needs the data content end of transmission, obtains the bandwidth of transmission needed for data, transmits the power needed for data and the time of transmission needed for data;
1d) secondary user uses its own antenna, detects the radio signal energy of authorized user frequency range; When the authorization user signal energy detected is greater than detection threshold value, authorized user takies frequency range, and the state value of frequency range occupied in local band table is set as 0 by secondary user; Otherwise frequency range is idle condition, the state value of local band table hollow ideler frequency section is set as 1 by secondary user;
1e) secondary user adopts test signal method, obtains the largest tolerable power of idle frequency range;
1f) secondary user adopts time forecasting methods, obtains the free time of idle frequency range;
1g) secondary user inquires about frequency spectrum list, obtains the bandwidth of idle frequency range;
(2) time user utility value is calculated:
2a) calculate the requirements of time user according to the following formula:
Wherein, N represents the requirements of time user, and b represents that time user transmits the bandwidth needed for data, and p represents that time user transmits the power needed for data, and d represents that time user transmits the time needed for data;
Simple method 2b) is used to calculate the value of utility of time user;
The concrete steps of described simple method are as follows:
The first step, according to the following formula, calculates the weight that the trust value of time user, requirements and participation value are shared in value of utility:
Wherein, max represents maximizing symbol, h represents the secondary users to trust value of current state, q represents the weight that the secondary users to trust value of current state is shared in value of utility, N represents the secondary user's request value of current state, w represents the weight that the secondary user's request value of current state is shared in value of utility, and J represents secondary user's participation value of current state, and e represents the weight that secondary user's participation value of current state is shared in value of utility;
Second step, calculates the value of utility of time user according to the following formula:
V＝h×q+N×w+J×e
Wherein, V represents the secondary user utility value of current state in this spectrum allocation may process, h represents the secondary users to trust value of current state in this spectrum allocation may process, q represents the weight that the secondary users to trust value of current state in this spectrum allocation may process is shared in value of utility, N represents the secondary user's request value of current state in this spectrum allocation may process, w represents the weight that the secondary user's request value of current state in this spectrum allocation may process is shared in value of utility, J represents secondary user's participation value of current state in this spectrum allocation may process, e represents the weight that secondary user's participation value of current state in this spectrum allocation may process is shared in value of utility,
(3) Stable coalitions is set up:
3a) each user is set as an alliance;
3b) calculate the overall utility value of each alliance according to the following formula;
Wherein, S represents the overall utility value of each alliance, and ∑ represents summation symbol, and k represents the number of time user in each alliance, and i represents any positive integer between 1 to k, and V represents the value of utility of time user in each alliance;
3c) often adjacent alliance is merged into an alliance, according to step 3b) overall utility value formula, calculate the overall utility value of alliance after merging;
3d) judge the overall utility value merging rear alliance, whether be less than the overall utility value participating in merging one of them alliance in alliance, if be less than, then cancel merging, otherwise, perform step 3e);
3e) be split into an alliance by merging the secondary user that in the rear alliance containing at least two users, trust value is the highest, remaining user in alliance before division is split into another alliance, according to step 3b) overall utility value formula, calculate the overall utility value of the rear each alliance of division;
3f) judge the overall utility value of the Liang Ge alliance of division gained, whether be all less than the overall utility value of the front alliance of division, if be all less than, then cancel division, otherwise, perform step 3g);
3g) repeat step 3c), step 3d), step 3e), step 3f), until all alliances all cannot continue merge or division;
3h) calculate the mean value of all user's request values in each alliance, using the requirements of mean value as each user in current state alliance;
(4) league administrator is selected:
To each alliance, the secondary user that in selection alliance, trust value is the highest is as the manager of this alliance;
(5) data fusion:
5a) local band table is sent to league administrator by each user;
5b) league administrator calculates the state value of all local band table Mid Frequencies according to fusion formula, and by state value stored in network band table;
Described fusion formula is as follows:
Wherein, y
xrepresent the frequency range state of network band table Mid Frequency x, x ∈ 1,2,3 ..., M}, M represent the number of frequency range,
with
represent that the frequency range state of frequency range x is secondary user's collection of 0 and 1 respectively;
5c) network band table is sent to all users in alliance by league administrator;
(6) time users to trust value is upgraded:
Each time user contrasts frequency range state value corresponding with it in the state value of local band table Mid Frequency and the network band table of league administrator transmission; When the state value of the local band table Mid Frequency of secondary user is with when in the network band table that league administrator sends, the state value of corresponding band is not identical, using 0.5 times of the trust value of secondary user's previous state trust value as the secondary user of current state;
(7) idle frequency range is distributed:
7a) calculate the matching degree of time user and idle frequency range according to the following formula:
Wherein, Y represents the matching degree of time user and idle frequency range, B represents the bandwidth of idle frequency range, b represents that time user transmits the bandwidth needed for data, Q represents the largest tolerable power of idle frequency range, p represents that time user transmits the power needed for data, and D represents the free time of idle frequency range, and d represents that time user transmits the time needed for data;
7b) judge whether matching degree Y is greater than 0.5, if so, represent time user and idle frequency band match, perform step 7c); Otherwise, represent that time user is not mated with idle frequency range, perform step 7d);
7c) idle frequency allocation is given the secondary user that in the secondary user of mating with it, trust value is the highest;
7d) repeat step 7a), step 7b), step 7c), until available free frequency range all distributes to time user;
(8) time users to trust value is upgraded:
8a) the idle band transmissions data that are being assigned to of secondary user, the power of reality and time during record transmission data;
If time of reality and power are all less than required time and power, then using 1.5 times of secondary users to trust values as current state of in step (6) users to trust value when 8b) secondary user transmits data; Otherwise, using 0.5 times of secondary users to trust value as current state of in step (6) users to trust value;
8c) repeat step (1) to step (8), until all do not need the data transmitted in all secondary users.
2. distributed cognition wireless network according to claim 1 is based on the frequency spectrum distributing method of Game with Coalitions, it is characterized in that, step 1d) described in local band table, record time user detects frequency range result, be expressed as the matrix of 2 × n, the number of the frequency range of n detected by time user, the 1st line display frequency spectrum designation of matrix, the state value of the 2nd behavior representation frequency range of matrix.
3. distributed cognition wireless network according to claim 1 is based on the frequency spectrum distributing method of Game with Coalitions, it is characterized in that, step 1d) described in detection threshold value refer to that the transmitting power of authorized user deducts the difference of free-space propagation loss.
4. distributed cognition wireless network according to claim 1 is based on the frequency spectrum distributing method of Game with Coalitions, it is characterized in that, step 1e) described in test signal method refer to, secondary user sends the test signal of variable power to idle frequency range, signal power evenly increases in time, until power reach test signal can the maximum critical value of normal transmission, obtain largest tolerable power.
5. distributed cognition wireless network according to claim 1 is based on the frequency spectrum distributing method of Game with Coalitions, it is characterized in that, step 1f) described in time forecasting methods refer to, secondary user calculates the average of continuous 5 the spectrum allocation may process Mid Frequency free times before this spectrum allocation may, using the frequency range free time of this average as this spectrum allocation may, if frequency range participates in the number of times of spectrum allocation may less than 5 times, is then set as that in this assigning process, time user transmits the time needed for data the free time of frequency range.
6. distributed cognition wireless network according to claim 1 is based on the frequency spectrum distributing method of Game with Coalitions, it is characterized in that, step 5b) described network band table, the result that record data merge, be expressed as the matrix of 2 × m, m is the number of frequency range; 1st line display frequency spectrum designation of matrix, the state value of the 2nd line display frequency range of matrix.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310120637.XA CN103260166B (en) | 2013-03-25 | 2013-03-25 | Distributed cognition wireless network is based on the frequency spectrum distributing method of Game with Coalitions |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310120637.XA CN103260166B (en) | 2013-03-25 | 2013-03-25 | Distributed cognition wireless network is based on the frequency spectrum distributing method of Game with Coalitions |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103260166A CN103260166A (en) | 2013-08-21 |
| CN103260166B true CN103260166B (en) | 2016-03-02 |
Family
ID=48963807
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310120637.XA Expired - Fee Related CN103260166B (en) | 2013-03-25 | 2013-03-25 | Distributed cognition wireless network is based on the frequency spectrum distributing method of Game with Coalitions |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103260166B (en) |
Families Citing this family (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103442368B (en) * | 2013-09-09 | 2016-03-30 | 哈尔滨工业大学 | Based on the frequency spectrum distributing method of potential game in cognitive radio system |
| CN103701917A (en) * | 2013-12-31 | 2014-04-02 | 遵义天义利威机电有限责任公司 | OCF game-based context awareness incentive mechanism of smart phone |
| CN103684641B (en) * | 2013-12-31 | 2016-03-02 | 遵义天义利威机电有限责任公司 | Based on the cognitive wireless radio cooperation frequency spectrum perception mechanism of overlapping Game with Coalitions |
| CN103686701B (en) * | 2013-12-31 | 2017-04-05 | 遵义天义利威机电有限责任公司 | The method that user security is improved in cognitive type radio net |
| CN103874225B (en) * | 2014-03-31 | 2018-03-02 | 北京邮电大学 | The method of mobile terminal access wireless network and base station |
| CN105120463B (en) * | 2015-09-02 | 2018-08-07 | 西安电子科技大学 | A kind of multifactor decision making method based on user demand in cognitive radio networks |
| CN106535346B (en) * | 2016-11-24 | 2019-07-02 | 哈工大机器人集团上海有限公司 | A kind of method for building up of network connection |
| CN106790213B (en) * | 2017-01-10 | 2020-01-10 | 西安电子科技大学 | Trust management method based on nested game in central cognitive wireless network |
| CN106851672B (en) * | 2017-01-20 | 2020-10-09 | 国家计算机网络与信息安全管理中心 | Method and device for constructing data packet forwarding alliance game payment model |
| CN108206728A (en) * | 2017-11-30 | 2018-06-26 | 天津津航计算技术研究所 | A kind of cooperation data packet transmission method based on Game with Coalitions |
| CN108616996B (en) * | 2018-03-19 | 2020-11-06 | 山东大学 | Spectrum and power distribution method, device and system for Femtocell network |
| CN108366428B (en) * | 2018-03-20 | 2021-12-07 | 东南大学 | Game optimization-based combined spectrum sensing and resource allocation method and device |
| CN110233686A (en) * | 2018-06-20 | 2019-09-13 | 桂林电子科技大学 | Stabilization matching method of the cognition wireless network based on Game with Coalitions |
| CN110650442A (en) * | 2019-11-06 | 2020-01-03 | 天津津航计算技术研究所 | Wireless network information sharing method |
| CN111918296B (en) * | 2020-07-01 | 2023-03-31 | 中国人民解放军陆军工程大学 | Distributed wireless network spectrum sharing system and sharing method |
| CN113347638B (en) * | 2021-05-14 | 2024-04-30 | 东北大学 | Cognitive industrial Internet of things dynamic cooperation spectrum prediction and perception method |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101945397A (en) * | 2010-09-07 | 2011-01-12 | 南京邮电大学 | Game theory-based graded pricing frequency spectrum resource management method |
| CN102026201A (en) * | 2010-12-15 | 2011-04-20 | 西安交通大学 | Game type selection-based method for realizing dynamic spectrum allocation |
| CN102307351A (en) * | 2011-08-29 | 2012-01-04 | 中山大学 | Game-theory-based spectrum allocation method, communication equipment and system |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2695328B1 (en) * | 2011-04-07 | 2019-10-09 | Nokia Solutions and Networks Oy | Optimization of network configuration |
-
2013
- 2013-03-25 CN CN201310120637.XA patent/CN103260166B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101945397A (en) * | 2010-09-07 | 2011-01-12 | 南京邮电大学 | Game theory-based graded pricing frequency spectrum resource management method |
| CN102026201A (en) * | 2010-12-15 | 2011-04-20 | 西安交通大学 | Game type selection-based method for realizing dynamic spectrum allocation |
| CN102307351A (en) * | 2011-08-29 | 2012-01-04 | 中山大学 | Game-theory-based spectrum allocation method, communication equipment and system |
Non-Patent Citations (1)
| Title |
|---|
| DRM博弈控制分析;马国峻，裴庆祺，姜晓鸿;《通信学报》;20120930;第33卷(第Z1期);正文第282-286页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103260166A (en) | 2013-08-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103260166B (en) | Distributed cognition wireless network is based on the frequency spectrum distributing method of Game with Coalitions | |
| CN103338452B (en) | The D2D communication means of base station of cellular system assist control | |
| CN102833759B (en) | Cognitive radio spectrum allocation method enabling OFDM (orthogonal frequency division multiplexing) master user to realize maximum revenue | |
| CN106454700A (en) | D2D (Device-to-Device) communication content distribution scheme based on social network | |
| CN103596182A (en) | Method for managing spectrum resources in D2D communications | |
| CN102413473A (en) | Cooperative game-based intra-cluster spectrum allocation method for cognitive sensor network | |
| CN104796900A (en) | Cellular network D2D (device-to-device) communication resource distributing method based on auction theory | |
| Tan et al. | Fair power control for wireless ad hoc networks using game theory with pricing scheme | |
| CN111669759A (en) | Dynamic multi-channel cooperative sensing method based on deep Q network | |
| CN101646176B (en) | Distance tree protocol frame of medium access control (MAC) layer based on opportunistic spectrum access (OSA) technology | |
| CN104640117A (en) | Allocation method and device of frequency spectrum resources | |
| CN108282905A (en) | A kind of accidental access method and its network element | |
| CN104796991A (en) | OFDMA (orthogonal frequency division multiple access) system resource distributing method based on potential game | |
| CN104270768A (en) | Spectrum sharing method based on Stackelberg game in cooperative cognitive wireless network | |
| Ren et al. | Joint spectrum allocation and power control in vehicular communications based on dueling double DQN | |
| CN102695176A (en) | Dynamic spectrum distribution method of cognitive radio network | |
| CN105592563A (en) | Multi-user opportunity spectrum access method | |
| CN102752760B (en) | Frequency spectrum collaboration sharing method in cognitive radio | |
| Zhou et al. | Joint peer discovery and resource allocation for social-aware D2D communications: A matching approach | |
| CN104255063A (en) | Network access mechanism based on power | |
| CN109039395B (en) | Beam selection method and device | |
| Elgaml et al. | Towards low-delay and high-throughput cognitive radio vehicular networks | |
| Liu et al. | Energy-efficiency maximization in D2D-enabled vehicular communications with consideration of dynamic channel information and fairness | |
| CN102118744B (en) | Method for safely selecting cooperative user during cooperative spectrum sensing | |
| Liu et al. | Hierarchical power allocation algorithm for D2D‐based cellular networks with heterogeneous statistical quality‐of‐service constraints |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20160302 |