Downlink scheduling in fractional frequency reuse (FFR) systems
    1.
    发明授权
    Downlink scheduling in fractional frequency reuse (FFR) systems 有权
    分数频率复用(FFR)系统中的下行链路调度

    公开(公告)号:US08712462B2

    公开(公告)日:2014-04-29

    申请号:US12819191

    申请日:2010-06-19

    IPC分类号: H04W52/34 H04W72/12

    摘要: An apparatus and method are disclosed for determining the optimal bandwidth fractions for all the users in each frequency band in a wireless communication system to maximize the net sum of user utilities. User utilities are functions of average rates of users, where different averaging rules can be used for different users. The standard approach of computing an optimal scheduler strategy involves the solution of a convex optimization problem that has a complexity on the order of O(N3) for N flows. This approach is not feasible for online implementation having a large number of flows. The method of the present work employs an efficient computational algorithm that obtains the optimal bandwidth fractions in O(N) time. This feature makes the method suitable for implementation in wideband cellular systems like LTE (Long Term Evolution) and UMB (Ultra Mobile Broadband).

    摘要翻译: 公开了一种用于确定无线通信系统中每个频带中所有用户的最佳带宽分数的装置和方法,以最大化用户实用程序的净和。 用户实用程序是用户的平均速率的函数,其中不同的平均规则可以用于不同的用户。 计算最优调度器策略的标准方法涉及对于N个流具有O(N3)级的复杂度的凸优化问题的解。 这种方法对于具有大量流量的在线实现是不可行的。 本工作的方法采用了一种在O(N)时间内获得最佳带宽分数的有效计算算法。 该特征使得该方法适用于诸如LTE(长期演进)和UMB(超移动宽带)的宽带蜂窝系统中的实现。

    DOWNLINK SCHEDULING IN FRACTIONAL FREQUENCY REUSE (FFR) SYSTEMS
    2.
    发明申请
    DOWNLINK SCHEDULING IN FRACTIONAL FREQUENCY REUSE (FFR) SYSTEMS 有权
    在频率重复(FFR)系统中的下行调度

    公开(公告)号:US20110312360A1

    公开(公告)日:2011-12-22

    申请号:US12819191

    申请日:2010-06-19

    IPC分类号: H04B7/00

    摘要: An apparatus and method are disclosed for determining the optimal bandwidth fractions for all the users in each frequency band in a wireless communication system to maximize the net sum of user utilities. User utilities are functions of average rates of users, where different averaging rules can be used for different users. The standard approach of computing an optimal scheduler strategy involves the solution of a convex optimization problem that has a complexity on the order of O(N3) for N flows. This approach is not feasible for online implementation having a large number of flows. The method of the present work employs an efficient computational algorithm that obtains the optimal bandwidth fractions in O(N) time. This feature makes the method suitable for implementation in wideband cellular systems like LTE (Long Term Evolution) and UMB (Ultra Mobile Broadband).

    摘要翻译: 公开了一种用于确定无线通信系统中每个频带中所有用户的最佳带宽分数的装置和方法,以最大化用户实用程序的净和。 用户实用程序是用户的平均速率的函数,其中不同的平均规则可以用于不同的用户。 计算最优调度器策略的标准方法涉及对于N个流具有O(N3)级的复杂度的凸优化问题的解。 这种方法对于具有大量流量的在线实现是不可行的。 本工作的方法采用了一种在O(N)时间内获得最佳带宽分数的有效计算算法。 该特征使得该方法适用于诸如LTE(长期演进)和UMB(超移动宽带)的宽带蜂窝系统中的实现。

    METHODS AND APPARATUS FOR CONTENTION-BASED UPLINK ACCESS IN WIRELESS COMMUNICATION SYSTEMS
    4.
    发明申请
    METHODS AND APPARATUS FOR CONTENTION-BASED UPLINK ACCESS IN WIRELESS COMMUNICATION SYSTEMS 有权
    无线通信系统中基于内容上行接入的方法与装置

    公开(公告)号:US20120014269A1

    公开(公告)日:2012-01-19

    申请号:US12987946

    申请日:2011-01-10

    IPC分类号: H04W72/04 H04W24/00

    CPC分类号: H04W74/006 H04W74/008

    摘要: Methods and apparatus for contention-based access in a wireless communication system are disclosed. A base station may determine a contention-based resource allocation comprising a subset of available system resources. Information related to the contention-based resources may be sent to a user device. In addition, state information may be provided to the UE. The UE may generate and send a contention-based uplink transmission consistent with the allocated resources and state information.

    摘要翻译: 公开了一种在无线通信系统中基于竞争的接入的方法和装置。 基站可以确定包括可用系统资源的子集的基于竞争的资源分配。 与基于竞争的资源相关的信息可以被发送到用户设备。 此外,可以向UE提供状态信息。 UE可以生成并发送与分配的资源和状态信息一致的基于争用的上行链路传输。

    DIVISION OF THE SCHEDULING ALGORITHM INTO BACKGROUND AND FOREGROUND ALGORITHMS
    9.
    发明申请
    DIVISION OF THE SCHEDULING ALGORITHM INTO BACKGROUND AND FOREGROUND ALGORITHMS 有权
    将调度算法分解为背景和前缀算法

    公开(公告)号:US20090116438A1

    公开(公告)日:2009-05-07

    申请号:US12261297

    申请日:2008-10-30

    IPC分类号: H04W72/04

    摘要: Systems and methodologies are described that facilitate dividing scheduling algorithms into background and foreground aspects capable of simultaneously servicing a multiplicity of disparate flows in wideband communications networks. The systems provided herein arbitrarily select prospective time horizons, generate optimal bandwidth allocation targets based on a plurality of flows observed by the system, and utilizes the optimal bandwidth targets to assign flows to users over the entirety of the prospective time horizon.

    摘要翻译: 描述了有助于将调度算法分解成能够同时服务于宽带通信网络中的多个不同流的背景和前景方面的系统和方法。 本文提供的系统任意选择预期时间间隔,基于系统观察到的多个流生成最优带宽分配目标,并利用最优带宽目标在整个预期时间范围内为用户分配流量。