Toward Cost-Efficient Integration of Telematic Systems Using K-Spanning Tree and Clustering Algorithms
| Document type: | Conference Papers |
|---|---|
| Peer reviewed: | Yes |
| Full text: | |
| Author(s): | Gideon Mbiydzenyuy, Jan A. Persson, Paul Davidsson |
| Title: | Toward Cost-Efficient Integration of Telematic Systems Using K-Spanning Tree and Clustering Algorithms |
| Conference name: | 14th International IEEE Annual Conference on Intelligent Transportation Systems Washington DC, USA, 2011 |
| Year: | 2011 |
| Pagination: | 803-808 |
| ISBN: | 978-1-4577-2196-0 |
| Publisher: | IEEE ITSC society (IEEE Xplore) |
| City: | Washington DC |
| URI/DOI: | 978-1-4577-2196-0/11/$26.00 ©2011 IEEE |
| ISI number: | 000298654700132 |
| Organization: | Blekinge Institute of Technology |
| Department: | School of Computing (Sektionen för datavetenskap och kommunikation) School of Computing S-371 79 Karlskrona +46 455 38 50 00 http://www.bth.se/com |
| Authors e-mail: | gideon.mbiydzenyuy@bth.se, jan.persson@bth.se, paul.davidsson@bth.se |
| Language: | English |
| 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%. |
| Subject: | Computer Science\General Mathematics\Discrete Mathematics Computer Science\Artificial Intelligence |
| Keywords: | Spanning tree, cost, telematic service, design, clustering |
| Note: | 14th International IEEE Annual Conference on Intelligent Transportation Systems, Washington DC, USA, 2011. CFP11ITS-CDR |
