Literature Database Entry


Florian Hagenauer, Christoph Sommer, Simon Merschjohann, Takamasa Higuchi, Falko Dressler and Onur Altintas, "Cars as the Base for Service Discovery and Provision in Highly Dynamic Networks," Proceedings of 35th IEEE Conference on Computer Communications (INFOCOM 2016), Demo Session, San Francisco, CA, April 2016, pp. 358–359.


In the smart cities of tomorrow huge amounts of data have to be processed. Cellular networks alone are unlikely to be able to cope with the amount of data and would introduce a critical dependence. Cars, on the other hand, are ubiquitous - even after massive disasters - and will be equipped with abundant communication technologies. This makes them a salient basis for connecting users and machines of smart cities. Discovery and providing services in such a highly dynamic network is a challenging task. We tackle this problem in our Car4ICT architecture which could be shown to work very well in simulations. The next logical step is to investigate the performance in experiments. To perform experiments we built a prototype which is able to emulate multiple vehicles on just a few machines. We show the feasibility of the proposed service discovery protocol and our emulation approach.

Quick access

Original Version DOI (at publishers web site)
Authors' Version PDF (PDF on this web site)
BibTeX BibTeX


Florian Hagenauer
Christoph Sommer
Simon Merschjohann
Takamasa Higuchi
Falko Dressler
Onur Altintas

BibTeX reference

    author = {Hagenauer, Florian and Sommer, Christoph and Merschjohann, Simon and Higuchi, Takamasa and Dressler, Falko and Altintas, Onur},
    doi = {10.1109/INFCOMW.2016.7562101},
    title = {{Cars as the Base for Service Discovery and Provision in Highly Dynamic Networks}},
    pages = {358--359},
    publisher = {IEEE},
    address = {San Francisco, CA},
    booktitle = {35th IEEE Conference on Computer Communications (INFOCOM 2016), Demo Session},
    month = {4},
    year = {2016},

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at

This page was automatically generated using BibDB and bib2web.