hagenauer2017parked
Abstract
Vehicular networks are envisioned to cover various use cases from safety related applications to infotainment. While there exist standardized solutions for exchanging single messages in a geographical area, coping with longer lasting ows of messages is more difficult. Developed solutions may require high node densities for fast delivery or even require pre-installed infrastructure (e.g., road side units). In this paper, we present a concept where we exploit parked cars to form a virtual network infrastructure. In particular, we form clusters representing a virtual road side unit spanning a relatively large geographical area. To reduce the channel load, we select a subset of the parked cars as active gateways to the cluster. This is done in a way to ensure that the connectivity to the cluster is not impaired. We evaluate the proposed algorithm using the Car4ICT architecture, a concept that enables cars in smart cities to discover and use various kinds of services.
Quick access
- Original Version (free download, provided by ACM Author-Izer)
- Original Version (at publishers web site)
- Authors' Version (PDF on this web site)
- BibTeX
Contact
- Florian Hagenauer
- Christoph Sommer
- Takamasa Higuchi
- Onur Altintas
- Falko Dressler
BibTeX reference
@inproceedings{hagenauer2017parked,
author = {Hagenauer, Florian and Sommer, Christoph and Higuchi, Takamasa and Altintas, Onur and Dressler, Falko},
title = {{Parked Cars as Virtual Network Infrastructure: Enabling Stable V2I Access for Long-Lasting Data Flows}},
booktitle = {23rd ACM International Conference on Mobile Computing and Networking (MobiCom 2017), 2nd ACM International Workshop on Smart, Autonomous, and Connected Vehicular Systems and Services (CarSys 2017)},
address = {Snowbird, UT},
doi = {10.1145/3131944.3131952},
month = {October},
pages = {57--64},
publisher = {ACM},
year = {2017},
}
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 permissions@acm.org.
The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.
The following applies to all papers listed above that have IFIP copyrights: © IFIP, (YEAR). This is the author's version of the work. It is posted here by permission of IFIP for your personal use. Not for redistribution. The definitive version was published in PUBLICATION, {VOL#, ISS#, (DATE)}, http://IFIP DL URL.