Deadline-Aware Scheduling for Transmitted RSU Packets in Cooperative Vehicle-Infrastructure Systems
Round 1
Reviewer 1 Report
The paper studies the optimization problem of multi-RSU distributed packet scheduling based on vehicle carrier relay in CVIS. It then proposes an optimization strategy to minimize end-to-end delay. The paper is well organized and in good written quality. The followings are suggested comments:
1. In abstract, please put the abbreviation DDPS right after the “DDPS”.
2. Although it is clearly stated that only one-lane scenario of the highway is considered in this paper, it is good to provide some discussion on how the conclusions and the strategy proposed in this paper will be affected the multi-lane scenario.
3. This paper is mostly theoretical and verified by simulations. End-to-end average delay is used to measure the performance of the scheduling strategy. To emphasize the impact of this research, it is recommended to discuss what is a reasonable criterion for end-to-end average delay.
4. Figure 3 to Figure 5 show the impact of weight V. What is the physical meaning of this parameter?
5. Figure 6 to Figure 11, please add the unit of x axis.
6. For all the assumptions in the paper, how are they affected in a real-world scenario?
Author Response
Please see the attachment
Author Response File: 
Author Response.docx
Reviewer 2 Report
The work is interesting, at a high level. It concerns current issues related to autonomy in road traffic. Therefore, better, more advanced conclusions would be expected. Conclusions should be extended, including the following issues: what are the achievements of the simulation results, what are the advantages of the Lyapunov method used in this case, summarize the advantages of the DDPS system.
Author Response
Please see the attachment
Author Response File: Author Response.docx
Reviewer 3 Report
Although the motivation is presented in the paper, it is not clear to the Reviewer where the presented research/results can be applied. For the scenario shown in Fig. 1 there is a simple and straightforward scenario to "pass" the data to RSU' (send the packets to RSUx with the use of backbone connection and then use the first car that occurs in RSUx coverage area to pass the packets to RSU'). Moreover, could the author explain what is the size (in bytes) of the priority and non-priority queues that are a subject of such an optimization?
Author Response
Please see the attachment.
Author Response File: Author Response.docx
Round 2
Reviewer 2 Report
After the authors' corrections, the work is suitable for publication
Reviewer 3 Report
I do not have further comments.
