TY - JOUR
T1 - Cache invalidation strategies for Internet-based vehicular ad hoc networks
AU - Lim, Sunho
AU - Yu, Chansu
AU - Das, Chita R.
N1 - Funding Information:
This research was supported in part by Startup Grant in Dept. of Computer Science at Texas Tech University and US National Science Foundation (NSF) under the Grants CNS-0831673 , CNS-1004210 , and CNS-0831853 , and Korea National Research Foundation (NRF) WCU Grant R31-2008-000-10100-0 . This work was published in part at the 18th International Conference on Computer Communications and Networks (ICCCN) 2009 [40] .
PY - 2012/2/1
Y1 - 2012/2/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84856519371&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84856519371&partnerID=8YFLogxK
U2 - 10.1016/j.comcom.2011.10.013
DO - 10.1016/j.comcom.2011.10.013
M3 - Article
AN - SCOPUS:84856519371
SN - 0140-3664
VL - 35
SP - 380
EP - 391
JO - Computer Communications
JF - Computer Communications
IS - 3
ER -