TY - JOUR
T1 - Supporting real-time multiple data items query in multi-RSU vehicular ad hoc networks (VANETs)
AU - Ali, G.G.Md. Nawaz
AU - Chan, Edward
AU - Li, Wenzhong
PY - 2013/8
Y1 - 2013/8
N2 - There has been increasing interest in the issue of multi-item queries in wireless broadcasting systems recently. Query starvation and bandwidth utilization have been identified as key issues for improved performance. 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 query is valid for serving in an RSU. By considering these two deadlines together with vehicle speed, RSU range and inter-RSU distance, we formulate a Cooperative Query Serving (CQS) scheme which allows multiple RSUs to share residual bandwidth and effectively address the query starvation as well as the bandwidth utilization problems, hence maximizing the chance of serving multiple items queries. Extensive simulation results confirm that CQS outperforms other existing scheduling algorithms. © 2013 Elsevier Inc. All rights reserved.
AB - There has been increasing interest in the issue of multi-item queries in wireless broadcasting systems recently. Query starvation and bandwidth utilization have been identified as key issues for improved performance. 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 query is valid for serving in an RSU. By considering these two deadlines together with vehicle speed, RSU range and inter-RSU distance, we formulate a Cooperative Query Serving (CQS) scheme which allows multiple RSUs to share residual bandwidth and effectively address the query starvation as well as the bandwidth utilization problems, hence maximizing the chance of serving multiple items queries. Extensive simulation results confirm that CQS outperforms other existing scheduling algorithms. © 2013 Elsevier Inc. All rights reserved.
KW - Multi-item queries
KW - Roadside-to-vehicle communication (RVC)
KW - Vehicular ad hoc networks (VANETs)
UR - http://www.scopus.com/inward/record.url?scp=84880152069&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-84880152069&origin=recordpage
U2 - 10.1016/j.jss.2013.03.073
DO - 10.1016/j.jss.2013.03.073
M3 - RGC 21 - Publication in refereed journal
SN - 0164-1212
VL - 86
SP - 2127
EP - 2142
JO - Journal of Systems and Software
JF - Journal of Systems and Software
IS - 8
ER -