A Bipartite Graph Based Spectrum Portfolio Auction Method for Cognitive Radio Networks
A cognitive radio and bipartite graph technology, applied in network planning, wireless communication, electrical components, etc., can solve problems such as insufficient spectrum auction performance and fairness of cognitive radio networks, and achieve high spectrum auction revenue and high computational complexity Effect
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0036] The present invention will be further described below in conjunction with the accompanying drawings and embodiments.
[0037] Such as figure 1 As shown, this embodiment provides a bipartite graph-based cognitive radio network spectrum combination auction method, using a bipartite graph to model the spectrum auction problem of a cognitive radio network with multiple primary users and multiple heterogeneous cognitive users, The KM algorithm is iteratively used to solve the maximum weighted perfect matching of the spectrum auction bipartite graph until the primary user can no longer be allocated. On the basis of the above allocation, the allocated cognitive users among the primary users are readjusted and replaced, thereby realizing the revenue of the spectrum auction and performance improvements. The specific implementation of the plan has the following three main steps: spectrum auction bidding phase, spectrum auction winner decision phase, spectrum auction result calcu...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


