Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: 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. ,  examine this problem in the context of VANETs with multiple cooperating Road Side Units (RSUs).  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,  formulate a Cooperative Query Serving (CQS) scheme which allows multiple RSUs to share residual bandwidth and effectively address the query starvation as ll 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.
['G. G. Md. Nawaz Ali', 'Edward Chan', 'Wenzhong Li']
I am writing a research paper on a idea Supporting real-time multiple data items query in multi-RSU vehicular ad hoc networks (VANETs)
[{"from": "human", "value": "I am writing a research paper on a idea Supporting real-time multiple data items query in multi-RSU vehicular ad hoc networks (VANETs)"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: 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. ,  examine this problem in the context of VANETs with multiple cooperating Road Side Units (RSUs).  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,  formulate a Cooperative Query Serving (CQS) scheme which allows multiple RSUs to share residual bandwidth and effectively address the query starvation as ll 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."}]