专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US07684337B2 Method and system for communicating in cooperative relay networks 有权
标题翻译：在协同中继网络中进行通信的方法和系统
公开(公告)号：US07684337B2
公开(公告)日：2010-03-23
申请号：US11333665
申请日：2006-01-17
申请人： Neelesh B. Mehta , Ritesh Madan , Andreas F. Molisch , Jinyun Zhang
发明人： Neelesh B. Mehta , Ritesh Madan , Andreas F. Molisch , Jinyun Zhang
IPC分类号： H04L12/26 , H04B3/36
CPC分类号： H04W40/06 , H04B7/026 , H04B7/0408 , H04W52/46 , Y02D70/322 , Y02D70/442 , Y02D70/444
摘要： A method and system for communicating information in a cooperative relay network of wireless nodes. The wireless nodes including a source, a set of relays, and a destination. Channel state information for each channel between a particular relay of the set of relays and the destination is estimated. A subset of the relays is selected based on the channel state information. The channel state information is fed back to the subset of relays. The source node can then broadcasting data packets from the source to the subset of relays, and the subset of relays forward coherently the data packets from the subset of relays to the destination using beamforming based on the channel state information, while adjusting power to minimize a total energy consumption in the network.
摘要翻译：一种用于在无线节点的协作中继网络中传送信息的方法和系统。无线节点包括源，一组中继和目的地。估计该组继电器的特定继电器和目的地之间的每个通道的通道状态信息。基于信道状态信息来选择继电器的子集。信道状态信息反馈给继电器的子集。源节点然后可以从源到广播数据分组到中继的子集，并且继电器的子集基于信道状态信息使用波束形成将来自中继的子集的数据分组向前转发到目的地，同时调整功率以最小化网络总能耗。

2. 发明申请

US20080075007A1 Decentralized and dynamic route selection in cooperative relay networks 失效
标题翻译：协同中继网络中的分散和动态路由选择
公开(公告)号：US20080075007A1
公开(公告)日：2008-03-27
申请号：US11527267
申请日：2006-09-25
申请人： Neelesh B. Mehta , Ritesh Madan , Andreas F. Molisch , Jinyun Zhang
发明人： Neelesh B. Mehta , Ritesh Madan , Andreas F. Molisch , Jinyun Zhang
IPC分类号： H04J3/14 , H04L12/28
CPC分类号： H04W40/22 , H04B7/15592 , H04L45/12 , H04L45/24 , H04W40/08 , Y02D70/122 , Y02D70/324 , Y02D70/39 , Y02D70/446
摘要： A method selects an optimal route in a cooperative relay network including a set of nodes. For each node in a set of nodes of a cooperative relay network, dynamically varying channel state information is determined. A transmission policy based on the dynamically-varying channel state information is selected, in which the transmission policy includes selected nodes forming an optimal route, a transmission mode for each selected node, and a transmission power for each selected node.
摘要翻译：一种方法在包括一组节点的协作中继网络中选择最优路由。对于协作中继网络的一组节点中的每个节点，确定动态变化的信道状态信息。选择基于动态变化的信道状态信息的传输策略，其中传输策略包括形成最佳路由的选定节点，每个选定节点的传输模式以及每个选择节点的传输功率。

3. 发明授权

US07706283B2 Decentralized and dynamic route selection in cooperative relay networks 失效
标题翻译：协同中继网络中的分散和动态路由选择
公开(公告)号：US07706283B2
公开(公告)日：2010-04-27
申请号：US11527267
申请日：2006-09-25
申请人： Neelesh B. Mehta , Ritesh Madan , Andreas F. Molisch , Jinyun Zhang
发明人： Neelesh B. Mehta , Ritesh Madan , Andreas F. Molisch , Jinyun Zhang
IPC分类号： H04L12/26
CPC分类号： H04W40/22 , H04B7/15592 , H04L45/12 , H04L45/24 , H04W40/08 , Y02D70/122 , Y02D70/324 , Y02D70/39 , Y02D70/446
摘要： A method selects an optimal route in a cooperative relay network including a set of nodes. For each node in a set of nodes of a cooperative relay network, dynamically varying channel state information is determined. A transmission policy based on the dynamically varying channel state information is selected, in which the transmission policy includes selected nodes forming an optimal route, a transmission mode for each selected node, and a transmission power for each selected node.
摘要翻译：一种方法在包括一组节点的协作中继网络中选择最优路由。对于协作中继网络的一组节点中的每个节点，确定动态变化的信道状态信息。选择基于动态变化的信道状态信息的传输策略，其中传输策略包括形成最佳路由的选择节点，每个选择节点的传输模式和每个选择节点的传输功率。

4. 发明申请

US20070165581A1 Method and system for communicating in cooperative relay networks 有权
标题翻译：在协同中继网络中进行通信的方法和系统
公开(公告)号：US20070165581A1
公开(公告)日：2007-07-19
申请号：US11333665
申请日：2006-01-17
申请人： Neelesh Mehta , Ritesh Madan , Andreas Molisch , Jinyun Zhang
发明人： Neelesh Mehta , Ritesh Madan , Andreas Molisch , Jinyun Zhang
IPC分类号： H04Q7/24
CPC分类号： H04W40/06 , H04B7/026 , H04B7/0408 , H04W52/46 , Y02D70/322 , Y02D70/442 , Y02D70/444
摘要： A method and system for communicating information in a cooperative relay network of wireless nodes. The wireless nodes including a source, a set of relays, and a destination. Channel state information for each channel between a particular relay of the set of relays and the destination is estimated. A subset of the relays is selected based on the channel state information. The channel state information is fed back to the subset of relays. The source node can then broadcasting data packets from the source to the subset of relays, and the subset of relays forward coherently the data packets from the subset of relays to the destination using beamforming based on the channel state information, while adjusting power to minimize a total energy consumption in the network.
摘要翻译：一种用于在无线节点的协作中继网络中传送信息的方法和系统。无线节点包括源，一组中继和目的地。估计该组继电器的特定继电器和目的地之间的每个通道的通道状态信息。基于信道状态信息来选择继电器的子集。信道状态信息反馈给继电器的子集。源节点然后可以从源到广播数据分组到中继的子集，并且继电器的子集基于信道状态信息使用波束形成将来自中继的子集的数据分组向前转发到目的地，同时调整功率以最小化网络总能耗。

5. 发明申请

US20090122717A1 SCHEDULING QOS FLOWS IN BROADBAND WIRELESS COMMUNICATION SYSTEMS 有权
标题翻译：在宽带无线通信系统中调度QOS流
公开(公告)号：US20090122717A1
公开(公告)日：2009-05-14
申请号：US12264051
申请日：2008-11-03
申请人： Arnab Das , Ritesh Madan , Sundeep Rangan , Sanjay Shakkottai , Siddharth Ray
发明人： Arnab Das , Ritesh Madan , Sundeep Rangan , Sanjay Shakkottai , Siddharth Ray
IPC分类号： H04L12/26
CPC分类号： H04L47/10 , H04L47/14 , H04L47/2441 , H04L47/283 , H04L47/30 , H04L47/70 , H04L47/762 , H04L47/803 , H04L47/824 , H04W72/12 , H04W72/1205 , H04W72/1231
摘要： Systems and methodologies are described that facilitate enhanced resource scheduling for a wireless communication system. As described herein, packets associated with a common flow that arrive within a predetermined time period following a leading packet associated with the flow can be grouped into respective packet bursts. Subsequently, system bandwidth, transmit power, and/or other communication resources can be scheduled based on an analysis of the respective packet bursts. As provided herein, by analyzing respective packet bursts in lieu of individual packets, computational and resource overhead required for resource scheduling can be significantly reduced. In one example described herein, a resource schedule is determined by selecting one or more flows to be assigned bandwidth from among a plurality of flows based on an analysis of packet bursts respectively associated with the flows. Sufficient bandwidth can subsequently be scheduled for the selected flows for transmission of the respectively associated packet bursts.
摘要翻译：描述了促进无线通信系统的增强的资源调度的系统和方法。如本文所述，与在与流相关联的前导分组之后的预定时间段内到达的公共流相关联的分组可以被分组为相应的分组突发。随后，可以基于相应分组突发的分析来调度系统带宽，发射功率和/或其他通信资源。如本文提供的，通过分析各个分组突发来代替各个分组，可以显着地减少资源调度所需的计算和资源开销。在本文描述的一个示例中，基于与流分别相关联的分组突发的分析，通过从多个流中选择要分配带宽的一个或多个流来确定资源调度。随后可以为所选择的流调度足够的带宽以传输分别相关联的分组突发。

6. 发明授权

US08923157B2 Scheduling QOS flows in broadband wireless communication systems 有权
标题翻译：在宽带无线通信系统中调度QOS流
公开(公告)号：US08923157B2
公开(公告)日：2014-12-30
申请号：US12264051
申请日：2008-11-03
申请人： Arnab Das , Ritesh Madan , Sundeep Rangan , Sanjay Shakkottai , Siddharth Ray
发明人： Arnab Das , Ritesh Madan , Sundeep Rangan , Sanjay Shakkottai , Siddharth Ray
IPC分类号： G01R31/08 , G06F11/00 , G08C15/00 , H04J1/16 , H04J3/14 , H04L1/00 , H04L12/26 , H04L12/801 , H04L12/54 , H04L12/851 , H04L12/841 , H04L12/835 , H04L12/923 , H04L12/927 , H04L12/911 , H04W72/12
CPC分类号： H04L47/10 , H04L47/14 , H04L47/2441 , H04L47/283 , H04L47/30 , H04L47/70 , H04L47/762 , H04L47/803 , H04L47/824 , H04W72/12 , H04W72/1205 , H04W72/1231
摘要： Systems and methodologies are described that facilitate enhanced resource scheduling for a wireless communication system. As described herein, packets associated with a common flow that arrive within a predetermined time period following a leading packet associated with the flow can be grouped into respective packet bursts. Subsequently, system bandwidth, transmit power, and/or other communication resources can be scheduled based on an analysis of the respective packet bursts. As provided herein, by analyzing respective packet bursts in lieu of individual packets, computational and resource overhead required for resource scheduling can be significantly reduced. In one example described herein, a resource schedule is determined by selecting one or more flows to be assigned bandwidth from among a plurality of flows based on an analysis of packet bursts respectively associated with the flows. Sufficient bandwidth can subsequently be scheduled for the selected flows for transmission of the respectively associated packet bursts.
摘要翻译：描述了促进无线通信系统的增强的资源调度的系统和方法。如本文所述，与在与流相关联的前导分组之后的预定时间段内到达的公共流相关联的分组可以被分组为相应的分组突发。随后，可以基于相应分组突发的分析来调度系统带宽，发射功率和/或其他通信资源。如本文提供的，通过分析各个分组突发来代替各个分组，可以显着地减少资源调度所需的计算和资源开销。在本文描述的一个示例中，基于与流分别相关联的分组突发的分析，通过从多个流中选择要分配带宽的一个或多个流来确定资源调度。随后可以为所选择的流调度足够的带宽以传输分别相关联的分组突发。

7. 发明申请

US20180240024A1 Event prediction 审中-公开
公开(公告)号：US20180240024A1
公开(公告)日：2018-08-23
申请号：US15844613
申请日：2017-12-17
申请人： Ying-zong Huang , Vishal Doshi , Balaji Rengarajan , Vasudha Shivamoggi , Devavrat Shah , Ritesh Madan
发明人： Ying-zong Huang , Vishal Doshi , Balaji Rengarajan , Vasudha Shivamoggi , Devavrat Shah , Ritesh Madan
IPC分类号： G06N5/04 , G06F17/30 , G06N99/00
CPC分类号： G06N5/04 , G06F16/2433 , G06F16/2477 , G06N20/00
摘要： Methods and systems for event prediction. The system includes at least one connector configured to gather at least partially incomplete data from at least one data source. The gathered data may be communicated to a model definition module that converts at least a subset of the gathered data into a prediction model in accordance with a received definition. A prediction module may receive a prediction query and, in response, supply an event prediction based on the prediction model.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式