# US 2014/0153501 A1 · Method for scheduling data burst

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2014/0153501 A1
- Document ID: US20140153501A1
- Status: Published application
- Kind: A1
- Application number: 13/875,304
- Filed: 2013-05-02
- Published: 2014-06-05
- Earliest claimed: 2012-12-04
- Assignees: National Taiwan University of Science and Technology
- Applicants: National Taiwan University of Science and Technology
- Inventors: Feng-Ming Yang; Wei-Mei Chen; Han-Peng Jiang
- Web page: https://patentgrep.com/patent/US20140153501A1

## CPC

- H04W 72/569: {of the traffic information}
- H04W 72/543: based on requested quality, e.g. QoS
- G06F 1/00: Details not covered by groups G06F3/00 - G06F13/00 and G06F21/00 (architectures of general purpose stored program computers G06F15/76)
- H04L 43/00: Arrangements for monitoring or testing data switching networks
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A method for scheduling data burst is provided. The method is adapted for a mobile apparatus. The method includes the following steps. Firstly, a data burst is generated, and a maximum delay time is calculated according to a delay constraint of the data burst. Next, whether to receive a downlink data burst before the maximum delay time is determined. If yes, a base station is requested to schedule the data burst to at least one available scheduling time near the downlink data burst. Afterwards, the data burst is sent according to the at least one available scheduling time.

## Claims

### Claim 1

A method for scheduling data burst, adapted for a mobile apparatus, comprising:
detecting at least one data burst from at least one data stream during a listening frame period, wherein each of the data bursts has a start time and a finish time;
searching for at least one available schedule time;
determining whether a time duration of any one of the data bursts is overlapped with a time duration of another data burst of the data bursts;
if the time duration of any one of the data bursts is not overlapped with the time duration of another of the data bursts, receiving one of the data bursts having an earliest finish time according to the at least one available schedule time;
if the time duration of any one of the data bursts is overlapped with the time duration of another of the data bursts, determining whether there is a first data burst that is about to fail to satisfy a delay constraint for each of the data bursts;
if yes, receiving the first data burst according to the at least one available schedule time;
if no, receiving the one of the data bursts having the earliest finish time; and
delaying the data bursts having a time duration overlapped with a time duration of the data bursts having the earliest finish time among the data bursts for a frame duration.

### Claim 2 (depends on 1)

The method according to claim 1, wherein the step of searching for the at least one available schedule time comprises:
determining whether the finish time of each of the data bursts is earlier than the frame finish time respectively at a frame finish time in the listening frame period;
if the finish time of each of the data bursts is earlier than the frame finish time, setting a period between the finish time of each of the data bursts and the frame finish time of the listening frame period to be the at least one available schedule time; and
if the finish time of each of the data bursts is not earlier than the frame finish time, setting a period between a finish time of receiving one of the data bursts that is previously received and the start time of each of the data bursts to be the at least one available schedule time.

### Claim 3 (depends on 2)

The method as claimed in claim 2, wherein given that there is no the data bursts that is previously received, setting a period between the starting time point of the listening frame period and the start time of each of the data bursts to be the at least one available schedule time.

### Claim 4 (depends on 1)

The method as claimed in claim 1, wherein the step of receiving the one of the data bursts having the earliest finish time according to the at least one available schedule time comprises:
determining whether the at least one available schedule time is suitable for receiving the one of the data bursts having the earliest finish time;
if the at least one available schedule time is suitable for receiving the one of the data bursts having the earliest finish time, receiving the one of the data bursts having the earliest finish time.

### Claim 5 (depends on 1)

The method as claimed in claim 1, wherein the step of determining whether there is the first data burst that is about to fail to satisfy the delay constraint in each of the data bursts comprises:
determining among the data bursts respectively, whether there is the first data burst having a cumulative delay time about to exceed the delay constraint,
wherein the cumulative delay time of each of the data bursts is respectively a time difference between a finish time and an initial start time of each of the data bursts.

### Claim 6 (depends on 1)

The method as claimed in claim 1, after the step of delaying the data bursts having the time duration overlapped with the time duration of the data bursts having the earliest finish time among the data bursts for the frame duration, further comprising:
recording an initial start time of the other the data bursts; and
setting a transmitting priority of the other data bursts according to a cumulative delay time of the other data bursts.

### Claim 7 (depends on 6)

The method as claimed in claim 6, wherein the step of setting the transmitting priority of the other data bursts according to the cumulative delay time of the other data bursts comprises:
setting the transmitting priority of the other data bursts to be the highest when the cumulative delay time of the other data bursts is more than the delay constraint of the other data bursts; and
setting the transmitting priority of the other data bursts to be the lowest when the cumulative delay time of the other data bursts is less than the delay constraint of the other data bursts.

### Claim 8

A method for scheduling data burst, adapted for a mobile apparatus, comprising:
generating a data burst;
calculating a maximum delay time according to a delay constraint of the data burst;
determining whether a downlink data burst is received before the maximum delay time;
if the downlink data burst is received before the maximum delay time, requesting a base station to schedule the data burst to at least one available schedule time near the downlink data burst, and transmitting the data burst according to the at least one available schedule time;
if the downlink data burst is not received before the maximum delay time, determining whether at least one other data burst is generated;
if the at least one other data burst is generated, requesting the base station to schedule the data burst and the at least one other data burst to the same or adjacent at least one available schedule time, and transmitting the data burst and the at least one other data burst according to the at least one available schedule time; and
if the at least one other data burst is not generated, transmitting the data burst according to a scheduling result of the base station.

### Claim 9 (depends on 8)

The method as claimed in claim 8, wherein the step of calculating the maximum delay time according to the delay constraint of the data burst comprises:
calculating the maximum delay time by adding up a start time of the data burst and the delay constraint.

### Claim 10 (depends on 8)

The method as claimed in claim 8, wherein the downlink data burst comprises a multicast/broadcast service data burst transmitted by the base station.