CN110290589B - Dynamic channel allocation and QoS guarantee data transmission method based on bidirectional cooperation - Google Patents
Dynamic channel allocation and QoS guarantee data transmission method based on bidirectional cooperation Download PDFInfo
- Publication number
- CN110290589B CN110290589B CN201910677528.5A CN201910677528A CN110290589B CN 110290589 B CN110290589 B CN 110290589B CN 201910677528 A CN201910677528 A CN 201910677528A CN 110290589 B CN110290589 B CN 110290589B
- Authority
- CN
- China
- Prior art keywords
- user
- bandwidth
- game
- primary user
- transmission
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
- H04W72/541—Allocation or scheduling criteria for wireless resources based on quality criteria using the level of interference
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
- H04W72/543—Allocation or scheduling criteria for wireless resources based on quality criteria based on requested quality, e.g. QoS
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/14—Spectrum sharing arrangements between different networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention discloses a dynamic channel based on bidirectional cooperationA data transmission method for distribution and QoS guarantee. The invention relates to a data transmission method based on bidirectional cooperation dynamic channel allocation and QoS guarantee, which is characterized by comprising the following steps: step 1: by setting a revenue function as game constraint, the primary user performs game matching on the secondary users to generate an optimal strategy set which accords with Nash equilibrium convergence; and 2, step: adaptively partitioning the bandwidth by taking W 1 The lower limit of the range of the method ensures that the transmission quality of the primary user is not influenced. The invention has the beneficial effects that: the invention can reasonably schedule the existing network resources, furthest improve the network throughput rate and the network bandwidth utilization rate on the basis of not increasing hardware resources, and simultaneously can furthest reduce the transmitting power of the master user under the condition of not influencing the transmission quality of the master user, thereby reducing the working energy consumption of the master node and prolonging the service life of the master node.
Description
Technical Field
The invention relates to a data transmission method which is applied to a cognitive wireless network and enables the data transmission performance of a global network to be optimal on the basis of not increasing hardware resources, in particular to a data transmission method based on bidirectional cooperation dynamic channel allocation and QoS guarantee.
Background
In recent years, with the rapid development of wireless communication technology, especially the development of wireless personal area network and wireless local area network technology, more and more people and things rely on the wireless technology to access the internet. Originally, wireless networks employed static spectrum allocation strategies, and governments have long-term licensed wireless spectrum to certain specific users for use based on regional long-term demand. However, due to the ever-increasing bandwidth demand, this policy makes the provision of certain spectrum severely scarce. On the other hand, a significant portion of the allocated spectrum is used less frequently, resulting in a lower overall utilization of the wireless spectrum.
In order to solve the technical problem that the utilization rate of the authorized frequency band is too low under the condition that the total amount of frequency spectrum resources is certain, expert scholars in the related field propose a solution for establishing a frequency spectrum secondary market to perform secondary utilization on the authorized frequency band, so that the overall use efficiency of the frequency band is improved. The concept of cognitive radio has come from the background of the technology, which was originally proposed by doctor Joseph Mitola of royal academy of royal sweden and is regarded as an extension technology of software radio. Cognitive radio is able to sense network environment information, allowing unauthorized wireless communication devices to actively identify and legally utilize free resources of a licensed frequency band. The appearance of the technology realizes the secondary utilization of the frequency band, thereby opening up a brand new situation for realizing the frequency band resource management and increasing the frequency band using frequency under the premise of lacking the bandwidth.
The Federal Communications Commission (Federal Communications Commission) refers to any radio with active spectrum sensing capability as a cognitive radio from the perspective of bandwidth resource management. Meanwhile, the FCC regulates that unlicensed devices can utilize licensed spectrum without affecting the licensed users. According to the FCC, cognitive radio is an opportunistic communication technology, which reverses the operation mode of conventional wireless communication, so that an originally passively executed wireless device can sense the wireless network environment, and thus actively adjust system parameters according to the change of the network environment. There are two types of users in cognitive radio networks, one being legitimate authorized users, also known as primary users, and the other being unauthorized users, also known as secondary users. The primary user has authorized spectrum resources, while the secondary user does not have authorized spectrum resources, and the secondary user can use an unauthorized band or a vacant authorized band. When the secondary user uses the authorized frequency band, the primary user returns, and the secondary user must immediately give way to the authorized frequency band, so that any harmful influence on the primary user is avoided. The secondary user can switch to another spectrum hole to execute the task.
One of the major challenges faced by cognitive radio development to date is how to increase the transmission opportunities for secondary users. To solve this problem, experts in the wireless field have proposed many solutions, the most promising of which is cooperative communication technology. The technology improves the channel capacity through space diversity, and in the cooperative transmission process, the system has three different types of nodes, namely a source node, a relay node and a destination node. The cooperative communication technology utilizes space diversity to enable the relay node to forward the data packet from the source node to the destination node. In the cognitive network, two cooperative transmission technologies are used for improving the transmission opportunity of a secondary user, namely vertical cooperation and horizontal cooperation. The vertical cooperation occurs between the primary user and the secondary user, and the secondary user serves as a cooperative node to help forward the data packet, so that the transmission quality of the primary user is improved, and the transmission delay is shortened. The master user releases the authorized bandwidth to provide the relay for the secondary user. As such, the secondary user gains transmission opportunity by providing cooperation to the primary user.
The traditional technology has the following technical problems:
however, cooperative technology provides opportunities for the development of cognitive radio, and at the same time, makes it a great challenge. Firstly, in the process of data transmission by a primary user, the authorized frequency band is difficult to be completely occupied, and meanwhile, in the traditional cooperation scheme, the secondary user cannot reasonably utilize the part of idle frequency band, so that the waste of frequency band resources is caused, and the overall performance of the network is reduced; secondly, the actual network environment is dynamically changed, and the cooperation scheme generated at one time cannot meet the transmission requirements of primary and secondary users for a long time. Meanwhile, frequently changing the cooperation scheme can seriously affect the overall performance of the network; thirdly, in the traditional cooperation technology, the selection of the cooperative nodes usually only meets the QoS of the current nodes, the method only guarantees the local optimality of the nodes, and the overall optimality of the network is not considered; fourthly, due to the particularity of the primary user position, the service life of the system is prolonged while the QoS of the system is guaranteed. That is, in the process of cooperation, not only the QoS of the primary and secondary users needs to be guaranteed, but also the power consumption of the primary user needs to be properly reduced.
Disclosure of Invention
In a dynamic complex cognitive network, the most fundamental aim is to optimize the data transmission performance of a global network on the basis of not increasing hardware resources. To achieve this goal, three key issues need to be addressed. One is the selection of the cooperative nodes. In a normal situation, when one node sends out a cooperation request, a plurality of idle nodes nearby respond. How to select proper nodes to ensure that the node bandwidth utilization rate of the network reaches the global optimum is a technical problem; the second is the problem of dividing the ratio of bandwidth and time slot. When the primary user uses the authorized bandwidth, the redundant bandwidth is often not utilized. On the premise of guaranteeing the QoS of a master user, the bandwidth and the transmission time slot of the master user are divided in proportion, so that the utilization rate of the authorized bandwidth of the master node is optimal; and thirdly, self-adaptive adjustment of the cooperation scheme. In a real network environment, the available bandwidth of the node is dynamically changed, so that the cooperation scheme also needs to be adaptively adjusted according to the change of the network environment.
No solution which can simultaneously solve the three technical problems exists in the research results of the existing cognitive network. Aiming at the defects in the prior art, the invention aims to provide a data transmission method applied to bidirectional dynamic cooperation between a primary user and a secondary user, which can reasonably schedule the existing network resources, furthest improve the utilization rate of the network resources on the basis of not increasing hardware resources, and simultaneously reduce the working energy consumption of the primary node, thereby prolonging the service life of the primary node.
In order to solve the above technical problem, the present invention provides a data transmission method based on bidirectional cooperation dynamic channel allocation and QoS guarantee, comprising:
step 1: by setting a revenue function as game constraint, the primary user performs game matching on the secondary users to generate an optimal strategy set which accords with Nash equilibrium convergence;
step 2: adaptively partitioning the bandwidth by taking W 1 The lower limit of the range of the master user is used for ensuring that the master user is properly served under the condition of not influencing the transmission quality of the master user; by taking W 2 The upper limit of the range of the method is combined with the result of the node game selection, the transmission requirement of secondary users is met, and the overall utilization rate of the network bandwidth is improved;
and step 3: when the available bandwidth of the node changes due to environmental interference or self demand change, the correction operation is carried out on the previously generated cooperation scheme.
In one embodiment, step 1 includes:
step 1.1: initializing game roles of a primary user and a secondary user;
step 1.2: acquiring physical attribute information of a primary user and a secondary user;
step 1.3: determining a revenue function U S
Wherein k is i，j Band j Total bandwidth required, k, for all secondary users indicating successful matching i，j *We i A total amount of free bandwidth, a revenue function U, representing all primary users successfully matched S Indicating the utilization rate of the global network idle bandwidth;
step 1.4: by a revenue function U S Performing primary user game for the reference, thereby generating a group of globally optimal strategy sets;
step 1.5: performing nash balance analysis on the final strategy set, if nash balance is satisfied, ending to obtain a group of globally optimal strategy sets, and executing the step 2; if the Nash equilibrium is not satisfied, returning to the step 1.4 to play the game again; wherein the non-cooperative game τ non Nash equilibrium of (a) means: for non-cooperative gambling τ non ＝{N，M，{S}，{U S }, strategy group station
Is a nash equilibrium, if and only if for each player, the following inequality holds:
wherein the content of the first and second substances,
in one embodiment, the step 2
Wherein Q is PU Indicates the size of the data packet to be transmitted by the master user within the time T, V PU A variable P representing the transmission requirement QoS of the primary user 1，2 And P 2 Respectively representing the transmitting power of a primary user facing a secondary user and the initial transmitting power of the primary user, wherein W represents the available total bandwidth of the primary user, and W represents the available total bandwidth of the primary user 2 Partial idle bandwidth (W) representing primary user 1 ，W 2 Is part of W, and W ═ W 1 +W 2 )。
In one embodiment, the correcting operation in step 3 is: when the last time slot T of the transmission scheme is finished, whether the total amount of the idle bandwidth and the division ratio of the bandwidth meet the transmission requirements of a primary user and a secondary user or not is detected respectively. When the total amount of the idle bandwidth of the primary user cannot meet the transmission requirement of the secondary user, reselecting the cooperative node of the secondary user through a game model; when the division ratio of the bandwidth cannot meet the transmission requirement of the master user, the W needs to be adjusted 1 And W 2 Is subdivided in size. And when the adjusted cooperation scheme meets the transmission requirements of the primary user and the secondary user again, entering the next transmission time slot.
In one embodiment, step 1.1 specifically includes: determining a primary user as a leader of the game process and a secondary user as a participant of the game process; wherein, the leader of the game process means: when a plurality of main users face at least one secondary user needing cooperative transmission, the main users can be used as a leader to conduct active game, and a relatively proper strategy set is generated according to the characteristics of the main users and different secondary user attributes.
In one embodiment, step 1.2 specifically includes: the secondary user can present physical information such as physical position, available bandwidth, required bandwidth and the like, so that the primary user can generate an optimal strategy set; in this section, the middle of the game is constructed as a non-cooperative game model, denoted τ non 。
In one embodiment, the specific representation method is as follows:
τ non ＝{N，M，{S}，{U S }}
wherein S represents a policy set, U S Representing a revenue function.
A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the steps of any of the methods when executing the program.
A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the steps of any of the methods.
A processor for running a program, wherein the program when running performs any of the methods.
The invention has the beneficial effects that:
the invention can reasonably schedule the existing network resources, furthest improve the network throughput rate and the network bandwidth utilization rate on the basis of not increasing hardware resources, and simultaneously can furthest reduce the transmitting power of the master user under the condition of not influencing the transmission quality of the master user, thereby reducing the working energy consumption of the master node and prolonging the service life of the master node.
Drawings
Fig. 1 is a schematic diagram illustrating a process of gaming a secondary user by a primary user to generate an optimal policy set.
Detailed Description
The present invention is further described below in conjunction with the following figures and specific examples so that those skilled in the art may better understand the present invention and practice it, but the examples are not intended to limit the present invention.
Step S1: by setting a revenue function as game constraint, the primary user performs game matching on the secondary users to generate an optimal strategy set which accords with Nash equilibrium convergence;
step S2: adaptively partitioning the bandwidth by taking W 1 The lower limit of the range of the master user is used for ensuring that the master user is properly served under the condition of not influencing the transmission quality of the master user; by taking W 2 Range of (1)The upper limit is combined with the result of the node game selection, the transmission requirement of a secondary user is met, and the overall utilization rate of the network bandwidth is improved;
step S3: when the available bandwidth of the node changes due to environmental interference or self demand change, the previously generated cooperation scheme is adaptively adjusted.
The nash equilibrium convergence refers to: the intermediate process of the game is constructed into a non-cooperative game model tau non ，τ non ＝{N，M，{S}，{U S }, where S represents a policy set, U S Representing a revenue function. For tau non Combination of strategies
Is a nash equilibrium and the inequality is if and only if for each player
This is true. Wherein the content of the first and second substances,
w is 1 The lower limit of the range of (b) means:
wherein Q PU Indicates the size of the data packet to be transmitted by the master user within the time T, V PU Indicating the QoS requirements of the primary user's transmissions.
W is 2 The upper range limit of (b) means:
wherein W represents the total bandwidth available to the primary user, W 2 Representing a portion of the spare bandwidth of the primary user. W 1 ，W 2 Is part of W, and W ═ W 1 +W 2 。
Said adaptationThe whole process is as follows: when the last time slot T of the transmission scheme is finished, whether the total amount of the idle bandwidth and the division ratio of the bandwidth meet the transmission requirements of a primary user and a secondary user or not is detected respectively. When the total amount of the idle bandwidth of the primary user cannot meet the transmission requirement of the secondary user, reselecting the cooperative node of the secondary user through a game model; when the division ratio of the bandwidth cannot meet the transmission requirement of the master user, the W needs to be adjusted 1 And W 2 Is subdivided. And when the adjusted cooperation scheme meets the transmission requirements of the primary user and the secondary user again, entering the next transmission time slot.
The technical solution of the present invention is described in more detail with reference to specific embodiments.
1) Selecting an optimal strategy set which accords with Nash equilibrium convergence based on a game theory: the primary user is identified as a leader of the gaming process and the secondary user is identified as a participant in the gaming process. When a plurality of primary users face at least one secondary user needing cooperative transmission, the primary users can be used as a leader to conduct active game, the secondary users can present physical information such as physical positions, available bandwidth, required bandwidth and the like, and an optimal strategy set is generated by matching with the primary users. Assuming that each network node participating in the game is selfish, each primary user can independently select a secondary user for cooperative transmission, so that the utilization rate of idle bandwidth is maximized. The middle process of the game is constructed into a non-cooperative game model which is marked as tau non The specific representation method is as follows:
τ non ＝{N，M，{S}，{U S }} (1-1)
wherein S represents a policy set, U S Representing a revenue function.
And (4) supposing that M main users carry out game matching on N secondary users. By adding a variable k n，j E {0, 1}, when k n，j When the number of the primary users is 1, the matching between the nth primary user and the jth secondary user is successful; when k is n，j And when the number is 0, the matching of the nth primary user and the jth secondary user is failed. Then, given a policy combination, the idle bandwidth utilization of the primary user n can be expressed as:
therefore, under the condition of a given policy set, the average utilization rate of the remaining bandwidth of the whole network is as follows:
wherein k is i，j Band j Total bandwidth required, k, for all secondary users indicating successful matching i，j *We i Indicating the total amount of free bandwidth of all primary users that successfully match. When the gaming process is over, the player may,
namely, the number of the successfully matched nodes cannot be more than the total number of the nodes participating in the game. Revenue function U S Indicating the utilization of the global network spare bandwidth. In addition, in order to guarantee the transmission requirement of the secondary user, the following constraint conditions are added:
by a gain function U S The primary user game is played on a base basis, and the final goal of each player is to select a set of strategies that maximize their own revenue. The strategy of each gambler is to select an appropriate secondary user for gambling, and the specific strategy can be expressed as:
wherein S n Representing the policy set of the nth primary user, n belongs to [1, M ∈ [ ]]。
So that the policy set S of all the gamblers can be obtained:
performing nash equilibrium analysis on the obtained strategy set, and if nash equilibrium is satisfied, obtaining a group of globally optimal strategy sets; if Nash equilibrium is not satisfied, the game is played again.
Non-cooperative game τ non ＝{N，M，{S}，{U S -nash equalization of (j) means: policy combination
Is a nash equilibrium, if and only if for each player the following inequality holds:
wherein the content of the first and second substances,
the strategy set conforming to the nash balance is composed of the optimal strategies of all the players, namely under the condition that the strategies of other nodes are fixed, any player cannot increase the global income of the game result by changing the strategy of the player, and therefore, no player can actively break the balance.
2) The self-adaptive division process of the bandwidth comprises the following steps: suppose that the size of the data packet to be transmitted by the master user in the time T is Q PU Then the transmission time constrained by the transmission requirement of the primary user is
While the actual transmission time in the simulated scene is
Wherein, V PU Indicating the transmission requirement QoS, R of the primary user c，p Indicating the secondary user going down to the primary userThe transmission rate of a one-hop routing node. The constraint can be found as:
the following result is obtained through further calculation, which indicates the value range of the transmission rate from the secondary user to the next hop of the primary user, and the value range ensures that the result of bandwidth segmentation can meet the transmission requirement of the primary user.
By the fragrance concentration theorem, the following equation can be derived. Wherein h is p，c Indicating the channel gain, h, between primary and secondary users c，p Signal gain, variable P, representing the next hop routing transmission node for the secondary and primary users 1，2 And P 2 Respectively representing the primary user-to-secondary user transmitting power and the primary user initial transmitting power.
Substituting formula (2-3) into formula (2-2) results in:
assuming a channel gain of 1, W can be obtained 1 The value range of (A):
bandwidth W in the above equation 1 The value range ensures that the transmission quality of the main node is not influenced by the cooperation scheme, and when the W is obtained 1 When the value range is limited, the secondary user can fully utilize the main nodeAnd thus the transmission requirements of the secondary users may also be met.
The bandwidth W can be obtained 2 Upper limit of the value of (1):
by taking W 1 Lower limit of the range of (1) and take W 2 The upper limit of the range not only guarantees the transmission quality of the primary user and the secondary user, but also improves the overall utilization rate of the network bandwidth.
3) Adaptive adjustment process of the cooperation scheme: since the real cognitive network environment is dynamically changed, the cooperation scheme of the invention needs to be adaptively adjusted according to the network dynamics. When the available bandwidth of the node changes due to environmental interference or self demand change, the previously generated cooperation scheme needs to be analyzed to verify whether the cooperation scheme still meets the transmission demands of the primary user and the secondary user. If so, the cooperation scheme is not changed; if the division ratio of the cooperative nodes and the bandwidth does not meet the requirement, the division ratio of the cooperative nodes and the bandwidth is readjusted to achieve the purpose of adapting to the environmental dynamics.
Environmental dynamics analysis
The invention reflects the dynamic property of the network environment by the actual change of the available bandwidth of the node, and analyzes and demonstrates the evaluation indexes of the two aspects.
i. Verifying whether the total amount of the idle bandwidth of the primary user can meet the transmission requirement of the secondary user: if the transmission requirements of the secondary user can be met, the following inequality must hold:
Band i ≤W 2 +W 3 (3-1)
if the inequality is not satisfied, it is proved that the existing cooperation scheme cannot meet the transmission requirements of the secondary users, the secondary users and the related main users need to be subjected to resource recovery, and a new strategy set is generated through a secondary game.
Verifying whether the division ratio of the bandwidth can meet the transmission requirement of a master user: let γ denote the ratio between the actual transmission quality of the primary user and its transmission demand, i.e.:
wherein, gamma belongs to (0, 1),
indicating the actual transmission quality of the primary user,
indicating the transmission needs of the primary user. In a dynamic network environment, the actual transmission quality of a master user needs to satisfy the following conditions:
in particular, when the actual transmission quality of the primary user is high
And when the range exceeds the agreed range of the inequality, the division ratio of the master user bandwidth needs to be adjusted again.
Adaptive adjustment algorithm
When the last time slot T of the transmission scheme is finished, whether the total amount of the idle bandwidth and the division ratio of the bandwidth meet the transmission requirements of a primary user and a secondary user or not is detected respectively. When the total amount of the idle bandwidth of the primary user cannot meet the transmission requirement of the secondary user, reselecting the cooperative node of the secondary user through a game model; when the division ratio of the bandwidth cannot meet the transmission requirement of the master user, the W needs to be adjusted 1 And W 2 Is subdivided in size. And when the adjusted cooperation scheme meets the transmission requirements of the primary user and the secondary user again, entering the next transmission time slot.
The above-mentioned embodiments are merely preferred embodiments for fully illustrating the present invention, and the scope of the present invention is not limited thereto. The equivalent substitution or change made by the technical personnel in the technical field on the basis of the invention is all within the protection scope of the invention. The protection scope of the invention is subject to the claims.
Claims (7)
1. A data transmission method based on bidirectional cooperation dynamic channel allocation and QoS guarantee is characterized by comprising the following steps:
step 1: by setting a revenue function as game constraint, the primary user performs game matching on the secondary users to generate an optimal strategy set which accords with Nash equilibrium convergence;
step 2: adaptively partitioning bandwidth by fetching
The lower limit of the range of the master user is used for guaranteeing that the master user is appropriately served under the condition that the transmission quality of the master user is not influenced; by taking
The upper limit of the range of the method is combined with the result of the node game selection, the transmission requirement of secondary users is met, and the overall utilization rate of the network bandwidth is improved;
and step 3: when the available bandwidth of the node is changed due to environmental interference or self demand change, correcting the generated cooperation scheme;
the step 1 comprises the following steps:
step 1.1: initializing game roles of a primary user and a secondary user;
step 1.2: acquiring physical attribute information of a master user and a secondary user;
step 1.3: determining a revenue function
Wherein the content of the first and second substances,
indicating the total bandwidth demanded by all secondary users that successfully matched,
the total amount of free bandwidth of all primary users with successful matching and a revenue function
Indicating the utilization rate of the global network free bandwidth;
step 1.4: as a function of profit
Performing primary user game for the reference, thereby generating a group of globally optimal strategy sets;
step 1.5: performing Nash equilibrium analysis on the final strategy set, if Nash equilibrium is met, ending to obtain a group of globally optimal strategy sets, and executing the step 2; if the Nash equilibrium is not satisfied, returning to the step 1.4 to play the game again; wherein the non-cooperative game
Nash equalization (nash) means: for non-cooperative gaming
Combination of strategies
Is a nash equilibrium, if and only if for each player, the following inequality holds:
wherein the content of the first and second substances,
；
in said step 2
，
Wherein the content of the first and second substances,
indicating the size of the data packet that the primary user needs to transmit during time T,
transmission requirement QoS, variable representing primary user
And
respectively representing the primary user-to-secondary user transmission power and the primary user initial transmission power, W representing the total available bandwidth of the primary user,
representing a portion of the spare bandwidth of the primary user.
2. The bi-directional cooperation-based dynamic channel allocation and QoS guarantee data transmission method according to claim 1, wherein the modifying operation in step 3 is: when the last time slot T of the transmission scheme is finished, respectively detecting whether the total amount of the idle bandwidth and the division ratio of the bandwidth meet the transmission requirements of a master user and a secondary user; reselecting cooperation of secondary users through a game model when the total amount of idle bandwidth of a primary user cannot meet the transmission requirement of the secondary usersA node; when the division ratio of the bandwidth cannot meet the transmission requirement of the master user, the bandwidth needs to be divided
And
is divided again; and when the adjusted cooperation scheme meets the transmission requirements of the primary user and the secondary user again, entering the next transmission time slot.
3. The data transmission method for dynamic channel allocation and QoS guarantee based on bidirectional cooperation according to claim 1, wherein step 1.1 specifically includes: determining a primary user as a leader of the game process and a secondary user as a participant of the game process; wherein, the leader of the game process means: when a plurality of main users face at least one secondary user needing cooperative transmission, the main users can be used as a leader to conduct active game, and a relatively proper strategy set is generated according to the characteristics of the main users and different secondary user attributes.
4. The data transmission method for dynamic channel allocation and QoS guarantee based on bidirectional cooperation according to claim 1, wherein step 1.2 specifically includes: the secondary user can present a physical position, available bandwidth and required bandwidth so that the primary user can generate an optimal strategy set; in this section, the middle of the game is constructed as a non-cooperative game model, written as
。
5. The data transmission method for dynamic channel allocation and QoS guarantee based on bidirectional cooperation according to claim 4, wherein the specific representation method is as follows:
wherein the content of the first and second substances,
on behalf of the set of policies,
representing a revenue function.
6. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the steps of the method of any of claims 1 to 5 are implemented when the program is executed by the processor.
7. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the steps of the method of any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910677528.5A CN110290589B (en) | 2019-07-25 | 2019-07-25 | Dynamic channel allocation and QoS guarantee data transmission method based on bidirectional cooperation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910677528.5A CN110290589B (en) | 2019-07-25 | 2019-07-25 | Dynamic channel allocation and QoS guarantee data transmission method based on bidirectional cooperation |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110290589A CN110290589A (en) | 2019-09-27 |
| CN110290589B true CN110290589B (en) | 2022-08-30 |
Family
ID=68024063
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910677528.5A Active CN110290589B (en) | 2019-07-25 | 2019-07-25 | Dynamic channel allocation and QoS guarantee data transmission method based on bidirectional cooperation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110290589B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112291010B (en) * | 2020-10-09 | 2021-10-01 | 中国人民武装警察部队工程大学 | Multi-domain optical network traffic grooming method based on matching game |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103313260A (en) * | 2013-06-18 | 2013-09-18 | 重庆邮电大学 | Cognitive radio network bandwidth and power joint allocation method based on game theory |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7944839B2 (en) * | 2001-11-30 | 2011-05-17 | British Telecommunications Public Limited Company | Method of resource control in a wireless network |
| CN103828426A (en) * | 2012-01-21 | 2014-05-28 | 日电（中国）有限公司 | Method and apparatus for determining feedback transmission resource for mobile stations and method and apparatus for providing information therefor |
| CN103441790B (en) * | 2012-12-07 | 2016-12-21 | 南京邮电大学 | It is applicable to the multi-service information channel resource management method of satellite network |
-
2019
- 2019-07-25 CN CN201910677528.5A patent/CN110290589B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103313260A (en) * | 2013-06-18 | 2013-09-18 | 重庆邮电大学 | Cognitive radio network bandwidth and power joint allocation method based on game theory |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110290589A (en) | 2019-09-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107819840A (en) | Distributed mobile edge calculations discharging method in the super-intensive network architecture | |
| CN111031547B (en) | Multi-user D2D communication resource allocation method based on spectrum allocation and power control | |
| CN113453239B (en) | Channel resource allocation method and system, storage medium and electronic device | |
| Huang et al. | Q-learning-based spectrum access for multimedia transmission over cognitive radio networks | |
| Tsiropoulou et al. | Efficient uplink power control in multi-service two-tier femtocell networks via a game theoretic approach | |
| Teng et al. | Application research of game theory in cognitive radio spectrum allocation | |
| Bairagi et al. | A multi-game approach for effective co-existence in unlicensed spectrum between LTE-U system and Wi-Fi access point | |
| Hajir et al. | Coalitional games for joint co-tier and cross-tier cooperative spectrum sharing in dense heterogeneous networks | |
| CN110290589B (en) | Dynamic channel allocation and QoS guarantee data transmission method based on bidirectional cooperation | |
| CN107302801A (en) | To QoE double-deck matching game method below a kind of 5G mixing scene | |
| Xu et al. | Play it by ear: Context-aware distributed coordinated anti-jamming channel access | |
| Elias et al. | Distributed spectrum management in TV white space networks | |
| Ortín et al. | Joint cell selection and resource allocation games with backhaul constraints | |
| Zhang et al. | Deep multi-agent reinforcement learning for resource allocation in D2D communication underlaying cellular networks | |
| Maaz et al. | Joint user association, power control and scheduling in multi-cell 5G networks | |
| Li et al. | Multiuser power and channel allocation algorithm in cognitive radio | |
| CN110062399B (en) | Cognitive heterogeneous cellular network spectrum allocation method based on game theory | |
| CN117202265A (en) | DQN-based service migration method in edge environment | |
| Boulos et al. | A hybrid approach for rrh clustering in cloud radio access networks based on game theory | |
| CN115568023A (en) | Time domain resource allocation method and device, electronic equipment and storage medium | |
| US9722725B2 (en) | System and method for resource management in heterogeneous wireless networks | |
| CN108718452B (en) | Dynamic interference method based on optimal PUEA mode of game theory | |
| CN114375058A (en) | Task queue aware edge computing real-time channel allocation and task unloading method | |
| Du et al. | Capacity and rate maximization in MEC systems | |
| Ma et al. | An improved game-theoretic spectrum sharing in cognitive radio systems |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |