Stable matching algorithm-based and demand lower limit-guaranteed spectrum allocation method

A matching algorithm and spectrum allocation technology, applied in the field of computer networks, can solve the problems that the algorithm cannot be directly used to solve the problem of spectrum matching and cannot meet the lower limit of demand.

Active Publication Date: 2017-10-24
WUHAN UNIV
View PDF4 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The traditional deferred acceptance algorithm cannot meet the lower limit of demand. D. Fragiadakis proposed an extended deferred acceptance algorithm to solve the matching problem of both upper demand limit and lower demand limit.
However, due to the nature of spectrum reuse, this algorithm cannot be directly used to solve the spectrum matching problem

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Stable matching algorithm-based and demand lower limit-guaranteed spectrum allocation method
  • Stable matching algorithm-based and demand lower limit-guaranteed spectrum allocation method
  • Stable matching algorithm-based and demand lower limit-guaranteed spectrum allocation method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment specific Embodiment approach

[0063] According to the buyer's bid to the seller, the preference relationship between the buyer and the seller can be established as follows:

[0064] a>> A e>> A b>> A f>> A c>> A d

[0065] c>> B e>> B f>> B d>> B b>> B a

[0066] f>> C c>> C d>> C b>> C e>> C a

[0067] Step 3, calculate the number of free spectrum θ, the specific steps are as follows: (1) For each requirement, the lower limit is p c The buyer s, creates p c a virtual node. (2) Each newly created virtual node inherits all the interference relations of the original node, that is, inherits the edges of the original node in all original interference graphs. (3) Create conflicting edges between every two virtual nodes of the same original node. (4) For the interference map obtained according to steps (1)(2)(3), use the Welch Powell method to calculate the minimum number of colors that can cover the entire G coloring, θ=M-coloring, where M is the individual number of all selle...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The present invention relates to a stable matching algorithm-based and demand lower limit-guaranteed spectrum allocation method. According to the lowest spectrum requirements of a spectrum buyer, a budget cost of the spectrum buyer and the interference relationship, the number of spectrums for guaranteeing the demand lower limit of the spectrum buyer and the number of spectrums capable of being freely controlled are calculated. On the above basis, an improved matching algorithm in the deferred reception mode is running, so that the purpose of stable spectrum allocation results is realized. On the premise that the spectrum allocation results are ensured to meet the lowest spectrum requirements and the cost budgets of secondary users, the spectrum transaction success rate and the spectrum transaction satisfaction degree of primary users and secondary users are improved.

Description

technical field [0001] The invention belongs to the technical field of computer networks, and in particular relates to a spectrum allocation model based on a stable matching algorithm to guarantee a lower limit of demand. Background technique [0002] In today's Internet era, the spectrum of wireless communication networks is an indispensable and important resource. However, due to the increasing amount of wireless communication traffic, spectrum has also become a strained resource. In order to make better use of the existing spectrum as much as possible and avoid the waste of spectrum caused by the traditional static spectrum allocation method. The result is a dynamic spectrum allocation approach that enables wireless communication service providers to buy and sell excess spectrum channels according to their needs. [0003] Spectrum trading activities are essentially a match between buyers and sellers of spectrum. Compared with the optimal spectrum matching result, the s...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): H04W16/10
CPCH04W16/10
Inventor 陈艳姣熊宇轩
Owner WUHAN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap