{"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}
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.