多rsu车辆自组网(vanet)中实时多项目查询调度

G. Ali, E. Chan, Wenzhong Li
{"title":"多rsu车辆自组网(vanet)中实时多项目查询调度","authors":"G. Ali, E. Chan, Wenzhong Li","doi":"10.1109/WAINA.2013.25","DOIUrl":null,"url":null,"abstract":"The issue of multi-item queries in wireless broadcasting systems has received considerable interest recently. Two problems, namely query starvation and bandwidth utilization, have been identified as key issues that need to be solved. In this paper, we examine this problem in the context of VANETs with multiple cooperating Road Side Units (RSUs). We characterize a query with two deadlines: query total deadline (QTD) which is the actual deadline of a query and query local deadline (QLD) which is the duration a vehicle dwells in an RSU range after submitting that query. By careful consideration of these deadlines, vehicle speed, RSU range and inter-RSU distance, we propose a Cooperative Query Serving (CQS)approach which allows multiple RSUs to share residual bandwidth, deal effectively with both the query starvation and the bandwidth utilization problem and hence maximize the chance of serving multiple items queries. Simulation results show CQS outperforms other scheduling algorithms.","PeriodicalId":359251,"journal":{"name":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","volume":"78 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On Scheduling Real-Time Multi-item Queries in Multi-RSU Vehicular Ad Hoc Networks (VANETs)\",\"authors\":\"G. Ali, E. Chan, Wenzhong Li\",\"doi\":\"10.1109/WAINA.2013.25\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The issue of multi-item queries in wireless broadcasting systems has received considerable interest recently. Two problems, namely query starvation and bandwidth utilization, have been identified as key issues that need to be solved. In this paper, we examine this problem in the context of VANETs with multiple cooperating Road Side Units (RSUs). We characterize a query with two deadlines: query total deadline (QTD) which is the actual deadline of a query and query local deadline (QLD) which is the duration a vehicle dwells in an RSU range after submitting that query. By careful consideration of these deadlines, vehicle speed, RSU range and inter-RSU distance, we propose a Cooperative Query Serving (CQS)approach which allows multiple RSUs to share residual bandwidth, deal effectively with both the query starvation and the bandwidth utilization problem and hence maximize the chance of serving multiple items queries. Simulation results show CQS outperforms other scheduling algorithms.\",\"PeriodicalId\":359251,\"journal\":{\"name\":\"2013 27th International Conference on Advanced Information Networking and Applications Workshops\",\"volume\":\"78 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-03-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 27th International Conference on Advanced Information Networking and Applications Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WAINA.2013.25\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 27th International Conference on Advanced Information Networking and Applications Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WAINA.2013.25","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

无线广播系统中的多项目查询问题近年来引起了人们的广泛关注。两个问题,即查询饥饿和带宽利用率,已经被确定为需要解决的关键问题。在本文中,我们在具有多个合作路侧单元(rsu)的vanet背景下研究了这个问题。我们用两个截止日期来描述查询:查询总截止日期(QTD)和查询本地截止日期(QLD),前者是查询的实际截止日期,后者是提交该查询后车辆在RSU范围内停留的时间。通过仔细考虑这些截止日期、车辆速度、RSU范围和RSU之间的距离,我们提出了一种允许多个RSU共享剩余带宽的合作查询服务(CQS)方法,有效地处理了查询饥渴和带宽利用率问题,从而最大限度地提高了服务多项查询的机会。仿真结果表明,CQS调度算法优于其他调度算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
On Scheduling Real-Time Multi-item Queries in Multi-RSU Vehicular Ad Hoc Networks (VANETs)
The issue of multi-item queries in wireless broadcasting systems has received considerable interest recently. Two problems, namely query starvation and bandwidth utilization, have been identified as key issues that need to be solved. In this paper, we examine this problem in the context of VANETs with multiple cooperating Road Side Units (RSUs). We characterize a query with two deadlines: query total deadline (QTD) which is the actual deadline of a query and query local deadline (QLD) which is the duration a vehicle dwells in an RSU range after submitting that query. By careful consideration of these deadlines, vehicle speed, RSU range and inter-RSU distance, we propose a Cooperative Query Serving (CQS)approach which allows multiple RSUs to share residual bandwidth, deal effectively with both the query starvation and the bandwidth utilization problem and hence maximize the chance of serving multiple items queries. Simulation results show CQS outperforms other scheduling algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
WiMAX-WLAN Vehicle-to-Infrastructure Network Architecture during Fast Handover Process RFID Tracking for Urban Transportation Using EPCGlobal-based WebServices An Effective Attack Detection Approach in Wireless Mesh Networks Privacy Enhanced and Computationally Efficient HSK-AKA LTE Scheme On Scheduling Real-Time Multi-item Queries in Multi-RSU Vehicular Ad Hoc Networks (VANETs)
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1