Literature Database Entry

yu2012content


Yu-Ting Yu, T. Punihaole, Mario Gerla and M.Y. Sanadidi, "Content routing in the Vehicle Cloud," Proceedings of IEEE Military Communications Conference (MILCOM 2012), Orlando, FL, October 2012, pp. 1–6.


Abstract

The advance of vehicle technology has brought to us the concept of Vehicle Cloud (VC). When Vehicle-to-Infrastructure (V2I) communications are unavailable, have failed or are too costly, Vehicle-to-Vehicle (V2V) communications fill the gap enabling VC services. In this paper, we discuss an important VC service, content-based routing, that allows future VC applications to store, share and discovery, search data totally within the Cloud. We review the critical issues of content and forwarding in a content-based VC. Moreover, we introduce Bloom-Filter Routing (BFR), a proactive content discovery scheme for popular contents, to tackle the mobility and large content population challenges. BFR is compared to popular reactive content discovery schemes in practical VANET scenarios. The results show that proactive content discovery (i.e. BFR) suits non-sharable data, while reactive content discovery works well with popular sharable data. Consequently, we propose an adaptive hybrid approach that combines proactive and strategies., reactive

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX

Contact

Yu-Ting Yu
T. Punihaole
Mario Gerla
M.Y. Sanadidi

BibTeX reference

@inproceedings{yu2012content,
    author = {Yu, Yu-Ting and Punihaole, T. and Gerla, Mario and Sanadidi, M.Y.},
    doi = {10.1109/MILCOM.2012.6415878},
    title = {{Content routing in the Vehicle Cloud}},
    pages = {1--6},
    publisher = {IEEE},
    address = {Orlando, FL},
    booktitle = {IEEE Military Communications Conference (MILCOM 2012)},
    month = {10},
    year = {2012},
   }
   
   

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.

This page was automatically generated using BibDB and bib2web.