公开(公告)号：US09491684B2

公开(公告)日：2016-11-08

申请号：US14404737

申请日：2013-09-30

申请人： UNIVERSIDADE DO PORTO ,  CARNEGIE MELLON UNIVERSITY

发明人： João Francisco Cordeiro De Oliveira Barros ,  Rui Manuel Pacheco Meireles ,  Peter Alfons Roland Steenkiste

IPC分类号： H04W40/20 ,  G08G1/09 ,  G08G1/16 ,  H04L12/823 ,  H04L29/08 ,  H04W72/04 ,  H04W72/06 ,  H04L12/733 ,  H04W40/24

CPC分类号： H04W40/20 ,  G08G1/093 ,  G08G1/163 ,  H04L45/126 ,  H04L47/32 ,  H04L67/12 ,  H04W40/244 ,  H04W40/246 ,  H04W72/0446 ,  H04W72/06

摘要： A method for multi-hop forwarding of data packets in vehicular ad-hoc networks is disclosed. Each node knows both its own and the destination's geographical coordinates. The coordinates of the one-hop neighbors are obtained from periodically broadcast Cooperative-Awareness Messages (CAMs). The method comprises the following distributed coordination scheme, executed by each node upon receiving a packet: i) computing the set of candidate forwarders; ii) ranking the candidate forwarders according to an utility metric; iii) forwarding the packet after a period of time proportional to its rank if top-ranked, dropping the packet otherwise. The base utility metric used for ranking forwarders is the inverse of the distance to the destination. Moreover, an extension is disclosed where this metric is replaced by the inverse of the expected number of packet transmissions to reach the destination. The latter metric is calculated based on spatial connectivity information cooperatively collected by nodes in the network.

摘要翻译： 公开了一种用于车载自组织网络中数据包的多跳转发的方法。 每个节点都知道自己和目的地的地理坐标。 从周期性广播合作意识消息（CAM）获得一跳邻居的坐标。 该方法包括以下分布式协调方案，在接收到分组时由每个节点执行：i）计算候选转发器集合; ii）根据效用度量对候选转发器进行排名; iii）如果数据包在与其排名成比例的时间段之后转发数据包，否则丢弃数据包。 用于对转发器进行排名的基本效用度量是到目的地的距离的倒数。 此外，公开了一种扩展，其中该度量被到达目的地的分组传输的预期数量的倒数替换。 后一个度量是基于由网络中的节点协同收集的空间连通性信息来计算的。

公开(公告)号：US20150163720A1

公开(公告)日：2015-06-11

申请号：US14404737

申请日：2013-09-30

申请人： UNIVERSIDADE DO PORTO ,  CARNEGIE MELLON UNIVERSITY

发明人： João Francisco Cordeiro De Oliveria Barros ,  Rui Manuel Pacheco Meireles ,  Peter Alfons Roland Steenkiste

IPC分类号： H04W40/20 ,  H04L29/08 ,  H04W72/06 ,  H04W40/24 ,  H04L12/823 ,  H04W72/04

CPC分类号： H04W40/20 ,  G08G1/093 ,  G08G1/163 ,  H04L45/126 ,  H04L47/32 ,  H04L67/12 ,  H04W40/244 ,  H04W40/246 ,  H04W72/0446 ,  H04W72/06

摘要： A method for multi-hop forwarding of data packets in vehicular ad-hoc networks is disclosed. Each node knows both its own and the destination's geographical coordinates. The coordinates of the one-hop neighbors are obtained from periodically broadcast Cooperative-Awareness Messages (CAMs). The method comprises the following distributed coordination scheme, executed by each node upon receiving a packet: i) computing the set of candidate forwarders; ii) ranking the candidate forwarders according to an utility metric; iii) forwarding the packet after a period of time proportional to its rank if top-ranked, dropping the packet otherwise. The base utility metric used for ranking forwarders is the inverse of the distance to the destination. Moreover, an extension is disclosed where this metric is replaced by the inverse of the expected number of packet transmissions to reach the destination. The latter metric is calculated based on spatial connectivity information cooperatively collected by nodes in the network.

摘要翻译： 公开了一种用于车载自组织网络中数据包的多跳转发的方法。 每个节点都知道自己和目的地的地理坐标。 从周期性广播合作意识消息（CAM）获得一跳邻居的坐标。 该方法包括以下分布式协调方案，在接收到分组时由每个节点执行：i）计算候选转发器集合; ii）根据效用度量对候选转发器进行排名; iii）如果数据包在与其排名成比例的时间段之后转发数据包，否则丢弃数据包。 用于对转发器进行排名的基本效用度量是到目的地的距离的倒数。 此外，公开了一种扩展，其中该度量被到达目的地的分组传输的预期数量的倒数替换。 后一个度量是基于由网络中的节点协同收集的空间连通性信息来计算的。