Scalable VANET content routing using hierarchical bloom filters

被引:30
作者
Yu, Yu-Ting [1 ]
Gerla, Mario [1 ]
Sanadidi, M. Y. [1 ]
机构
[1] Univ Calif Los Angeles, Dept Comp Sci, Los Angeles, CA 90095 USA
基金
美国国家科学基金会;
关键词
VANET; content routing; hierarchical routing; bloom filters;
D O I
10.1002/wcm.2495
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, we discuss scalable content-oriented routing that enables storing, sharing, and searching data totally within the urban VANET. We introduce a scalable proactive content discovery scheme, hierarchical bloom-filter routing (HBFR), to tackle mobility, large population, and rich content challenges of VANETs. Our simulation results show that HBFR achieves low latency and high content availability with relatively low overhead in practical VANET scenarios. In particular, HBFR improves the response time by up to 45% compared with the conventional Content Centric Networking (CCN) and reduces the traffic by up to 85% compared with timer-based intelligent content search. HBFR suits the popular private data services the best and also achieves low response time comparable with that of flooding-based content discovery when applying to popular public data services.Copyright (c) 2014 John Wiley & Sons, Ltd.
引用
收藏
页码:1001 / 1014
页数:14
相关论文
共 22 条
[1]  
Ahlgren Bengt., 2008, ACM CoNEXT, P1
[2]   Scalable Bloom Filters [J].
Almeida, Paulo Sergio ;
Baquero, Carlos ;
Preguica, Nuno ;
Hutchison, David .
INFORMATION PROCESSING LETTERS, 2007, 101 (06) :255-261
[3]  
[Anonymous], 2005, Internet Mathematics, DOI DOI 10.1080/15427951.2004.10129096
[4]  
[Anonymous], 2009, MILITARY COMMUNICATI
[5]  
[Anonymous], CS200006 DUK U
[6]  
[Anonymous], J AD HOC NETWORKING
[7]   Opportunistic routing in multi-hop wireless networks [J].
Biswas, S ;
Morris, R .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2004, 34 (01) :69-74
[8]   SPACE/TIME TRADE/OFFS IN HASH CODING WITH ALLOWABLE ERRORS [J].
BLOOM, BH .
COMMUNICATIONS OF THE ACM, 1970, 13 (07) :422-&
[9]   Mutable strings in Java']Java: design, implementation and lightweight text-search algorithms [J].
Boldi, P ;
Vigna, S .
SCIENCE OF COMPUTER PROGRAMMING, 2005, 54 (01) :3-23
[10]  
Breslau L, 1999, IEEE INFOCOM SER, P126, DOI 10.1109/INFCOM.1999.749260