Cache invalidation strategies for Internet-based vehicular ad hoc networks

被引:14
作者
Lim, Sunho [1 ]
Yu, Chansu [2 ,4 ]
Das, Chita R. [3 ]
机构
[1] Texas Tech Univ, Dept Comp Sci, Lubbock, TX 79409 USA
[2] Cleveland State Univ, Dept Elect & Comp Engn, Cleveland, OH 44115 USA
[3] Penn State Univ, Dept Comp Sci & Engn, University Pk, PA 16802 USA
[4] POSTECH, WCU Div IT Convergence Engn, Pohang, South Korea
基金
新加坡国家研究基金会; 美国国家科学基金会;
关键词
Cache invalidation; Data access; Internet-based vehicular ad hoc networks; ACCESS;
D O I
10.1016/j.comcom.2011.10.013
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Internet-based vehicular ad hoc network (IVANET) is an emerging technique that combines a wired Internet and a vehicular ad hoc network (VANET) for developing an ubiquitous communication infrastructure and improving universal information and service accessibility. A key design optimization technique in IVANETS is to cache the frequently accessed data items in a local storage of vehicles. Since vehicles are not critically limited by the storage/memory space and power consumption, selecting proper data items for caching is not very critical. Rather, an important design issue is how to keep the cached copies valid when the original data items are updated. This is essential to provide fast access to valid data for fast moving vehicles. in this paper, we propose a cooperative cache invalidation (CCI) scheme and its enhancement (ECCI) that take advantage of the underlying location management scheme to reduce the number of broadcast operations and the corresponding query delay. We develop an analytical model for CCI and ECCI techniques for fasthand estimate of performance trends and critical design parameters. Then, we modify two prior cache invalidation techniques to work in IVANETS: a poll-each-read (PER) scheme, and an extended asynchronous (EAS) scheme. We compare the performance of four cache invalidation schemes as a function of query interval, cache update interval, and data size through extensive simulation. Our simulation results indicate that the proposed schemes can reduce the query delay up to 69% and increase the cache hit rate up to 57%, and have the lowest communication overhead compared to the prior PER and EAS schemes. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码:380 / 391
页数:12
相关论文
共 40 条
  • [1] [Anonymous], 2009, ICIS 2009 P
  • [2] [Anonymous], 2003, P 4 ACM INT S MOB AD
  • [3] [Anonymous], CSIM USER GUIDES
  • [4] [Anonymous], DEDICATED SHORT RANG
  • [5] [Anonymous], 1949, Human behaviour and the principle of least-effort
  • [6] [Anonymous], P IEEE INFOCOM
  • [7] BARBARA D, 1994, ACM SIGMOD, P1
  • [8] Breslau L, 1999, IEEE INFOCOM SER, P126, DOI 10.1109/INFCOM.1999.749260
  • [9] Bychkovsky V, 2006, MOBICOM 2006, P50
  • [10] Update-based cache access and replacement in wireless data access
    IEEE
    不详
    不详
    不详
    [J]. IEEE Trans. Mob. Comput., 2006, 12 (1734-1748): : 1734 - 1748