Eureka AIR delivers breakthrough ideas for toughest innovation challenges, trusted by R&D personnel around the world.

Method and system for cognitive radio fair scheduling

A cognitive radio and fairness technology, applied in wireless communication, electrical components, etc., can solve the problems affecting the communication quality of unauthorized users and the number of collisions, so as to achieve fairness, reduce serious impact, and improve communication service quality Effect

Active Publication Date: 2017-11-03
邳州市鑫盛创业投资有限公司
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] The technical problem to be solved by the present invention is to provide a method and system for cognitive radio fairness scheduling to solve the problem in the prior art that the communication quality of unlicensed users is affected due to the high number of collisions between unlicensed users and authorized users

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
  • Method and system for cognitive radio fair scheduling
  • Method and system for cognitive radio fair scheduling
  • Method and system for cognitive radio fair scheduling

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0075] Taking the number of channels N=6 and the priority determination module working in mode 1 as an example, the scheduling process of the central spectrum management device C for unlicensed users with the same priority is described in detail based on the existing scheduling algorithm to further refine the scheduling priority process .

[0076] Assume that before scheduling, there are six unauthorized users b1, b2, b3, b4, b5, and b6 in buffer B, among which b5 and b6 are waiting users and are accessing the main user channel. These six unauthorized users correspond to queues 1, 2, 3, 4, 5, and 6 respectively, and the number of collisions carried by them are 1, 5, 4, 0, 0, and 0 respectively.

[0077] Its channel state and the state of buffer B are as follows Figure 4 And as shown in Table 1:

[0078] Table 1

[0079] channel number

state

user

Cumulative number of collisions

1

1

p1

-

2

2

b4

0

3

2

b1

1

...

Embodiment 2

[0090] This embodiment is an example of joint application with other scheduling algorithms, that is, other scheduling algorithms set initial scheduling priorities for each unauthorized user. In this case, it is a specific example of combining with the solution of the present invention.

[0091] According to the existing scheduling algorithm, if there are 8 unauthorized users b1, b2, b3, b4, b5, b6, b7, b8, the initial scheduling priorities are 1, 2, 3, 3, 5, 6, 6, 8. Among them, b3 and b4 belong to priority 3, and b6 and b7 belong to priority 5.

[0092] Consider the results of the original scheduling algorithm and the number of collisions as the results of scheduling considerations for weighting, and determine the weights of the two according to the status quo of the system. If the collision problem is serious, for example, the number of collisions between unauthorized users and authorized users is greater than the set threshold, the weight corresponding to the initial schedu...

Embodiment 3

[0100] Same as the second embodiment, this embodiment is also another example of joint application with other scheduling algorithms.

[0101] When the collision between unauthorized users and authorized users is not serious, for example, the number of collisions between unauthorized users and authorized users is less than the set threshold, then the weight corresponding to the initial scheduling priority is set to be greater than the weight corresponding to the adjusted priority. That is: the interruption probability of the unauthorized user caused by the collision is very low (such as only 0.05), according to the method in the second embodiment of the method, the weight of the result of setting the number of collisions as the scheduling consideration factor can be set smaller, such as 0.3, Correspondingly, the priority weight of the original scheduling algorithm is 0.7. Other conditions are consistent with method embodiment two, then can obtain the scheduling result as shown ...

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 invention discloses a method for cognitive radio fairness scheduling. The method includes the following steps: obtaining the number of collisions between current unauthorized users and authorized users; and adjusting the number of times of collisions between each unauthorized user final priority; generating scheduling control information according to the final priority of each unlicensed user and status information of each channel; the scheduler schedules each unlicensed user according to the scheduling control information. The invention can reduce the average number of collisions of unauthorized users in the communication service process, reflect the fairness among unauthorized users, and improve the overall communication quality of unauthorized users.

Description

technical field [0001] The present invention relates to the technical field of cognitive radio networks, in particular to a method and system for cognitive radio fairness scheduling. Background technique [0002] With the rapid development of wireless communication services, wireless spectrum resources are becoming more and more scarce. However, according to the existing measurement data, the existing spectrum allocation system based on fixed spectrum allocation has very low resource utilization. Therefore, cognitive radio technology emerges as the times require. Cognitive radio technology dynamically borrows the spectrum resources of the licensed system without causing harmful interference to licensed users, effectively improving the use efficiency of spectrum resources. [0003] At present, many scholars and organizations have carried out in-depth research on the issue of spectrum scheduling in cognitive radio. Although, there have been many studies on improving the effic...

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 Patents(China)
IPC IPC(8): H04W72/12H04W74/08
Inventor 刘星李岩周栋苗婷任龙涛唐万斌周晶
Owner 邳州市鑫盛创业投资有限公司
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
Eureka Blog
Learn More
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com