首页> 外文会议>IEEE Consumer Communications and Networking Conference >Delay-bounded routing on hybrid-solar vehicular ad-hoc networks
【24h】

Delay-bounded routing on hybrid-solar vehicular ad-hoc networks

机译:混合太阳能车辆AD-HOC网络上的延时界限路由

获取原文

摘要

Most of the researches pay attention to minimize the end-to-end delay rather than reduce the usage of radio. However, some information is not urgent and radio is a valuable and limited resource. Recently, delay-bounded routing protocol has become a popular issue, whose goal is to deliver messages to the destination within user-defined delay and minimize the usage of radio. To decrease the burden on the environment and save energy, the hybrid-solar vehicle is one of the most prominent solutions. The existing delay-bounded routing protocols do not consider the charge and the energy expenditure factors and only choose the path with the least forwarding times. To improve previous works, we propose a mechanism based on a cost function, which includes forwarding times and power gain, to choose a minimum cost path. Besides, we propose a novel mechanism to deliver message to the destination by the hybrid of data muling (carried by the vehicle) and forwarding (transmitted through radio). In the existing protocol, when the remaining time is not enough the vehicle should forward the message by radio and when the remaining time is enough the vehicle should carry the message by itself. However, forwarding message by radio consumes more energy and hence the energy factor should be added into the consideration. The proposed protocol contains two schemes: the greedy and centralized schemes. In the centralized scheme, the information such as the solar illumination, length of each road segment, and the average velocity of the vehicles on each road segment are collected and then the dynamic programming is used to find the least cost routing path. In the greedy scheme, it only has the knowledge of the average velocity, the solar illumination and the length of all the possible next road segments to choose the next road segment with the least cost. Simulation results illustrate that the proposed routing protocol can save more energy than existing protocols.
机译:大多数研究都注意最小化端到端延迟而不是减少无线电的使用。但是,一些信息不是迫切的,无线电是一个有价值的资源和有限的资源。最近,延迟界限路由协议已成为一个流行的问题,其目标是在用户定义的延迟内向目的地传送消息,并最大限度地减少无线电的使用。为了减少环境的负担并节省能源,混合太阳能汽车是最突出的解决方案之一。现有的延迟界限路由协议不考虑充电和能量消耗因素,只能选择转发时间最少的路径。为了改善以前的作品,我们提出了一种基于成本函数的机制,包括转发时间和功率增益,选择最小成本路径。此外,我们提出了一种新的机制,通过数据Muling(车辆携带)的混合来向目的地提供信息并转发(通过无线电传输)。在现有协议中,当剩余时间不够时,车辆应该通过无线电转发消息,并且当剩余时间足够时,车辆应该自行携带消息。然而,无线电的转发消息消耗更多能量,因此应该将能量因子添加到考虑中。拟议的协议包含两种方案:贪婪和集中化方案。在集中方案中,收集诸如太阳能照明,每个道路段的长度以及每条道路段上的车辆的平均速度的信息,然后使用动态编程来找到最低成本的路由路径。在贪婪方案中,它只有知识的平均速度,太阳能照射和所有可能的下一条道路段的长度,以选择具有最低成本的下一个道路段。仿真结果说明所提出的路由协议可以节省比现有协议更多的能量。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号