A link scheduling method based on minimum co-channel interference
A link scheduling and co-channel interference technology, which is applied in the field of link scheduling based on minimum co-channel interference, can solve the problems of affecting user QoS and failure of link scheduling to achieve strong interference management capabilities and low co-channel interference Effect
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0033] The technical solution of the present invention will be described in detail below in conjunction with the accompanying drawings.
[0034] Take a cell as an example. There is a base station in the middle of the cell, and N users are evenly distributed in the radius R of the base station. B Inside. The user set is U={u 1 ,u 2 ,...,U N }. The network file library has M files of equal size, which are respectively denoted as f 1 ,f 2 ,...,F M .
[0035] Assuming that each user has cached a file from the file library and independently requests a file from the file library, the request probability obeys the Zipf distribution, that is, file f i The request probability is:
[0036]
[0037] Where γ r It is to request Zipf distribution parameters.
[0038] Because each user can cache files from the wireless D2D network. In addition to obtaining from the base station, users can obtain the files they need from themselves or from neighboring users. Obtaining files from oneself requires t...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


