CN103260166A - Distributed cognition wireless network spectrum allocation method based on coalition games - Google Patents
Distributed cognition wireless network spectrum allocation method based on coalition games Download PDFInfo
- Publication number
- CN103260166A CN103260166A CN201310120637XA CN201310120637A CN103260166A CN 103260166 A CN103260166 A CN 103260166A CN 201310120637X A CN201310120637X A CN 201310120637XA CN 201310120637 A CN201310120637 A CN 201310120637A CN 103260166 A CN103260166 A CN 103260166A
- Authority
- CN
- China
- Prior art keywords
- value
- user
- alliance
- inferior
- time
- 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
Links
- 238000001228 spectrum Methods 0.000 title claims abstract description 93
- 238000000034 method Methods 0.000 title claims abstract description 58
- 230000019771 cognition Effects 0.000 title claims abstract description 24
- 230000008569 process Effects 0.000 claims description 27
- 230000005540 biological transmission Effects 0.000 claims description 20
- 239000011159 matrix material Substances 0.000 claims description 15
- 230000004927 fusion Effects 0.000 claims description 7
- 230000008878 coupling Effects 0.000 claims description 6
- 238000010168 coupling process Methods 0.000 claims description 6
- 238000005859 coupling reaction Methods 0.000 claims description 6
- 238000001514 detection method Methods 0.000 claims description 6
- 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
- 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
- 230000008859 change Effects 0.000 description 2
- 239000013598 vector Substances 0.000 description 2
- 230000003044 adaptive effect Effects 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000008447 perception Effects 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
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a distributed cognition wireless network spectrum allocation method based on coalition games. The problem that in the prior art, a cognition wireless network cannot fully use a totalization and whole and partial concept to allocate free frequency ranges is mainly solved. The method comprise the steps of detecting free frequency ranges, computing secondary user utility values, establishing stable coalition, selecting a coalition manager, merging data, refreshing secondary user trust values, allocating the free frequency ranges and refreshing the secondary user trust values. The method is fully combined with the advantages of the cognition wireless network, the trust values, participation values and requirement values are used to represent the utility values of a secondary user comprehensively, the secondary user satisfaction degree of the free frequency ranges and network service quality are improved, the secondary user is divided into the coalition to allocate spectrum resources, using ratio of the free frequency ranges and fairness of spectrum allocating are improved, and by refreshing the secondary user trust values, negative influence on a network from a vicious secondary user is lowered.
Description
Technical field
The invention belongs to communication technical field, further relate to distributed cognition radio network in the cognition wireless network field based on the frequency spectrum distributing method as required of alliance's game.The present invention can be according to inferior user's requirements, participation value, trust value and the physical attribute of authorizing frequency range, method in conjunction with Engineering Optimizational Method and alliance's game, dynamically adjust the probability that time user obtains frequency spectrum, thereby make the distribution of cognition wireless network frequency spectrum resource and use more flexible, efficiently, justice.
Background technology
In recent years, because the finiteness of frequency spectrum resource, and most of frequency spectrum has been assigned to authorized user, causes frequency spectrum resource now rare.In fact, studies show that in a large number authorizing frequency range is idle in the plenty of time section, uncommitted user uses, and this is the waste to limited frequency spectrum resource in some sense.For these idle frequency spectrums are fully utilized, people have 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 who rents frequency spectrum is called time user.
Spectrum allocation may refers to according to time user's number and its demand to channel idle frequency spectrum be distributed to the user one or more times, and main purpose is to select and utilize idle frequency spectrum effectively by an adaptive strategy.In cognition network, in order to obtain to insert the authority of idle frequency spectrum, all times user must come the idle period of perception mandate frequency spectrum by cooperation.When authorizing frequency spectrum idle, obtain to rent inferior user of authority can rent the inferior user of this band transmissions under the prerequisite that does not influence main user local information.Utilize the dynamic frequency spectrum deployment strategy, can improve the flexibility of radio communication effectively, avoid the conflict between main user and the inferior user.
The patent application that Southeast China University proposes " a kind of cognitive sensing net based on cooperative game bunch in frequency spectrum distributing method " (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: at first cognitive nodes by bunch in local control channel the channel condition information that perceives is sent to a bunch head, bunch head utilizes these information, sets up the channel idle matrix.Secondly, utilize subchannel matrix, node priority weight vectors, public indication vector constructing system utility function.At last, add two constraintss, obtain optimum subchannel matrix by maximization system utility function.The deficiency that this patent application exists is: at first, in this method model bunch is static, can not change and dynamically adjusts according to inferior state of user.Secondly, the inferior User Priority that adopts when setting up utility function has only been considered the conditions of demand of user to channel, and basis time user's credibility and inferior user do not wait Comprehensive Assessment time user's priority to the contribution of network.
The patent application " based on the frequency spectrum share game method of the 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 the frequency spectrum share game based on the demand factor and has taken precautions against, concrete steps are: at first the frequency spectrum share problem model is turned to Cournot model, and make up need-based time user's game utility function.Secondly, calculate time user's frequency spectrum shared number.The solution procedure of frequency spectrum optimal response function is discussed at last.The deficiency that this patent application exists is: at first, only considered inferior user's demand and bid, but do not considered time user's credibility, if time user is the illegal user of overbid, then do not influenced this original intention of main telex network against the cognition net.Secondly, only considered in the demand function that inferior user to the requirement of frequency spectrum quantity, does not consider the difference in actual use of channel quality difference, may cause time user to get the phenomenon that frequency spectrum but can't be communicated by letter, at last, do not consider in the spectrum allocation may process not homogeneous user's fairness problem.
Summary of the invention
The present invention is directed to the deficiencies in the prior art, a kind of distributed cognition wireless network is proposed based on the frequency spectrum distributing method of alliance's game, adopt the method for alliance's game, carry out the frequency spectrum resource distribution in the basis of trust value introducing time user's participation value and requirements, can guarantee that the frequency spectrum that time user obtains all is available, improve the utilance of frequency spectrum in the net, guaranteed the fairness between inferior user, promoted inferior user's satisfaction and enthusiasm simultaneously.
To achieve these goals, concrete steps of the present invention comprise as follows:
(1) detects idle frequency spectrum
1a) initial value that will participate in the inferior users to trust value of spectrum allocation may process first is set at 0.5, and the initial value of inferior user's participation value is set at 0;
1b) data-storing of other times user transmission that will accept of inferior user is in self memory space;
1c) the data content end that need transmit of inferior scanning input obtains the required bandwidth of transmission data, the power that the transmission data are required and transmission required time of data;
1d) inferior user uses self antenna, detects the radio signal energy of authorized user frequency range; When the authorization user signal energy that detects during greater than detection threshold value, authorized user takies frequency range, and inferior user is set at 0 with the state value of occupied frequency range in the local band table; Otherwise frequency range is idle condition, and inferior user is set at 1 with the state value of local band table hollow ideler frequency section;
1e) inferior user adopts the test signal method, obtains the largest tolerable power of idle frequency range;
1f) inferior user adopts time forecasting methods, obtains the free time of idle frequency range;
1g) inferior user inquires about the frequency spectrum tabulation, obtains the bandwidth of idle frequency range.
(2) calculate time user's value of utility
2a) calculate time user's requirements according to following formula:
Wherein, N represents time user's requirements, and b represents that time user transmits the required bandwidth of data, and p represents that time user transmits the required power of data, and d represents that time user transmits the required time of data;
2b) use simple method to calculate time user's value of utility.
(3) alliance is stablized in foundation
3a) each time user is set at an alliance;
3b) calculate the overall utility value of each alliance according to following formula;
Wherein, S represents the overall utility value of each alliance, and ∑ is represented the symbol of suing for peace, 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 that merges back alliance;
3d) judge the overall utility value that merges back alliance, whether less than the overall utility value that participates in merging one of them alliance in the alliance, if less than, then cancellation merges; Otherwise, execution in step 3e);
3e) contain that the highest inferior user of trust value is split into an alliance at least two users' the alliance after will merging, another alliance that remaining time user is split in the preceding alliance will be divided, according to step 3b) overall utility value formula, calculate the overall utility value that divides each alliance of back;
3f) judge the overall utility value of two alliances of division gained, whether all less than the overall utility value of alliance before the division, if all less than, then cancellation division; Otherwise, execution in step 3g);
3g) repeating step 3c), step 3d), step 3e), step 3f), all can't continue to merge or division until all alliances;
3h) calculate in each alliance the mean value of all times user's request values, with the requirements of mean value as each time user in the current state alliance.
(4) select league administrator
To each alliance, the inferior user that trust value is the highest in the selection alliance is as the manager of this alliance.
(5) data fusion
5a) each time user sends to league administrator with local band table;
5b) league administrator is calculated the state value of all local band table Mid Frequencies according to fusion formula, and state value is deposited in the network band table;
5c) league administrator sends to all times user in the alliance with the network band table.
(6) upgrade time users to trust value
Each time user contrasts in the state value of local band table Mid Frequency and the network band table that league administrator sends corresponding with it frequency range state value; When the state value of corresponding band in the network band table that the state value of inferior subscriber's local band table Mid Frequency and league administrator send is inequality, with 0.5 times of trust value as current state time user of the trust value of inferior user's previous state.
(7) distribute idle frequency range
7a) calculate the matching degree of time user and idle frequency range according to 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 required bandwidth of data, Q represents the largest tolerable power of idle frequency range, p represents that time user transmits the required power of data, and D represents the free time of idle frequency range, and d represents that time user transmits the required time of data;
7b) whether judge matching degree Y greater than 0.5, if, expression time user and idle frequency range coupling, execution in step 7c); Otherwise expression time user and idle frequency range do not match execution in step 7d);
7c) idle frequency allocation is given the highest inferior user of trust value among the inferior user with its coupling;
7d) repeating step 7a), step 7b), step 7c), all distribute to time user until all idle frequency ranges.
(8) upgrade time users to trust value
8a) inferior user records power and the time of reality when transmitting data in the idle band transmissions data that are assigned to;
8b) if the time of reality and power part are less than required time and power when time user is transmitted data, then with 1.5 times of inferior users to trust values as current state of in the step (6) users to trust value; Otherwise, with 0.5 times of inferior users to trust value as current state of in the step (6) users to trust value;
8c) repeating step (1) does not all need the data of transmitting to step (8) in all inferior users.
The present invention compared with prior art has the following advantages:
First, the present invention adopts time user to transmit the required bandwidth of data, power and time, calculate time user's requirements, overcome in the prior art requirements and only considered that inferior user is to the requirement of number of frequency bands, do not consider the deficiency of frequency range quality difference difference in actual use, make the present invention improve network to inferior quality of services for users.
Second, the present invention is according to inferior user's trust value, requirements and participation value are calculated time user's value of utility, guaranteeing that the high inferior user of trust value can obtain on the basis of idle frequency range on high probability ground, encourage the not high user of trust value to improve the probability that oneself obtains frequency spectrum by playing an active part in frequency spectrum, demand and the bid of only having considered inferior user in the prior art have been overcome, but do not consider the deficiency of time user's credibility, make the present invention improve the reliability that inferior user obtains idle frequency spectrum, the inferior user who has improved first adding cognition wireless network obtains the probability of idle frequency range.
The 3rd, the present invention adopts simple method to optimize time user's value of utility, make homogeneous user not trust value, participation value and requirements have different weights, overcome the inferior User Priority that adopts when setting up utility function in the prior art and only considered the conditions of demand of user to channel, according to time user's credibility and inferior user the contribution of network is not waited the deficiency of Comprehensive Assessment time user's priority, make the present invention improve integrality and the reliability of inferior user's value of utility.
The 4th, the present invention adopts time user's value of utility to calculate the overall utility value of alliance, stablize alliance by the merging between alliance or division formation, overcome and do not considered in the spectrum allocation may process the not deficiency of homogeneous user's fairness in the prior art, make the present invention increase the income of cognition wireless network, improved the fairness of cognition wireless network.
Description of drawings
Fig. 1 is flow chart of the present invention;
Fig. 2 stablizes the flow chart of alliance's step for the present invention sets up;
Fig. 3 stablizes the structural representation of alliance for 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 time user is in the same geographical position in the network, adopts the distributed group net mode, no base station, and inferior user uses idle frequency range by demand application separately, 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 that participates in the inferior users to trust value of spectrum allocation may first is set at 0.5, the initial value of inferior user's participation value is set at 0.
Inferior user's trust value is represented the credibility of its behavior, is to weigh a whether believable standard of time user behavior, and it constantly changes in the process of each spectrum allocation may.Inferior user's participation value representation 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 is along with the number of times of spectrum allocation may changes with time number of times of user's participation.
The data-storing of other times user that inferior user will accept transmission is in self memory space, and scanning needs the end of the data content of transmission, obtains transmission data required bandwidth, power and the time.The value of these three parameters has determined the requirement of secondary user's for idle frequency range, and based on these three parameters, inferior user can select the idle frequency range that is fit to the transmission desired data.
Inferior user uses self antenna, detects the radio signal energy of authorized user frequency range; When the authorization user signal energy that detects during greater than detection threshold value, the expression authorized user takies frequency range, and inferior user is set at 0 with the state value of occupied frequency range in the local band table; Otherwise the expression frequency range is idle condition, and inferior user is set at 1 with the state value of local band table hollow ideler frequency section.Detection threshold value is the difference that the transmitting power of authorized user deducts the free space propagation loss, and free space propagation loss value is to be calculated by following formula to obtain:
L＝32.44+20lg?r+20lg?u
Wherein, L represents free space propagation loss value, and lg represents to ask log, and r represents the distance of time user and authorized user, and u represents to detect the frequency of frequency range.
Local band table record time user detects the result of frequency range, is expressed as the matrix of 2 * n, and n is the number of time detected frequency range of user, the 1st line display frequency spectrum designation of matrix, and the state value of frequency range is represented in the 2nd behavior of matrix.
Inferior user is the test signal that 1 idle frequency range is sent variable power to the frequency range state value, and signal power evenly increases in time, reaches the maximum critical value that test signal can normal transmission until power, obtains the largest tolerable power of idle frequency range.
Inferior user calculates the average of continuous 5 the spectrum allocation may process Mid Frequency free times before this spectrum allocation may, with the frequency range free time of this average as this spectrum allocation may, if frequency range participates in the number of times less than 5 times of spectrum allocation may, then free time of frequency range is set in this assigning process time user and transmits the required time of data.
Inferior user inquires about the frequency spectrum tabulation, obtains the bandwidth of idle frequency range.
Step 2 is calculated time user's value of utility.
Inferior user uses following formula to calculate the self-demand value:
Wherein, N represents time user's requirements, and b represents that time user transmits the required bandwidth of data, and p represents that time user transmits the required power of data, and d represents that time user transmits the required time of data.
Inferior user uses simple method to calculate time user's value of utility according to self requirements, trust value and participation value, the steps include:
The first step, trust value, requirements and the participation value that inferior user calculates self shared weight in value of utility, its formula is as follows:
Wherein, max represents the maximizing symbol, h represents the inferior users to trust value of current state, the inferior users to trust value that q represents current state shared weight in value of utility, N represents the inferior user's request value of current state, the inferior user's request value that w represents current state shared weight in value of utility, J represents inferior user's participation value of current state, inferior user's participation value that e represents current state shared weight in value of utility.
Second step, according to inferior users to trust value, requirements and the participation value of trying to achieve shared weight in value of utility, the calculating value of utility, its formula is as follows:
V＝h×q+N×w+J×e
Wherein, V represents inferior user's value of utility of current state in this spectrum allocation may process, h represents the inferior users to trust value of current state in this spectrum allocation may process, the inferior users to trust value that q represents current state in this spectrum allocation may process shared weight in value of utility, N represents the inferior user's request value of current state in this spectrum allocation may process, the inferior user's request value that w represents current state in this spectrum allocation may process shared weight in value of utility, J represents inferior user's participation value of current state in this spectrum allocation may process, inferior user's participation value that e represents current state in this spectrum allocation may process shared weight in value of utility.
Step 3 is set up and is stablized alliance.
With reference to accompanying drawing 2, this step specific implementation process is as follows:
3a) alliance's initialization is set at an alliance with each time user.
3b) according to time number of users in the alliance and each time user's value of utility, calculate the overall utility value of each alliance according to overall utility value formula, its overall utility value formula is as follows:
Wherein, S represents the overall utility value of each alliance, and ∑ is represented the symbol of suing for peace, 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 that merges back alliance.Judge the overall utility value that merges back alliance, whether greater than the overall utility value that participates in one of them alliance in the merging alliance, if greater than, then keep the alliance after merging, comprise the inferior user that all participate in the alliance of merging in the alliance of company after the merging.Execution in step 3c); Otherwise then cancellation merges, and returns the state before this adjacent alliance merges, execution in step 3d).
3d) contain that the highest inferior user of trust value is split into an alliance at least two users' the alliance after will merging, another alliance that remaining time user is split in the preceding alliance will be divided, according to overall utility value formula, calculate the overall utility value of each alliance of division back.Judge the overall utility value of two alliances of division gained, whether greater than the overall utility value of alliance before the division, if all greater than, then keep the alliance after the division, execution in step 3c); Otherwise then cancellation division turns back to the preceding state of this alliance's division, execution in step 3e).
3e) when all alliances all can't continue to merge or divide, reach and stablize alliance.
Stablize the structure of alliance with reference to accompanying drawing 3.Fig. 3 comprises three circles, represents alliance 1 respectively, and alliance 2 and alliance 3, alliance 1 comprise the user four times, and alliance 2 comprises the user four times, and alliance 3 comprises the user three times, can direct communication between inferior user.The inferior user that trust value is the highest in each alliance is as the leader of alliance.Inferior number of users in three alliance's numbers and each alliance does not change in embodiments of the present invention.
3f) with the mean value of all time user's request values in each alliance, as the requirements of each time user in the current state alliance.
Step 4 is selected league administrator.
To each alliance, the inferior user that trust value is the highest in the selection alliance is as the manager of this alliance.After league administrator is selected, be constant in a spectrum allocation may process, the trust value after next assigning process changes according to time user is reselected.
Step 5, data fusion.
Each time user sends to league administrator with local band table.The manager of each alliance calculates the state value of all local band table Mid Frequencies according to following fusion formula, and state value is deposited in the network band table, and the result that network band table record data merge is expressed as the matrix of 2 * m, and m is the number of frequency range; The 1st line display frequency spectrum designation of matrix, the state value of the 2nd line display frequency range of matrix.
Wherein, y
xThe frequency range state of expression network band table Mid Frequency x, x ∈ 1,2,3 ..., M}, M represent the number of frequency range,
With
The frequency range state of representing frequency range x respectively is inferior user's collection of 0 and 1.
League administrator sends in the alliance all times users with the network band table, make all times users in the alliance can both obtain all inferior users in the alliance detect the state of all frequency ranges, state value is that 0 frequency range is available idle frequency range.
Step 6 is upgraded time users to trust value.
Each time user contrasts in the state value of local band table Mid Frequency and the network band table that league administrator sends corresponding with it frequency range state value; When the state value of corresponding band in the network band table that the state value of inferior subscriber's local band table Mid Frequency and league administrator send is inequality, namely this time user is inaccurate for the frequency range status detection, might the time flase drop taken place, also might be that malicious user has deliberately been revised the result who detects, no matter be above-mentioned which kind of situation, this time user does not really finish the task of detecting frequency range, with 0.5 times of trust value as current state time user of the trust value of inferior user's previous state.
Step 7 is distributed idle frequency range.
Between alliance according to the descending order of each alliance overall utility value, in the alliance according to inferior users to trust value by high order on earth, mate idle frequency range.Inferior user calculates the matching degree of this time user and idle frequency range according to the matching degree formula, 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 required bandwidth of data, Q represents the largest tolerable power of idle frequency range, p represents that time user transmits the required power of data, and D represents the free time of idle frequency range, and d represents that time user transmits the required time of data.
Whether judge matching degree Y greater than 0.5, if, expression time user and idle frequency range coupling; Otherwise expression time user and idle frequency range do not match.
Give the highest inferior user of trust value among the inferior user with its coupling with idle frequency allocation.The inferior user who obtains idle frequency range no longer participates in assigning process subsequently.
Repeating step 7 is all distributed to suitable inferior user until all idle frequency ranges.
Step 8 is upgraded time users to trust value.
The idle frequency range that inferior user is assigned to is used certain power transmission data, the power of reality and the actual required time of transmission data during record transmission data.
If the time of reality and power were all less than required time and power when time user was transmitted data, then with 1.5 times of inferior users to trust values as current state of in the step 6 users to trust value; Otherwise, with 0.5 times of inferior users to trust value as current state of in the step 6 users to trust value.The initial value of time users to trust value during as next spectrum allocation may of the trust value after the renewal.
Repeating step 1 does not all need the data of transmitting to step 8 in all times user.
Claims (8)
1. a distributed cognition wireless network comprises the steps: based on the frequency spectrum distributing method of alliance's game
(1) detect idle frequency spectrum:
1a) initial value that will participate in the inferior users to trust value of spectrum allocation may process first is set at 0.5, and the initial value of inferior user's participation value is set at 0;
1b) data-storing of other times user transmission that will accept of inferior user is in self memory space;
1c) the data content end that need transmit of inferior scanning input obtains the required bandwidth of transmission data, the power that the transmission data are required and transmission required time of data;
1d) inferior user uses self antenna, detects the radio signal energy of authorized user frequency range; When the authorization user signal energy that detects during greater than detection threshold value, authorized user takies frequency range, and inferior user is set at 0 with the state value of occupied frequency range in the local band table; Otherwise frequency range is idle condition, and inferior user is set at 1 with the state value of local band table hollow ideler frequency section;
1e) inferior user adopts the test signal method, obtains the largest tolerable power of idle frequency range;
1f) inferior user adopts time forecasting methods, obtains the free time of idle frequency range;
1g) inferior user inquires about the frequency spectrum tabulation, obtains the bandwidth of idle frequency range;
(2) calculate time user's value of utility:
2a) calculate time user's requirements according to following formula:
Wherein, N represents time user's requirements, and b represents that time user transmits the required bandwidth of data, and p represents that time user transmits the required power of data, and d represents that time user transmits the required time of data;
2b) use simple method to calculate time user's value of utility;
(3) alliance is stablized in foundation:
3a) each time user is set at an alliance;
3b) calculate the overall utility value of each alliance according to following formula;
Wherein, S represents the overall utility value of each alliance, and ∑ is represented the symbol of suing for peace, 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 that merges back alliance;
3d) judge the overall utility value that merges back alliance, whether less than the overall utility value that participates in merging one of them alliance in the alliance, if less than, then cancellation merges, otherwise, execution in step 3e);
3e) contain that the highest inferior user of trust value is split into an alliance at least two users' the alliance after will merging, another alliance that remaining time user is split in the preceding alliance will be divided, according to step 3b) overall utility value formula, calculate the overall utility value that divides each alliance of back;
3f) judge the overall utility value of two alliances of division gained, whether all less than the overall utility value of alliance before the division, if all less than, then cancellation division, otherwise, execution in step 3g);
3g) repeating step 3c), step 3d), step 3e), step 3f), all can't continue to merge or division until all alliances;
3h) calculate in each alliance the mean value of all times user's request values, with the requirements of mean value as each time user in the current state alliance;
(4) select league administrator:
To each alliance, the inferior user that trust value is the highest in the selection alliance is as the manager of this alliance;
(5) data fusion:
5a) each time user sends to league administrator with local band table;
5b) league administrator is calculated the state value of all local frequency spectrum table Mid Frequencies according to fusion formula, and state value is deposited in the network spectrum table;
5c) league administrator sends to all times user in the alliance with the network band table;
(6) upgrade time users to trust value:
Each time user contrasts in the state value of local band table Mid Frequency and the network band table that league administrator sends corresponding with it frequency range state value; When the state value of corresponding band in the network band table that the state value of inferior subscriber's local band table Mid Frequency and league administrator send is inequality, with 0.5 times of trust value as current state time user of the trust value of inferior user's previous state;
(7) distribute idle frequency range:
7a) calculate the matching degree of time user and idle frequency range according to 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 required bandwidth of data, Q represents the largest tolerable power of idle frequency range, p represents that time user transmits the required power of data, and D represents the free time of idle frequency range, and d represents that time user transmits the required time of data;
7b) whether judge matching degree Y greater than 0.5, if, expression time user and idle frequency range coupling, execution in step 7c); Otherwise expression time user and idle frequency range do not match execution in step 7d);
7c) idle frequency allocation is given the highest inferior user of trust value among the inferior user with its coupling;
7d) repeating step 7a), step 7b), step 7c), all distribute to time user until all idle frequency ranges;
(8) upgrade time users to trust value:
8a) inferior user records power and the time of reality when transmitting data in the idle band transmissions data that are assigned to;
8b) if the time of reality and power are all less than required time and power when time user is transmitted data, then with 1.5 times of inferior users to trust values as current state of in the step (6) users to trust value; Otherwise, with 0.5 times of inferior users to trust value as current state of in the step (6) users to trust value;
8c) repeating step (1) does not all need the data of transmitting to step (8) in all inferior users.
2. distributed cognition wireless network according to claim 1 is based on the frequency spectrum distributing method of alliance's game, it is characterized in that, step 1d) described local frequency spectrum table, record time user detects the frequency range result, be expressed as the matrix of 2 * n, n is the number of time detected frequency range of user, the 1st line display frequency spectrum designation of matrix, and the state value of frequency range is represented in the 2nd behavior of matrix.
3. distributed cognition wireless network according to claim 1 is characterized in that step 1d based on the frequency spectrum distributing method of alliance's game) 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 alliance's game, it is characterized in that, step 1e) described test signal method refers to, inferior user sends the test signal of variable power to idle frequency range, signal power evenly increases in time, reach the maximum critical value that test signal can normal transmission until power, obtain largest tolerable power.
5. distributed cognition wireless network according to claim 1 is based on the frequency spectrum distributing method of alliance's game, it is characterized in that, step 1f) described time forecasting methods refer to, inferior user calculates the average of continuous 5 the spectrum allocation may process Mid Frequency free times before this spectrum allocation may, with the frequency range free time of this average as this spectrum allocation may, if frequency range participates in the number of times less than 5 times of spectrum allocation may, then free time of frequency range is set in this assigning process time user and transmits the required time of data.
6. distributed cognition wireless network according to claim 1 is characterized in that step 2b based on the frequency spectrum distributing method of alliance's game) concrete steps of described simple method are as follows:
The first step, according to following formula, trust value, requirements and the participation value of calculating time user shared weight in value of utility:
Wherein, max represents the maximizing symbol, h represents the inferior users to trust value of current state, the inferior users to trust value that q represents current state shared weight in value of utility, N represents the inferior user's request value of current state, the inferior user's request value that w represents current state shared weight in value of utility, J represents inferior user's participation value of current state, inferior user's participation value that e represents current state shared weight in value of utility;
Second goes on foot, and calculates time user's value of utility according to following formula:
V＝h×q+N×w+J×e
Wherein, V represents inferior user's value of utility of current state in this spectrum allocation may process, h represents the inferior users to trust value of current state in this spectrum allocation may process, the inferior users to trust value that q represents current state in this spectrum allocation may process shared weight in value of utility, N represents the inferior user's request value of current state in this spectrum allocation may process, the inferior user's request value that w represents current state in this spectrum allocation may process shared weight in value of utility, J represents inferior user's participation value of current state in this spectrum allocation may process, inferior user's participation value that e represents current state in this spectrum allocation may process shared weight in value of utility.
7. distributed cognition wireless network according to claim 1 is characterized in that step 5b based on the frequency spectrum distributing method of alliance's game) described fusion formula is as follows:
Wherein, y
xThe frequency range state of expression network band table Mid Frequency x, x ∈ 1,2,3 ..., M}, M represent the number of frequency range,
With
The frequency range state of representing frequency range x respectively is inferior user's collection of 0 and 1.
8. distributed cognition wireless network according to claim 1 is characterized in that step 5b based on the frequency spectrum distributing method of alliance's game) described network band table, the result that record data merge is expressed as the matrix of 2 * m, note, m is the number of frequency range; The 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 true CN103260166A (en) | 2013-08-21 |
| CN103260166B 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) |
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103442368A (en) * | 2013-09-09 | 2013-12-11 | 哈尔滨工业大学 | Latent gaming-based method for distributing frequency spectrums in cognition wireless system |
| CN103686701A (en) * | 2013-12-31 | 2014-03-26 | 遵义天义利威机电有限责任公司 | Method for improving user security in cognitive radio network |
| CN103684641A (en) * | 2013-12-31 | 2014-03-26 | 遵义天义利威机电有限责任公司 | Cognitive radio cooperative spectrum sensing mechanism based on overlapping coalition game |
| CN103701917A (en) * | 2013-12-31 | 2014-04-02 | 遵义天义利威机电有限责任公司 | OCF game-based context awareness incentive mechanism of smart phone |
| CN103874225A (en) * | 2014-03-31 | 2014-06-18 | 北京邮电大学 | Method and base station for mobile terminal to have access to wireless network |
| CN105120463A (en) * | 2015-09-02 | 2015-12-02 | 西安电子科技大学 | Multi-factor decision making method based on user requirements in cognitive radio network |
| CN106535346A (en) * | 2016-11-24 | 2017-03-22 | 哈工大机器人集团上海有限公司 | Method for establishing network connection |
| CN106790213A (en) * | 2017-01-10 | 2017-05-31 | 西安电子科技大学 | A kind of trust management method based on nested game in center type cognition wireless network |
| CN106851672A (en) * | 2017-01-20 | 2017-06-13 | 国家计算机网络与信息安全管理中心 | The method and device that packet forwarding Game with Coalitions payment model builds |
| CN108206728A (en) * | 2017-11-30 | 2018-06-26 | 天津津航计算技术研究所 | A kind of cooperation data packet transmission method based on Game with Coalitions |
| CN108366428A (en) * | 2018-03-20 | 2018-08-03 | 东南大学 | A kind of joint spectrum perception and resource allocation methods and device based on game optimization |
| CN108616996A (en) * | 2018-03-19 | 2018-10-02 | 山东大学 | A kind of frequency spectrum and power distribution method, apparatus and system of Femtocell networks |
| 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 |
| CN111918296A (en) * | 2020-07-01 | 2020-11-10 | 中国人民解放军陆军工程大学 | Distributed wireless network spectrum sharing system and sharing method |
| CN113347638A (en) * | 2021-05-14 | 2021-09-03 | 东北大学 | Dynamic cooperative spectrum prediction and sensing method for cognitive industry Internet of things |
Citations (4)
| 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 |
| WO2012136261A1 (en) * | 2011-04-07 | 2012-10-11 | Nokia Siemens Networks Oy | Optimization of network configuration |
-
2013
- 2013-03-25 CN CN201310120637.XA patent/CN103260166B/en not_active Expired - Fee Related
Patent Citations (4)
| 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 |
| WO2012136261A1 (en) * | 2011-04-07 | 2012-10-11 | Nokia Siemens Networks Oy | Optimization of network configuration |
| CN102307351A (en) * | 2011-08-29 | 2012-01-04 | 中山大学 | Game-theory-based spectrum allocation method, communication equipment and system |
Non-Patent Citations (2)
| Title |
|---|
| 马国峻，裴庆祺，姜晓鸿: "DRM博弈控制分析", 《通信学报》 * |
| 黎妍: "《南京邮电大学硕士学位论文，认知无线电中基于联盟博弈的协作频谱感知技术的研究》", 2 March 2012 * |
Cited By (25)
| 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 |
| CN103442368A (en) * | 2013-09-09 | 2013-12-11 | 哈尔滨工业大学 | Latent gaming-based method for distributing frequency spectrums in cognition wireless system |
| CN103686701A (en) * | 2013-12-31 | 2014-03-26 | 遵义天义利威机电有限责任公司 | Method for improving user security in cognitive radio network |
| CN103684641A (en) * | 2013-12-31 | 2014-03-26 | 遵义天义利威机电有限责任公司 | Cognitive radio cooperative spectrum sensing mechanism based on overlapping coalition game |
| CN103701917A (en) * | 2013-12-31 | 2014-04-02 | 遵义天义利威机电有限责任公司 | OCF game-based context awareness incentive mechanism of smart phone |
| CN103686701B (en) * | 2013-12-31 | 2017-04-05 | 遵义天义利威机电有限责任公司 | The method that user security is improved in cognitive type radio net |
| CN103684641B (en) * | 2013-12-31 | 2016-03-02 | 遵义天义利威机电有限责任公司 | Based on the cognitive wireless radio cooperation frequency spectrum perception mechanism of overlapping Game with Coalitions |
| CN103874225B (en) * | 2014-03-31 | 2018-03-02 | 北京邮电大学 | The method of mobile terminal access wireless network and base station |
| CN103874225A (en) * | 2014-03-31 | 2014-06-18 | 北京邮电大学 | Method and base station for mobile terminal to have access to wireless network |
| CN105120463B (en) * | 2015-09-02 | 2018-08-07 | 西安电子科技大学 | A kind of multifactor decision making method based on user demand in cognitive radio networks |
| CN105120463A (en) * | 2015-09-02 | 2015-12-02 | 西安电子科技大学 | Multi-factor decision making method based on user requirements in cognitive radio network |
| CN106535346A (en) * | 2016-11-24 | 2017-03-22 | 哈工大机器人集团上海有限公司 | Method for establishing network connection |
| CN106535346B (en) * | 2016-11-24 | 2019-07-02 | 哈工大机器人集团上海有限公司 | A kind of method for building up of network connection |
| CN106790213A (en) * | 2017-01-10 | 2017-05-31 | 西安电子科技大学 | A kind of trust management method based on nested game in center type cognition wireless network |
| CN106851672B (en) * | 2017-01-20 | 2020-10-09 | 国家计算机网络与信息安全管理中心 | Method and device for constructing data packet forwarding alliance game payment model |
| CN106851672A (en) * | 2017-01-20 | 2017-06-13 | 国家计算机网络与信息安全管理中心 | The method and device that packet forwarding Game with Coalitions payment model builds |
| CN108206728A (en) * | 2017-11-30 | 2018-06-26 | 天津津航计算技术研究所 | A kind of cooperation data packet transmission method based on Game with Coalitions |
| CN108616996A (en) * | 2018-03-19 | 2018-10-02 | 山东大学 | A kind of frequency spectrum and power distribution method, apparatus and system of Femtocell networks |
| CN108366428A (en) * | 2018-03-20 | 2018-08-03 | 东南大学 | A kind of joint spectrum perception and resource allocation methods and device based on game optimization |
| 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 |
| CN111918296A (en) * | 2020-07-01 | 2020-11-10 | 中国人民解放军陆军工程大学 | Distributed wireless network spectrum sharing system and sharing method |
| CN113347638A (en) * | 2021-05-14 | 2021-09-03 | 东北大学 | Dynamic cooperative spectrum prediction and sensing method for cognitive industry Internet of things |
| CN113347638B (en) * | 2021-05-14 | 2024-04-30 | 东北大学 | Cognitive industrial Internet of things dynamic cooperation spectrum prediction and perception method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103260166B (en) | 2016-03-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103260166A (en) | Distributed cognition wireless network spectrum allocation method based on coalition games | |
| CN103297974B (en) | A kind of method for allocating dynamic frequency spectrums and device based on channel management | |
| CN102186176B (en) | Cognitive radio spectrum sharing method based on supply-demand balance | |
| CN102413473B (en) | Cooperative game-based frequency spectrum allocation method in cognitive sensor network cluster | |
| CN104469951B (en) | A kind of method, apparatus and system of resource allocation | |
| CN101635600B (en) | Channel and power joint distribution method based on interference temperature in cognitive radio (CR) | |
| CN103347246A (en) | Method for finding adjacent user under embedded D2D circumstances in cellular network | |
| CN103596182A (en) | Method for managing spectrum resources in D2D communications | |
| Zhao et al. | Joint subchannel and power allocation in multiuser OFDM systems with minimal rate constraints | |
| CN107040323B (en) | Multichannel power bandwidth combined distributing method in a kind of cognitive radio networks | |
| US20140211707A1 (en) | Method and device for allocating group identifier | |
| CN101729164B (en) | Wireless resource allocation method and cognitive radio user equipment | |
| CN102448159A (en) | Interference management-based power and speed combined control gaming method | |
| CN101321388B (en) | Cognition radio network FDM channel selection method based on game theory | |
| CN104640117A (en) | Allocation method and device of frequency spectrum resources | |
| CN111669759A (en) | Dynamic multi-channel cooperative sensing method based on deep Q network | |
| CN106714327A (en) | Method and transmitter of implementing multiple-carrier Listen-Before-Talk | |
| CN101646176B (en) | Distance tree protocol frame of medium access control (MAC) layer based on opportunistic spectrum access (OSA) technology | |
| CN104270768A (en) | Spectrum sharing method based on Stackelberg game in cooperative cognitive wireless network | |
| CN102883326A (en) | Method for distributing frequency spectrum resources in cognitive network | |
| Dahrouj et al. | Coordinated scheduling for wireless backhaul networks with soft frequency reuse | |
| Elias et al. | Distributed spectrum management in TV white space networks | |
| CN102695176A (en) | Dynamic spectrum distribution method of cognitive radio network | |
| CN105592563A (en) | Multi-user opportunity spectrum access method | |
| CN106162646A (en) | The motivational techniques of a kind of cooperation interference realizing safety of physical layer and device |
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 |