18 December 2017 in IEEE Transactions on Vehicular Technology
Vehicular Content Centric Networks (VCCNs) emerge as a strong candidate to be deployed in informationrich applications of vehicular communications. Due to vehicles' mobility, it becomes rather inefficient to establish end-to-end connections in VCCNs. Consequently, content packets are usually sent back to the requesting node via different paths in VCCNs. To improve network performance of VCCNs, node mobility should be exploited for vehicles to serve as relays and to carry data for delivery. In this work, we propose a scheme called Cooperative Caching based on Mobility Prediction (CCMP) for VCCNs. The main idea of CCMP is to cache popular contents at a set of mobile nodes that may visit the same hot spot areas repeatedly. In our CCMP scheme, we use Prediction based on Partial Matching (PPM) to predict mobile nodes' probability of reaching different hot spot regions based on their past trajectories. Vehicles with longer sojourn time in a hot region can provide more services and should be preferred as caching nodes. To solve the problem of limited buffer at each node, we design a cache replacement based on content popularity to guarantee only popular contents are cached. We evaluate CCMP through the ONE simulator for its salient features in success ratio and content access delay compared to other state-of-the-art schemes.
23 June 2017 in IEEE Transactions on Intelligent Transportation Systems
It is very difficult to establish and maintain end-to-end connections in a vehicle ad hoc network (VANET) as a result of high vehicle speed, long inter-vehicle distance, and varying vehicle density. Instead, a store-and-forward strategy has been considered for vehicle communications. The success of this strategy, however, depends heavily on the cooperation among nodes. Different from exiting store-and-forward solutions, we propose predictive routing based on the hidden Markov model (PRHMM) for VANETS, which exploits the regularity of vehicle moving behaviors to increase the transmission performance. As vehicle movements often exhibit a high degree of repetition, including regular visits to certain places and regular contacts during daily activities, we can predict a vehicle's future locations based on the knowledge of past traces and the hidden Markov model. Consequently, the short-term route of a vehicle and its packet delivery probability for a specific mobile destination can be predicted. Moreover, PRHMM enables seamless handoff between vehicle-to-vehicle and vehicle-to-infrastructure communications so that the transmission performance will not be constrained by the vehicle density and moving speed. Simulation evaluation demonstrates that PRHMM performs much better in terms of delivery ratio, end-to-end delay, traffic overhead, and buffer occupancy.
1 October 2019 in IEEE Transactions on Mobile Computing
Communications in vehicular ad-hoc network (VANET) are subject to performance degradation as results of channel fading and intermittent network connectivity. The emerging Vehicular Content Centric Network (VCCN) is promising in supporting the needs of contents and alleviating the communication problems in VANET. Specifically, to improve the cache hit ratio and reduce the access delay of content retrieval, it helps to choose the appropriate vehicles to cache the frequently accessed data items. In this paper, we propose a Cooperative Caching scheme based on Social Attributes and Mobility Prediction (CCSAMP) for VCCN. CCSAMP is based on the observation that vehicles move around and are liable to contact each other according to drivers' common interests or social similarities. A caching node sharing more social attributes with the content requester is more likely to be interested in the same contents and distribute the contents to others with similar interests. Furthermore, a caching node that frequently meets other nodes is a better candidate to keep cache copies. CCSAMP also exploits the regularity of vehicle moving behaviors to predict the chance for a vehicle to reach hot zones based on Hidden Markov Model (HMM). We evaluate CCSAMP through the ONE simulator to demonstrate its higher performance.
16 October 2018 in IEEE Transactions on Dependable and Secure Computing
Named Data Network (NDN), as a promising information-centric networking architecture, is expected to support next-generation of large-scale content distribution with open in-network cachings. However, such open in-network caches are vulnerable against Cache Pollution Attacks (CPAs) with the goal of filling cache storage with non-popular contents. The detection and defense against such attacks are especially difficult because of CPA's similarities with normal fluctuations of content requests. In this work, we use a clustering technique to detect and defend against CPAs. By clustering the content interests, our scheme is able to distinguish whether they have followed the Zipf-like distribution or not for accurate detections. Once any attack is detected, an attack table will be updated to record the abnormal requests. While such requests are still forwarded, the corresponding content chunks are not cached. Extensive simulations in ndnSIM demonstrate that our scheme can resist CPA effectively with higher cache hit, higher detecting ratio, lower hop count, and lower algorithm complexity compared to other state-of-the-art schemes.
1 May 2015 in The Journal of Supercomputing
9 May 2022 in IEEE Transactions on Intelligent Transportation Systems
In order to mitigate the performance degradation of intermittent vehicular network caused by traffic mobility and sporadic connectivity issues, Vehicular Content Centric Network (VCCN) has been proposed to apply many technologies in Content Centric Network (CCN) into vehicular ad hoc networks. The open in-network caching strategy of CCN enables sharing and coordination of the cached data among multiple nodes as an efficient data access without relying on remote fetching. Nonetheless, few studies have considered the effective use of overall cache capacity with these cooperative nodes, especially the issues of cache duplication. Furthermore, most content replacement polices have ignored the needs of cooperative contents when making cache decisions. In this paper, we design a novel Cooperative Caching scheme by using Mobility Prediction and Consistent Hash for VCCN (called CCMPCH). Specifically, based on the observation that vehicles with the same trajectory are more likely to maintain stable communication links, we adopt Prediction by Partial Matching (PPM) to forecast each vehicle's path and cluster the vehicles with similar future path, moving direction, and moving speed into one group. In each cluster, the consistent hash algorithm is used to allocate contents among cooperative nodes, thereby reducing unnecessary cache duplication while maintaining strong content availability. A popularity-based cache replacement policy is also developed to prioritize cooperative contents. We evaluate CCMPCH via extensive simulations, which demonstrates its higher cache hit ratio, shorter content access delay, and lower hop count compared to other state-of-the-art schemes.