Multiple simultaneous link transmissions for a multi-frequency multi-rate multi-transceiver communications device
    1.
    发明授权
    Multiple simultaneous link transmissions for a multi-frequency multi-rate multi-transceiver communications device 有权
    用于多频多速率多收发器通信设备的多个同时链路传输

    公开(公告)号:US09402244B2

    公开(公告)日:2016-07-26

    申请号:US13744133

    申请日:2013-01-17

    摘要: An apparatus includes a network node configured to communicate with other network nodes via a communication network. The network node includes a plurality of transceivers and a controller. The controller includes a link management module and a packet management module. The link management module is configured to produce link profiles associated with communication links available to the network node, wherein a link profile indicates link characteristics that include a busy indication of a transceiver. The packet management module is configured to identify a link profile solution set that includes a set of link profiles corresponding to communication links for multicasting the message packet, map the link profiles of the link profile solution set to at least a portion of the plurality of transceivers, and initiate transmission of the message packet using the communication links corresponding to the link profile solution set.

    摘要翻译: 一种装置包括被配置为经由通信网络与其他网络节点通信的网络节点。 网络节点包括多个收发器和控制器。 控制器包括链路管理模块和分组管理模块。 链路管理模块被配置为产生与可用于网络节点的通信链路相关联的链路简档,其中链路简档指示包括收发器的忙指示的链路特性。 分组管理模块被配置为识别链路简档解决方案集合,其包括与用于多播消息分组的通信链路相对应的一组链路简档,将链路简档解决方案集合的链路简档映射到多个收发器的至少一部分 并且使用与链路简档解集合相对应的通信链路来发起消息分组的传输。

    METHODS FOR DYNAMIC TRANSCEIVER RESOURCE ALLOCATION IN MULTI-TRANSCEIVER SYSTEMS
    2.
    发明申请
    METHODS FOR DYNAMIC TRANSCEIVER RESOURCE ALLOCATION IN MULTI-TRANSCEIVER SYSTEMS 审中-公开
    多收付系统中动态收敛资源分配的方法

    公开(公告)号:US20140269267A1

    公开(公告)日:2014-09-18

    申请号:US13803109

    申请日:2013-03-14

    IPC分类号: H04W72/04

    CPC分类号: H04W72/0486 H04L47/12

    摘要: Embodiments of a system and method for managing transceiver resources in a wireless network are generally described herein. In some embodiments, a transceiver resource manager (MXRM) dynamically adapts the number of transceivers to an offered load. A node computes the number of transceiver it needs based on queue depth and queue usage. MXRM then shares the number of the transceivers to be requested, A, with next-hop neighbors. A node assigns X transceivers such that X is the maximum of their own A value and the highest A value they receive if they are next-hop targets. MXRM processes requests for additional transceivers from nodes and previous-hop neighbors such that the sender-receiver pair assigns a compatible number of transceivers. MXRM is also used to drive frequency assignments to increase capacity along the traffic flows. Therefore, MXRM adapts transceiver assignments to the traffic paths.

    摘要翻译: 这里一般地描述用于管理无线网络中的收发器资源的系统和方法的实施例。 在一些实施例中,收发器资源管​​理器(MXRM)动态地将收发器的数量适配到所提供的负载。 节点根据队列深度和队列使用情况计算需要的收发器数量。 MXRM然后与下一跳邻居共享要请求的收发器的数量A。 节点分配X个收发器,使得X是自己的A值的最大值,如果它们是下一跳目标,它们将接收到最高的A值。 MXRM处理来自节点和上一跳邻居的附加收发器的请求,以便发送方 - 接收方对分配一个兼容数量的收发器。 MXRM还用于驱动频率分配,以增加流量的容量。 因此,MXRM将收发器分配调整到流量路径。

    Frequency assignment with dynamic multi-transceiver resources
    5.
    发明授权
    Frequency assignment with dynamic multi-transceiver resources 有权
    使用动态多收发器资源进行频率分配

    公开(公告)号:US09374292B2

    公开(公告)日:2016-06-21

    申请号:US13803124

    申请日:2013-03-14

    摘要: Embodiments of a system and method for providing frequency assignment with managed transceiver resources. A frequency assignment protocol manages transceiver resources in making channel assignment decisions based on a number of links and state of transceivers. Long-term traffic patterns are captured and transceiver resource decisions are made based on an analysis of the captured long-term traffic patterns to increase a selected metric, such as connectivity, capacity or any other measurable quantity.

    摘要翻译: 用于通过管理的收发器资源提供频率分配的系统和方法的实施例。 频率分配协议基于多个链路和收发器的状态来管理收发机资源以进行信道分配决定。 捕获长期流量模式,并且基于对所捕获的长期流量模式的分析来进行收发器资源决策,以增加所选度量,诸如连接性,容量或任何其它可测量的数量。

    REPRESENTATION AND SOLUTIONS FOR SIMULTANEOUS TRANSMISSIONS OVER BROADCAST MEDIUM
    6.
    发明申请
    REPRESENTATION AND SOLUTIONS FOR SIMULTANEOUS TRANSMISSIONS OVER BROADCAST MEDIUM 有权
    广播媒体同时传输的代表和解决方案

    公开(公告)号:US20150223139A1

    公开(公告)日:2015-08-06

    申请号:US14174510

    申请日:2014-02-06

    IPC分类号: H04W40/06 H04W4/06

    摘要: Embodiments of a system and method for finding optimal routes for simultaneous transmissions over broadcast medium are generally described herein. In some embodiments, nodes are placed into a cost matrix representing a connected graph of nodes, virtual nodes are identified by applying matrix operations to the cost matrix and backtracking is performed incrementally to build candidates of virtual nodes for a solution set from the identified virtual nodes and to eliminate unsuitable candidates.

    摘要翻译: 通常在此描述用于通过广播媒体同时发送的最佳路由的系统和方法的实施例。 在一些实施例中,将节点放置在代表节点的连接图的成本矩阵中,通过将矩阵运算应用于成本矩阵来识别虚拟节点,并且逐渐执行回溯以从识别的虚拟节点构建用于解集的虚拟节点的候选 并消除不合适的候选人。

    Representation and solutions for simultaneous transmissions over broadcast medium
    8.
    发明授权
    Representation and solutions for simultaneous transmissions over broadcast medium 有权
    通过广播媒体同时传输的表示和解决方案

    公开(公告)号:US09380512B2

    公开(公告)日:2016-06-28

    申请号:US14174510

    申请日:2014-02-06

    摘要: Embodiments of a system and method for finding optimal routes for simultaneous transmissions over broadcast medium are generally described herein. In some embodiments, nodes are placed into a cost matrix representing a connected graph of nodes, virtual nodes are identified by applying matrix operations to the cost matrix and backtracking is performed incrementally to build candidates of virtual nodes for a solution set from the identified virtual nodes and to eliminate unsuitable candidates.

    摘要翻译: 通常在此描述用于找到通过广播媒体同时传输的最佳路由的系统和方法的实施例。 在一些实施例中,将节点放置在代表节点的连接图的成本矩阵中,通过将矩阵运算应用于成本矩阵来识别虚拟节点,并且逐渐执行回溯以从识别的虚拟节点构建用于解集的虚拟节点的候选 并消除不合适的候选人。

    Packet dissemination in a wireless network performing distributed beamforming
    9.
    发明授权
    Packet dissemination in a wireless network performing distributed beamforming 有权
    在分布式波束成形的无线网络中的分组传播

    公开(公告)号:US09351314B2

    公开(公告)日:2016-05-24

    申请号:US14208032

    申请日:2014-03-13

    IPC分类号: H04J1/16 H04W72/12 H04W16/28

    摘要: Embodiments for providing for dissemination of packets in a network performing distributed beamforming are generally described herein. In some embodiments, distributing packets from nodes in a squad local area network using a first waveform to beamforming nodes, providing scheduling to a long link interface for delivering a stream of packets free of scheduling conflict and distributing a copy of the packets from a long link interface based on the provided scheduling and using a second waveform, the first waveform being different from the second waveform.

    摘要翻译: 这里通常描述用于在执行分布式波束形成的网络中提供分组传播的实施例。 在一些实施例中,使用第一波形向波束成形节点分发来自小区局域网中的节点的分组,向长链路接口提供调度以递送没有调度冲突的分组流,并从长链路分发分组的副本 基于所提供的调度并使用第二波形,所述第一波形与所述第二波形不同。

    System and method for packet transmission along shortest-path to multiple destinations
    10.
    发明授权
    System and method for packet transmission along shortest-path to multiple destinations 有权
    最短路径到多个目的地的分组传输的系统和方法

    公开(公告)号:US09049136B2

    公开(公告)日:2015-06-02

    申请号:US13788092

    申请日:2013-03-07

    IPC分类号: H04L12/801

    CPC分类号: H04L47/15

    摘要: A system, method and apparatus arranged for efficient usage of network resources. Embodiments include nodes linked together, and the links having differing costs, e.g., bandwidth, frequency, and/or monetary cost, or any combination of these. Embodiments may identify neighboring nodes as either next-hop-neighbors or non-next-hop-neighbors. Next-hop-neighbors lie on the shortest path to any node, while non-next-hop-neighbors are nodes linked directly to a node, but the link is more costly than an alternative multi-hop path to the same node. Accordingly, embodiments may suppress packets to the non-next-hop-neighbors.

    摘要翻译: 一种为有效利用网络资源而安排的系统,方法和装置。 实施例包括链接在一起的节点,以及具有不同成本的链路,例如带宽,频率和/或货币成本,或这些的任何组合。 实施例可以将相邻节点标识为下一跳邻居或非下一跳邻居。 下一跳邻居位于到任何节点的最短路径上,而非下一跳邻居是直接链接到节点的节点,但该链路比同一节点的替代多跳路径成本更高。 因此,实施例可以将分组抑制到非下一跳邻居。