-
公开(公告)号：US20120176931A1
公开(公告)日：2012-07-12
申请号：US13204902
申请日：2011-08-08
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.
摘要翻译： 各种实施例实现一组低开销机制以实现按需路由协议。 按需协议在发现洪水期间使用路由累积，以便在更好的路径变得可用时发现，即使协议当前使用的路径没有被破坏。 换句话说，机制（或“路由优化”）可以改善路由，即使有功能的路由可用。 路由优化机制使得网络中的节点被动地学习路由信息，以便在更改重要时通知需要知道路由信息中的更改的节点。 在一些实施例中，在没有任何明确的控制分组交换的情况下，执行在最新路径上学习路由信息并确定将从该信息中受益的节点。 路由优化机制之一包括传达描述改进路由的改进路由的信息，其中改进路由从较不接近最优路由发散。
-
公开(公告)号：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
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.
摘要翻译： 各种实施例实现一组低开销机制以实现按需路由协议。 按需协议在发现洪水期间使用路由累积，以便在更好的路径变得可用时发现，即使协议当前使用的路径没有被破坏。 换句话说，机制（或“路由优化”）可以改善路由，即使有功能的路由可用。 路由优化机制使得网络中的节点被动地学习路由信息，以便在更改重要时通知需要知道路由信息中的更改的节点。 在一些实施例中，在没有任何明确的控制分组交换的情况下，执行在最新路径上学习路由信息并确定将从该信息中受益的节点。 路由优化机制之一包括传达描述改进路由的改进路由的信息，其中改进路由从较不接近最优路由发散。
-
公开(公告)号：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
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.
摘要翻译： 各种实施例实现一组低开销机制以实现按需路由协议。 按需协议在发现洪水期间使用路由累积，以便在更好的路径变得可用时发现，即使协议当前使用的路径没有被破坏。 换句话说，机制（或“路由优化”）可以改善路由，即使有功能的路由可用。 路由优化机制使得网络中的节点被动地学习路由信息，以便在更改重要时通知需要知道路由信息中的更改的节点。 在一些实施例中，在没有任何明确的控制分组交换的情况下，执行在最新路径上学习路由信息并确定将从该信息中受益的节点。 路由优化机制之一包括传达描述改进路由的改进路由的信息，其中改进路由从较不接近最优路由发散。
-
公开(公告)号：US20090175169A1
公开(公告)日：2009-07-09
申请号：US12404170
申请日：2009-03-13
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.
摘要翻译： 在由多个无线电节点组成的网状网络中，我们将每个无线电分配给多个信道中的一个，并且将一对节点之间的多个链路视为一个逻辑链路（绑定链路）。 在一些实施例中，路由协议适于将每个绑定链路视为具有组成物理链路的至少一些属性的组合的一个链路。 根据每个接口的当前利用率，沿着路径发送的流量在每个中间节点的接口之间动态负载平衡。 在至少一些实施例中，路由发现分组记录离开节点的绑定链路的每个分量链路的度量，但是每对节点仅转发一个路由发现分组，与每个路由发现分组相比减少了路由发现分组流量 被转发通过该对节点之间的每个组件链路。
-
公开(公告)号：US08830921B2
公开(公告)日：2014-09-09
申请号：US12864244
申请日：2009-01-13
申请人： Jorjeta Jetcheva , Ravi Prakash , Vinay Gupta , Sachin Kanodia , Mohan Natarajan
发明人： Jorjeta Jetcheva , Ravi Prakash , Vinay Gupta , Sachin Kanodia , Mohan Natarajan
CPC分类号： H04W72/082 , H04L41/12 , H04W72/0426 , H04W72/0433 , H04W72/0486 , H04W72/121 , H04W88/08
摘要： Channel assignment for wireless access networks is directed toward improved overall communication capability of the networks. A network is formed of wireless access points (APs) coupled via wired (and/or wireless) links and enabled to communicate with clients via radio channels of each of the APs. Local information is collected at each of the APs and processed to determine channel assignments according to a Neighbor Impact Metric (NIM) that accounts for one-hop and two-hop neighbors as well as neighbors not part of the network. Optionally, the NIM accounts for traffic load on the APs. The channel assignments are determined either on a centralized resource (such as a server or one of the APs) or via a distributed scheme across the APs. The local information includes how busy a channel is and local operating conditions such as error rate and interference levels.
摘要翻译： 无线接入网络的信道分配旨在改善网络的整体通信能力。 网络由经由有线（和/或无线）链路耦合的无线接入点（AP）形成，并且能够经由每个AP的无线电信道与客户端通信。 在每个AP处收集本地信息，并根据占用一跳和两跳邻居的邻居影响度量（NIM）以及不属于网络的邻居来处理信道分配。 可选地，NIM考虑到AP上的流量负载。 信道分配在集中式资源（如服务器或其中一个AP）上确定，或者通过跨AP的分布式方案确定。 本地信息包括信道繁忙和本地操作条件，如错误率和干扰级别。
-
公开(公告)号：US20120134326A1
公开(公告)日：2012-05-31
申请号：US13168988
申请日：2011-06-26
IPC分类号： H04W72/04
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.
摘要翻译： 在由多个无线电节点组成的网状网络中，我们将每个无线电分配给多个信道中的一个，并且将一对节点之间的多个链路视为一个逻辑链路（绑定链路）。 在一些实施例中，路由协议适于将每个绑定链路视为具有组成物理链路的至少一些属性的组合的一个链路。 根据每个接口的当前利用率，沿着路径发送的流量在每个中间节点的接口之间动态负载平衡。 在至少一些实施例中，路由发现分组记录离开节点的绑定链路的每个分量链路的度量，但是每对节点仅转发一个路由发现分组，与每个路由发现分组相比减少了路由发现分组流量 被转发通过该对节点之间的每个组件链路。
-
公开(公告)号：US20110051677A1
公开(公告)日：2011-03-03
申请号：US12864244
申请日：2009-01-13
申请人： Jorjeta Jetcheva , Ravi Prakash , Vinay Gupta , Sachin Kanodia , Mohan Natarajan
发明人： Jorjeta Jetcheva , Ravi Prakash , Vinay Gupta , Sachin Kanodia , Mohan Natarajan
IPC分类号： H04W72/04
CPC分类号： H04W72/082 , H04L41/12 , H04W72/0426 , H04W72/0433 , H04W72/0486 , H04W72/121 , H04W88/08
摘要： Channel assignment for wireless access networks is directed toward improved overall communication capability of the networks. A network is formed of wireless access points (APs) coupled via wired (and/or wireless) links and enabled to communicate with clients via radio channels of each of the APs. Local information is collected at each of the APs and processed to determine channel assignments according to a Neighbor Impact Metric (NIM) that accounts for one-hop and two-hop neighbors as well as neighbors not part of the network. Optionally, the NIM accounts for traffic load on the APs. The channel assignments are determined either on a centralized resource (such as a server or one of the APs) or via a distributed scheme across the APs. The local information includes how busy a channel is and local operating conditions such as error rate and interference levels.
摘要翻译： 无线接入网络的信道分配旨在改善网络的整体通信能力。 网络由经由有线（和/或无线）链路耦合的无线接入点（AP）形成，并且能够经由每个AP的无线电信道与客户端通信。 在每个AP处收集本地信息，并根据占用一跳和两跳邻居的邻居影响度量（NIM）以及不属于网络的邻居进行处理以确定信道分配。 可选地，NIM考虑到AP上的流量负载。 信道分配在集中式资源（如服务器或其中一个AP）上确定，或者通过跨AP的分布式方案确定。 本地信息包括信道繁忙和本地操作条件，如错误率和干扰级别。
-
8.发明申请Multi-Channel Assignment Method For Multi-Radio Multi-Hop Wireless Mesh Networks 有权用于多无线多跳无线网状网络的多信道分配方法公开(公告)号：US20090175238A1
公开(公告)日：2009-07-09
申请号：US12404166
申请日：2009-03-13
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.
摘要翻译： 描述了用于自动确定具有具有两个或多个无线电的节点的多跳网状网络中的每个无线电的准静态每链路信道分配的技术，并且其中只有少量信道可用于网络中。 该方法将信道最佳地分配给网络中所有节点的无线电，以实现链路之间的最低干扰和最高可能的带宽。
-
公开(公告)号：US20080107034A1
公开(公告)日：2008-05-08
申请号：US12014802
申请日：2008-01-16
IPC分类号： H04L12/26
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.
摘要翻译： 各种实施例实现一组低开销机制以实现按需路由协议。 按需协议在发现洪水期间使用路由累积，以便在更好的路径变得可用时发现，即使协议当前使用的路径没有被破坏。 换句话说，机制（或“路由优化”）可以改善路由，即使有功能的路由可用。 路由优化机制使得网络中的节点被动地学习路由信息，以便在更改重要时通知需要知道路由信息中的更改的节点。 在一些实施例中，在没有任何明确的控制分组交换的情况下，执行在最新路径上学习路由信息并确定将从该信息中受益的节点。 路由优化机制之一包括传达描述改进路由的改进路由的信息，其中改进路由从较不接近最优路由发散。
-
10.发明申请公开(公告)号：US20130033987A1
公开(公告)日：2013-02-07
申请号：US13441726
申请日：2012-04-06
IPC分类号： H04W28/10
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.
摘要翻译： 无线网状网络（或网格）能够互相任意互连，并可根据需要提供不同级别的覆盖和冗余。 具有不同配置，内部操作或两者的网格之间的互操作性可以以无限制的组合自由地混合和互操作。 增强型显式桥间控制协议使用预先存在的控制数据包进行操作。 使用预先存在的广播数据包洪泛来学习跨互连网格（称为多网格）的最佳路径。 在每个网格内运行的增强的路由协议可以可选地检查在转发流量时限制于相应网格的信息，从而实现关于存储器和路由协议所需的处理时间的鲁棒多网格缩放。 通过在多个频率下进行操作，通过在彼此的干扰范围内配置网格来实现跨多网格的频率分集来提高通信可伸缩性。 每个网格可以在相应的非干扰频率下操作。
-
-
-
-
-
-
-
-
-
搜索结果
18 条记录 (耗时 0.02 秒)