公开(公告)号：US08953497B2

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

申请号：US13335480

申请日：2011-12-22

申请人： Kai Feng Wang ,  PengFei Zhu ,  HongXia Sun ,  YongQiang Wu

发明人： Kai Feng Wang ,  PengFei Zhu ,  HongXia Sun ,  YongQiang Wu

IPC分类号： H04L12/56 ,  H04L12/721 ,  H04L12/761

CPC分类号： H04L45/06 ,  H04L45/16

摘要： In mesh networks having multiple nodes that communicate data to and from each other, a great number of data transmissions may be initiated and carried out to get data to a proper processing node for execution. To get data where it needs to go (e.g., the proper destination node), a routing algorithm is used to define a set of rules for efficiently passing data from node to node until the destination node is reached. For the purpose of assuring that all data is properly transferred from node to node in a reasonably efficient manner, a routing algorithm may define subsets of nodes into regions and then send data via the regions. Even greater overall efficiency may be realized by recognizing specific adjacency relationships among a group of destination nodes and taking advantage of such adjacencies by rerouting data through regions other than the region in which a destination node resides.

摘要翻译： 在具有向彼此传递数据的多个节点的网状网络中，可以启动并执行大量数据传输以将数据传送到适当的处理节点以供执行。 为了获得需要去的数据（例如，适当的目的地节点），使用路由算法来定义用于有效地将数据从节点传递到节点的规则集，直到到达目的地节点。 为了确保以合理有效的方式从节点到节点正确传输所有数据，路由算法可以将节点的子集定义为区域，然后经由区域发送数据。 通过识别一组目的地节点之间的特定邻接关系并且通过重新路由数据通过除了目的地节点驻留的区域之外的区域来利用这种相邻性，可以实现更高的总体效率。

公开(公告)号：US20120170488A1

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

申请号：US13335480

申请日：2011-12-22

申请人： Kai Feng WANG ,  PengFei ZHU ,  HongXia SUN ,  YongQiang WU

发明人： Kai Feng WANG ,  PengFei ZHU ,  HongXia SUN ,  YongQiang WU

IPC分类号： H04L12/56 ,  H04L12/28

CPC分类号： H04L45/06 ,  H04L45/16

摘要： In mesh networks having multiple nodes that communicate data to and from each other, a great number of data transmissions may be initiated and carried out to get data to a proper processing node for execution. To get data where it needs to go (e.g., the proper destination node), a routing algorithm is used to define a set of rules for efficiently passing data from node to node until the destination node is reached. For the purpose of assuring that all data is properly transferred from node to node in a reasonably efficient manner, a routing algorithm may define subsets of nodes into regions and then send data via the regions. Even greater overall efficiency may be realized by recognizing specific adjacency relationships among a group of destination nodes and taking advantage of such adjacencies by rerouting data through regions other than the region in which a destination node resides.

摘要翻译： 在具有向彼此传递数据的多个节点的网状网络中，可以启动并执行大量数据传输以将数据传送到适当的处理节点以供执行。 为了获得需要去的数据（例如，适当的目的地节点），使用路由算法来定义用于有效地将数据从节点传递到节点的规则集，直到到达目的地节点。 为了确保以合理有效的方式从节点到节点正确传输所有数据，路由算法可以将节点的子集定义为区域，然后经由区域发送数据。 通过识别一组目的地节点之间的特定邻接关系并且通过重新路由数据通过除了目的地节点驻留的区域之外的区域来利用这种相邻性，可以实现更高的整体效率。