Toward Cost-Efficient Integration of Telematic Systems Using K-Spanning Tree and Clustering Algorithms
Blekinge Institute of Technology, School of Computing2011 (English)Conference paper (Refereed) Published
This article uses analytical methods to assess reductions in total costs of telematic systems that can result from common infrastructure utilization. Analytical methods based on clustering and K-minimum spanning tree can be adopted for finding clusters or sets which maximize reductions in total system costs due to infrastructure sharing between telematic systems. Efficient integration of telematic systems through infrastructure sharing can positively influence telematic service interoperability while reducing costs. Results show the measure of synergy for each K-value, as well as total cost savings of up to 2%.
Place, publisher, year, edition, pages
Washington DC: IEEE ITSC society (IEEE Xplore) , 2011.
Spanning tree, cost, telematic service, design, clustering
Mathematical Analysis Computer Science
IdentifiersURN: urn:nbn:se:bth-7359DOI: 978-1-4577-2196-0/11/$26.00 ©2011 IEEEISI: 000298654700132Local ID: oai:bth.se:forskinfo4360934DA77C833BC125797A005B2422ISBN: 978-1-4577-2196-0OAI: oai:DiVA.org:bth-7359DiVA: diva2:834966
14th International IEEE Annual Conference on Intelligent Transportation Systems Washington DC, USA, 2011
14th International IEEE Annual Conference on Intelligent Transportation Systems, Washington DC, USA, 2011. CFP11ITS-CDR2012-09-182012-01-032015-06-30Bibliographically approved