混合太阳能汽车自组网中的延迟有界路由

Yuh-Shyan Chen, Chih-Shun Hsu, Shu-Yu Lin
{"title":"混合太阳能汽车自组网中的延迟有界路由","authors":"Yuh-Shyan Chen, Chih-Shun Hsu, Shu-Yu Lin","doi":"10.1109/CCNC.2014.6866550","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":287724,"journal":{"name":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Delay-bounded routing on hybrid-solar vehicular ad-hoc networks\",\"authors\":\"Yuh-Shyan Chen, Chih-Shun Hsu, Shu-Yu Lin\",\"doi\":\"10.1109/CCNC.2014.6866550\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":287724,\"journal\":{\"name\":\"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-07-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCNC.2014.6866550\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCNC.2014.6866550","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

大多数研究的重点是最小化端到端延迟,而不是减少无线电的使用。然而,有些信息并不紧急,无线电是一种宝贵而有限的资源。延迟有界路由协议是近年来研究的热点问题,其目标是在用户定义的延迟内将消息传递到目的地,并最大限度地减少无线电的使用。为了减轻环境负担和节约能源,混合动力太阳能汽车是最突出的解决方案之一。现有的延迟有界路由协议不考虑费用和能量消耗因素,只选择转发次数最少的路径。为了改进以前的工作,我们提出了一种基于成本函数的机制,其中包括转发时间和功率增益,以选择最小成本路径。此外,我们提出了一种新的机制,通过数据骡子(由车辆携带)和转发(通过无线电传输)的混合方式将消息传递到目的地。在现有协议中,当剩余时间不足时,车辆应通过无线电转发消息,当剩余时间足够时,车辆应自行携带消息。然而,通过无线电转发消息消耗更多的能量,因此应该考虑能量因素。提出的协议包含两种方案:贪心方案和中心化方案。在集中式方案中,收集太阳能照度、每条道路的长度、每条道路上车辆的平均速度等信息,然后采用动态规划方法寻找成本最小的路径。在贪心方案中,它只知道平均速度、太阳照度和所有可能的下一路段的长度,从而选择成本最小的下一路段。仿真结果表明,所提出的路由协议比现有的路由协议更节能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Delay-bounded routing on hybrid-solar vehicular ad-hoc networks
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信