Managing reserved cells and user equipments in an MBSFN environment within a wireless communication system
US-9226248-B2 · Dec 29, 2015 · US
US10285140B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-10285140-B2 |
| Application number | US-201715582373-A |
| Country | US |
| Kind code | B2 |
| Filing date | Apr 28, 2017 |
| Priority date | Oct 31, 2014 |
| Publication date | May 7, 2019 |
| Grant date | May 7, 2019 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Embodiments of the present invention disclose a power estimation method and apparatus. On a premise of controlling interference caused by a second node to a first node to be within a range, a transmit power of the second node can be increased so as to improve communication quality of the second node. A specific solution is: obtaining an estimated load value of each first node in N first nodes according to a transmit power and user service requirements of each first node that are obtained and according to a transmit power set for each second node in M second nodes, and further, respectively using the transmit power set for each second node as an allowed transmit power of each second node according to the estimated load value of each first node in the N first nodes.
Opening claim text (preview).
What is claimed is: 1. A power estimation method, comprising: obtaining a transmit power of each first node in N first nodes; setting a transmit power of each second node in M second nodes, wherein each second node is a network node that causes interference to at least one first node in the N first nodes; obtaining channel gains from each first node and each second node to each user; obtaining user service requirements of each first node in the N first nodes, wherein user service requirements of an n th first node in the N first nodes are service data rates between the n th first node and users served by the n th first node, and n is a positive integer less than or equal to N; obtaining an estimated load value of each first node in the N first nodes according to the transmit power of each first node in the N first nodes, the user service requirements of each first node in the N first nodes, and the transmit power of each second node in the M second nodes, wherein the estimated load value of the n th first node in the N first nodes is a value obtained by estimating a physical resource consumption level of the n th first node in the N first nodes; and when the estimated load value of each first node in the N first nodes is less than a first threshold and greater than a second threshold, or the estimated load value of each first node in the N first nodes is less than the first threshold and the transmit power of each second node in the M second nodes is greater than a third threshold, individually using the transmit power of each second node in the M second nodes as an allowed transmit power of each second node in the M second nodes, wherein the obtaining estimated load value of each first node in the N first nodes according to the transmit power of each first node in the N first nodes, the user service requirements of each first node in the N first nodes, and the transmit power of each second node in the M second nodes comprises: substituting the transmit power of each first node in the N first nodes, the user service requirements of each first node in the N first nodes, and the transmit power of each second node in the M second nodes into a first formula, so as to obtain, by means of calculation, the estimated load value of the n th first node in the N first nodes, wherein the first formula is: ρ i ∈ M O = min { ∑ j ∈ I d j x i , j KB log 2 ( 1 + P i g i , j ∑ l ∈ M O \ { i } P l g l , j ρ l + ∑ q ∈ M τ P q
taking into account interferences · CPC title
Interferences in heterogeneous networks, e.g. among macro and femto or pico cells or other sector / system interference [OSI] · CPC title
Aspects of the step size · CPC title
Power values between minimum and maximum limits, e.g. dynamic range · CPC title
taking into account loading or congestion level · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.