The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Centralized and Localized Data Congestion Control Strategy for Vehicular Ad Hoc Networks Using a Machine Learning Clustering Algorithm
Abstract
In an urban environment, intersections are critical locations in terms of road crashes and number of killed or injured people. Vehicular ad hoc networks (VANETs) can help reduce the traffic collisions at intersections by sending warning messages to the vehicles. However, the performance of VANETs should be enhanced to guarantee delivery of the messages, particularly safety messages to the destination. Data congestion control is an efficient way to decrease packet loss and delay and increase the reliability of VANETs. In this paper, a centralized and localized data congestion control strategy is proposed to control data congestion using roadside units (RSUs) at intersections. The proposed strategy consists of three units for detecting congestion, clustering messages, and controlling data congestion. In this strategy, the channel usage level is measured to detect data congestion in the channels. The messages are gathered, filtered, and then clustered by machine learning algorithms. K-means algorithm clusters the messages based on message size, validity of messages, and type of messages. The data congestion control unit determines appropriate values of transmission range and rate, contention window size, and arbitration interframe spacing for each cluster. Finally, RSUs at the intersections send the determined communication parameters to the vehicles stopped before the red traffic lights to reduce communication collisions. Simulation results show that the proposed strategy significantly improves the delay, throughput, and packet loss ratio in comparison with other congestion control strategies using the proposed congestion control strategy.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Algorithm AS 136: A K-Means Clustering Algorithm
Hartigan, J. A., & Wong, M. A. (1979) · Applied Statistics · doi:10.2307/2346830 · Cited by 14,523
Genetic Algorithms and Machine Learning
Goldberg, D. E., & Holland, J. H. (1988) · Machine Learning · doi:10.1023/a:1022602019183 · Cited by 3,193 · cited 1×
“…means for classifying and clustering the large data sets due to their specific abilities such as short computing time, supporting the huge amount of data, automatically detecting pattern in data, predicting future data using the uncovered patterns, and planning to collect more data [41], [42].”
BackgroundVehicle-to-Vehicle Communication: Fair Transmit Power Control for Safety-Critical Information
Torrent-Moreno, M., Mittag, J., Santi, P., & Hartenstein, H. (2009) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2009.2017545 · Cited by 562 · cited 1×
“However, high transmission rate may saturate the channels increasing the load of channels [53].”
Background
Cited by
6G and Beyond: The Future of Wireless Communications Systems
Akyildiz, I. F., Kak, A., & Nie, S. (2020) · IEEE Access · doi:10.1109/access.2020.3010896 · Cited by 1,385
Survey on 6G Frontiers: Trends, Applications, Requirements, Technologies and Future Research
Alwis, C. D., Kalla, A., Pham, Q.-V., Kumar, P., Dev, K., Hwang, W.-J., & Liyanage, M. (2021) · IEEE Open Journal of the Communications Society · doi:10.1109/ojcoms.2021.3071496 · Cited by 788
Xu, Y., Gui, G., Gacanin, H., & Adachi, F. (2021) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2021.3059896 · Cited by 648
Future Intelligent and Secure Vehicular Network Toward 6G: Machine-Learning Approaches
Tang, F., Kawamoto, Y., Kato, N., & Liu, J. (2020) · Proceedings of the IEEE · doi:10.1109/jproc.2019.2954595 · Cited by 620
“In the related works, the unsupervisedlearning is exploited for the clustering of the blocks in the vehicular network [107].”
MethodMorocho-Cayamcela, M. E., Lee, H., & Lim, W. (2019) · IEEE Access · doi:10.1109/access.2019.2942390 · Cited by 418
Cybersecurity challenges in vehicular communications
El-Rewini, Z., Sadatsharan, K., Selvaraj, D. F., Plathottam, S. J., & Ranganathan, P. (2020) · Vehicular Communications · doi:10.1016/j.vehcom.2019.100214 · Cited by 326
Artificial Intelligence for Vehicle-to-Everything: A Survey
Tong, W., Hussain, A., Bo, W. X., & Maharjan, S. (2019) · IEEE Access · doi:10.1109/access.2019.2891073 · Cited by 320
Machine learning for vehicular networks: Recent advances and application examples
Ye, H., Liang, L., Ye Li, G., Kim, J., Lu, L., & Wu, M. (2018) · IEEE Vehicular Technology Magazine · doi:10.1109/mvt.2018.2811185 · Cited by 303
Qayyum, A., Usama, M., Qadir, J., & Al-Fuqaha, A. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2975048 · Cited by 257
“…Markov models Zeng et al. [64] Recursive least squares Karami et al. [65] Network congestion control Feed forward neural network Taherkhani et al. [66] k-means clustering Li et al. [67] Load balancing Reinforcement learning Taylor et al. [68] Network security LSTM Zheng et al. [69] Virtual…”
BackgroundMachine learning for next-generation intelligent transportation systems: A survey
Yuan, T., Da Rocha Neto, W., Rothenberg, C. E., Obraczka, K., Barakat, C., & Turletti, T. (2022) · Transactions on Emerging Telecommunications Technologies · doi:10.1002/ett.4427 · Cited by 179
“Network [127-129] Cluster or rank network messages or nodes.”
BackgroundMethodChen, J., Li, K., & Yu, P. S. (2022) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2021.3105682 · Cited by 116
Modeling Quality of IoT Experience in Autonomous Vehicles
Minovski, D., Ahlund, C., & Mitra, K. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2020.2975418 · Cited by 59
“For vehicular cases, Taherkhani and Pierre [80] reviewed other solutions for estimating network congestions in crowded intersections.”
Backgrounddo Vale Saraiva, T., Girardi, R., & Campos, C. A. V. (2021) · 2021 IEEE 94th Vehicular Technology Conference (VTC2021-Fall) · doi:10.1109/vtc2021-fall52928.2021.9625538 · Cited by 6
Network Performance Analysis of Content Delivery for V2R Communication in VANET Urban Mobility
Ramli, N. I., Shawal, S., Ibrahim, M. F., & Rawi, M. I. M. (2021) · 2021 IEEE International Conference on Computing (ICOCO) · doi:10.1109/icoco53166.2021.9673560 · Cited by 2
Metadata
- Authors
- Taherkhani, N., & Pierre, S.
- Venue
- IEEE Transactions on Intelligent Transportation Systems
- Published
- 2016-11
- Volume
- 17
- Issue
- 11
- Pages
- 3275-3285
- ISSN
- 1524-9050 (ISSN-L)
- 1558-0016
- OpenAlex
- W2342712621
- Cited by
- 198
- References
- 3
- FWCI
- 7.93
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.