Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • 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, (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 Science
Identifiers
URN: 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-0 (print)OAI: oai:DiVA.org:bth-7359DiVA: diva2:834966
Conference
14th International IEEE Annual Conference on Intelligent Transportation Systems Washington DC, USA, 2011
Note
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: 2015-06-30Bibliographically approved

Open Access in DiVA

fulltext(1081 kB)86 downloads
File information
File name FULLTEXT01.pdfFile size 1081 kBChecksum SHA-512
c6e64c2f21b4d43f124aa32dbfdafc9ea9134b49479838a36ed8b560ce8b2fbb1e5ed4aba3b3b142970927812b7403bb8e1f039aee18154662b9fecbc71fd731
Type fulltextMimetype application/pdf

Other links

Publisher's full text
Mathematical AnalysisComputer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 86 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 26 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf