• DocumentCode
    2368733
  • Title

    Toward cost-efficient integration of telematic systems using K-spanning tree and clustering algorithms

  • Author

    Mbiydzenyuy, Gideon ; Persson, Jan A. ; Davidsson, Paul

  • Author_Institution
    Blekinge Inst. of Technol./Comput., Karlshamn, Sweden
  • fYear
    2011
  • fDate
    5-7 Oct. 2011
  • Firstpage
    803
  • Lastpage
    808
  • Abstract
    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%.
  • Keywords
    pattern clustering; transportation; trees (mathematics); K-spanning tree; clustering algorithms; infrastructure sharing; telematic service interoperability; telematic systems; Algorithm design and analysis; Clustering algorithms; Equations; Mathematical model; Monitoring; Roads; Telematics;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Intelligent Transportation Systems (ITSC), 2011 14th International IEEE Conference on
  • Conference_Location
    Washington, DC
  • ISSN
    2153-0009
  • Print_ISBN
    978-1-4577-2198-4
  • Type

    conf

  • DOI
    10.1109/ITSC.2011.6082957
  • Filename
    6082957