Change search
CiteExportLink to record
Permanent link

Direct link
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Toward Cost-Efficient Integration of Telematic Systems Using K-Spanning Tree and Clustering Algorithms
Responsible organisation
2011 (English)Conference paper, Published paper (Refereed) Published
Abstract [en]

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.
Keyword [en]
Spanning tree, cost, telematic service, design, clustering
National Category
Mathematical Analysis Computer Sciences
URN: urn:nbn:se:bth-7359DOI: 978-1-4577-2196-0/11/$26.00 ©2011 IEEEISI: 000298654700132Local ID: 978-1-4577-2196-0 (print)OAI: 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-CDRAvailable from: 2012-09-18 Created: 2012-01-03 Last updated: 2018-01-11Bibliographically approved

Open Access in DiVA

fulltext(1081 kB)