Event Message Clustering Algorithm for Selection of Majority Message in VANETs
The trustworthiness of nodes in Vehicular Ad-Hoc Networks (VANETs) is essential for disseminating truthful event messages. False messages may cause vehicles to behave in unintended ways, creating an unreliable transportation system. The efficiency and reliability of the transportation system can be...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2023-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10042408/ |
| _version_ | 1797904653939113984 |
|---|---|
| author | Narayan Khatri Sihyung Lee Abdul Mateen Seung Yeob Nam |
| author_facet | Narayan Khatri Sihyung Lee Abdul Mateen Seung Yeob Nam |
| author_sort | Narayan Khatri |
| collection | DOAJ |
| description | The trustworthiness of nodes in Vehicular Ad-Hoc Networks (VANETs) is essential for disseminating truthful event messages. False messages may cause vehicles to behave in unintended ways, creating an unreliable transportation system. The efficiency and reliability of the transportation system can be obtained through trustworthy vehicular nodes providing correct event messages. In a VANET, the consensus issue can be resolved by employing blockchain. Even if we employ blockchain in a VANET, the trustworthiness of each message recorded needs to be verified separately since the blockchain itself does not guarantee the trust level of each event message. For instance, when there are multiple conflicting messages associated with a single accident on the road, a vote based on majority opinion can be considered one option for making a decision regarding the accident. In this work, we design the VANET event message clustering algorithm (VEMCA) to resolve the conflicting message problem. Furthermore, we develop a simulator for the VANET environment that demonstrates how the clustering algorithm can be used for event message validation. Experimental results show that our algorithm outperforms state-of-the-art clustering algorithms in terms of accuracy, precision, recall, f1-score, and computational time. |
| first_indexed | 2024-04-10T09:52:24Z |
| format | Article |
| id | doaj.art-b80f97c79bf349d6895f494191d10f4e |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-04-10T09:52:24Z |
| publishDate | 2023-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-b80f97c79bf349d6895f494191d10f4e2023-02-17T00:00:21ZengIEEEIEEE Access2169-35362023-01-0111146211463510.1109/ACCESS.2023.324432710042408Event Message Clustering Algorithm for Selection of Majority Message in VANETsNarayan Khatri0https://orcid.org/0000-0002-2755-9395Sihyung Lee1https://orcid.org/0000-0001-7945-3763Abdul Mateen2https://orcid.org/0000-0003-1349-9579Seung Yeob Nam3https://orcid.org/0000-0001-8249-4742Department of Information and Communication Engineering, Yeungnam University, Gyeongsan, South KoreaSchool of Computer Science and Engineering, Kyungpook National University, Daegu, South KoreaDepartment of Computer Science, Federal Urdu University of Arts, Science and Technology, Islamabad, PakistanDepartment of Information and Communication Engineering, Yeungnam University, Gyeongsan, South KoreaThe trustworthiness of nodes in Vehicular Ad-Hoc Networks (VANETs) is essential for disseminating truthful event messages. False messages may cause vehicles to behave in unintended ways, creating an unreliable transportation system. The efficiency and reliability of the transportation system can be obtained through trustworthy vehicular nodes providing correct event messages. In a VANET, the consensus issue can be resolved by employing blockchain. Even if we employ blockchain in a VANET, the trustworthiness of each message recorded needs to be verified separately since the blockchain itself does not guarantee the trust level of each event message. For instance, when there are multiple conflicting messages associated with a single accident on the road, a vote based on majority opinion can be considered one option for making a decision regarding the accident. In this work, we design the VANET event message clustering algorithm (VEMCA) to resolve the conflicting message problem. Furthermore, we develop a simulator for the VANET environment that demonstrates how the clustering algorithm can be used for event message validation. Experimental results show that our algorithm outperforms state-of-the-art clustering algorithms in terms of accuracy, precision, recall, f1-score, and computational time.https://ieeexplore.ieee.org/document/10042408/VANETclustering algorithmtrustworthinessblockchainsimulator |
| spellingShingle | Narayan Khatri Sihyung Lee Abdul Mateen Seung Yeob Nam Event Message Clustering Algorithm for Selection of Majority Message in VANETs IEEE Access VANET clustering algorithm trustworthiness blockchain simulator |
| title | Event Message Clustering Algorithm for Selection of Majority Message in VANETs |
| title_full | Event Message Clustering Algorithm for Selection of Majority Message in VANETs |
| title_fullStr | Event Message Clustering Algorithm for Selection of Majority Message in VANETs |
| title_full_unstemmed | Event Message Clustering Algorithm for Selection of Majority Message in VANETs |
| title_short | Event Message Clustering Algorithm for Selection of Majority Message in VANETs |
| title_sort | event message clustering algorithm for selection of majority message in vanets |
| topic | VANET clustering algorithm trustworthiness blockchain simulator |
| url | https://ieeexplore.ieee.org/document/10042408/ |
| work_keys_str_mv | AT narayankhatri eventmessageclusteringalgorithmforselectionofmajoritymessageinvanets AT sihyunglee eventmessageclusteringalgorithmforselectionofmajoritymessageinvanets AT abdulmateen eventmessageclusteringalgorithmforselectionofmajoritymessageinvanets AT seungyeobnam eventmessageclusteringalgorithmforselectionofmajoritymessageinvanets |