Communication method and apparatus
US-2024267762-A1 · Aug 8, 2024 · US
US9525535B1 · US · B1
| Field | Value |
|---|---|
| Publication number | US-9525535-B1 |
| Application number | US-201414454900-A |
| Country | US |
| Kind code | B1 |
| Filing date | Aug 8, 2014 |
| Priority date | Aug 8, 2014 |
| Publication date | Dec 20, 2016 |
| Grant date | Dec 20, 2016 |
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.
Systems and methods are described for scheduling transmission from an access node. Network conditions in a communication network comprising an access node may be monitored. A scheduling algorithm may be selected for the access node based on the monitored network conditions. Data transmissions may be scheduled from the access node based on the selected scheduling algorithm. And data may be transmitted from the access node to wireless devices based on the transmission schedule.
Opening claim text (preview).
What is claimed is: 1. A method for scheduling transmissions from an access node, the method comprising: monitoring network conditions in a communication network comprising an access node; selecting, based on the network conditions, one of a fair scheduling algorithm, a data rate scheduling algorithm, and a hybrid scheduling algorithm; scheduling data transmission from the access node based on the selected scheduling algorithm; and transmitting data from the access node to wireless devices based on the transmission schedule. 2. The method of claim 1 , wherein the fair scheduling algorithm comprises a round robin scheduling algorithm. 3. The method of claim 2 , wherein the network conditions comprise a mobility for the wireless devices in communication with the access node, and wherein the round robin scheduling algorithm is selected when the monitored mobility meets a mobility criteria. 4. The method of claim 2 , wherein the network conditions comprise whether each wireless device in communication with the access node comprises a smartphone, and wherein the round robin scheduling algorithm is selected when the number of wireless devices in communication with the access node that comprise smart phones meets a phone criteria. 5. The method of claim 1 , wherein the data rate scheduling algorithm comprises an algorithm that schedules data transmissions based on which of the wireless devices in communication with the first access node comprises a greatest channel quality value. 6. The method of claim 5 , wherein the network conditions comprise a number of connections between the access node and the wireless devices in communication with the access node, and wherein the data rate scheduling algorithm is selected when the monitored number of connections does not meet a connections criteria. 7. The method of claim 5 , wherein the network conditions comprise a data bearer type for connections between the access node and the wireless devices in communication with the access node, and wherein the data rate scheduling algorithm is selected when the monitored data bearer types comprise a number guaranteed data bearers that meets a bearer type criteria. 8. The method of claim 1 , wherein the hybrid scheduling algorithm comprises an algorithm that schedules data transmissions based on a balance between the fair scheduling algorithm and the data rate scheduling algorithm. 9. The method of claim 8 , wherein the hybrid scheduling algorithm comprises an algorithm that schedules data transmissions based on a metric calculated for each wireless device, the metric being inversely proportional to an average data rate for the wireless device and directly proportional to the instantaneous data rate of the wireless device. 10. The method of claim 8 , wherein the network conditions comprise a number of connections between the access node and the wireless devices in communication with the access node, and wherein the hybrid scheduling algorithm is selected when the monitored number of connections meets a connections criteria. 11. The method of claim 8 , wherein the network conditions comprise a data bearer type for connections between the access node and the wireless devices in communication with the access node, and wherein the hybrid scheduling algorithm is selected when the monitored data bearer types comprise a number nonguaranteed data bearers that meets a bearer type criteria. 12. A system for determining broadcast parameters for a transmission, the system comprising: a processing node with a processor configured to: monitor network conditions in a communication network comprising an access node; select, based on the network conditions, one of a fair scheduling algorithm, a data rate scheduling algorithm, and a hybrid scheduling algorithm; schedule data transmission from the access node based on the selected scheduling algorithm; and transmit data from the access node to wireless devices based on the transmission schedule. 13. The system of claim 12 , wherein the fair scheduling algorithm comprises a round robin scheduling algorithm. 14. The system of claim 13 , wherein the network conditions comprise a mobility for the wireless devices in communication with the access node, and wherein the round robin scheduling algorithm is selected when the monitored mobility meets a mobility criteria. 15. The system of claim 13 , wherein the network conditions comprise whether each wireless device in communication with the access node comprises a smartphone, and wherein the round robin scheduling algorithm is selected when the number of wireless devices in communication with the access node that comprise smart phones meets a phone criteria. 16. The system of claim 12 , wherein the data rate scheduling algorithm comprises an algorithm that schedules data transmissions based on which of the wireless devices in communication with the first access node comprises a greatest channel quality value. 17. The system of claim 16 , wherein the network conditions comprise a number of connections between the access node and the wireless devices in communication with the access node, and wherein the data rate scheduling algorithm is selected when the monitored number of connections does not meet a connections criteria. 18. The system of claim 16 , wherein the network conditions comprise a data bearer type for connections between the access node and the wireless devices in communication with the access node, and wherein the data rate scheduling algorithm is selected when the monitored data bearer types comprise a number guaranteed data bearers that meets a bearer type criteria. 19. The system of claim 12 , wherein the hybrid scheduling algorithm comprises an algorithm that schedules data transmissions based on a balance between the fair scheduling algorithm and the data rate scheduling algorithm. 20. The system of claim 19 , wherein the hybrid scheduling algorithm comprises an algorithm that schedules data transmissions based on a metric calculated for each wireless device, the metric being inversely proportional to an average data rate for the wireless device and directly proportional to the instantaneous data rate of the wireless device.
based on quality criteria · CPC title
Allocation criteria · CPC title
Testing, {supervising or monitoring} using real traffic · CPC title
Time-frequency · CPC title
Rate requirement of the data, e.g. scalable bandwidth, data priority · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.