Communication Scheduling and Control of a Platoon of Vehicles in VANETs
This paper is concerned with the problem of vehicular platoon control in vehicular ad hoc networks subject to capacity limitation and random packet dropouts. By introducing binary sequences as the basis of network access scheduling and modeling random packet dropouts as independent Bernoulli process...
Saved in:
Published in | IEEE transactions on intelligent transportation systems Vol. 17; no. 6; pp. 1551 - 1563 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
New York
IEEE
01.06.2016
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | This paper is concerned with the problem of vehicular platoon control in vehicular ad hoc networks subject to capacity limitation and random packet dropouts. By introducing binary sequences as the basis of network access scheduling and modeling random packet dropouts as independent Bernoulli processes, we derive a closed-form methodology for vehicular platoon control. In particular, an interesting framework for network access scheduling and platoon control codesign is established based on a set of priority rules for network access control. The resulting platoon control and scheduling algorithm can resolve network access conflicts in vehicular ad hoc networks and guarantee string stability and zero steady-state spacing errors. The effectiveness of the method is demonstrated by numerical simulations and experiments with laboratory-scale Arduino cars. |
---|---|
Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 |
ISSN: | 1524-9050 1558-0016 |
DOI: | 10.1109/TITS.2015.2505407 |