利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

88 条记录 (耗时 0.029 秒)

    CALL HANDOFF INITIATION IN HYBRID NETWORKS
    43.
    发明申请
    CALL HANDOFF INITIATION IN HYBRID NETWORKS 有权
    混合网络中的呼叫切换启动

    公开(公告)号：US20170034754A1

    公开(公告)日：2017-02-02

    申请号：US15295174

    申请日：2016-10-17

    申请人： Microsoft Technology Licensing, LLC

    发明人： Gursharan S. Sidhu ,  Thomas Kuehnel ,  Rao Salapaka ,  Vishal Soni ,  Ranveer Chandra ,  Mansoor Jafry ,  Anish Desai ,  Ruchir Astavans ,  Humayun Khan ,  John Mark Miller

    IPC分类号： H04W36/14 ,  H04W36/00 ,  H04W40/26 ,  H04L12/26 ,  H04B17/318

    CPC分类号： H04W36/14 ,  H04B17/318 ,  H04L43/16 ,  H04M7/006 ,  H04M7/122 ,  H04W36/0083 ,  H04W40/26

    摘要： A continual learning process is applied to a class of risk estimate-based algorithms and associated risk thresholds used for deciding when to initiate a handoff between different types of network connections that are available to a mobile device having telephony functionality. The process is implemented as a virtuous loop providing ongoing tuning and adjustment to improve call handoff algorithms and risk thresholds so that handoffs can be performed with the goals of minimizing dropped calls and unacceptable degradation in call quality as well as avoiding premature handoffs. Device characteristics, environmental context, connection measurements, and outcomes of call handoff decisions are crowd-sourced from a population of mobile devices into a cloud-based handoff decision enabling service. The service evaluates potentially usable handoff decision algorithms and risk thresholds against archived crowd-sourced data to determine how they would have performed in real world situations and delivers improved algorithms and risk thresholds to the mobile devices.

    摘要翻译： 连续学习过程被应用于一类基于风险估计的算法和相关联的风险阈值，用于决定什么时候在具有电话功能的移动设备可用的不同类型的网络连接之间进行切换。 该过程被实现为良性循环，其提供持续的调谐和调整以改善呼叫切换算法和风险阈值，使得可以以最小化呼叫质量和拒绝过早切换的不可接受的降级的目标来执行切换。 设备特性，环境背景，连接测量以及呼叫切换决策的结果都是从移动设备群体中大量涌入基于云的切换决策启用服务。 该服务评估潜在可用的切换决策算法和风险阈值，以防止存档的人群来源数据，以确定它们将如何在现实世界中执行，并为移动设备提供改进的算法和风险阈值。

    Electronic device with wireless path selection capability
    44.
    发明授权
    Electronic device with wireless path selection capability 有权
    具有无线路径选择功能的电子设备

    公开(公告)号：US09282501B2

    公开(公告)日：2016-03-08

    申请号：US14724134

    申请日：2015-05-28

    申请人： Hand Held Products, Inc.

    发明人： Ynjiun P. Wang ,  Huyu Qu

    IPC分类号： G06K7/00 ,  H04W40/02 ,  H04W84/18 ,  H04W52/02 ,  G06K7/01 ,  H04W40/26 ,  H04W40/28 ,  H04W40/30 ,  H04W40/22

    CPC分类号： H04W40/12 ,  G06K7/01 ,  H04W4/06 ,  H04W40/02 ,  H04W40/22 ,  H04W40/26 ,  H04W40/28 ,  H04W40/30 ,  H04W52/0216 ,  H04W52/0229 ,  H04W52/0254 ,  H04W52/0296 ,  H04W72/046 ,  H04W76/38 ,  H04W84/18 ,  Y02D70/00 ,  Y02D70/142 ,  Y02D70/166 ,  Y02D70/22 ,  Y02D70/39

    摘要： A portable encoded information reading (EIR) terminal for incorporation in a data collection system can comprise a terminal module communicatively coupled to a wireless interface module via a wired interface. The terminal module can include a central processing unit (CPU), a memory, and an encoded information reading (EIR) device. The wireless interface module can include a microcontroller, a memory, and at least one wireless communication interface. The wireless interface module can establish one or more wireless links with one or more peer EIR terminals, to join a wireless network which is collectively formed by the peer EIR terminals. The wireless interface module can receive or transmit beacons containing at least an identifier of a path selection protocol which is used for unicast, multicast and broadcast frame transmission within the wireless network.

    摘要翻译： 用于并入数据收集系统的便携式编码信息读取（EIR）终端可以包括通过有线接口通信地耦合到无线接口模块的终端模块。 终端模块可以包括中央处理单元（CPU），存储器和编码信息读取（EIR）设备。 无线接口模块可以包括微控制器，存储器和至少一个无线通信接口。 无线接口模块可以与一个或多个对等EIR终端建立一个或多个无线链路，以加入由对等EIR终端共同形成的无线网络。 无线接口模块可以在无线网络内接收或发送至少包含用于单播，组播和广播帧传输的路径选择协议的标识符的信标。

    AD HOC WIRELESS COMMUNICATIONS NETWORK WITH NODE ROLE INFORMATION ROUTING AND ASSOCIATED METHODS
    46.
    发明申请
    AD HOC WIRELESS COMMUNICATIONS NETWORK WITH NODE ROLE INFORMATION ROUTING AND ASSOCIATED METHODS 有权
    广播无线通信网络与节点信息路由和相关方法

    公开(公告)号：US20130034031A1

    公开(公告)日：2013-02-07

    申请号：US13197350

    申请日：2011-08-03

    申请人： Stephen Guy Sherman ,  Justin Roy Dietrich ,  Timothy Raymond Klembczyk ,  Nick Andrew Van Stralen ,  Tony Michael Dal Santo ,  James Andrew McCusker

    发明人： Stephen Guy Sherman ,  Justin Roy Dietrich ,  Timothy Raymond Klembczyk ,  Nick Andrew Van Stralen ,  Tony Michael Dal Santo ,  James Andrew McCusker

    IPC分类号： H04W40/26 ,  H04W84/18

    CPC分类号： H04W40/26 ,  H04L45/04 ,  H04W84/18

    摘要： An ad hoc wireless communications network includes wireless nodes arranged in a backbone net and stub nets coupled to the backbone net via respective wireless nodes defining gateway nodes. A method for the network includes transmitting node role information from each gateway node to respective wireless nodes within each stub net. The node role information includes node reactive routing directions for establishing a route outside of a given stub net. A route request is unicast transmitted from a first wireless node in a respective first stub net to a respective first gateway node based upon the node role information. The route request is a request to communicate to a second wireless node in a respective second stub net. The route request is transmitted from the first gateway node across the backbone net to the second gateway node of the second stub net.

    摘要翻译： 自组织无线通信网络包括布置在骨干网中的无线节点和经由定义网关节点的相应无线节点耦合到骨干网的短线网络。 网络的方法包括将每个网关节点的节点角色信息发送到每个子网内的相应无线节点。 节点角色信息包括用于在给定的存根网之外建立路由的节点反应路由方向。 基于节点角色信息，路由请求被单播从相应的第一存根网络中的第一无线节点发送到相应的第一网关节点。 所述路由请求是在相应的第二短截线网络中与第二无线节点进行通信的请求。 路由请求从第一网关节点通过骨干网发送到第二短网的第二网关节点。

    Hierarchical mobile ad-hoc network and methods for performing reactive routing therein using dynamic source routing (DSR)
    48.
    发明授权
    Hierarchical mobile ad-hoc network and methods for performing reactive routing therein using dynamic source routing (DSR) 有权
    分层移动自组织网络和使用动态源路由（DSR）来执行其中的反应路由的方法

    公开(公告)号：US06870846B2

    公开(公告)日：2005-03-22

    申请号：US10134859

    申请日：2002-04-29

    申请人： Joseph Bibb Cain

    发明人： Joseph Bibb Cain

    IPC分类号： H04L12/28 ,  H04L12/56 ,  H04W40/02 ,  H04W40/24 ,  H04W40/26 ,  H04W40/28 ,  H04W40/32 ,  H04Q7/24

    CPC分类号： H04W40/02 ,  H04L45/04 ,  H04L45/26 ,  H04L45/34 ,  H04L45/46 ,  H04W40/246 ,  H04W40/26 ,  H04W40/28 ,  H04W40/32

    摘要： A method is provided for sending data in a wireless ad-hoc network including a plurality of nodes grouped into clusters of nodes and a plurality of wireless links connecting the plurality of nodes, where each cluster node has a designated cluster leader node. The method may include sending a cluster-level route request from a source node of a source cluster to a cluster leader node of the source cluster, and determining a cluster-level route between the source cluster and a destination cluster including a destination node responsive to the cluster-level route request and using a plurality of the cluster leader nodes. Furthermore, at least one cluster target node may be designated in a cluster along the cluster-level route, and a node-level route determined from the source node to the destination node including the at least one cluster target node. In addition, the method may also include generating a mission data packet for transferring the data.

    摘要翻译： 提供了一种用于在无线自组织网络中发送数据的方法，所述无线自组织网络包括分组为节点簇的多个节点和连接所述多个节点的多个无线链路，其中每个群集节点具有指定的簇首节点。 该方法可以包括：将来自源集群的源节点的集群级路由请求发送到源集群的集群引导节点，以及确定源集群和目的集群之间的集群级路由，其包括响应于 集群级路由请求并使用多个集群引导节点。 此外，可以沿着集群级路由在集群中指定至少一个集群目标节点，以及从源节点确定到包括至少一个集群目标节点的目的地节点的节点级路由。 此外，该方法还可以包括生成用于传送数据的任务数据分组。

    Multi-hop peer-to-peer wireless local loop phone system and method
    49.
    发明申请
    Multi-hop peer-to-peer wireless local loop phone system and method 审中-公开
    多点对等无线本地环路电话系统及方法

    公开(公告)号：US20050036470A1

    公开(公告)日：2005-02-17

    申请号：US10884535

    申请日：2004-07-02

    申请人： Nathan Calvert

    发明人： Nathan Calvert

    IPC分类号： H04L12/28 ,  H04L12/56 ,  H04W40/02 ,  H04W40/22 ,  H04W40/24 ,  H04W40/26 ,  H04W72/04 ,  H04W76/02 ,  H04W84/14 ,  H04W92/18 ,  H04Q7/24

    CPC分类号： H04L45/00 ,  H04W28/26 ,  H04W40/02 ,  H04W40/22 ,  H04W40/246 ,  H04W40/26 ,  H04W72/04 ,  H04W76/14 ,  H04W84/14 ,  H04W92/18 ,  Y02D30/40 ,  Y02D70/142 ,  Y02D70/164 ,  Y02D70/22 ,  Y02D70/23 ,  Y02D70/30 ,  Y02D70/39

    摘要： A peer-to-peer wireless phone system with peer-to-peer units and network configuration algorithms by which a virtual circuit data path is established by minimizing the latency added at each hop starting with the external network gateway or the most loaded hop and choosing closest time slots for each next hop until a the virtual circuit is completed. Also, certain embodiments of the present invention include network configuration algorithms by which traffic around any external network gateway(s) is optimized to maximize throughput around the gateway by allocating certain of many available channels to a group of P2P units around the gateway, these units acting as an “infrastructure” through which other units route virtual circuits through the gateway. The network topology is also configured to let these units transmit at higher power levels and ranges than other P2P units in the network, and thereby help minimize the number of hops needed to reach the external network gateway. Further, other sets of units can be configured with similar larger transmit ranges (around 4 of the standard P2P hop ranges), positioned at such a range on the opposite side of from the gateway to also act as “infrastructure units”, both to pass calls forward to the group of units in the gateway's Point Coordinator group, and to also route circuits that are internal to the network around the Point Coordinator group on the gateway, thereby maximizing efficient use of the gateway capacity. Such rings or layers of infrastructure can be repeated as necessary to minimize hops as the network grows larger, making the tradeoff between minimizing hops (which maximizes transmit power and increases co-channel interference) and minimizing power (which maximizes the number of hops and produces poor latency).

    摘要翻译： 具有点对点单元和网络配置算法的点对点无线电话系统，通过该对等单元和网络配置算法，通过最小化从外部网络网关或最负载跳跃开始的每个跳跃处添加的延迟来选择虚拟电路数据路径，并选择 每个下一跳的最短时隙，直到虚拟电路完成。 此外，本发明的某些实施例还包括网络配置算法，通过该网络配置算法优化了任何外部网络网关周围的流量，以通过将许多可用信道的一些分配给网关周围的一组P2P单元来最大化网关周围的吞吐量，这些单元 充当其他单元通过网关路由虚拟电路的“基础设施”。 网络拓扑还被配置为使这些单元以比网络中的其他P2P单元更高的功率级别和范围发送，从而有助于最小化到达外部网络网关所需的跳数。 此外，其他单元组可以被配置为具有类似的更大的发射范围（大约4个标准P2P跳频范围），位于与网关相反的一个范围上，也用作“基础设施单元”，两者都通过 呼叫网关的点协调器组中的单元组，并且还将网络周围的点协调器组周围的网络路由路由，从而最大限度地提高网关容量的有效使用。 可以根据需要重复这样的环或层的基础设施，以使网络越来越大来最小化跳数，从而使最小化跳数（使发射功率最大化并增加同信道干扰）和最小化功率（使跳数达到最大化） 差的延迟）。

    Routing protocol for ad hoc networks
    50.
    发明申请
    Routing protocol for ad hoc networks 有权
    自组织网络的路由协议

    公开(公告)号：US20050030921A1

    公开(公告)日：2005-02-10

    申请号：US10897631

    申请日：2004-07-23

    申请人： Po-Wah Yau

    发明人： Po-Wah Yau

    IPC分类号： H04J3/24 ,  H04L1/18 ,  H04L12/28 ,  H04L12/701 ,  H04L12/721 ,  H04W28/04 ,  H04W40/00 ,  H04W40/10 ,  H04W40/24 ,  H04W40/26 ,  H04W84/18 ,  H04Q7/00

    CPC分类号： H04W40/00 ,  H04L45/00 ,  H04L45/26 ,  H04W40/10 ,  H04W40/246 ,  H04W40/26 ,  H04W84/18

    摘要： A routing method for an ad hoc network is disclosed, the network comprising two or more nodes (A, B, C, D, E, F), and the method comprising: sending a message from a start node (A) to a finish node (F) via one or more intermediate nodes (B, C, D, E); each of the start node (A) and intermediate nodes (B, C, D, E) receiving an acknowledgement signal (AckB, AckC, AckD, AckE, AckF) from a one-hop neighbouring node when the one-hop neighbouring node receives the message from the start node (A;F) or intermediate nodes (B, C, D, E) and, in the case of the one-hop neighbouring node not being the finish node (F), the start node and intermediate nodes receiving an acknowledgement signal (AckC, AckD, AckE, AckF) from a two-hop neighbouring node when the two-hop neighbouring node receives the message from the one-hop neighbouring node.

    摘要翻译： 公开了一种用于自组织网络的路由方法，所述网络包括两个或多个节点（A，B，C，D，E，F），并且所述方法包括：将消息从起始节点（A）发送到完成 节点（F）经由一个或多个中间节点（B，C，D，E）; 起始节点（A）和中间节点（B，C，D，E）中的每一个从一跳相邻节点接收确认信号（AckB，AckC，AckD，AckE，AckF） 来自起始节点（A; F）或中间节点（B，C，D，E）的消息，并且在一跳相邻节点不是完成节点（F）的情况下，起始节点和中间节点 当两跳相邻节点从一跳相邻节点接收到消息时，从两跳相邻节点接收确认信号（AckC，AckD，AckE，AckF）。