公开(公告)号：US07995501B2

公开(公告)日：2011-08-09

申请号：US12014802

申请日：2008-01-16

申请人： Jorjeta Gueorguieva Jetcheva ,  Sachin Kanodia ,  Murali Sundaramoorthy Repakula ,  Mohan Natarajan

发明人： Jorjeta Gueorguieva Jetcheva ,  Sachin Kanodia ,  Murali Sundaramoorthy Repakula ,  Mohan Natarajan

IPC分类号： H04W28/08 ,  H04W28/12 ,  H04W40/28 ,  H04L12/56 ,  H04J3/14

CPC分类号： H04W40/38 ,  H04L45/122 ,  H04L45/22 ,  H04L45/26 ,  H04L45/36 ,  H04L49/1584 ,  H04W24/02 ,  H04W40/02 ,  H04W40/023 ,  H04W40/28 ,  H04W40/34 ,  H04W84/18

摘要： Various embodiments implement a set of low overhead mechanisms to enable on-demand routing protocols. The on-demand protocols use route accumulation during discovery floods to discover when better paths have become available even if the paths that the protocols are currently using are not broken. In other words, the mechanisms (or “Route Optimizations”) enable improvements to routes even while functioning routes are available. The Route Optimization mechanisms enable nodes in the network that passively learn routing information to notify nodes that need to know of changes in the routing information when the changes are important. Learning routing information on up-to-date paths and determining nodes that would benefit from the information is performed, in some embodiments, without any explicit control packet exchange. One of the Route Optimization mechanisms includes communicating information describing an improved route from a node where the improved route diverges from a less nearly optimal route.

摘要翻译： 各种实施例实现一组低开销机制以实现按需路由协议。 按需协议在发现洪水期间使用路由累积，以便在更好的路径变得可用时发现，即使协议当前使用的路径没有被破坏。 换句话说，机制（或“路由优化”）可以改善路由，即使有功能的路由可用。 路由优化机制使得网络中的节点被动地学习路由信息，以便在更改重要时通知需要知道路由信息中的更改的节点。 在一些实施例中，在没有任何明确的控制分组交换的情况下，执行在最新路径上学习路由信息并确定将从该信息中受益的节点。 路由优化机制之一包括传达描述改进路由的改进路由的信息，其中改进路由从较不接近最优路由发散。

公开(公告)号：US07969942B2

公开(公告)日：2011-06-28

申请号：US12404170

申请日：2009-03-13

申请人： Sachin Kanodia ,  Mohan Natarajan ,  Jorjeta Gueorguieva Jetcheva

发明人： Sachin Kanodia ,  Mohan Natarajan ,  Jorjeta Gueorguieva Jetcheva

IPC分类号： H04W4/00

CPC分类号： H04W28/085 ,  H04L45/245 ,  H04L45/26 ,  H04L47/10 ,  H04L47/125 ,  H04L47/14 ,  H04W28/08 ,  H04W40/02 ,  H04W84/18

摘要： In a mesh network composed of multiple-radio nodes, we assign each radio to one of a plurality of channels, and treat a plurality of links between a pair of nodes as one logical link (bonded link). In some embodiments, the routing protocol is adapted to view each bonded link as one link having a combination of at least some of the properties of the constituent physical links. Traffic sent along a path is dynamically load balanced between the interfaces at each intermediate node based on the current utilization of each interface. In at least some embodiments, route discovery packets record the metrics of each component link of the bonded links leaving a node, but only one route discovery packet per pair of nodes is forwarded, reducing the route discovery packet traffic compared to if each route discovery packet were forwarded over each component link between the pair of nodes.

摘要翻译： 在由多个无线电节点组成的网状网络中，我们将每个无线电分配给多个信道中的一个，并且将一对节点之间的多个链路视为一个逻辑链路（绑定链路）。 在一些实施例中，路由协议适于将每个绑定链路视为具有组成物理链路的至少一些属性的组合的一个链路。 根据每个接口的当前利用率，沿着路径发送的流量在每个中间节点的接口之间动态负载平衡。 在至少一些实施例中，路由发现分组记录离开节点的绑定链路的每个分量链路的度量，但是每对节点仅转发一个路由发现分组，与每个路由发现分组相比减少了路由发现分组流量 被转发通过该对节点之间的每个组件链路。

公开(公告)号：US08824380B2

公开(公告)日：2014-09-02

申请号：US12404166

申请日：2009-03-13

申请人： Jorjeta Gueorguieva Jetcheva ,  Sivakumar Kailas ,  Sachin Kanodia ,  Mohan Natarajan

发明人： Jorjeta Gueorguieva Jetcheva ,  Sivakumar Kailas ,  Sachin Kanodia ,  Mohan Natarajan

IPC分类号： H04W72/04

CPC分类号： H04W72/0453 ,  H04W28/085 ,  H04W72/0486 ,  H04W72/082 ,  H04W72/085 ,  H04W84/18

摘要： Techniques are described for automatically determining quasi-static per-link channel assignments for each radio in multiple-hop mesh networks having nodes with two or more radios and where only a small number of channels is available for use in the network. The method optimally assigns the channels to the radios of all of the nodes in the network so as to achieve the lowest interference among links and the highest possible bandwidth.

摘要翻译： 描述了用于自动确定具有具有两个或多个无线电的节点的多跳网状网络中的每个无线电的准静态每链路信道分配的技术，并且其中只有少量信道可用于网络中。 该方法将信道最佳地分配给网络中所有节点的无线电，以实现链路之间的最低干扰和最高可能的带宽。

公开(公告)号：US08737268B2

公开(公告)日：2014-05-27

申请号：US13204902

申请日：2011-08-08

申请人： Jorjeta Gueorguieva Jetcheva ,  Sachin Kanodia ,  Murali Sundaramoorthy Repakula ,  Mohan Natarajan

发明人： Jorjeta Gueorguieva Jetcheva ,  Sachin Kanodia ,  Murali Sundaramoorthy Repakula ,  Mohan Natarajan

IPC分类号： H04W28/08 ,  H04W28/12 ,  H04W40/34 ,  H04L12/56 ,  H04W40/28

CPC分类号： H04W40/38 ,  H04L45/122 ,  H04L45/22 ,  H04L45/26 ,  H04L45/36 ,  H04L49/1584 ,  H04W24/02 ,  H04W40/02 ,  H04W40/023 ,  H04W40/28 ,  H04W40/34 ,  H04W84/18

摘要： Various embodiments implement a set of low overhead mechanisms to enable on-demand routing protocols. The on-demand protocols use route accumulation during discovery floods to discover when better paths have become available even if the paths that the protocols are currently using are not broken. In other words, the mechanisms (or “Route Optimizations”) enable improvements to routes even while functioning routes are available. The Route Optimization mechanisms enable nodes in the network that passively learn routing information to notify nodes that need to know of changes in the routing information when the changes are important. Learning routing information on up-to-date paths and determining nodes that would benefit from the information is performed, in some embodiments, without any explicit control packet exchange. One of the Route Optimization mechanisms includes communicating information describing an improved route from a node where the improved route diverges from a less nearly optimal route.

摘要翻译： 各种实施例实现一组低开销机制以实现按需路由协议。 按需协议在发现洪水期间使用路由累积，以便在更好的路径变得可用时发现，即使协议当前使用的路径没有被破坏。 换句话说，机制（或“路由优化”）可以改善路由，即使有功能的路由可用。 路由优化机制使得网络中的节点被动地学习路由信息，以便在更改重要时通知需要知道路由信息中的更改的节点。 在一些实施例中，在没有任何明确的控制分组交换的情况下，执行在最新路径上学习路由信息并确定将从该信息中受益的节点。 路由优化机制之一包括传达描述改进路由的改进路由的信息，其中改进路由从较不接近最优路由发散。

公开(公告)号：US08724468B2

公开(公告)日：2014-05-13

申请号：US13168988

申请日：2011-06-26

申请人： Sachin Kanodia ,  Mohan Natarajan ,  Jorjeta Gueorguieva Jetcheva

发明人： Sachin Kanodia ,  Mohan Natarajan ,  Jorjeta Gueorguieva Jetcheva

IPC分类号： G08C15/00

CPC分类号： H04W28/085 ,  H04L45/245 ,  H04L45/26 ,  H04L47/10 ,  H04L47/125 ,  H04L47/14 ,  H04W28/08 ,  H04W40/02 ,  H04W84/18

摘要： In a mesh network composed of multiple-radio nodes, we assign each radio to one of a plurality of channels, and treat a plurality of links between a pair of nodes as one logical link (bonded link). In some embodiments, the routing protocol is adapted to view each bonded link as one link having a combination of at least some of the properties of the constituent physical links. Traffic sent along a path is dynamically load balanced between the interfaces at each intermediate node based on the current utilization of each interface. In at least some embodiments, route discovery packets record the metrics of each component link of the bonded links leaving a node, but only one route discovery packet per pair of nodes is forwarded, reducing the route discovery packet traffic compared to if each route discovery packet were forwarded over each component link between the pair of nodes.

摘要翻译： 在由多个无线电节点组成的网状网络中，我们将每个无线电分配给多个信道中的一个，并且将一对节点之间的多个链路视为一个逻辑链路（绑定链路）。 在一些实施例中，路由协议适于将每个绑定链路视为具有组成物理链路的至少一些属性的组合的一个链路。 根据每个接口的当前利用率，沿着路径发送的流量在每个中间节点的接口之间动态负载平衡。 在至少一些实施例中，路由发现分组记录离开节点的绑定链路的每个分量链路的度量，但是每对节点仅转发一个路由发现分组，与每个路由发现分组相比减少了路由发现分组流量 被转发通过该对节点之间的每个组件链路。

公开(公告)号：US08155008B2

公开(公告)日：2012-04-10

申请号：US12014811

申请日：2008-01-16

申请人： Jorjeta Gueorguieva Jetcheva ,  Sivakumar Kailas ,  Mohan Natarajan

发明人： Jorjeta Gueorguieva Jetcheva ,  Sivakumar Kailas ,  Mohan Natarajan

IPC分类号： H04J1/16

CPC分类号： H04L45/74 ,  H04L45/04 ,  H04L45/122 ,  H04L45/124 ,  H04L45/26 ,  H04L45/32 ,  H04W40/246 ,  H04W84/18

摘要： Wireless mesh networks (or “meshes”) are enabled for arbitrary interconnection to each other and may provide varying levels of coverage and redundancy as desired. Interoperability between meshes having differing configurations, internal operations, or both, may be freely intermixed and inter-operated in unrestricted combination. Enhanced explicit inter-bridge control protocols operate using pre-existing control packets. Pre-existing broadcast packet floods are used to learn the best paths across interconnected meshes (termed a “multi-mesh”). Enhanced routing protocols operating within each mesh may optionally examine information limited to the respective mesh when forwarding traffic, thus enabling robust multi-mesh scaling with respect to memory and processing time required by the routing protocols. Communication scalability is improved by enabling frequency diversity across the multi-mesh by configuring meshes within interference range of each other for operation at a plurality of frequencies. Each mesh may operate at a respective non-interfering frequency.

摘要翻译： 使无线网状网络（或“网格”）能够彼此进行任意互连，并且可以根据需要提供不同级别的覆盖和冗余。 具有不同配置，内部操作或两者的网格之间的互操作性可以以无限制的组合自由地混合和互操作。 增强型显式桥间控制协议使用预先存在的控制数据包进行操作。 使用预先存在的广播数据包洪泛来学习跨互连网格（称为“多网格”）的最佳路径。 在每个网格内运行的增强的路由协议可以可选地检查在转发流量时限制到相应网格的信息，从而实现关于存储器的鲁棒多网格缩放和路由协议所需的处理时间。 通过在多个频率下进行操作，通过在彼此的干扰范围内配置网格来实现跨多网格的频率分集来提高通信可伸缩性。 每个网格可以在相应的非干扰频率下操作。

公开(公告)号：US08948015B2

公开(公告)日：2015-02-03

申请号：US13441726

申请日：2012-04-06

申请人： Jorjeta Gueorguieva Jetcheva ,  Sivakumar Kailas ,  Mohan Natarajan

发明人： Jorjeta Gueorguieva Jetcheva ,  Sivakumar Kailas ,  Mohan Natarajan

IPC分类号： H04J1/16 ,  H04W40/24 ,  H04L12/715 ,  H04L12/733 ,  H04L12/721

CPC分类号： H04L45/74 ,  H04L45/04 ,  H04L45/122 ,  H04L45/124 ,  H04L45/26 ,  H04L45/32 ,  H04W40/246 ,  H04W84/18

摘要： Wireless mesh networks (or “meshes”) are enabled for arbitrary interconnection to each other and may provide varying levels of coverage and redundancy as desired. Interoperability between meshes having differing configurations, internal operations, or both, may be freely intermixed and inter-operated in unrestricted combination. Enhanced explicit inter-bridge control protocols operate using pre-existing control packets. Pre-existing broadcast packet floods are used to learn the best paths across interconnected meshes (termed a “multi-mesh”). Enhanced routing protocols operating within each mesh may optionally examine information limited to the respective mesh when forwarding traffic, thus enabling robust multi-mesh scaling with respect to memory and processing time required by the routing protocols. Communication scalability is improved by enabling frequency diversity across the multi-mesh by configuring meshes within interference range of each other for operation at a plurality of frequencies. Each mesh may operate at a respective non-interfering frequency.

摘要翻译： 使无线网状网络（或“网格”）能够彼此进行任意互连，并且可以根据需要提供不同级别的覆盖和冗余。 具有不同配置，内部操作或两者的网格之间的互操作性可以以无限制的组合自由地混合和互操作。 增强型显式桥间控制协议使用预先存在的控制数据包进行操作。 使用预先存在的广播数据包洪泛来学习跨互连网格（称为“多网格”）的最佳路径。 在每个网格内运行的增强的路由协议可以可选地检查在转发流量时限制到相应网格的信息，从而实现关于存储器的鲁棒多网格缩放和路由协议所需的处理时间。 通过在多个频率下进行操作，通过在彼此的干扰范围内配置网格来实现跨多网格的频率分集来提高通信可伸缩性。 每个网格可以在相应的非干扰频率下操作。

公开(公告)号：US20090175169A1

公开(公告)日：2009-07-09

申请号：US12404170

申请日：2009-03-13

申请人： Sachin Kanodia ,  Mohan Natarajan ,  Jorjeta Jetcheva

发明人： Sachin Kanodia ,  Mohan Natarajan ,  Jorjeta Jetcheva

IPC分类号： H04L12/56

CPC分类号： H04W28/085 ,  H04L45/245 ,  H04L45/26 ,  H04L47/10 ,  H04L47/125 ,  H04L47/14 ,  H04W28/08 ,  H04W40/02 ,  H04W84/18

摘要： In a mesh network composed of multiple-radio nodes, we assign each radio to one of a plurality of channels, and treat a plurality of links between a pair of nodes as one logical link (bonded link). In some embodiments, the routing protocol is adapted to view each bonded link as one link having a combination of at least some of the properties of the constituent physical links. Traffic sent along a path is dynamically load balanced between the interfaces at each intermediate node based on the current utilization of each interface. In at least some embodiments, route discovery packets record the metrics of each component link of the bonded links leaving a node, but only one route discovery packet per pair of nodes is forwarded, reducing the route discovery packet traffic compared to if each route discovery packet were forwarded over each component link between the pair of nodes.

摘要翻译： 在由多个无线电节点组成的网状网络中，我们将每个无线电分配给多个信道中的一个，并且将一对节点之间的多个链路视为一个逻辑链路（绑定链路）。 在一些实施例中，路由协议适于将每个绑定链路视为具有组成物理链路的至少一些属性的组合的一个链路。 根据每个接口的当前利用率，沿着路径发送的流量在每个中间节点的接口之间动态负载平衡。 在至少一些实施例中，路由发现分组记录离开节点的绑定链路的每个分量链路的度量，但是每对节点仅转发一个路由发现分组，与每个路由发现分组相比减少了路由发现分组流量 被转发通过该对节点之间的每个组件链路。

公开(公告)号：US08634293B2

公开(公告)日：2014-01-21

申请号：US12812458

申请日：2009-01-13

申请人： Sachin Kanodia ,  Kota Rathnamaiah Sharath Kumar ,  Mohan Natarajan ,  Pramod Jathavedan Akkarachittor

发明人： Sachin Kanodia ,  Kota Rathnamaiah Sharath Kumar ,  Mohan Natarajan ,  Pramod Jathavedan Akkarachittor

IPC分类号： G01R31/08

CPC分类号： H04L5/0039 ,  H04L47/14 ,  H04L47/20 ,  H04L47/2408 ,  H04L47/26 ,  H04W28/12 ,  H04W28/24

摘要： Differentiated services are provided through service level agreements (SLAs) between access nodes and some of the clients using a wireless access network. Client devices include internal devices that are compliant with service-related specifications published by the access nodes. Client devices also may include non-compliant external and legacy devices, as well as outside interferers. The access nodes control target SLAs for each client device. The access nodes and the internal client devices perform rate limiting to ensure that a device's target SLA is adhered to. The service-related specifications include schedules to ensure preferential access for preferred internal client devices. The internal client devices send usage and bandwidth availability feedback to the access node they are associated with, enabling the access node to come up with better schedules for meeting the preferred internal devices' SLAs in view of the network conditions reported via the feedback.

摘要翻译： 通过接入节点与使用无线接入网络的某些客户端之间的业务级别协议（SLA）提供差分服务。 客户端设备包括符合访问节点发布的服务相关规范的内部设备。 客户端设备还可以包括不兼容的外部和传统设备以及外部干扰源。 接入节点控制每个客户端设备的目标SLA。 接入节点和内部客户端设备执行速率限制，以确保遵守设备的目标SLA。 服务相关规范包括计划，以确保首选内部客户端设备的优先访问。 内部客户端设备向与其相关联的接入节点发送使用和带宽可用性反馈，使得接入节点能够根据通过反馈报告的网络状况，找到更好的时间表以满足优选的内部设备的SLA。

公开(公告)号：US20120176931A1

公开(公告)日：2012-07-12

申请号：US13204902

申请日：2011-08-08

申请人： Jorjeta Jetcheva ,  Sachin Kanodia ,  Murali Sundaramoorthy Repakula ,  Mohan Natarajan

发明人： Jorjeta Jetcheva ,  Sachin Kanodia ,  Murali Sundaramoorthy Repakula ,  Mohan Natarajan

IPC分类号： H04L12/28

CPC分类号： H04W40/38 ,  H04L45/122 ,  H04L45/22 ,  H04L45/26 ,  H04L45/36 ,  H04L49/1584 ,  H04W24/02 ,  H04W40/02 ,  H04W40/023 ,  H04W40/28 ,  H04W40/34 ,  H04W84/18

摘要： Various embodiments implement a set of low overhead mechanisms to enable on-demand routing protocols. The on-demand protocols use route accumulation during discovery floods to discover when better paths have become available even if the paths that the protocols are currently using are not broken. In other words, the mechanisms (or “Route Optimizations”) enable improvements to routes even while functioning routes are available. The Route Optimization mechanisms enable nodes in the network that passively learn routing information to notify nodes that need to know of changes in the routing information when the changes are important. Learning routing information on up-to-date paths and determining nodes that would benefit from the information is performed, in some embodiments, without any explicit control packet exchange. One of the Route Optimization mechanisms includes communicating information describing an improved route from a node where the improved route diverges from a less nearly optimal route.

摘要翻译： 各种实施例实现一组低开销机制以实现按需路由协议。 按需协议在发现洪水期间使用路由累积，以便在更好的路径变得可用时发现，即使协议当前使用的路径没有被破坏。 换句话说，机制（或“路由优化”）可以改善路由，即使有功能的路由可用。 路由优化机制使得网络中的节点被动地学习路由信息，以便在更改重要时通知需要知道路由信息中的更改的节点。 在一些实施例中，在没有任何明确的控制分组交换的情况下，执行在最新路径上学习路由信息并确定将从该信息中受益的节点。 路由优化机制之一包括传达描述改进路由的改进路由的信息，其中改进路由从较不接近最优路由发散。