Using time division duplex systems in frequency division duplex networks
By utilizing the propagation delay information of full-duplex gateway terminals and half-duplex user equipment in the satellite network, the scheduler allocates non-overlapping time slots, solving the problem of low utilization of time division duplex scheduling resources in the satellite network and improving the network Resource utilization efficiency.
Patent Information
- Application Number
- CN202380032197.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Priority Date
- 2022-02-14
- Filing Date
- 2023-02-14
- Publication Date
- 2024-12-06
AI Technical Summary
In satellite networks, the propagation delay of half-duplex user equipment causes too large time division duplex (TDD) scheduling time slot gap period, resulting in low network resource utilization and inability to effectively utilize available network resources.
By determining the propagation delay between the gateway terminal and the user equipment, the scheduler allocates non-overlapping downlink time slots and uplink time slots to each user equipment to avoid conflicting time slots, and utilizes a full-duplex gateway terminal to the gateway at the gateway Schedules overlapping time slots and time slots.
The utilization rate of network resources is improved, so that half-duplex user equipment can use network resources efficiently without each user equipment having a full duplex modem, reducing equipment costs.
Smart Images

Figure CN119096613A_ABST
Abstract
Description
[0001] CROSS-REFERENCE TO RELATED APPLICATIONS
[0002] This application claims priority to U.S. Provisional Application No. 63 / 310,099, filed on February 14, 2022, and entitled “SCHEDULER FOR HALF DUPLEXTERMINAL WITH FULL DUPLEX GATEWAY,” which is expressly incorporated herein by reference in its entirety for all purposes. Background Art Technical Field
[0003] The present disclosure generally relates to communication systems that employ both time division duplexing and frequency division duplexing.
[0004] Description of related technologies
[0005] A communication system may employ various techniques to enable communication between devices over a network. A communication system may use a terrestrial network link, a non-terrestrial network link, or a combination of these network links to transfer information between devices. These network links use duplexing to achieve two-way communication over a communication channel. Two forms of duplexing include time division duplexing (TDD) and frequency division duplexing (FDD). In wireless communication systems, time division duplexing uses a single frequency band or channel for both sending and receiving, while frequency division duplexing uses different frequency bands or channels for sending and receiving. Summary of the invention
[0006] In some embodiments, the present disclosure relates to a method for scheduling time slots in a frame for a gateway terminal and a plurality of user equipments (UEs) in a communication system. The method includes determining a propagation delay between the gateway terminal and each of the plurality of UEs. The method includes determining, for each of the plurality of UEs, one or more conflicting time slots at the UE based on the propagation delay between the gateway terminal and the UE, wherein the conflicting time slot is a time slot in which the UE is scheduled to transmit and receive simultaneously. The method includes filling a constrained gateway schedule to avoid conflicting time slots at each of the plurality of UEs. The method includes transmitting a schedule corresponding to the gateway schedule to each of the plurality of UEs.
[0007] In some implementations, a schedule corresponding to a gateway schedule for a specific UE includes a schedule having a downlink time slot that is delayed in time relative to the gateway schedule by a time delay equal to a propagation time associated with the specific UE, and having an uplink time slot that is advanced in time relative to the gateway schedule by a time advance equal to the propagation time associated with the specific UE.
[0008] In some implementations, filling the gateway schedule includes allocating a plurality of downlink time slots for each of the plurality of UEs. In some implementations, filling the gateway schedule further includes identifying, for each of the plurality of UEs, one or more uplink time slots that violate a constraint to avoid conflicting time slots caused at least in part by the one or more uplink time slots overlapping in time with one or more downlink time slots of the plurality of downlink time slots.
[0009] In some implementations, filling the gateway schedule includes allocating a plurality of uplink time slots for each of the plurality of UEs. In some implementations, filling the gateway schedule further includes identifying, for each of the plurality of UEs, one or more downlink time slots that violate a constraint to avoid conflicting time slots caused at least in part by the one or more downlink time slots overlapping in time with one or more uplink time slots in the plurality of uplink time slots.
[0010] In some implementations, the propagation delay of a particular UE changes. In some implementations, the gateway schedule is updated in response to the change in the propagation delay of the particular UE. In some implementations, the propagation delay of the particular UE varies over time.
[0011] In some embodiments, the present disclosure relates to a scheduler in a communication system including a gateway terminal and a plurality of user equipments (UEs). The scheduler includes a data storage device configured to store computer executable instructions for downlink time slots and uplink time slots for scheduling frames in the communication system. The scheduler further includes a processor communicating with the data storage device. The processor is configured to execute computer executable instructions to perform the following operations: determine the propagation delay between the gateway terminal and each of the plurality of UEs; for each of the plurality of UEs, determine one or more conflicting time slots at the UE based on the propagation delay between the gateway terminal and the UE, wherein the conflicting time slot is a time slot in which the UE is scheduled to transmit and receive simultaneously; fill the constrained gateway scheduling to avoid the conflicting time slots at each of the plurality of UEs; and transmit the scheduling corresponding to the gateway scheduling to each of the plurality of UEs.
[0012] In some implementations, the scheduler is incorporated into a gateway terminal of the communication system. In some implementations, the schedule corresponding to the gateway schedule for the specific UE includes a schedule having a downlink time slot that is delayed in time relative to the gateway schedule by a propagation time associated with the specific UE and having an uplink time slot that is advanced in time relative to the gateway schedule by a propagation time associated with the specific UE.
[0013] In some implementations, filling the gateway schedule includes allocating a plurality of downlink time slots for each of the plurality of UEs. In some implementations, filling the gateway schedule further includes identifying, for each of the plurality of UEs, one or more uplink time slots that violate a constraint to avoid conflicting time slots caused at least in part by the one or more uplink time slots overlapping in time with one or more downlink time slots of the plurality of downlink time slots.
[0014] In some implementations, the propagation delay of a particular UE changes. In some implementations, the gateway schedule is updated in response to the change in the propagation delay of the particular UE. In some implementations, the propagation delay of the particular UE varies over time.
[0015] In some embodiments, the present disclosure relates to a communication system, the communication system comprising: a plurality of user equipments (UEs) configured for half-duplex operation; a gateway terminal configured for full-duplex operation, the gateway terminal configured to communicate with each of the plurality of UEs; and a scheduler communicating with the gateway terminal. The scheduler is configured to schedule time slots of frames in the communication system by performing the following operations: determining a propagation delay between the gateway terminal and each of the plurality of UEs; for each of the plurality of UEs, determining one or more conflicting time slots at the UE based on the propagation delay between the gateway terminal and the UE, the conflicting time slots being time slots in which the UE is scheduled to transmit and receive simultaneously; filling a constrained gateway schedule to avoid conflicting time slots at each of the plurality of UEs; and transmitting a schedule corresponding to the gateway schedule to each of the plurality of UEs.
[0016] In some implementations, the scheduler is incorporated into a gateway terminal of the communication system. In some implementations, the schedule corresponding to the gateway schedule for the specific UE includes a schedule having a downlink time slot that is delayed in time relative to the gateway schedule by a propagation time associated with the specific UE and having an uplink time slot that is advanced in time relative to the gateway schedule by a propagation time associated with the specific UE.
[0017] In some implementations, filling the gateway schedule includes allocating a plurality of downlink time slots for each of the plurality of UEs. In some implementations, filling the gateway schedule further includes identifying, for each of the plurality of UEs, one or more uplink time slots that violate a constraint to avoid conflicting time slots caused at least in part by the one or more uplink time slots overlapping in time with one or more downlink time slots of the plurality of downlink time slots.
[0018] In some implementations, the propagation delay of a particular UE changes. In some implementations, the gateway schedule is updated in response to the change in the propagation delay of the particular UE. In some implementations, the propagation delay of the particular UE varies over time.
[0019] In some implementations, at least one of the plurality of UEs has a propagation delay greater than or equal to the duration of one time slot in the gateway schedule. In some implementations, at least one of the plurality of UEs has a propagation delay greater than or equal to the duration of two consecutive time slots in the gateway schedule.
[0020] In some implementations, the present disclosure relates to a method for scheduling time slots in a frame for a gateway terminal and a plurality of user equipments (UEs) in a communication system. The method includes generating an initial gateway schedule for the gateway terminal, the initial gateway schedule allocating a plurality of downlink time slots for each of the plurality of UEs, and allocating a plurality of uplink time slots for each of the plurality of UEs. The method includes determining an initial UE schedule for each UE based on a propagation delay between the UE and the gateway terminal, the initial UE schedule including a plurality of downlink time slots, the plurality of downlink time slots being delayed in time relative to the corresponding plurality of downlink time slots in the initial gateway schedule, the delay in time being equal to the propagation delay between the UE and the gateway terminal, the initial UE schedule also including a plurality of uplink time slots, the plurality of uplink time slots being advanced in time relative to the corresponding plurality of uplink time slots in the initial gateway schedule, the advance in time being equal to the propagation delay between the UE and the gateway terminal. The method includes determining one or more conflicting time slots in the initial gateway schedule, the conflicting time slot being a time slot in which a downlink time slot for a particular UE overlaps with an uplink time slot in time. The method includes generating an intermediate gateway schedule by removing one or more conflicting time slots from an initial gateway schedule, each time slot removed from the initial gateway schedule comprising an unmet demand time slot associated with a particular UE. The method includes generating a final gateway schedule by looping through each unmet demand time slot and allocating the unmet demand time slot in an open time slot in the intermediate gateway in response to determining that allocating the unmet demand time slot to the open time slot will not result in a conflicting time slot for the UE associated with the unmet demand time slot.
[0021] In some implementations, the one or more conflicting time slots removed from the initial gateway schedule include uplink time slots. In some implementations, the one or more conflicting time slots removed from the initial gateway schedule include downlink time slots. In some implementations, after removing the one or more conflicting time slots, the intermediate gateway schedule does not include any conflicting time slots. In some implementations, the method further includes determining a propagation delay for each UE. In some implementations, the one or more unmet demand time slots are allocated to the final gateway schedule based at least in part on a priority of a UE associated with the unmet demand time slot.
[0022] In some implementations, the method further includes generating a final UE schedule for each UE in the plurality of UEs, the final UE schedule for a particular UE including a plurality of downlink time slots delayed in time relative to a corresponding plurality of downlink time slots in the final gateway schedule, the time delay being equal to a propagation delay between the UE and a gateway terminal, and the final UE schedule for the particular UE also includes a plurality of uplink time slots advanced in time relative to a corresponding plurality of uplink time slots in the final gateway schedule, the time advance being equal to a propagation delay between the UE and the gateway terminal. In some implementations, the method further includes transmitting the final UE schedule for each UE to a corresponding UE in the plurality of UEs.
[0023] In some implementations, the initial gateway schedule is generated by looping through each UE and sequentially allocating the plurality of downlink time slots and the plurality of uplink time slots in the frame. In some implementations, at least one unmet demand time slot remains unallocated in the final gateway schedule.
[0024] In some implementations, the present disclosure relates to a scheduler in a communication system including a gateway terminal and multiple user equipments (UEs). The scheduler includes a data storage device configured to store computer executable instructions for scheduling downlink time slots and uplink time slots of frames in the communication system; and a processor that communicates with the data storage device. The processor is configured to execute computer executable instructions to perform the following operations: generate an initial gateway schedule for the gateway terminal, the initial gateway schedule allocates multiple downlink time slots for each of the multiple UEs, and allocates multiple uplink time slots for each of the multiple UEs; for each UE, determine the initial UE schedule based on the propagation delay between the UE and the gateway terminal, the initial UE schedule includes multiple downlink time slots, the multiple downlink time slots are delayed in time relative to the corresponding multiple downlink time slots in the initial gateway schedule, and the time delay is equal to the propagation delay between the UE and the gateway terminal, and the initial UE schedule also includes multiple uplink time slots, the multiple uplink time slots are delayed in time relative to the corresponding multiple uplink time slots in the initial gateway schedule. advance in time, the advance in time being equal to the propagation delay between the UE and the gateway terminal; determine one or more conflicting time slots in the initial gateway schedule, the conflicting time slots being time slots in which downlink time slots for the specific UE overlap in time with uplink time slots; generate an intermediate gateway schedule by removing the one or more conflicting time slots from the initial gateway schedule, each time slot removed from the initial gateway schedule comprising an unmet demand time slot associated with the specific UE; and generate a final gateway schedule by looping through each unmet demand time slot and assigning the unmet demand time slot in an open time slot in the intermediate gateway in response to determining that assigning the unmet demand time slot to the open time slot will not result in a conflicting time slot for the UE associated with the unmet demand time slot.
[0025] In some implementations, the scheduler is incorporated into a gateway terminal of the communication system. In some implementations, the one or more conflicting time slots removed from the initial gateway schedule include uplink time slots. In some implementations, the one or more conflicting time slots removed from the initial gateway schedule include downlink time slots. In some implementations, after removing the one or more conflicting time slots, the intermediate gateway schedule does not include any conflicting time slots. In some implementations, the processor is further configured to determine a propagation delay for each UE. In some implementations, the one or more unsatisfied demand time slots are allocated to the final gateway schedule based at least in part on the priority of the UE associated with the unsatisfied demand time slot. In some implementations, at least one unsatisfied demand time slot remains unallocated in the final gateway schedule.
[0026] In some embodiments, the present disclosure relates to a communication system, which includes: a plurality of user equipments (UEs) configured for half-duplex operation; a gateway terminal configured for full-duplex operation, the gateway terminal configured to communicate with each of the plurality of UEs; and a scheduler that communicates with the gateway terminal. The scheduler is configured to schedule time slots of a frame in the communication system by performing the following operations: generating an initial gateway schedule for the gateway terminal, the initial gateway schedule allocating a plurality of downlink time slots for each of the plurality of UEs, and allocating a plurality of uplink time slots for each of the plurality of UEs; for each UE, determining an initial UE schedule based on a propagation delay between the UE and the gateway terminal, the initial UE schedule including a plurality of downlink time slots, the plurality of downlink time slots being delayed in time relative to the corresponding plurality of downlink time slots in the initial gateway schedule, the delay in time being equal to the propagation delay between the UE and the gateway terminal, the initial UE schedule also including a plurality of uplink time slots, the plurality of uplink time slots being delayed in time relative to the corresponding plurality of uplink time slots in the initial gateway schedule. advance in time, the advance in time being equal to the propagation delay between the UE and the gateway terminal; determine one or more conflicting time slots in the initial gateway schedule, the conflicting time slots being time slots in which downlink time slots for a specific UE overlap in time with uplink time slots; generate an intermediate gateway schedule by removing one or more conflicting time slots from the initial gateway schedule, each time slot removed from the initial gateway schedule comprising an unmet demand time slot associated with the specific UE; and generate a final gateway schedule by looping through each unmet demand time slot and assigning the unmet demand time slot in an open time slot in the intermediate gateway in response to determining that assigning the unmet demand time slot to the open time slot will not result in a conflicting time slot for the UE associated with the unmet demand time slot.
[0027] In some implementations, the scheduler is incorporated into a gateway terminal of the communication system. In some implementations, the one or more conflicting time slots removed from the initial gateway schedule include uplink time slots. In some implementations, the one or more conflicting time slots removed from the initial gateway schedule include downlink time slots. In some implementations, after removing the one or more conflicting time slots, the intermediate gateway schedule does not include any conflicting time slots. In some implementations, the scheduler is further configured to determine a propagation delay for each UE. In some implementations, the one or more unsatisfied demand time slots are allocated to the final gateway schedule at least in part based on the priority of the UE associated with the unsatisfied demand time slot. In some implementations, at least one unsatisfied demand time slot remains unallocated in the final gateway schedule.
[0028] In some implementations, at least one of the plurality of UEs has a propagation delay greater than or equal to the duration of one time slot in the final gateway schedule. In some implementations, at least one of the plurality of UEs has a propagation delay greater than or equal to the duration of two consecutive time slots in the final gateway schedule.
[0029] For purposes of summarizing the present disclosure, certain aspects, advantages, and novel features have been described herein. It should be understood that not all such advantages may be achieved according to any particular embodiment. Thus, the disclosed embodiments may be implemented in a manner that achieves or optimizes one advantage or group of advantages as taught herein without necessarily achieving other advantages as may be taught or suggested herein. BRIEF DESCRIPTION OF THE DRAWINGS
[0030] Various embodiments are depicted in the drawings for purposes of illustration and should not be construed as limiting the scope of the present disclosure. Additionally, various features of the different disclosed embodiments may be combined to form additional embodiments as part of the present disclosure.
[0031] Figure 1 A diagram illustrating an example communication system that uses a satellite network to communicatively couple multiple user equipment (UE) and a gateway terminal to each other to provide access to a network, such as the Internet.
[0032] FIG. 2 shows an example cellular communication system comprising a base station with which both a first UE and a second UE communicate.
[0033] FIG. 3 shows another example cellular communication system comprising a base station with which both the first UE and the second UE communicate.
[0034] Figure 4 An example satellite communication system is shown including a ground station and a UE communicating with each other via a satellite.
[0035] Figure 5A An example of a scheduler determining conflicting time slots for gateway scheduling and first UE scheduling is shown.
[0036] Figure 5B An example of a scheduler determining conflicting time slots for gateway scheduling and second UE scheduling is shown.
[0037] Figure 5C An example of a scheduler determining conflicting time slots for gateway scheduling and third UE scheduling is shown.
[0038] Figure 5D An example of a scheduler determining conflicting time slots for gateway scheduling and fourth UE scheduling is shown.
[0039] Fig. 6AAn example of a process for populating a schedule for a gateway terminal and four UEs, each with a different propagation delay, is shown.
[0040] Figure 6B An example algorithm for determining potential conflicting time slots and for filling the time slots subject to the determined potential conflicting constraints is shown.
[0041] Figure 7 A flow chart illustrating an example method of scheduling time slots in a full-duplex network including half-duplex user equipment.
[0042] Figure 8 A flow chart illustrating another example method of scheduling time slots in a full-duplex network including half-duplex user equipment.
[0043] Fig. 9 A block diagram is shown of an example scheduler configured to schedule time slots in a full-duplex network including half-duplex user equipment. DETAILED DESCRIPTION
[0044] Subheadings provided herein, if any, are for convenience only and do not necessarily affect the scope or meaning of the claimed subject matter.
[0045] Overview
[0046] Some wireless communication systems (such as cellular networks) may have base stations and user equipment (UE) (such as cellular phones) capable of frequency division duplexing (FDD). This means using different carrier frequencies or channels for downlink (DL) transmissions and uplink (UL) transmissions. In such systems, it may be desirable to align all UE transmissions when they arrive at the base station. In order to achieve this alignment, a timing advance is used for each UE, which is equal to the propagation delay between the base station and the UE. The timing advance is used to advance the transmission time at the UE so that the transmission from the user equipment arrives at the base station at the target time. For UEs with large propagation delays, this may cause the transmit slots and receive slots to overlap in time at the UE. This will require the UE to have a full-duplex modem. This overlap at the UE occurs due to propagation delays and may occur even when the scheduler only schedules transmit slots and receive slots that do not overlap at the base station.
[0047] In other wireless communication systems including cellular networks, base stations and UEs utilize time division duplex (TDD) instead of FDD. This means using the same carrier frequency or channel for downlink (DL) transmission and uplink (UL) transmission. Therefore, in a TDD frame, there are usually a series of DL slots and a series of UL slots separated by a gap period to allow the device to switch between sending (Tx) and receiving (Rx). The duration of the gap period is at least twice the propagation delay (caused by the signal propagated between the base station and the user equipment, such as the propagation delay from the base station to the user equipment and the propagation delay from the user equipment back to the base station, or the round-trip time). During the gap period, no traffic is scheduled. In terrestrial communication systems, the gap period may be relatively small, thereby introducing a relatively small amount of overhead to the system.
[0048] User equipment may be modified to enable communication via a satellite network instead of or in addition to a terrestrial network. However, the propagation delay in a typical satellite network is significantly greater than a typical terrestrial network. Therefore, when TDD scheduling as described above is employed, the gap period becomes undesirably large due to this larger propagation delay. This introduces an undesirably large amount of overhead to the system and fails to utilize available network resources.
[0049] Therefore, to address these and other issues, techniques are described herein for utilizing a full-duplex gateway terminal in a satellite network with half-duplex user equipment. The disclosed scheduling techniques incorporate knowledge of the propagation delay between the gateway terminal and each UE that communicates with the gateway terminal. Based on the propagation delay, the scheduler can allocate DL and UL time slots in a scheduling frame in a manner that avoids allocating overlapping DL and UL time slots at each UE.
[0050] Advantageously, since a single gateway terminal can serve many UEs, using a full-duplex gateway terminal with a half-duplex UE can more fully utilize available network resources without the relatively large costs associated with requiring each UE to be full-duplex. As described herein, scheduling techniques enable the use of half-duplex UEs with full-duplex components in a communication system while also efficiently utilizing network resources. For example, a scheduler may allocate DL time slots and UL time slots in a scheduling frame in a manner that avoids overlapping DL time slots with UL time slots at each UE while still allocating most or all available time slots. This may be achieved at least in part because the scheduler is aware of the propagation delays of the respective UEs.
[0051] Example Communication System
[0052] Figure 1A diagram of an example communication system 100 is shown that uses a satellite network 140 to communicatively couple a plurality of user equipments (UEs) 110a, 110b and a gateway terminal 150 to each other to provide access to a network, such as the Internet 180. The communication system 100 includes a scheduler 170 that is configured to allocate network resources to the gateway terminal 150 and the UEs 110a, 110b. As described in more detail herein, the scheduler 170 is configured to allocate transmit time slots and receive time slots in a scheduling frame to avoid overlap of the transmit time slots with the receive time slots at each UE 110a, 110b, while allowing the transmit time slots to overlap with the receive time slots at the gateway terminal 150. The scheduler 170 achieves this at least in part due to being configured to determine a propagation delay between each UE 110a, 110b and the gateway terminal 150. Based on this determination, the scheduler 170 is configured to determine which time slots will overlap at each UE 110a, 110b, and allocates the transmit time slots and / or receive time slots so that there are no transmit time slots that overlap with any receive time slots at each UE 110a, 110b or for each UE. In this way, the gateway terminal 150 can be full-duplex, while each UE 110a, 110b can be half-duplex.
[0053] The satellite network 140 includes satellites 105 to provide satellite links in the communication system 100. Each UE 110a, 110b includes a UE transceiver 120a, 120b configured to send and receive radio frequency (RF) signals using the satellite 105. As an example and without limitation, the UE 110a, 110b can be a handheld terminal or a very small aperture terminal (VSAT) with an integrated antenna (e.g., a parabolic antenna). In some implementations, the UE transceiver 120a, 120b is separated from the UE 110a, 110b, so that the UE 110a, 110b is operably coupled to the UE transceiver 120a, 120b. Similarly, the gateway terminal 150 is operably coupled to the gateway satellite transceiver 130, which is configured to send and receive signals using the satellite 105. The gateway terminal 150 and the gateway satellite transceiver 130 can be integrated into the ground station 160 together.
[0054] The satellite network 140 provides a forward link (FL) for sending information from the gateway terminal 150 to the UE 110a, 110b and a return link (RL) for sending information from the UE 110a, 110b to the gateway terminal 150. The forward link includes a transmission path from the ground station 160 via a satellite uplink (UL) channel through the satellite 105 and via a satellite downlink (DL) channel to the UE 110a, 110b. The return link includes a transmission path from the UE 110a, 110b via a satellite uplink channel through the satellite 105 and via a satellite downlink channel to the ground station 160. It should be understood that each communication path can utilize multiple satellites and transceivers. The satellite network 140 implements an FDD scheme, which means that the satellite UL channel uses a frequency band different from the satellite DL channel. Therefore, the satellite network 140 may be referred to as an FDD network in this article.
[0055] The scheduler 170 is configured to allocate DL time slots and UL time slots to the gateway terminal 150 and the UE 110a, 110b. In some implementations, the scheduler 170 is a single component of the communication system 100. In some implementations, the gateway terminal 150 and / or part or all of the scheduler 170 may be located in a virtual device residing in a public or private computing cloud and / or as part of a distributed computing environment. The scheduler 170 may be configured to allocate network resources between the UE 110a, 110b and the gateway terminal 150 to enable TDD user equipment (such as UE 110a, 110b) to use an FDD network (such as a satellite network 140 with a gateway terminal 150).
[0056] The scheduler 170 is configured to perform one or more methods to allocate network resources between the UE 110a, 110b and the gateway terminal 150. The scheduler 170 is configured to determine the propagation delay between each UE 110a, 110b and the gateway terminal 150. The scheduler 170 is further configured to determine the number of time slots in the scheduling frame that will conflict at the corresponding UE based on the propagation delay between the gateway terminal 150 and the corresponding UE for each UE 110a, 110b. The scheduler 170 is further configured to fill the schedule based on the conflict determination to avoid forming a conflict at each UE. The scheduler 170 then transmits the filled schedule to the corresponding UE 110a, 110b and the gateway terminal 150.
[0057] In some implementations, UE 110a may or may not be co-located with UE 110b, which may cause different propagation delays between UE 110a and UE 110b and gateway terminal 150. In some implementations, UE 110a may represent a user terminal group, and UE 110b may represent another user terminal group. In some implementations, one or more of UE 110a, 110b may be mobile (e.g., located on a mobile platform or a vehicle such as an airplane, ship, bus, train, etc.), thereby causing propagation delays that vary over time.
[0058] The communication system 100 may utilize various network architectures including space segments and ground segments. The satellite network 140 incorporates these elements to provide communication between multiple UEs 110a, 110b and a gateway terminal 150. For example, the space segment may include one or more satellites (such as satellite 105), and the ground segment may include one or more satellite user terminals (such as UE 110a, 110b), gateway terminals (such as gateway terminal 150), network operation centers (NOCs), satellite and gateway terminal command centers, ground stations, base stations, etc. For clarity, some of these elements are not shown in the figure. The satellite network 140 may include one or more geosynchronous earth orbit (GEO) satellites, one or more medium earth orbit (MEO) satellites, and / or one or more low earth orbit (LEO) satellites. It should be understood that the satellite 105 may represent one or more satellites, and the one or more satellites may include GEO satellites, MEO satellites, LEO satellites, or any combination of these satellites.
[0059] Example Schedule of Components of a Communication System
[0060] Fig. 2 shows an example cellular communication system 200 including a base station 232, wherein both a first UE 210a and a second UE 210b communicate with the base station 232. The base station 232 is full-duplex and configured for FDD communication. The first UE 210a and the second UE 210b are each full-duplex and also capable of FDD communication. In the cellular communication system 200, the first UE 210a is positioned near the base station 232, and the second UE 210b is positioned at a relatively far position from the base station 232. Therefore, the propagation delay between the base station 232 and the first UE 210a is small or close to zero, and the propagation delay between the base station 232 and the second UE 210b is relatively large. In some implementations, the propagation delay associated with the second UE 210b may represent the maximum propagation delay in the cellular communication system 200. In this example, the propagation delay for the second UE 210b is approximately equal to the duration of a single time slot in the scheduling frame.
[0061] Each component in the cellular communication system 200 is assigned a network allocation schedule. The schedule includes a plurality of DL time slots and a plurality of UL time slots arranged in a schedule frame. The base station schedule 291 is configured to align the DL time slots with the UL time slots at the base station 232 when transmissions arrive from the UEs 210a, 210b. That is, the DL time slots assigned to the first UE 210a are aligned in time with the UL time slots in the base station schedule 291, and the DL time slots assigned to the second UE 210b are aligned in time with the UL time slots in the base station schedule 291. In order to achieve the alignment shown in the base station schedule 291, the first UE schedule 292 allocates a plurality of DL time slots and a plurality of UL time slots for the UE 210a, wherein these time slots are aligned in time with the allocated time slots in the base station schedule 291. This is because the propagation delay between the base station 232 and the first UE 210a is negligible due at least in part to the physical proximity of the first UE 210a to the base station 232.
[0062] In order to achieve the target alignment in the base station schedule 291, the second UE schedule 293 includes a DL time slot overlapping with the UL time slot for UE 210b. In this example, the propagation delay of the second UE 210b is approximately the same as the duration of one time slot in the schedule. Therefore, the DL transmission from the base station 232 arrives at the second UE 210b one time slot after they are sent. In addition, in order to achieve the target transmission arrival time of the UL transmission from UE 210b to the base station 232, the second UE schedule 293 allocates the UL time slot one time slot ahead of the time when the UL transmission will arrive at the base station 232. That is, relative to the time when the UL transmission from UE 210b is expected to arrive at the base station 232, there is a time advance equal to the propagation delay in the UL time slot. This time advance together with the propagation delay of the DL transmission from the base station 232 to the second UE 210b leads to two overlapping time slots in the second UE schedule 293. That is, the last 2 DL time slots overlap with the first 2 UL time slots in the second UE schedule 293. Therefore, the second UE schedule 293 requires the second UE 210b to be capable of full-duplex communication to accommodate the second UE schedule 293. This occurs despite the fact that the base station schedule 291 only includes non-overlapping UL and DL time slots for each UE.
[0063] FIG. 3 shows another example cellular communication system 300 including a base station 332, wherein both a first UE 310a and a second UE 310b communicate with the base station 332. Compared with the cellular communication system 200, the base station 332 is half-duplex and is configured for TDD communication. Similarly, the first UE 310a and the second UE 310b are each half-duplex and are also configured for TDD communication. Similar to the cellular communication system 200, the first UE 310a is positioned near the base station 332, and the second UE 310b is positioned at a relatively far position from the base station 332. Therefore, the propagation delay between the base station 332 and the first UE 310a is small or close to zero, and the propagation delay between the base station 332 and the second UE 310b is relatively large. In some implementations, the propagation delay associated with the second UE 310b may represent the maximum propagation delay in the cellular communication system 300. In this example, the propagation delay for the second UE 310b is approximately equal to the duration of a single time slot in the scheduling frame.
[0064] Each component in the cellular communication system 300 is assigned a network allocation schedule. The schedule includes a plurality of DL time slots and a plurality of UL time slots arranged in a schedule frame. The base station schedule 391 is configured to align the DL time slots with the UL time slots at the base station 332 when the transmission arrives from the UE 310a, 310b. That is, the DL time slots assigned to the first UE 310a are aligned in time with the UL time slots in the base station schedule 391, and the DL time slots assigned to the second UE 310b are aligned in time with the UL time slots in the base station schedule 391. However, compared with the cellular communication system 200, the scheduling of the cellular communication system 300 takes into account the propagation delay of the UE 310a, 310b by incorporating a turnaround time equal to twice the maximum propagation delay in the system. The turnaround time in this example is two time slots. Therefore, the base station schedule 391 includes two time slots between the DL time slots and the UL time slots in each schedule frame, in which there is no scheduled traffic to be sent or received. The base station schedule 391 also schedules communication with the first UE 310a in a first scheduling frame and communication with the second UE 310b in a second scheduling frame.
[0065] To achieve the alignment shown in the base station schedule 391, the first UE schedule 392 allocates a plurality of DL time slots and a plurality of UL time slots for the UE 310a, wherein these time slots are aligned in time with the allocated time slots in the base station schedule 391. This is because the propagation delay between the base station 332 and the first UE 310a is negligible due at least in part to the physical proximity of the first UE 310a to the base station 332. Therefore, the first UE schedule 392 also includes two time slots between the DL time slots and the UL time slots to account for the maximum propagation delay in the system.
[0066] In order to achieve the alignment shown in the base station scheduling 391, the second UE scheduling 393 allocates a DL time slot adjacent to the UL time slot in time for UE 310b. For example, the second UE scheduling 393 does not include an empty time slot between the DL time slot and the UL time slot. In this example, the propagation delay of the second UE 310b is approximately the same as the duration of a time slot in the scheduling. Therefore, the DL transmission from the base station 332 arrives at the second UE 310b in a time slot after they are sent. In addition, in order to achieve the target transmission arrival time of the UL transmission from UE310b to the base station 332, the second UE scheduling 393 allocates the UL time slot one time slot ahead of the time when the UL transmission will arrive at the base station 332. That is, relative to the time when the UL transmission from UE 310b is expected to arrive at the base station 332, there is a time advance equal to the propagation delay in the UL time slot. This time advance together with the propagation delay of the DL transmission from the base station 332 to the second UE 310b requires a gap of two time slots in the base station scheduling 391 to avoid overlapping time slots in the second UE scheduling 393. Therefore, the time gap factored into the turnaround time in the base station schedule 391 allows the second UE 310b to be half-duplex.
[0067] Figure 4 An example satellite communication system 400 is shown including a ground station 460 and a UE 410 communicating with each other via a satellite 405. The ground station 460 is similar to Figure 1 The ground station 160 and the UE 410 are similar to Figure 1 UE 110a, 110b. Ground station 460 and UE 410 each implement a TDD scheme. In satellite communication system 400, the propagation delay between ground station 460 and UE 410 is significantly greater than the propagation delay in cellular communication system 200 of FIG. 2 and cellular communication system 300 of FIG. 3. This is at least in part due to the greater distance traveled by the signal between ground station 460 and UE 410 than the distance traveled by the signal in a typical terrestrial cellular communication system. In this example, the propagation delay between ground station 460 and UE 410 is approximately 8 time slots, which means that the turnaround time is approximately equal to the duration of 16 time slots.
[0068] In order to achieve the target schedule, similar to the schedule described herein with reference to FIG. 3, the turnaround time is accounted for in the gateway schedule 491. The satellite schedule 492 also shows the effect of the propagation delay between the ground station 460 and the satellite 405. Since the UE 410 is half-duplex, the UE schedule 493 is configured to include only non-overlapping forward link (FL) time slots and return link (RL) time slots. Due to the propagation delay described herein, the gateway schedule 491 includes a large number of unused time slots to account for the turnaround time. This is not desirable because it will result in inefficient use of network resources.
[0069] As an example, a schedule frame may have a duration of approximately 10 ms. Typical propagation delays in satellite communication systems are approximately 4 ms, resulting in a turnaround time of approximately 8 ms. The turnaround time causes approximately 80% of the time slots in the schedule frame to be unused.
[0070] Therefore, a scheduling technique is described herein that solves the inefficiency and impracticality of a satellite communication system with half-duplex equipment for ground stations and user equipment. The scheduling technique is implemented in a satellite communication system with a full-duplex ground station and a half-duplex UE. This configuration is advantageous because it improves network utilization without requiring UE to utilize a potentially expensive full-duplex modem. Advantageously, a single ground station or gateway terminal can be configured to serve many UEs. This makes it cheaper to utilize a full-duplex gateway terminal than to utilize a full-duplex UE because the equipment cost will be dominated by the cost of the UE. Therefore, the scheduling technique described herein is modified relative to a typical scheduling technique to be configured to consider the TDD user equipment used in an FDD network.
[0071] Figure 5A , Figure 5B , Figure 5C and Figure 5D A scheduling frame generated by a scheduling technique (e.g., a scheduler, etc.) is shown, which determines the DL time slot and UL time slot of a potential conflict based on the propagation delay between the corresponding UE and the gateway terminal. The scheduler is configured to determine the propagation delay for each UE in the communication system and determine which time slots will cause a conflict at the specific UE when assigned to a specific UE. As used herein, a conflict time slot in a schedule is a time slot that will require the UE to transmit and receive simultaneously when assigned to a specific UE. Similarly, as used herein, a conflict time slot includes a DL time slot that overlaps with the UL time slot in time in a scheduling frame for a specific UE. In these examples, there are four UEs with different propagation delays between the gateway terminal and the UE. The first UE does not have a propagation delay, the second UE has a propagation delay equal to the duration of approximately one time slot, the third UE has a propagation delay equal to the duration of approximately two time slots, and the fourth UE has a propagation delay equal to the duration of approximately three time slots.
[0072] In each example, a scheduling frame or a portion of a scheduling frame is shown. Each scheduling frame includes multiple DL time slots and multiple UL time slots. Since each UE is half-duplex, the UE cannot transmit and receive at the same time. Therefore, the scheduler will not schedule DL time slots that conflict with UL time slots at a specific UE, and vice versa. However, since the gateway terminal is full-duplex, the scheduler is free to schedule overlapping DL time slots and UL time slots at the gateway.
[0073] Figure 5A An example of a scheduler that determines conflicting time slots for a gateway schedule 591 and a first UE schedule 592 is shown. The propagation delay between the gateway and the first UE is negligible (e.g., the duration is less than one time slot). The scheduler may allocate a DL time slot 501 in the gateway schedule 591, which causes the scheduler to allocate a corresponding DL time slot 511 in the first UE schedule 592, and the DL time slots 501, 511 are aligned in time due to the negligible propagation delay. Therefore, the scheduler recognizes that allocating an UL time slot 502 in the gateway schedule 591 will cause a conflicting UL time slot 512 in the first UE schedule 592. Therefore, the scheduler is configured not to allocate the UL time slot 502 to the gateway terminal for transmission to the first UE. However, the UL time slot 502 may be allocated to a different UE that is subject to the conflict analysis described herein. The conflict analysis is an analysis performed by the scheduler to determine whether allocating a particular time slot in a scheduling frame will cause a conflict between a DL time slot and an UL time slot in a particular UE.
[0074] Figure 5B An example of a scheduler that determines conflicting time slots for a gateway schedule 591 and a second UE schedule 593 is shown. The propagation delay between the gateway and the second UE is approximately equal to the duration of one time slot. The scheduler may allocate a DL time slot 503 in the gateway schedule 591, which causes the scheduler to allocate a corresponding DL time slot 513 in the second UE schedule 593, and the DL time slots 503, 513 are offset in time by one time slot due to the propagation delay. Therefore, the scheduler recognizes that allocating an UL time slot 504 in the gateway schedule 591 will result in a conflicting UL time slot 514 in the second UE schedule 593. Therefore, the scheduler is configured not to allocate the UL time slot 504 to the gateway terminal for transmission to the second UE. However, the UL time slot 504 may be allocated to a different UE that is subject to the conflict analysis described herein.
[0075] Figure 5C An example of a scheduler that determines conflicting time slots for a gateway schedule 591 and a third UE schedule 594 is shown. The propagation delay between the gateway and the third UE is approximately equal to the duration of two consecutive time slots. The scheduler may allocate an UL time slot 506 in the gateway schedule 591, which causes the scheduler to allocate a corresponding UL time slot 516 in the third UE schedule 594, and the UL time slots 506, 516 are offset in time by two time slots due to the propagation delay. Therefore, the scheduler recognizes that allocating a DL time slot 505 in the gateway schedule 591 will result in a conflicting DL time slot 515 in the third UE schedule 594. Therefore, the scheduler is configured not to allocate the DL time slot 505 to the gateway terminal for transmission to the third UE. However, the DL time slot 505 may be allocated to a different UE that is subject to the conflict analysis described herein.
[0076] Figure 5DAn example of a scheduler determining conflicting time slots for a gateway schedule 591 and a fourth UE schedule 595 is shown. The propagation delay between the gateway and the fourth UE is approximately equal to the duration of three consecutive time slots. The scheduler may allocate UL time slots 508 in the gateway schedule 591, which causes the scheduler to allocate corresponding UL time slots 518 in the fourth UE schedule 595, and the UL time slots 508, 518 are offset in time by three time slots due to the propagation delay. Therefore, the scheduler recognizes that allocating DL time slots 507 in the gateway schedule 591 will cause conflicting DL time slots 517 in the fourth UE schedule 595. Therefore, the scheduler is configured not to allocate DL time slots 507 to the gateway terminal for transmission to the fourth UE. However, DL time slots 505 may be allocated to different UEs subject to the conflict analysis described herein.
[0077] FIG. 5A to FIG. 5D An example is shown in which the scheduler determines time slots that will collide at a UE based on the propagation delay between the gateway terminal and a particular UE. Such a conflict analysis or conflict determination may be based on allocating one or more time slots at the gateway terminal and determining potentially conflicting time slots at the corresponding UE. The conflict analysis may also be based on determining a set of potentially conflicting time slots or time slots that cannot be allocated together in the same scheduling frame without causing conflicting time slots. For example, Figure 5A The potentially conflicting time slot set in includes DL time slot 501 and UL time slot 502, and thus includes DL time slot 511 and UL time slot 512, which means that these two time slots cannot be allocated to UE 1 together in the same scheduling frame. Similarly, Figure 5B The conflicting time slot set in includes time slots 503 and 504 for UE 2, Figure 5C The conflicting time slot set in includes time slots 505 and 506 for UE 3, and Figure 5D The set of conflicting time slots in includes time slots 507 and 508 for UE 4. When the scheduler starts to fill the schedule for the components in the communication system, the potentially conflicting time slots can be added to the scheduler as additional constraints.
[0078] In some implementations, the scheduler may use one or more optimization schemes to determine which time slots to allocate. The optimization scheme may be configured to optimize the utilization of network resources, the satisfaction of service level agreements, the satisfaction of scheduling priorities, or any combination of these items. For example, the scheduler may iterate through different potential schedules and select a schedule that does not violate any constraints, including constraints for allocating time slots that require UEs to transmit and receive simultaneously, and the schedule has one or more superior or optimal indicators relative to other schedules. In some implementations, the scheduler may first fill the DL time slots, and then determine the UL time slots that will conflict if allocated. Based on these determinations, the scheduler may then fill the non-conflicting UL time slots. In some implementations, the scheduler may first fill the UL time slots, and then determine the DL time slots that will conflict if allocated. Based on these determinations, the scheduler may then fill the non-conflicting DL time slots. In some implementations, the scheduler may fill the time slots for the first UE before filling the time slots for the second UE, thereby ensuring that the filled scheduling for the first UE does not include conflicting time slots. In some of these implementations, the order in which the schedule of UEs is populated may be based at least in part on a scheduling priority or similar parameter for each UE.
[0079] In some implementations, the process of generating a schedule includes deriving a closed form calculation to determine allowed or non-colliding DL and UL time slots. For example, the schedule may be generated by mathematically representing the propagation delay of each UE and then solving the mathematical representation for a non-colliding schedule.
[0080] Fig. 6A An example of a process for filling a schedule for a gateway terminal and four UEs is shown, where each UE has a different propagation delay. At the beginning, the scheduler is configured to allocate an equal portion of network traffic to each UE. That is, at the beginning, the scheduler is configured to allocate approximately one-quarter of the network traffic to each UE. Fig. 6A A scheduling frame with 20 time slots is shown, and the scheduling frame repeats in time. Therefore, the scheduler allocates 5 DL time slots to each UE at the beginning. It should be noted that the scheduling frame can have a different number of time slots. It should also be noted that the scheduler can be configured to allocate unequal portions of network traffic to multiple UEs.
[0081] The initial step in the process is for the scheduler to determine the propagation delay associated with each UE. Here, the propagation delay for each UE is different, but this may not necessarily be the case in other cases. For example, one or more UEs may have the same propagation delay (or a propagation delay that is similar enough to other UEs to be considered the same at the scheduler). In some implementations, a sufficiently similar propagation delay can be a propagation delay that is less than or equal to the duration of a time slot or less than or equal to a fraction (e.g., half) of the duration of a time slot. In this example, the first UE has a negligible propagation delay (e.g., less than or equal to half a time slot), the second UE has a propagation delay that is approximately equal to one time slot in duration, the third UE has a propagation delay that is approximately equal to two time slots in duration, and the fourth UE has a propagation delay that is approximately equal to three time slots in duration.
[0082] After determining the propagation delay for each UE, the scheduler can determine the time slots of potential conflict (indicated by "X" in the figure). This can be achieved by filling one or more time slots (such as the DL time slot for each UE), such as Fig. 6A As shown in the schedule 690a in the left box. Based on the propagation delay, the potentially conflicting time slots can be identified and added to the constraints used by the scheduler to fill the UL time slots in the scheduling frame. Once the scheduler determines these additional constraints based on the potential conflicting time slots, the scheduler can iteratively fill the UL time slots, resulting in the schedule 690b in the right box. With these determined schedules 690b, the scheduler can send the schedule to the corresponding components. That is, the scheduler can send the gateway schedule to the gateway terminal and send the UE schedule to the corresponding UE.
[0083] A variety of algorithms may be implemented to determine potential conflicts in time slots. For example, the relationship between conflicting DL time slots and UL time slots may be determined based on the propagation delay for a particular UE. Fig. 6A In the case of UE 1, the relation will be that the gateway scheduling cannot include UL time slots that overlap in time with DL time slots. Fig. 6A In UE 2, the relation will be that the gateway scheduling cannot include an UL time slot that is two time slots later than the DL time slot. Fig. 6A In UE 3, the relation would be that the gateway scheduling cannot include an UL time slot that is four time slots later than the DL time slot. Fig. 6A For UE 4, the relation would be that the gateway scheduling cannot include a UL time slot that is eight time slots later than the DL time slot.
[0084] Similarly, there are various algorithms that can be implemented to fill time slots, which are subject to constraints related to potential conflicts in time slots determined by the scheduler. For example, the scheduler may iteratively fill available time slots subject to constraints. As another example, the scheduler may generate multiple potential schedules and select a schedule that improves or optimizes a particular metric or parameter (such as network utilization). As another example, the scheduler may allocate DL time slots (or UL time slots) based on initial constraints or constraints that do not include potential conflicting time slots, then determine potential conflicting time slots, and then allocate UL time slots (or DL time slots) subject to the initial constraints and additional constraints related to potential time slot conflicts. In some implementations, the order in which the scheduler allocates network resources may be related to the scheduling priority of the corresponding UE.
[0085] Figure 6B An example algorithm for determining potential conflict time slots and for filling the time slots subject to the determined potential conflict constraints is shown. Fig. 6A Example of the same component configuration and the same propagation delay. That is, there is a gateway terminal and four UEs whose propagation delay is in the range of 0 time slots to 3 time slots.
[0086] At the beginning, the scheduler is configured to allocate an equal portion of network traffic to each UE. That is, at the beginning, about a quarter of the network traffic is allocated to each UE. In the example, the scheduling frame includes 20 time slots, so that at the beginning, five DL time slots and five UL time slots aligned in time at the gateway terminal are allocated to each UE. At each UE, the corresponding UE scheduling indicates that the DL time slot is delayed, and the UL time slot is correspondingly advanced in time with the propagation delay for the corresponding UE, so that the DL time slot and the UL time slot are synchronized in time at the gateway terminal. For example, in the initial gateway scheduling 691a, the five DL time slots for UE 1 overlap with the five UL time slots in time, the five DL time slots for UE 2 overlap with the five UL time slots in time, the five DL time slots for UE 3 overlap with the five UL time slots in time, and the five DL time slots for UE 4 overlap with the five UL time slots in time. This process generates initial scheduling 692a, 693a, 694a, 695a for each of the four UEs. The initial schedule 691a to 695a includes conflicting time slots at one or more UEs among the plurality of UEs.
[0087] In an intermediate step, the scheduler generates an intermediate gateway schedule 691b and corresponding intermediate schedules 692b, 693b, 694b, 695b for multiple UEs. The scheduler generates the intermediate schedule by removing the UL time slots that overlap in time with the DL time slots at a specific UE. For example, since all UL time slots conflict with the DL time slots in the initial UE 1 schedule 692a, the scheduler can remove all UL time slots for UE 1, which means that the intermediate UE 1 schedule 692b does not include any allocated UL time slots. Similarly, since the three UL time slots for UE 2 conflict with the DL time slots in the initial UE 2 schedule 693a, the scheduler can remove these three UL time slots, which means that the intermediate UE 2 schedule 693b includes two allocated UL time slots. Similarly, since one UL time slot for UE 3 conflicts with the DL time slot in the initial UE 3 schedule 694a, the scheduler can remove the one UL time slot, which means that the intermediate UE 3 schedule 694b includes four allocated UL time slots. Since there are no conflicting time slots in the initial UE 3 schedule 695a, the scheduler does not remove any UL time slots for UE 4, which means that the intermediate UE 4 schedule 695b is the same as the initial UE 4 schedule 695a. The removed UL time slots can be designated as unmet demand time slots. The scheduler can be configured to track unmet demand time slots for allocation in the final schedule for the gateway terminal and multiple UEs.
[0088] In the final step, the scheduler generates a final gateway schedule 691c and corresponding final schedules 692c, 693c, 694c, 695c for multiple UEs. The scheduler generates the final schedule by placing unmet demand slots in existing holes in the schedule. For example, there are four available holes that can be used for UE 1 and do not violate the time slot conflict constraint. Therefore, the scheduler allocates four available holes to generate the final UE 1 schedule 692c. Similarly, there are five available holes that can be used for UE 2 and do not violate the time slot conflict constraint. Therefore, the scheduler allocates five available holes to generate the final UE 2 schedule 693c. Similarly, there are five available holes that can be used for UE 3 and do not violate the time slot conflict constraint. Therefore, the scheduler allocates five available holes to generate the final UE 3 schedule 694c. As described above, there is no UL time slot removed for UE 4, so that UE 4 does not have any unmet demand time slots, and the final UE 4 schedule 695c is the same as the intermediate UE 4 schedule 695b. It should be noted that not all unmet demand slots are allocated in the final schedules 691c to 695c. As described herein, different scheduling algorithms that more efficiently allocate network resources may be implemented. For example, such algorithms may be configured to allocate all unmet demand slots.
[0089] In some embodiments, the scheduling frames are loaded sequentially, such as Fig. 6A and Figure 6B In some embodiments, the scheduled frames are loaded non-sequentially. For example, the frames may be loaded in a round-trip mode subject to one or more constraints, including a half-duplex UE constraint.
[0090] In some embodiments, the scheduler may allocate network resources and the generated schedule may be suitable for multiple schedule frames. For example, a schedule may be generated and remain unchanged for 1 millisecond or more milliseconds. As an example, a schedule frame may include a time slot with a duration of approximately 312.5us, wherein the corresponding schedule frame lasts for approximately 5ms. The schedule frame may be updated in milliseconds, or updated every few schedule frames. Relatedly, the propagation delay calculation or determination may be updated in milliseconds to hundreds of milliseconds. In some embodiments, the propagation delay of one or more UEs changes (e.g., as one or more UEs move or as a satellite moves, etc.). In response, the scheduler may update or change the schedule. In some embodiments, the propagation delay of one or more UEs varies over time.
[0091] Method for scheduling network resources for TDD UE in FDD network
[0092] Figure 7 A flow chart illustrating an example method 700 for scheduling time slots in a full-duplex network including half-duplex user equipment. Figure 1 and Fig. 9 Method 700 may be performed in any of the schedulers described herein. For ease of description, method 700 will be described as being performed by a scheduler. This should not be construed as limiting the scope of the present disclosure. Specifically, any step or portion of method 700 may be performed by any component or combination of components of the communication system described herein.
[0093] In block 705, the scheduler determines a propagation delay between the gateway terminal and each of the plurality of UEs. The propagation delay may be determined based on measurements made by the scheduler or other components of the communication system. The propagation delay may be calculated by the scheduler or another component in the communication system and then relayed to the scheduler.
[0094] In block 710, for each UE, the scheduler determines the conflicting time slots at the UE based on the propagation delay between the gateway terminal and the UE. The conflicting time slots include time slots that violate the half-duplex constraint. The half-duplex constraint is a constraint that limits the allocation of time slots to a specific UE, which will require the UE to transmit and receive at the same time. The conflicting time slots include DL time slots and UL time slots that overlap in time. In some implementations, the scheduler identifies the conflicting time slots for the corresponding UE at the gateway terminal based on the propagation delay between the gateway terminal and the corresponding UE. In other words, the scheduler identifies the time slot that will violate the half-duplex constraint at the UE to which the time slot is allocated if it is allocated at the gateway terminal. This determination can be based on calculating the position of one or more DL time slots at the UE in time by delaying one or more DL time slots in time at the gateway terminal, and the time delay is equal to the corresponding propagation time. Similarly, this determination can be based on calculating the advance in time of one or more UL time slots at the UE by advancing one or more UL time slots in time at the gateway terminal, and the advance in time is equal to the corresponding propagation time.
[0095] In block 715, the scheduler populates the gateway schedule subject to the constraint of avoiding allocating conflicting time slots at each of the plurality of UEs. By identifying the conflicting time slots in block 710, the scheduler may be configured to allocate time slots to a particular UE and, in response, eliminate one or more time slots that conflict with the allocated time slots from the time slots available to the particular UE. For example, the scheduler may allocate DL time slots to a particular UE and, in response, eliminate one or more UL time slots that conflict with the allocated DL time slots from the available time slots for the particular UE. As another example, the scheduler may allocate UL time slots to a particular UE and, in response, eliminate one or more DL time slots that conflict with the allocated UL time slots from the available time slots for the particular UE.
[0096] In some implementations, the scheduler is configured to generate an uplink schedule for the gateway schedule. In such implementations, the scheduler may be configured to not explicitly send an explicit downlink schedule to each UE. For example, the downlink schedule may be inferred from packets received from the UE. In some implementations, the scheduler generates and sends a partial schedule. The partial schedule includes only the uplink schedule for the gateway schedule.
[0097] In block 720, the scheduler transmits the corresponding schedule to each UE. In some implementations, the scheduler transmits the gateway schedule to each UE. In some implementations, the scheduler generates a corresponding UE schedule for each UE. The corresponding UE schedule includes a DL time slot assigned to the UE in the gateway schedule, which is delayed in time by an amount approximately equal to the propagation delay. The corresponding UE schedule also includes a UL time slot assigned to the UE in the gateway schedule, which is advanced in time by an amount approximately equal to the propagation delay. In such implementations, the scheduler transmits the corresponding UE schedule to the associated UE.
[0098] Figure 8 A flow chart illustrating an example method 800 for scheduling time slots in a full-duplex network including half-duplex user equipment. Figure 1 and Fig. 9 Method 800 may be performed in any of the schedulers described herein. For ease of description, method 800 will be described as being performed by a scheduler. This should not be construed as limiting the scope of the present disclosure. Specifically, any step or portion of method 800 may be performed by any component or combination of components of the communication system described herein.
[0099] In block 805, the scheduler determines an initial gateway schedule for a scheduling frame of a full-duplex gateway terminal. The scheduler allocates a plurality of DL time slots for each UE and allocates a plurality of UL time slots for each UE in the initial gateway schedule. The scheduler generates the initial gateway schedule without considering half-duplex constraints (e.g., constraints that the UE cannot transmit and receive simultaneously).
[0100] In block 810, for each UE, the scheduler determines an initial UE schedule using a propagation delay between the UE and the gateway terminal. The initial UE schedule for each UE includes a plurality of DL time slots corresponding to the plurality of DL time slots in the initial gateway schedule and a plurality of UL time slots corresponding to the plurality of UL time slots in the initial gateway schedule. The plurality of DL time slots in the initial UE schedule are delayed in time relative to the plurality of DL time slots in the initial gateway schedule, and the delay in time is approximately equal to the propagation delay between the corresponding UE and the gateway terminal. Similarly, the plurality of UL time slots in the initial UE schedule are advanced in time relative to the plurality of UL time slots in the initial gateway schedule, and the advance in time is approximately equal to the propagation delay between the corresponding UE and the gateway terminal.
[0101] In block 815, the scheduler determines conflicting time slots in the initial gateway schedule. Conflicting time slots correspond to time slots that overlap in time at a particular UE or time slots that require a particular UE to transmit and receive simultaneously. The scheduler may determine conflicting time slots using the initial UE schedule to identify DL time slots and UL time slots that overlap in time. For each time slot that violates the half-duplex constraint at a particular UE, the scheduler may be configured to identify the corresponding time slot in the initial gateway schedule. Thus, the scheduler is configured to identify conflicting time slots in the initial gateway schedule that violate the half-duplex constraint.
[0102] In block 820, the scheduler determines the intermediate gateway scheduling by removing the conflicting time slots from the initial gateway scheduling. The resulting intermediate gateway does not violate the half-duplex constraint. The conflicting time slots removed from the initial gateway scheduling may be marked by the scheduler as unmet demand time slots. In some implementations, in the case where one or more DL time slots conflict with one or more UL time slots, the scheduler may remove the one or more conflicting UL time slots to eliminate the corresponding conflicting time slots. This may be advantageous because the demand for UL time slots is generally less than the demand for DL time slots. This means that unmet UL demand time slots that result in UL inefficiency may be more harmful or disadvantageous than inefficiencies in DL. In some implementations, in the case where one or more DL time slots conflict with one or more UL time slots, the scheduler may remove the one or more conflicting DL time slots to eliminate the corresponding conflicting time slots. In some embodiments, the scheduler determines the corresponding intermediate UE scheduling for each UE based on the propagation delay between the gateway terminal and the corresponding UE, as described above with respect to the initial UE scheduling.
[0103] In block 825, the scheduler generates a final gateway schedule by looping through the unsatisfied request slots and assigning the unsatisfied request slots in open slots in the intermediate gateway schedule subject to the half-duplex constraint. The scheduler may be configured to generate a final UE schedule for each UE based on the propagation delay between the gateway terminal and the corresponding UE, as described above for the initial UE schedule. In some implementations, one or more unsatisfied demand slots are not assigned in the final gateway schedule. In some implementations, the scheduler may implement one or more heuristics to assign unsatisfied demand slots to the final gateway schedule.
[0104] In some implementations, the scheduler is configured to try different time slot combinations to determine a superior or optimal final gateway schedule. This can be done in place of blocks 820 and 825 to find a superior or optimal final gateway schedule that complies with the half-duplex constraint. In some implementations, the scheduler is configured to implement an algorithmic optimization routine (such as linear programming) to determine a superior or optimal final gateway schedule based on an initial gateway schedule subject to the half-duplex constraint.
[0105] In some implementations, the scheduler is configured to transmit the final gateway schedule to the gateway terminal and transmit the final UE schedule to the corresponding UE. In some implementations, the initial schedule and intermediate schedule described for method 800 are not generated, but rather virtual constructs used by the scheduler to facilitate generating the final schedule.
[0106] Sample Scheduler
[0107] Fig. 9 A block diagram of an example scheduler 970 configured to schedule time slots in a full-duplex network including half-duplex user equipment is shown. The scheduler 970 is similar to the one described herein with reference to Figure 1 The scheduler 170 described herein may be implemented in any of the communication systems described herein. The scheduler 970 may employ any of the methods described herein for coordinating the operation of access nodes using supplemental scheduling, such as those described herein with reference to Figure 7 and Figure 8 Example methods 700 and 800 are described.
[0108] Scheduler 970 may include hardware, software and / or firmware components for coordinating the operation of access nodes in a satellite communication system. Scheduler 970 includes a data storage device 971, one or more processors 973, a scheduling module 972, a constraint module 974, a conflict module 976, and a propagation delay module 978. The components of scheduler 970 can communicate with each other, with external systems, and with other components of the network using a communication bus 979. Scheduler 970 can be implemented using one or more computing devices. For example, scheduler 970 can be implemented using a single computing device, multiple computing devices, a distributed computing environment, or it can be located in a virtual device residing in a public or private computing cloud. In a distributed computing environment, one or more computing devices can be configured to provide modules 972, 974, 976, and 978 to provide the described functions.
[0109] The scheduler 970 includes a scheduling module 972 to generate a gateway schedule and / or a UE schedule for each UE communicating with a specific gateway terminal. The scheduling module 972 is configured to generate a schedule based on the constraints from the constraint module 974. The scheduler allocates network resources to different network flows, channel conditions, etc. based on the constraints and the priority, weight, and ratio of the network traffic. Therefore, there are a variety of different ways to allocate network resources in the schedule. The scheduling module 972 can be configured to track the available time slots in the frame and execute algorithms or heuristics to allocate time slots to UEs, which can be done using optimization techniques. For example, based on the constraint module 974 and the conflict module 976, the scheduling module 972 knows that some time slots are unavailable for each UE, so the scheduling module 972 can be configured to track as many time slots as possible to efficiently or optimally allocate open time slots and available time slots.
[0110] Scheduler 970 includes constraint module 974 to identify schedule module 972 and enforce execution constraints on the schedule module. Therefore, the schedule generated by schedule module 972 does not violate the constraints identified by constraint module 974. Constraint module 974 is configured to receive additional constraints from conflict module 976.
[0111] Scheduler 970 includes conflict module 976 to identify potential conflicting time slots for the gateway based on the requirement that the UE not transmit and receive at the same time. This may be referred to as a half-duplex constraint. Thus, conflicting time slots are DL time slots and UL time slots that overlap in time at a particular UE. To determine potentially conflicting time slots, conflict module 976 uses the propagation delay associated with the particular UE, which is received from propagation delay module 978.
[0112] Scheduler 970 includes a propagation delay module 978 to determine the propagation delay for each UE in the communication system. The propagation delay corresponds to the amount of time it takes for a signal to travel from a gateway terminal to a particular UE. Conflict module 976 uses the propagation time to identify time slots of potential conflict.
[0113] The scheduler 970 includes one or more processors 973, which are configured to control the operation of modules 972, 974, 976, 978 and data storage devices 971. One or more processors 973 implement and utilize software modules, hardware components and / or firmware elements configured to schedule time slots for multiple UEs and gateway terminals. One or more processors 973 may include any suitable computer processor, application specific integrated circuit (ASIC), field programmable gate array (FPGA) or other suitable microprocessor. One or more processors 973 may include other computing components configured to interface with various modules and data storage devices of the scheduler 970.
[0114] The scheduler 970 includes a data storage device 971 that is configured to store configuration data, analysis parameters, control commands, databases, algorithms, executable instructions (e.g., instructions for one or more processors 973), etc. The data storage device 971 can be any suitable data storage device or combination of devices, including, for example, but not limited to, random access memory, read-only memory, solid state disk, hard disk drive, flash drive, bubble memory, etc.
[0115] Additional Examples and Terminology
[0116] The present disclosure describes various features, wherein no single feature is solely responsible for the benefits described herein. It should be understood that the various features described herein can be combined, modified or omitted, as will be apparent to those of ordinary skill in the art. Other combinations and subcombinations other than the combinations and subcombinations specifically described herein will be apparent to those of ordinary skill in the art, and are intended to form a part of the present disclosure. Various methods are described herein in conjunction with various flow chart steps and / or stages. It should be understood that in many cases, certain steps and / or stages can be combined together so that the multiple steps and / or stages shown in the flow chart can be performed as a single step and / or stage. In addition, certain steps and / or stages can be divided into additional sub-components to be performed separately. In some cases, the order of steps and / or stages can be rearranged, and certain steps and / or stages can be completely omitted. In addition, the method described herein should be understood to be open, so that additional steps and / or stages of those steps and / or stages shown and described herein can also be performed.
[0117] Some aspects of the systems and methods described herein may be advantageously implemented using, for example, computer software, hardware, firmware, or any combination of computer software, hardware, and firmware. Computer software may include computer executable code stored in a computer-readable medium (e.g., a non-transitory computer-readable medium) that performs the functions described herein when the computer executable code is executed. In some embodiments, the computer executable code is executed by one or more general-purpose computer processors. According to the present disclosure, it will be appreciated by those skilled in the art that any feature or function that can be implemented using software to be executed on a general-purpose computer may also be implemented using different combinations of hardware, software, or firmware. For example, such modules may be implemented entirely in hardware using a combination of integrated circuits. Alternatively or additionally, such features or functions may be implemented in whole or in part using a special-purpose computer designed to perform the specific functions described herein rather than by a general-purpose computer.
[0118] Multiple distributed computing devices may replace any one computing device described herein. In such distributed embodiments, the functionality of one computing device is distributed (eg, via a network) such that some functions are performed on each of the distributed computing devices.
[0119] Some embodiments may be described with reference to equations, algorithms and / or flow charts. These methods may be implemented using computer program instructions executable on one or more computers. These methods may also be implemented as computer program products individually, or as components of devices or systems. In this regard, the frames or steps of each equation, algorithm, flow chart and their combination may be implemented by hardware, firmware and / or software including one or more computer program instructions embodied in computer-readable program code logic. As will be appreciated, any such computer program instruction may be loaded onto one or more computers, including but not limited to general-purpose computers or special-purpose computers, or other programmable processing devices for producing machines, so that the computer program instructions executed on computers or other programmable processing devices implement the functions specified in equations, algorithms and / or flow charts. It should also be understood that the frames and their combinations in each equation, algorithm and / or flow chart display may be implemented by a computer system based on dedicated hardware or a combination of dedicated hardware and computer-readable program code logic devices that perform specified functions or steps.
[0120] In addition, computer program instructions, such as those embodied in computer-readable program code logic, may also be stored in a computer-readable memory (e.g., a non-transitory computer-readable medium) that may direct one or more computers or other programmable processing devices to function in a particular manner such that the instructions stored in the computer-readable memory implement the functions specified in the blocks of the flowchart. The computer program instructions may also be loaded onto one or more computers or other programmable computing devices to cause a series of operational steps to be performed on one or more computers or other programmable computing devices to produce a computer-implemented process such that the instructions executed on the computers or other programmable processing devices provide steps for implementing the functions specified in the blocks of the equations, algorithms, and / or flowcharts.
[0121] Some or all of the methods and tasks described herein may be performed and fully automated by a computer system. In some cases, a computer system may include multiple different computers or computing devices (e.g., physical servers, workstations, storage arrays, etc.) that communicate and interoperate over a network to perform the functions described. Each such computing device typically includes a processor (or multiple processors) that executes program instructions or modules stored in a memory or other non-temporary computer-readable storage medium or device. The various functions disclosed herein may be embodied in such program instructions, although some or all of the disclosed functions may alternatively be implemented in a dedicated circuit system (e.g., ASIC or FPGA) of a computer system. In the case where a computer system includes multiple computing devices, these devices may, but need not, be co-located. The results of the disclosed methods and tasks may be stored persistently by converting physical storage devices such as solid-state memory chips and / or disks into different states.
[0122] Unless the context clearly requires otherwise, throughout the specification and claims, the words "comprise, comprising" and the like should be interpreted as inclusive, rather than exclusive or exhaustive; that is, the meaning of "including but not limited to". As generally used herein, the word "coupled" refers to two or more elements that can be directly connected or connected by means of one or more intermediate elements. In addition, when used in this application, the words "herein", "above", "below" and words with similar meanings should refer to the entire application rather than any specific part of the application. Where the context permits, the words used in the above specific embodiments in the singular or plural may also include the plural or singular, respectively. With respect to the word "or" for a list of two or more items, the word covers all the following interpretations of the word: any item in the list, all items in the list, and any combination of items in the list. The word "exemplary" is exclusively used herein to mean "serving as an example, example or illustration". Any specific implementation described as "exemplary" herein is not necessarily interpreted as being preferred or advantageous over other specific implementations.
[0123] The present disclosure is not intended to be limited to the specific implementations shown herein. Those skilled in the art may readily appreciate various modifications to the embodiments described in the present disclosure, and the general principles defined herein may be applied to other embodiments without departing from the spirit or scope of the present disclosure. The teachings of the present invention provided herein may be applied to other methods and systems, and are not limited to the above methods and systems, and the elements and actions of the various embodiments described above may be combined to provide additional embodiments. Therefore, the novel methods and systems described herein may be embodied in various other forms; in addition, various omissions, substitutions, and changes may be made to the forms of the methods and systems described herein without departing from the spirit of the present disclosure. The attached claims and their equivalents are intended to cover such forms or modifications that fall within the scope and spirit of the present disclosure.
Claims
1. A method for scheduling time slots in a frame for a gateway terminal and a plurality of user equipments (UEs) in a communication system, the method comprising: determining a propagation delay between the gateway terminal and each of the plurality of UEs; determining, for each UE of the plurality of UEs, one or more conflicting time slots at the UE based on the propagation delay between the gateway terminal and the UE, the conflicting time slots being time slots in which the UE is scheduled to transmit and receive simultaneously; filling a constrained gateway schedule to avoid conflicting time slots at each of the plurality of UEs; as well as A schedule corresponding to the gateway schedule is transmitted to each UE of the plurality of UEs.
2. The method of claim 1 , wherein the schedule corresponding to the gateway schedule for a specific UE comprises a schedule having a downlink time slot and having an uplink time slot, the downlink time slot being delayed in time relative to the gateway schedule by a time delay equal to a propagation time associated with the specific UE, and the uplink time slot being advanced in time relative to the gateway schedule by a time advance equal to the propagation time associated with the specific UE. 3 . The method of claim 1 , wherein populating the gateway schedule comprises allocating a plurality of downlink time slots for each of the plurality of UEs.
4. The method of claim 3 , wherein populating the gateway schedule further comprises identifying, for each of the plurality of UEs, one or more uplink time slots that violate the constraint to avoid conflicting time slots caused at least in part by the one or more uplink time slots temporally overlapping with one or more downlink time slots of the plurality of downlink time slots. 5 . The method of claim 1 , wherein populating the gateway schedule comprises allocating a plurality of uplink time slots for each of the plurality of UEs.
6. The method of claim 5, wherein filling the gateway schedule further comprises identifying, for each of the plurality of UEs, one or more downlink time slots that violate the constraint to avoid conflicting time slots caused at least in part by the one or more downlink time slots temporally overlapping with one or more uplink time slots of the plurality of uplink time slots. The method of claim 1 , wherein a propagation delay of a specific UE varies.
8. The method of claim 7, wherein the gateway schedule is updated in response to a change in the propagation delay for the particular UE.
9. The method of claim 7, wherein the propagation delay of the specific UE varies with time.
10. A scheduler in a communication system including a gateway terminal and a plurality of user equipments (UEs), the scheduler comprising: a data storage device configured to store computer executable instructions for scheduling downlink time slots and uplink time slots of frames in the communication system; as well as a processor in communication with the data storage device, the processor being configured to execute the computer executable instructions to: determining a propagation delay between the gateway terminal and each of the plurality of UEs; determining, for each UE of the plurality of UEs, one or more conflicting time slots at the UE based on the propagation delay between the gateway terminal and the UE, the conflicting time slots being time slots in which the UE is scheduled to transmit and receive simultaneously; filling a constrained gateway schedule to avoid conflicting time slots at each of the plurality of UEs; as well as A schedule corresponding to the gateway schedule is transmitted to each UE of the plurality of UEs.
11. The scheduler of claim 10, wherein the scheduler is incorporated into the gateway terminal of the communication system.
12. The scheduler of claim 10 , wherein the schedule corresponding to the gateway schedule for a specific UE comprises a schedule having a downlink time slot that is delayed in time relative to the gateway schedule by a time delay equal to a propagation time associated with the specific UE, and having an uplink time slot that is advanced in time relative to the gateway schedule by a time advance equal to the propagation time associated with the specific UE.
13. The scheduler of claim 10, wherein populating the gateway schedule comprises allocating a plurality of downlink time slots for each of the plurality of UEs.
14. The scheduler of claim 13, wherein populating the gateway schedule further comprises identifying, for each of the plurality of UEs, one or more uplink time slots that violate the constraint to avoid conflicting time slots caused at least in part by the one or more uplink time slots temporally overlapping with one or more downlink time slots of the plurality of downlink time slots.
15. The scheduler of claim 10, wherein a propagation delay for a specific UE varies.
16. The scheduler of claim 15, wherein the gateway schedule is updated in response to a change in the propagation delay for the particular UE.
17. The scheduler of claim 15, wherein the propagation delay for the specific UE varies with time.
18. A communication system comprising: a plurality of user equipments (UEs) configured for half-duplex operation; a gateway terminal configured for full-duplex operation, the gateway terminal configured to communicate with each of the plurality of UEs; as well as A scheduler in communication with the gateway terminal, the scheduler being configured to schedule time slots of frames in the communication system by performing the following operations: determining a propagation delay between the gateway terminal and each of the plurality of UEs; determining, for each UE of the plurality of UEs, one or more conflicting time slots at the UE based on the propagation delay between the gateway terminal and the UE, the conflicting time slots being time slots in which the UE is scheduled to transmit and receive simultaneously; filling a constrained gateway schedule to avoid conflicting time slots at each of the plurality of UEs; as well as A schedule corresponding to the gateway schedule is transmitted to each UE of the plurality of UEs.
19. The communication system according to claim 18, wherein the scheduler is incorporated into the gateway terminal of the communication system.
20. The communication system of claim 18, wherein the schedule corresponding to the gateway schedule for a specific UE comprises a schedule having a downlink time slot and having an uplink time slot, the downlink time slot being delayed in time relative to the gateway schedule by a time delay equal to a propagation time associated with the specific UE, and the uplink time slot being advanced in time relative to the gateway schedule by a time advance equal to the propagation time associated with the specific UE.
21. The communication system of claim 18, wherein populating the gateway schedule comprises allocating a plurality of downlink time slots for each of the plurality of UEs.
22. The communication system of claim 21 , wherein filling the gateway schedule further comprises identifying, for each of the plurality of UEs, one or more uplink time slots that violate the constraint to avoid conflicting time slots caused at least in part by the one or more uplink time slots temporally overlapping with one or more downlink time slots of the plurality of downlink time slots.
23. The communication system of claim 18, wherein populating the gateway schedule comprises allocating a plurality of uplink time slots for each of the plurality of UEs.
24. The communication system of claim 23, wherein filling the gateway schedule further comprises identifying, for each of the plurality of UEs, one or more downlink time slots that violate the constraint to avoid conflicting time slots caused at least in part by the one or more downlink time slots temporally overlapping with one or more uplink time slots of the plurality of uplink time slots.
25. The communication system of claim 18, wherein a propagation delay of a specific UE varies.
26. The communication system of claim 25, wherein the gateway schedule is updated in response to a change in the propagation delay for the particular UE.
27. The communication system of claim 25, wherein the propagation delay for the specific UE varies with time.
28. The communication system of claim 18, wherein at least one UE of the plurality of UEs has a propagation delay greater than or equal to a duration of a time slot in the gateway schedule.
29. The communication system of claim 28, wherein at least one UE of the plurality of UEs has a propagation delay greater than or equal to a duration of two consecutive time slots in the gateway schedule.
30. A method for scheduling time slots in a frame for a gateway terminal and a plurality of user equipments (UEs) in a communication system, the method comprising: generating an initial gateway schedule for the gateway terminal, the initial gateway schedule allocating a plurality of downlink time slots for each of the plurality of UEs and allocating a plurality of uplink time slots for each of the plurality of UEs; For each UE, determining an initial UE schedule based on a propagation delay between the UE and the gateway terminal, the initial UE schedule comprising a plurality of downlink time slots, the plurality of downlink time slots being delayed in time relative to a corresponding plurality of downlink time slots in the initial gateway schedule, the time delay being equal to the propagation delay between the UE and the gateway terminal, the initial UE schedule further comprising a plurality of uplink time slots, the plurality of uplink time slots being advanced in time relative to a corresponding plurality of uplink time slots in the initial gateway schedule, the time advance being equal to the propagation delay between the UE and the gateway terminal; determining one or more conflicting time slots in the initial gateway schedule, a conflicting time slot being a time slot in which a downlink time slot for a particular UE overlaps in time with an uplink time slot; generating an intermediate gateway schedule by removing one or more conflicting time slots from the initial gateway schedule, each time slot removed from the initial gateway schedule comprising an unmet demand time slot associated with a particular UE; and A final gateway schedule is generated by looping through each unmet demand slot and allocating the unmet demand slot in an open slot in the intermediate gateway in response to determining that allocating the unmet demand slot to the open slot will not result in a conflicting slot for the UE associated with the unmet demand slot.
31. The method of claim 30, wherein the one or more conflicting time slots removed from the initial gateway schedule include uplink time slots.
32. The method of claim 30, wherein the one or more conflicting time slots removed from the initial gateway schedule include downlink time slots.
33. The method of claim 30, wherein after removing the one or more conflicting time slots, the intermediate gateway schedule does not include any conflicting time slots.
34. The method of claim 30, further comprising determining the propagation delay for each UE.
35. The method of claim 30, wherein the one or more unmet demand time slots are allocated to the final gateway schedule based at least in part on a priority of the UE associated with the unmet demand time slots.
36. The method of claim 30, further comprising generating a final UE schedule for each of the plurality of UEs, the final UE schedule for a specific UE comprising a plurality of downlink time slots, the plurality of downlink time slots being delayed in time relative to a corresponding plurality of downlink time slots in the final gateway schedule, the delay in time being equal to the propagation delay between the UE and the gateway terminal, the final UE schedule for the specific UE further comprising a plurality of uplink time slots, the plurality of uplink time slots being advanced in time relative to a corresponding plurality of uplink time slots in the final gateway schedule, the advance in time being equal to the propagation delay between the UE and the gateway terminal.
37. The method of claim 36, further comprising transmitting the final UE schedule for each UE to a corresponding UE among the plurality of UEs.
38. The method of claim 30, wherein the initial gateway schedule is generated by looping through each UE and sequentially allocating the plurality of downlink time slots and the plurality of uplink time slots in the frame.
39. The method of claim 30, wherein at least one unmet demand time slot remains unallocated in the final gateway schedule.
40. A scheduler in a communication system including a gateway terminal and a plurality of user equipments (UEs), the scheduler comprising: a data storage device configured to store computer executable instructions for scheduling downlink time slots and uplink time slots of frames in the communication system; as well as a processor in communication with the data storage device, the processor being configured to execute the computer executable instructions to: generating an initial gateway schedule for the gateway terminal, the initial gateway schedule allocating a plurality of downlink time slots for each of the plurality of UEs and allocating a plurality of uplink time slots for each of the plurality of UEs; For each UE, determining an initial UE schedule based on a propagation delay between the UE and the gateway terminal, the initial UE schedule comprising a plurality of downlink time slots, the plurality of downlink time slots being delayed in time relative to a corresponding plurality of downlink time slots in the initial gateway schedule, the time delay being equal to the propagation delay between the UE and the gateway terminal, the initial UE schedule further comprising a plurality of uplink time slots, the plurality of uplink time slots being advanced in time relative to a corresponding plurality of uplink time slots in the initial gateway schedule, the time advance being equal to the propagation delay between the UE and the gateway terminal; determining one or more conflicting time slots in the initial gateway schedule, a conflicting time slot being a time slot in which a downlink time slot for a particular UE overlaps in time with an uplink time slot; generating an intermediate gateway schedule by removing one or more conflicting time slots from the initial gateway schedule, Each time slot removed from the initial gateway schedule comprises an unmet demand time slot associated with a particular UE; and A final gateway schedule is generated by looping through each unmet demand slot and allocating the unmet demand slot in an open slot in the intermediate gateway in response to determining that allocating the unmet demand slot to the open slot will not result in a conflicting slot for the UE associated with the unmet demand slot.
41. A dispatcher according to claim 40, wherein the dispatcher is incorporated into a gateway terminal of the communication system.
42. The scheduler of claim 40, wherein the one or more conflicting time slots removed from the initial gateway schedule include uplink time slots.
43. The scheduler of claim 40, wherein the one or more conflicting time slots removed from the initial gateway schedule include downlink time slots.
44. The scheduler of claim 40, wherein after removing the one or more conflicting time slots, the intermediate gateway schedule does not include any conflicting time slots.
45. The scheduler of claim 40, wherein the processor is further configured to determine a propagation delay for each UE.
46. The scheduler of claim 40, wherein the one or more unmet demand time slots are allocated to the final gateway schedule based at least in part on a priority of the UE associated with the unmet demand time slots.
47. The scheduler of claim 40, wherein at least one unmet demand time slot remains unallocated in the final gateway schedule.
48. A communication system comprising: a plurality of user equipments (UEs) configured for half-duplex operation; a gateway terminal configured for full-duplex operation, the gateway terminal configured to communicate with each of the plurality of UEs; as well as A scheduler in communication with the gateway terminal, the scheduler being configured to schedule time slots of frames in the communication system by performing the following operations: generating an initial gateway schedule for the gateway terminal, the initial gateway schedule allocating a plurality of downlink time slots for each of the plurality of UEs and allocating a plurality of uplink time slots for each of the plurality of UEs; For each UE, determining an initial UE schedule based on a propagation delay between the UE and the gateway terminal, the initial UE schedule comprising a plurality of downlink time slots, the plurality of downlink time slots being delayed in time relative to a corresponding plurality of downlink time slots in the initial gateway schedule, the time delay being equal to the propagation delay between the UE and the gateway terminal, the initial UE schedule further comprising a plurality of uplink time slots, the plurality of uplink time slots being advanced in time relative to a corresponding plurality of uplink time slots in the initial gateway schedule, the time advance being equal to the propagation delay between the UE and the gateway terminal; determining one or more conflicting time slots in the initial gateway schedule, a conflicting time slot being a time slot in which a downlink time slot for a particular UE overlaps in time with an uplink time slot; generating an intermediate gateway schedule by removing one or more conflicting time slots from the initial gateway schedule, Each time slot removed from the initial gateway schedule comprises an unmet demand time slot associated with a particular UE; and A final gateway schedule is generated by looping through each unmet demand slot and allocating the unmet demand slot in an open slot in the intermediate gateway in response to determining that allocating the unmet demand slot to the open slot will not result in a conflicting slot for the UE associated with the unmet demand slot.
49. A communication system according to claim 48, wherein the scheduler is incorporated into a gateway terminal of the communication system.
50. The communication system of claim 48, wherein the one or more conflicting time slots removed from the initial gateway schedule include uplink time slots.
51. The communication system of claim 48, wherein the one or more conflicting time slots removed from the initial gateway schedule include downlink time slots.
52. The communication system of claim 48, wherein after removing the one or more conflicting time slots, the intermediate gateway schedule does not include any conflicting time slots.
53. The communication system of claim 48, wherein the scheduler is further configured to determine a propagation delay for each UE.
54. The communication system of claim 48, wherein the one or more unmet demand time slots are allocated to the final gateway schedule based at least in part on a priority of the UE associated with the unmet demand time slot.
55. The communication system of claim 48, wherein at least one unmet demand time slot remains unallocated in the final gateway schedule.
56. The communication system of claim 48, wherein at least one UE of the plurality of UEs has a propagation delay greater than or equal to a duration of a time slot in the final gateway schedule.
57. The communication system of claim 56, wherein at least one UE of the plurality of UEs has a propagation delay greater than or equal to a duration of two consecutive time slots in the final gateway schedule.
