Skip to main content
Erschienen in: Soft Computing 11/2020

03.04.2020 | Focus

Applying improved K-means algorithm into official service vehicle networking environment and research

verfasst von: Xiangxi Meng, Jianghua Lv, Shilong Ma

Erschienen in: Soft Computing | Ausgabe 11/2020

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In order to improve the traffic efficiency of official vehicles in the traffic road network, a backpressure routing control strategy for multi-commodity flow (official traffic flow) using official vehicle network environmental data information is proposed. Firstly, the road network composed of official service vehicle-mounted wireless network nodes is used to collect information on road conditions and official service vehicles. In order to improve the real-time and forward-looking route control, an official service vehicle flow forecasting method is introduced to construct a virtual official service vehicle queue. A multi-commodity flow (official service vehicle flow) backpressure route method is proposed, and an official service vehicle control strategy is designed to improve the self-adaptive route of K-means algorithm. In addition, the weight of backpressure strategy is improved according to traffic pressure conditions, and the adaptability of backpressure route algorithm is improved by using optimized parameters. Finally, the simulation results show that the proposed method can effectively control traffic vehicles and improve traffic smoothness.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literatur
Zurück zum Zitat Arzoo MK, Prof A, Rathod K (2017) K-means algorithm with different distance metrics in spatial data mining with uses of NetBeans IDE 8.2. Int Res J Eng Technol 4(4):2363–2368 Arzoo MK, Prof A, Rathod K (2017) K-means algorithm with different distance metrics in spatial data mining with uses of NetBeans IDE 8.2. Int Res J Eng Technol 4(4):2363–2368
Zurück zum Zitat Chen L, Ye F, Ruan Y et al (2018) An algorithm for highway vehicle detection based on convolutional neural network. EURASIP J Image Video Process 2018(1):109CrossRef Chen L, Ye F, Ruan Y et al (2018) An algorithm for highway vehicle detection based on convolutional neural network. EURASIP J Image Video Process 2018(1):109CrossRef
Zurück zum Zitat Cohen-Addad V, Klein PN, Mathieu C (2019) Local search yields approximation schemes for k-means and k-median in euclidean and minor-free metrics. SIAM J Comput 48(2):644–667MathSciNetMATHCrossRef Cohen-Addad V, Klein PN, Mathieu C (2019) Local search yields approximation schemes for k-means and k-median in euclidean and minor-free metrics. SIAM J Comput 48(2):644–667MathSciNetMATHCrossRef
Zurück zum Zitat Deng J, Tyson G, Cuadrado F et al (2019) Keddah: network evaluation powered by simulating distributed application traffic. ACM Trans Model Comput Simul 29(3):16CrossRef Deng J, Tyson G, Cuadrado F et al (2019) Keddah: network evaluation powered by simulating distributed application traffic. ACM Trans Model Comput Simul 29(3):16CrossRef
Zurück zum Zitat Ferrandez SM, Harbison T, Weber T et al (2016) Optimization of a truck-drone in tandem delivery network using k-means and genetic algorithm. JIEM 9(2):374–388CrossRef Ferrandez SM, Harbison T, Weber T et al (2016) Optimization of a truck-drone in tandem delivery network using k-means and genetic algorithm. JIEM 9(2):374–388CrossRef
Zurück zum Zitat Friggstad Z, Rezapour M, Salavatipour MR (2019) Local search yields a PTAS for k-means in doubling metrics. SIAM J Comput 48(2):452–480MathSciNetMATHCrossRef Friggstad Z, Rezapour M, Salavatipour MR (2019) Local search yields a PTAS for k-means in doubling metrics. SIAM J Comput 48(2):452–480MathSciNetMATHCrossRef
Zurück zum Zitat Han G, Yang X, Liu L et al (2017) A joint energy replenishment and data collection algorithm in wireless rechargeable sensor networks. IEEE Internet Things J 5(4):2596–2604CrossRef Han G, Yang X, Liu L et al (2017) A joint energy replenishment and data collection algorithm in wireless rechargeable sensor networks. IEEE Internet Things J 5(4):2596–2604CrossRef
Zurück zum Zitat Hussain I, Bingcai C (2017) Cluster formation and cluster head selection approach for vehicle ad-hoc network (VANETs) using K-means and floyd-Warshall technique. Int J Adv Comput Sci Appl 8(12):11–15 Hussain I, Bingcai C (2017) Cluster formation and cluster head selection approach for vehicle ad-hoc network (VANETs) using K-means and floyd-Warshall technique. Int J Adv Comput Sci Appl 8(12):11–15
Zurück zum Zitat Inam M, Li Z, Ali A et al (2019) A novel protocol for vehicle cluster formation and vehicle head selection in vehicular ad-hoc networks. Int J Electron Inf Eng 10(2):103–119 Inam M, Li Z, Ali A et al (2019) A novel protocol for vehicle cluster formation and vehicle head selection in vehicular ad-hoc networks. Int J Electron Inf Eng 10(2):103–119
Zurück zum Zitat Karagiannis D, Argyriou A (2018) Jamming attack detection in a pair of RF communicating vehicles using unsupervised machine learning. Veh Commun 13:56–63 Karagiannis D, Argyriou A (2018) Jamming attack detection in a pair of RF communicating vehicles using unsupervised machine learning. Veh Commun 13:56–63
Zurück zum Zitat Liang TY, Li YJ (2017) A location-aware service deployment algorithm based on K-means for cloudlets. Mob Inf Syst 2017:1–10 Liang TY, Li YJ (2017) A location-aware service deployment algorithm based on K-means for cloudlets. Mob Inf Syst 2017:1–10
Zurück zum Zitat Lin L, Chen J, Qu DY et al (2019) Study on traffic state discrimination method based on K-means clustering algorithm. J Qingdao Univ Technol 40(4):109–114 Lin L, Chen J, Qu DY et al (2019) Study on traffic state discrimination method based on K-means clustering algorithm. J Qingdao Univ Technol 40(4):109–114
Zurück zum Zitat Luan WB, Wang L, Zhang N et al (2018) Daily classification of urban rail transit operation characteristics based on data clustering technology. Urban Rail Transit Res 4:14–17 Luan WB, Wang L, Zhang N et al (2018) Daily classification of urban rail transit operation characteristics based on data clustering technology. Urban Rail Transit Res 4:14–17
Zurück zum Zitat Maciejewski M, Bischoff J, Kai N (2016) An assignment-based approach to efficient real-time city-scale taxi dispatching. IEEE Intell Syst 31(1):68–77CrossRef Maciejewski M, Bischoff J, Kai N (2016) An assignment-based approach to efficient real-time city-scale taxi dispatching. IEEE Intell Syst 31(1):68–77CrossRef
Zurück zum Zitat Mohanty A, Mahapatra S, Bhanja U (2019) Traffic congestion detection in a city using clustering techniques in VANETs. Indones J Electr Eng Comput Sci 13(2):884–891CrossRef Mohanty A, Mahapatra S, Bhanja U (2019) Traffic congestion detection in a city using clustering techniques in VANETs. Indones J Electr Eng Comput Sci 13(2):884–891CrossRef
Zurück zum Zitat Nawrin S, Rahman MR, Akhter S (2017) Exploreing k-means with internal validity indexes for data clustering in traffic management system. Int J Adv Comput Sci Appl 8(3):264–268 Nawrin S, Rahman MR, Akhter S (2017) Exploreing k-means with internal validity indexes for data clustering in traffic management system. Int J Adv Comput Sci Appl 8(3):264–268
Zurück zum Zitat Peng Y, Liu X, Shen C et al (2019) An improved optical flow algorithm based on mask-R-CNN and K-means for velocity calculation. Appl Sci 9(14):2808CrossRef Peng Y, Liu X, Shen C et al (2019) An improved optical flow algorithm based on mask-R-CNN and K-means for velocity calculation. Appl Sci 9(14):2808CrossRef
Zurück zum Zitat Pholsena K, Pan L (2018) Traffic status evaluation based on possibilistic fuzzy C-means clustering algorithm. In: 2018 IEEE third international conference on data science in cyberspace (DSC). IEEE Pholsena K, Pan L (2018) Traffic status evaluation based on possibilistic fuzzy C-means clustering algorithm. In: 2018 IEEE third international conference on data science in cyberspace (DSC). IEEE
Zurück zum Zitat Qi H, Li J, Di X et al (2019) Improved K-means clustering algorithm and its applications. Recent Patents Eng 13(4):403–409CrossRef Qi H, Li J, Di X et al (2019) Improved K-means clustering algorithm and its applications. Recent Patents Eng 13(4):403–409CrossRef
Zurück zum Zitat Ramalingam M, Thangarajan R (2020) Mutated k-means algorithm for dynamic clustering to perform effective and intelligent broadcasting in medical surveillance using selective reliable broadcast protocol in VANET. Comput Commun 150:563–568CrossRef Ramalingam M, Thangarajan R (2020) Mutated k-means algorithm for dynamic clustering to perform effective and intelligent broadcasting in medical surveillance using selective reliable broadcast protocol in VANET. Comput Commun 150:563–568CrossRef
Zurück zum Zitat Sharma DK, Dhurandher SK, Agarwal D et al (2019) kROp: k-Means clustering based routing protocol for opportunistic networks. J Ambient Intell Hum Comput 10(4):1289–1306CrossRef Sharma DK, Dhurandher SK, Agarwal D et al (2019) kROp: k-Means clustering based routing protocol for opportunistic networks. J Ambient Intell Hum Comput 10(4):1289–1306CrossRef
Zurück zum Zitat Taherkhani N, Pierre S (2016) Centralized and localized data congestion control strategy for vehicular ad hoc networks using a machine learning clustering algorithm. IEEE Trans Intell Transp Syst 17(11):3275–3285CrossRef Taherkhani N, Pierre S (2016) Centralized and localized data congestion control strategy for vehicular ad hoc networks using a machine learning clustering algorithm. IEEE Trans Intell Transp Syst 17(11):3275–3285CrossRef
Zurück zum Zitat Velea R, Ciobanu C, Margarit L et al (2017) Network traffic anomaly detection using shallow packet inspection and parallel k-means data clustering. Stud Inform Control 26(4):387–396CrossRef Velea R, Ciobanu C, Margarit L et al (2017) Network traffic anomaly detection using shallow packet inspection and parallel k-means data clustering. Stud Inform Control 26(4):387–396CrossRef
Zurück zum Zitat Venkatesh G, Arunesh K (2019) Map reduce for big data processing based on traffic aware partition and aggregation. Clust Comput 22(5):12909–12915CrossRef Venkatesh G, Arunesh K (2019) Map reduce for big data processing based on traffic aware partition and aggregation. Clust Comput 22(5):12909–12915CrossRef
Zurück zum Zitat Wang X, Li J, Shang X (2019) The state subdivision of public traffic vehicles based on K-means algorithm. Int J Manuf Technol Manag 33(3–4):133–149 Wang X, Li J, Shang X (2019) The state subdivision of public traffic vehicles based on K-means algorithm. Int J Manuf Technol Manag 33(3–4):133–149
Metadaten
Titel
Applying improved K-means algorithm into official service vehicle networking environment and research
verfasst von
Xiangxi Meng
Jianghua Lv
Shilong Ma
Publikationsdatum
03.04.2020
Verlag
Springer Berlin Heidelberg
Erschienen in
Soft Computing / Ausgabe 11/2020
Print ISSN: 1432-7643
Elektronische ISSN: 1433-7479
DOI
https://doi.org/10.1007/s00500-020-04893-w

Weitere Artikel der Ausgabe 11/2020

Soft Computing 11/2020 Zur Ausgabe