利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

7 条记录 (耗时 0.014 秒)

    Method and apparatus for dynamic frequency selection in a wireless communications network
    2.
    发明授权
    Method and apparatus for dynamic frequency selection in a wireless communications network 有权
    用于无线通信网络中动态频率选择的方法和装置

    公开(公告)号：US07171160B2

    公开(公告)日：2007-01-30

    申请号：US10609776

    申请日：2003-06-30

    申请人： Mooi Choo Chuah ,  Kameswara Rao Medapalli

    发明人： Mooi Choo Chuah ,  Kameswara Rao Medapalli

    IPC分类号： H04B15/00

    CPC分类号： H04W16/04 ,  H04W16/10

    摘要： An advance over the prior art is achieved through an efficient method for the dynamic selection of frequencies with low occupancy in a manner that results in minimizing the search for such frequencies and the risk of a large of number of nodes choosing the same frequency. A method for dynamically selecting the frequencies according to the invention includes the following parts. A channel loading indicator that determines if the mobile node needs to look for a new channel. A channel search algorithm that quickly determines the new channel to be used. A tracking algorithm that remembers the channels that were most recently determined to be loaded and hence should be avoided in the near future. In one embodiment of the invention a method of selecting frequencies for use by a device in a wireless communications network is presented. The method includes the steps of monitoring channel usage of given frequencies to determine loaded channels based on whether an associated channel usage threshold has been reached and, if the channel usage threshold has been reached, determining whether to switch from a loaded channel to another channel based on a probability function.

    摘要翻译： 现有技术的进步是通过一种用于动态选择具有低占用率的频率的有效方法来实现的，该方式导致最小化对这种频率的搜索和选择相同频率的大量节点的风险。 根据本发明的用于动态选择频率的方法包括以下部分。 确定移动节点是否需要寻找新信道的信道加载指示符。 快速确定要使用的新频道的频道搜索算法。 跟踪算法记住最近确定要加载的通道，因此应该在不久的将来避免。 在本发明的一个实施例中，提出了一种选择频率供无线通信网络中的设备使用的频率的方法。 该方法包括以下步骤：基于是否已经达到相关联的信道使用阈值来监测给定频率的信道使用以确定加载的信道，并且如果已经达到信道使用阈值，则确定是否从加载的信道切换到另一信道 在概率函数上。

    Methods and apparatus for reliable point to multipoint communications
    3.
    发明授权
    Methods and apparatus for reliable point to multipoint communications 失效
    用于可靠的点对多点通信的方法和装置

    公开(公告)号：US07324545B2

    公开(公告)日：2008-01-29

    申请号：US10403423

    申请日：2003-03-31

    申请人： Mooi Choo Chuah ,  Kameswara Rao Medapalli

    发明人： Mooi Choo Chuah ,  Kameswara Rao Medapalli

    IPC分类号： H04L12/403

    CPC分类号： H04L1/1685 ,  H04L1/1887 ,  H04L1/203 ,  H04L2001/0093 ,  H04W4/06 ,  H04W72/005 ,  Y02D70/1242 ,  Y02D70/142

    摘要： An advance over the prior art is achieved through an efficient method to retransmit erroneous frames by identifying the users who are most likely to experience a frame error and requests retransmissions from them. Since the recovery is done by starting with the most likely, second most likely etc., the invention results in faster recovery of data. Moreover, the invention reduces the battery consumption of subsequent mobile nodes by suppressing the retransmission requests that were already made by nodes preceding it. A key element of the invention is to rank the set of receiver nodes in the order of decreasingly worse channel conditions, i.e., from worst to best. Hence, with K receiver nodes, a transmit node assigns rank 1 to a receiver node to which it has the poorest radio channel condition. Similarly, it assigns rank K to the receiver node to which it has the best radio channel condition. The channel condition is known at the receiver by keeping a simple measure of the number of data frames correctly received so far and the total number of frames transmitted to it. This information can be periodically sent back to the transmitter and thus aiding in the ranking procedure. Alternatively, if the transmitter is capable of sending a pilot/beacon, the receiver can do some averaging of received signal strength and provide such information back to the transmitter.

    摘要翻译： 通过有效的方法通过识别最有可能经历帧错误并请求重传的用户重传错误帧来实现现有技术的进步。 由于恢复是通过从最可能的，最可能的次数等开始来实现的，所以本发明导致更快的数据恢复。 此外，本发明通过抑制已经由节点之前已经做出的重传请求来减少后续移动节点的电池消耗。 本发明的一个关键要素是以越来越差的信道条件，即从最差到最佳的顺序对接收机节点集进行排序。 因此，对于K个接收器节点，发射节点将秩1分配给具有最差无线电信道条件的接收机节点。 类似地，它将等级K分配给具有最佳无线电信道条件的接收机节点。 通过保持对到目前为止正确接收的数据帧的数量的简单测量以及发送给它的总帧数，在接收机处知道信道条件。 该信息可以周期性地发送回发射机，从而辅助排序过程。 或者，如果发射机能够发送导频/信标，则接收机可以对接收到的信号强度进行一些平均，并将这些信息提供给发射机。

    Scheduler and method for scheduling transmissions in a communication network
    4.
    发明授权
    Scheduler and method for scheduling transmissions in a communication network 有权
    在通信网络中调度传输的调度器和方法

    公开(公告)号：US07349338B2

    公开(公告)日：2008-03-25

    申请号：US10413382

    申请日：2003-04-15

    申请人： Krishna Balachandran ,  Kenneth C. Budka ,  Arnab Das ,  Kameswara Rao Medapalli ,  Minothi Parulekar

    发明人： Krishna Balachandran ,  Kenneth C. Budka ,  Arnab Das ,  Kameswara Rao Medapalli ,  Minothi Parulekar

    IPC分类号： H04J3/16 ,  H04B7/212

    CPC分类号： H04W72/1226 ,  H04L47/10 ,  H04L47/14 ,  H04L47/215 ,  H04L47/24 ,  H04L47/2458 ,  H04L47/50 ,  H04L47/626 ,  H04W28/24 ,  H04W72/1236 ,  H04W72/1247

    摘要： A scheduler and a method for scheduling transmissions to a plurality of users in a communication network assigns a higher target minimum throughput for receiving a next transmission to a user based on a quality of service (QoS) class of the user. A token count that tracks the user's achieved performance relative to a target minimum throughput Is determined for each user in given timeslot, and a weight is determined for each user based on one or more of the token count and a current rate requested by the user. A user having the highest weight as determined by a weight function is scheduled to be served the next transmission. User priority for scheduling may be downgraded if an average data rate requested by the user is less than the target minimum throughput.

    摘要翻译： 基于用户的服务质量（QoS）类别，向通信网络中的多个用户调度传输的调度器和方法为用户分配用于接收下一个传输的更高的目标最小吞吐量。 针对给定时隙中的每个用户确定跟踪用户相对于目标最小吞吐量的实现性能的令牌计数，并且基于令牌计数和用户请求的当前速率中的一个或多个确定每个用户的权重。 由权重函数确定的具有最高权重的用户被调度为下次发送。 如果用户请求的平均数据速率小于目标最小吞吐量，则可以降低用于调度的用户优先级。

    Method and System for a Time Domain Approach to 4G WiMAX/LTE-WiFi/BT Coexistence
    5.
    发明申请
    Method and System for a Time Domain Approach to 4G WiMAX/LTE-WiFi/BT Coexistence 审中-公开
    用于4G WiMAX / LTE-WiFi / BT共存的时域方法和系统

    公开(公告)号：US20110205986A1

    公开(公告)日：2011-08-25

    申请号：US13024124

    申请日：2011-02-09

    申请人： Kameswara Rao Medapalli

    发明人： Kameswara Rao Medapalli

    IPC分类号： H04W72/04

    CPC分类号： H04L5/0062 ,  H04L5/0092 ,  H04W72/0446 ,  H04W72/1215

    摘要： A method and system are provided in which a device that is operable to handle WiFi communication and WiMAX communication may receive downlink medium access protocol (MAP) information in a downlink sub-frame of a WiMAX frame and disable WiFi transmission during a portion of the downlink sub-frame based on the downlink MAP information. The disabled WiFi transmission may be enabled after data within the downlink sub-frame is decoded. The device may also receive uplink MAP information in the downlink sub-frame and may control a clear channel assessment associated with the WiFi transmission based on the uplink MAP information. The MAP information may comprise data or burst profile information and/or one or more physical control messages. A similar time domain approach may be utilized for coexistence between WiFi and long term evolution (LTE) coexistence, Bluetooth and WiMAX, and Bluetooth and LTE. Frame aggregation may be enabled to alleviate pending WiFi traffic.

    摘要翻译： 提供一种方法和系统，其中可操作以处理WiFi通信和WiMAX通信的设备可以在WiMAX帧的下行链路子帧中接收下行链路媒体接入协议（MAP）信息，并且在下行链路的一部分期间禁用WiFi传输 基于下行MAP信息的子帧。 在下行链路子帧中的数据被解码之后，可以启用禁用的WiFi传输。 该设备还可以在下行链路子帧中接收上行链路MAP信息，并且可以基于上行链路MAP信息来控制与WiFi传输相关联的清除信道评估。 MAP信息可以包括数据或突发配置文件信息和/或一个或多个物理控制消息。 类似的时域方法可以用于WiFi和长期演进（LTE）共存，蓝牙和WiMAX以及蓝牙和LTE之间的共存。 可以启用帧聚合以减轻未决的WiFi流量。

    Efficient automatic repeat request method using variable length sequence numbers
    6.
    发明授权
    Efficient automatic repeat request method using variable length sequence numbers 有权
    使用可变长度序列号的高效自动重复请求方法

    公开(公告)号：US06654422B1

    公开(公告)日：2003-11-25

    申请号：US09312167

    申请日：1999-05-14

    申请人： Farooq Ullah Khan ,  Douglas N. Knisely ,  Sarath Kumar ,  Kameswara Rao Medapalli ,  Sanjiv Nanda

    发明人： Farooq Ullah Khan ,  Douglas N. Knisely ,  Sarath Kumar ,  Kameswara Rao Medapalli ,  Sanjiv Nanda

    IPC分类号： H04L2700

    CPC分类号： H04L1/1825 ,  H04L1/0023 ,  H04L1/165 ,  H04L1/1671 ,  H04L1/1809

    摘要： A variable length sequence number is used to identify data units in a communication channel. The sequence number associated with the most recent data that has been received successfully and the sequence number expected with the next new data message to be received are examined to determine the minimum size sequence number necessary to unambiguously identify to the transmitter incorrectly received data that must be retransmitted in a later message. The receiver provides the transmitter with the sequence number associated with the last successfully received byte of data and the sequence number associated with the next expected byte of data. The receiver communicates this information to the transmitter using a NAK control message. The transmitter then uses the sequence number of the next byte of data to be transmitted and the information received in the control message from the receiver to determine the smallest number of bits necessary to represent the sequence numbers for both data transmissions and the retransmission of data that was not received properly by the receiver.

    摘要翻译： 可变长度序列号用于识别通信信道中的数据单元。 检查与已经成功接收的最新数据相关联的序列号以及预期接收到的下一个新数据消息的序列号，以确定明确识别发射机所必需的最小大小序列号，这些数据必须是 在稍后的消息中重传。 接收器向发射机提供与最后成功接收的数据字节相关联的序列号以及与下一个预期数据字节相关联的序列号。 接收机使用NAK控制消息将该信息传送给发射机。 然后，发射机使用要发送的数据的下一字节的序列号和来自接收机的控制消息中接收的信息来确定表示数据传输的序列号所需的最小比特数，并且重传数据的数据， 接收机没有正确接收到。