DATA FLOW ROUTING IN A MULTI-HOP WIRELESS NETWORK
    41.
    发明申请
    DATA FLOW ROUTING IN A MULTI-HOP WIRELESS NETWORK 有权
    数据流在几个无线网络中的路由

    公开(公告)号:US20100278102A1

    公开(公告)日:2010-11-04

    申请号:US12433718

    申请日:2009-04-30

    IPC分类号: H04W40/02

    摘要: A data flow from a source to a destination is routed in a multi-hop wireless network. Nodes are searched in the multi-hop wireless network for information of route metrics for the nodes, the information of the route metrics are received, a route that has a most optimal route metric for the data flow are determined based on the route metrics and a data flow metric of the data flow, and the data flow are received from the source via the route at the destination in the multi-hop wireless network.

    摘要翻译: 从源到目的地的数据流在多跳无线网络中路由。 在多跳无线网络中搜索节点的路由度量的信息,接收路由度量的信息,基于路由度量确定具有数据流最佳路由度量的路由,并且 通过多跳无线网络中的目的地的路由从源接收数据流的数据流量度量和数据流。

    Selecting nodes close to another node in a network using location information for the nodes
    42.
    发明授权
    Selecting nodes close to another node in a network using location information for the nodes 有权
    使用节点的位置信息选择靠近网络中另一个节点的节点

    公开(公告)号:US07827279B2

    公开(公告)日:2010-11-02

    申请号:US10767285

    申请日:2004-01-30

    IPC分类号: G06F15/173

    摘要: A network includes a plurality of nodes. A set of candidate nodes from the plurality of nodes is selected based on location information for the candidate nodes and a first node also in the network. A clustering algorithm is applied to the location information for the candidate nodes and the first node, and a subset of the set of candidate nodes closest to the first node is identified based on the results of applying the clustering algorithm.

    摘要翻译: 网络包括多个节点。 基于候选节点的位置信息和网络中的第一节点来选择来自多个节点的一组候选节点。 聚类算法应用于候选节点和第一节点的位置信息,并且基于应用聚类算法的结果来识别最接近第一节点的候选节点集合的子集。

    Distributed network distance detemination using a distributed hash table overlay network
    44.
    发明申请
    Distributed network distance detemination using a distributed hash table overlay network 有权
    使用分布式哈希表覆盖网络分布式网络距离

    公开(公告)号:US20080181135A1

    公开(公告)日:2008-07-31

    申请号:US11700579

    申请日:2007-01-31

    IPC分类号: G08C15/00 H04L12/28

    摘要: Distances are determined between an identified node and landmark nodes and milestone nodes in a network. The closest milestone or landmark node associated with a shortest of the measured distances is determined. A corresponding distributed hash table (DHT) overlay node is queried for distances between observed nearest nodes for the closest milestone or landmark node and the identified node. Distances between the identified node and the observed nearest nodes are calculated from distances received from the DHT overlay node and the measured distance to the closest milestone or landmark node. K-closest nodes from the identified node are selected from at least one of the closest milestone or landmark node and one or more of the observed nearest nodes based on the calculated distances.

    摘要翻译: 在一个网络中确定的节点和地标节点和里程碑节点之间确定距离。 确定与最短测量距离相关联的最近的里程碑或地标节点。 查询对应的分布式哈希表(DHT)覆盖节点,用于最近的里程碑或地标节点和已识别节点的观察最近节点之间的距离。 从从DHT覆盖节点接收的距离和到最近里程碑或地标节点的测量距离计算识别的节点和观察到的最近节点之间的距离。 基于计算出的距离,从最近的里程碑或地标节点中的至少一个和观察到的最近的节点中的至少一个中选出来自所识别的节点的K个最近的节点。

    Multi-hop network having reduced power consumption
    47.
    发明授权
    Multi-hop network having reduced power consumption 有权
    具有降低功耗的多跳网络

    公开(公告)号:US09185629B2

    公开(公告)日:2015-11-10

    申请号:US12579604

    申请日:2009-10-15

    摘要: The present disclosure is directed to networks having reduced power consumption characteristics and associated methods. In one aspect, a method for reducing power consumption in a multi-hop network can include receiving data at a plurality of primary nodes in a multi-hop network and transmitting the data from the plurality of primary nodes to a plurality of secondary nodes. Individual primary nodes have nearest neighbors at a defined distance and the secondary nodes are spaced at a distance that is greater than the defined distance away from individual primary nodes. Data is transmitted from a given primary node to a secondary node by skipping at least one intervening node and reducing power consumption of the wireless network.

    摘要翻译: 本公开涉及具有降低的功耗特性和相关方法的网络。 一方面,一种用于降低多跳网络中的功耗的方法可以包括在多跳网络中的多个主节点处接收数据,并将数据从多个主节点发送到多个次节点。 单个主节点在确定的距离处具有最近的邻居,并且辅助节点间隔大于远离各个主节点的限定距离的距离。 通过跳过至少一个中间节点并降低无线网络的功耗,将数据从给定主节点传送到次节点。

    Transmission in a network with active and sleeping clients
    48.
    发明授权
    Transmission in a network with active and sleeping clients 有权
    在主动和睡眠客户端的网络中传输

    公开(公告)号:US08879458B2

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

    申请号:US13453664

    申请日:2012-04-23

    摘要: Methods, devices, and machine readable media are provided for transmission in a network with active and sleeping clients. Some examples can include transmitting a first multicast stream of data in response to an active wireless client being associated with the wireless network device at a particular time. The method can include transmitting a second multicast stream of the data after the first multicast stream in response to a sleeping wireless client being associated with the wireless network device at the particular time and in response to a delivery traffic indication message count expiring. The first and/or second multicast streams of the data can be retransmitted a number of times (e.g., at different data rates). An active/sleep status can be maintained for the wireless clients. A unicast stream can be transmitted when the number of clients does not exceed a threshold.

    摘要翻译: 提供方法,设备和机器可读介质用于在具有主动和睡眠客户端的网络中进行传输。 一些示例可以包括响应于在特定时间与无线网络设备相关联的活动无线客户端来发送数据的第一多播流。 所述方法可以包括在所述特定时间响应于与所述无线网络设备相关联的睡眠无线客户端以及响应于传送通信量指示消息计数到期而在所述第一多播流之后发送所述数据的第二多播流。 可以多次重复数据的第一和/或第二多播流(例如,以不同的数据速率)。 可以为无线客户端维护活动/睡眠状态。 当客户端的数量不超过阈值时,可以传输单播流。

    Dynamic balancing priority queue assignments for quality-of-service network flows
    49.
    发明授权
    Dynamic balancing priority queue assignments for quality-of-service network flows 有权
    用于服务质量网络流的动态平衡优先级队列分配

    公开(公告)号:US08670310B2

    公开(公告)日:2014-03-11

    申请号:US12974767

    申请日:2010-12-21

    IPC分类号: G01R31/08

    摘要: A priority queue assignment technique for quality-of-service (“QoS”) network flows in a network is provided. A network path is determined for an incoming flow including a plurality of network switches associated, with a plurality of priority queue levels. A priority queue level is determined for the incoming flow for at least one of the plurality of network switches in the network path based on priority queue levels of existing flows. The priority queue level of the incoming flow is adjusted, to dynamically balance flows over the plurality of priority queue levels for at least one of the plurality of network switches in the network path based on quality-of-service (“QoS”) requirements associated with the incoming flow.

    摘要翻译: 提供了一种用于网络中的服务质量(“QoS”)网络流的优先级队列分配技术。 为包括与多个优先级队列等级相关联的多个网络交换机的进入流确定网络路径。 基于现有流的优先级队列级别,确定网络路径中的多个网络交换机中的至少一个的入站流的优先级队列级别。 调整输入流的优先级队列级别,以基于与服务质量(“QoS”)相关联的要求动态平衡网络路径中的多个网络交换机中的至少一个的多个优先级队列级别上的流 与流入流。