COMPUTING DISJOINT PATHS FOR REACTIVE ROUTING MESH NETWORKS
    1.
    发明申请
    COMPUTING DISJOINT PATHS FOR REACTIVE ROUTING MESH NETWORKS 审中-公开
    用于反应性路由网络的计算机DISP

    公开(公告)号:US20140068105A1

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

    申请号:US14071585

    申请日:2013-11-04

    CPC classification number: H04L47/125 H04L45/128 H04L45/22 H04L45/64 H04W40/28

    Abstract: In one embodiment, a reactive routing computer network may be partitioned into diverse logical topologies, and a source node may transmit route request (RREQ) messages toward a destination node on each logical topology. In response, the source node may receive route reply (RREP) messages indicating routes to the destination node in each logical topology. The source node may thus select a route for each logical topology to reach the destination node, accordingly. In another embodiment, if partitioned logical topologies do not produce two or more routes or as a standalone embodiment, the source node may transmit RREQ messages toward the destination node without any corresponding logical topology. The destination node receives RREQ messages, and two or more routes from the source node to the destination node may be determined (e.g., by the destination or source node) based on the received RREQ messages at the destination node and path selection criteria.

    Abstract translation: 在一个实施例中,可以将反应性路由计算机网络划分为不同的逻辑拓扑,并且源节点可以向每个逻辑拓扑上的目的地节点发送路由请求(RREQ)消息。 作为响应,源节点可以在每个逻辑拓扑中接收指示到目的地节点的路由的路由回复(RREP)消息。 因此,源节点可以相应地为每个逻辑拓扑选择到达目的地节点的路由。 在另一个实施例中,如果分区逻辑拓扑不产生两个或更多个路由或者作为独立实施例,则源节点可以向目的地节点发送RREQ消息而没有任何对应的逻辑拓扑。 目的地节点接收RREQ消息,并且可以基于目的地节点处的接收到的RREQ消息和路径选择标准来确定(例如,目的地或源节点)从源节点到目的地节点的两条或更多路由。

    Computing disjoint paths for reactive routing mesh networks

    公开(公告)号:US09608912B2

    公开(公告)日:2017-03-28

    申请号:US14071585

    申请日:2013-11-04

    CPC classification number: H04L47/125 H04L45/128 H04L45/22 H04L45/64 H04W40/28

    Abstract: In one embodiment, a reactive routing computer network may be partitioned into diverse logical topologies, and a source node may transmit route request (RREQ) messages toward a destination node on each logical topology. In response, the source node may receive route reply (RREP) messages indicating routes to the destination node in each logical topology. The source node may thus select a route for each logical topology to reach the destination node, accordingly. In another embodiment, if partitioned logical topologies do not produce two or more routes or as a standalone embodiment, the source node may transmit RREQ messages toward the destination node without any corresponding logical topology. The destination node receives RREQ messages, and two or more routes from the source node to the destination node may be determined (e.g., by the destination or source node) based on the received RREQ messages at the destination node and path selection criteria.

    Prioritized queueing in a mesh network based on age of payload data
    3.
    发明授权
    Prioritized queueing in a mesh network based on age of payload data 有权
    基于有效载荷数据的年龄,网格网络中的优先排队

    公开(公告)号:US09019824B2

    公开(公告)日:2015-04-28

    申请号:US13768375

    申请日:2013-02-15

    CPC classification number: H04W72/1242 H04W72/1221 H04W84/18

    Abstract: In one embodiment, a method comprises identifying an age of payload data in a data packet by a wireless network node configured for transmitting the data packet to a multi-hop destination via a wireless mesh network; determining by the wireless network node a schedule for the data packet reaching the multi-hop destination; and the wireless network node prioritizing queuing of the data packet for Collision Sense with Multiple Access and Collision Avoidance (CSMA-CA) based wireless transmission in the wireless mesh network based on the corresponding age, relative to the schedule and respective ages of other data packets awaiting transmission by the wireless network node to the destination, where a higher-aged data packet relative to the schedule is granted a higher priority than a lower-aged data packet relative to the schedule.

    Abstract translation: 在一个实施例中,一种方法包括:被配置用于经由无线网状网络将数据分组发送到多跳目的地的无线网络节点识别数据分组中的有效载荷数据的年龄; 由所述无线网络节点确定所述数据分组到达所述多跳目的地的调度; 并且所述无线网络节点基于相对于所述时间表和其他数据分组的相应年龄的相应年龄,优先排序所述无线网状网络中的基于多路访问和冲突避免(CSMA-CA)的冲突感测数据分组排队 等待由无线网络节点传送到目的地,其中相对于时间表的较高年龄的数据分组被授予比相对于时间表的低龄数据分组更高的优先级。

Patent Agency Ranking