A novel intersection-based clustering scheme for VANET
| dc.contributor | Hong, Xiaoyan | |
| dc.contributor | Smith, Randy | |
| dc.contributor | Dixon, Bradon | |
| dc.contributor | Hainen, Alexander | |
| dc.contributor.advisor | Atkison, Travis | |
| dc.contributor.author | Lee, Michael Sutton | |
| dc.contributor.other | University of Alabama Tuscaloosa | |
| dc.date.accessioned | 2021-07-07T14:37:09Z | |
| dc.date.available | 2021-07-07T14:37:09Z | |
| dc.date.issued | 2021 | |
| dc.description | Electronic Thesis or Dissertation | en_US |
| dc.description.abstract | Currently, much attention is being placed on the development and deployment of vehicle communication technologies. Such technologies could revolutionize both navigation and entertainment systems available to drivers. However, there are still many challenges posed by this field that are in need of further investigation. One of these is the limitations on the throughput of networks created by vehicular devices. As such, it is necessary to resolve some of these network throughput issues so that vehicle communication technologies can increase the amount of information they exchange. One scheme to improve network throughput involves dividing the vehicles into subgroups called clusters. Many such clustering algorithms have been proposed, but none have yet been determined to be optimal. This dissertation puts forth a new passive clustering approach that has the key advantage of a significantly reduced overhead. The reduced overhead of passive algorithms increases the amount of the network available in which normal data transmissions can occur. The drawback to passive algorithms is their unreliable knowledge of the network which can cause them to struggle to successfully perform cluster maintenance activities. Clusters created by passive algorithms, therefore, tend to be shorter-lived and smaller than what an active clustering algorithm can maintain. In order to maintain a cluster with a low overhead and better knowledge of the network, this dissertation introduces a new clustering algorithm intended to function at intersections. This new algorithm attempts to take advantage of the decreased overhead of passive clustering algorithms while introducing a lightweight machine learning algorithm that will assist with cluster selection. | en_US |
| dc.format.extent | 132 p. | |
| dc.format.medium | electronic | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.other | u0015_0000001_0003829 | |
| dc.identifier.other | Lee_alatus_0004D_14469 | |
| dc.identifier.uri | http://ir.ua.edu/handle/123456789/7908 | |
| dc.language | English | |
| dc.language.iso | en_US | |
| dc.publisher | University of Alabama Libraries | |
| dc.relation.hasversion | born digital | |
| dc.relation.ispartof | The University of Alabama Electronic Theses and Dissertations | |
| dc.relation.ispartof | The University of Alabama Libraries Digital Collections | |
| dc.rights | All rights reserved by the author unless otherwise indicated. | en_US |
| dc.subject | Computer science | |
| dc.title | A novel intersection-based clustering scheme for VANET | en_US |
| dc.type | thesis | |
| dc.type | text | |
| etdms.degree.department | University of Alabama. Department of Computer Science | |
| etdms.degree.discipline | Computer Science | |
| etdms.degree.grantor | The University of Alabama | |
| etdms.degree.level | doctoral | |
| etdms.degree.name | Ph.D. |
Files
Original bundle
1 - 1 of 1