【24h】

Knowing vehicles location HELPS avoiding broadcast packets storm

机译:了解车辆位置帮助避免广播数据包风暴

获取原文

摘要

This paper proposes HELP, a simple and distributed broadcast algorithm for warning delivery services in inter-vehicular ad hoc networks. Assuming that neighborhood location information is available from the routing layer, each node determines whether to re-broadcast the message based on i) the coverage zone of the received message and ii) the estimated position of its neighbors. Investigations are led using a popular microscopic traffic model, in order to ensure realism of the networking performance evaluation. Results show that the algorithm efficiently limits the number of broadcasted messages, which is very close to the optimal. Furthermore, robustness of the results in terms of the number of informed vehicles can also be achieved, provided that a safety error margin is considered in the position estimate.
机译:本文提出了一种简单和分布式广播算法,用于在车辆间临时网络中的警告递送服务。假设邻域位置信息可从路由层获得,每个节点确定是否基于I)接收消息的覆盖区域和II)其邻居的估计位置。使用流行的微观交通模型来调查,以确保网络性能评估的现实。结果表明,该算法有效地限制了广播消息的数量,这非常接近最佳。此外,还可以实现关于所通知车辆的数量的结果的鲁棒性,但是提供了在位置估计中考虑安全误差余量。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号