Optimal Rate-Adaptive Data Dissemination in Vehicular Platoons

Li, K; Ni, W; Tovar, E; Guizani, M

Optimal Rate-Adaptive Data Dissemination in Vehicular Platoons

Li, K Ni, W

Tovar, E Guizani, M

Permalink

Publisher:: Institute of Electrical and Electronics Engineers (IEEE)
Publication Type:: Journal Article
Citation:: IEEE Transactions on Intelligent Transportation Systems, 2020, 21, (10), pp. 4241-4251
Issue Date:: 2020-10-01

Closed Access

	Filename	Description	Size
	08984213.pdf	Published version	4.93 MB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Li, K
dc.contributor.author	Ni, W https://orcid.org/0000-0002-4933-594X
dc.contributor.author	Tovar, E
dc.contributor.author	Guizani, M
dc.date.accessioned	2021-03-23T00:41:28Z
dc.date.available	2021-03-23T00:41:28Z
dc.date.issued	2020-10-01
dc.identifier.citation	IEEE Transactions on Intelligent Transportation Systems, 2020, 21, (10), pp. 4241-4251
dc.identifier.issn	1524-9050
dc.identifier.issn	1558-0016
dc.identifier.uri	http://hdl.handle.net/10453/147457
dc.description.abstract	© 2000-2011 IEEE. In intelligent transportation systems, wireless connected vehicles moving in platoons can improve roads' throughput. For managing driving status of the platoon, a lead vehicle transmits driving information to following autonomous vehicles by using multi-hop data dissemination. We study a novel data dissemination protocol which investigates a chain-based transmit rate control to reduce data dissemination latency. The optimal resource allocation algorithm is formulated to minimize the total dissemination latency of the platoon under guaranteed bit error rates, and can be judiciously reformulated and solved using standard optimization techniques. A novel dynamic programming algorithm is presented to solve the platooning resource allocation optimization, which uses backward induction to significantly reduce the resource allocation complexity. In addition, we interpret the vehicular platoon as one-dimensional Markov chain, and derive a closed form of dissemination latency. Simulations are carried out to evaluate the performance of the proposed dynamic programming algorithm. The numerical results show that our algorithm achieves optimal solutions with cutting off the complexity by orders of magnitude, while improving dissemination rate in the vehicular platoon.
dc.language	en
dc.publisher	Institute of Electrical and Electronics Engineers (IEEE)
dc.relation.ispartof	IEEE Transactions on Intelligent Transportation Systems
dc.relation.isbasedon	10.1109/TITS.2019.2939292
dc.rights	info:eu-repo/semantics/closedAccess
dc.rights	© 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.	en_US
dc.subject	0801 Artificial Intelligence and Image Processing, 0905 Civil Engineering, 1507 Transportation and Freight Services
dc.subject.classification	Logistics & Transportation
dc.title	Optimal Rate-Adaptive Data Dissemination in Vehicular Platoons
dc.type	Journal Article
utslib.citation.volume	21
utslib.for	0801 Artificial Intelligence and Image Processing
utslib.for	0801 Artificial Intelligence and Image Processing
utslib.for	0905 Civil Engineering
utslib.for	1507 Transportation and Freight Services
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
utslib.copyright.status	closed_access	*
dc.date.updated	2021-03-23T00:41:24Z
pubs.issue	10
pubs.publication-status	Published
pubs.volume	21
utslib.citation.issue	10

Abstract:

© 2000-2011 IEEE. In intelligent transportation systems, wireless connected vehicles moving in platoons can improve roads' throughput. For managing driving status of the platoon, a lead vehicle transmits driving information to following autonomous vehicles by using multi-hop data dissemination. We study a novel data dissemination protocol which investigates a chain-based transmit rate control to reduce data dissemination latency. The optimal resource allocation algorithm is formulated to minimize the total dissemination latency of the platoon under guaranteed bit error rates, and can be judiciously reformulated and solved using standard optimization techniques. A novel dynamic programming algorithm is presented to solve the platooning resource allocation optimization, which uses backward induction to significantly reduce the resource allocation complexity. In addition, we interpret the vehicular platoon as one-dimensional Markov chain, and derive a closed form of dissemination latency. Simulations are carried out to evaluate the performance of the proposed dynamic programming algorithm. The numerical results show that our algorithm achieves optimal solutions with cutting off the complexity by orders of magnitude, while improving dissemination rate in the vehicular platoon.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/147457