公开(公告)号：US09131433B2

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

申请号：US13424523

申请日：2012-03-20

申请人： David Steer ,  Koon Hoo Teo ,  Adrian D. Smith

发明人： David Steer ,  Koon Hoo Teo ,  Adrian D. Smith

IPC分类号： G01R31/08 ,  H04W40/24 ,  H04L12/721 ,  H04L12/727 ,  H04W28/08 ,  H04W40/28 ,  H04W84/22

CPC分类号： H04W40/246 ,  H04L45/12 ,  H04L45/121 ,  H04L45/36 ,  H04W28/08 ,  H04W40/28 ,  H04W84/22

摘要： Packets in a multi-hop wireless network are routed based on the available link throughputs, network node congestion and the connectivity of the network in a manner that minimizes the use of radio resources and minimizes delay for packets in multi-hop system. The routing method also avoids congestion in the access network, especially near the network access points as provided by network access nodes. Each wireless network node maintains a link table for storing link conditions and associated route costs. Packets are routed according to the low cost route. Subsequent wireless network nodes evaluate whether a lower cost route is available and, if so, route the data packet according to the lower cost route. Every wireless network node transmits the data packet, a specified route and a time stamp indicated a time of the last data entry in the link table that was used to calculate the low cost route.

摘要翻译： 基于可用的链路吞吐量，网络节点拥塞和网络的连通性，以最小化无线资源的使用并最小化多跳系统中的分组的延迟的方式来路由多跳无线网络中的分组。 路由方法还可以避免接入网络中的拥塞，特别是网络接入节点附近的网络接入点。 每个无线网络节点维护用于存储链路条件和相关联的路由成本的链路表。 数据包根据低成本路由进行路由。 随后的无线网络节点评估较低成本路由是否可用，如果是，则根据较低成本路由路由数据分组。 每个无线网络节点发送数据包，指定的路由和时间戳表示在用于计算低成本路由的链路表中最后一个数据条目的时间。