scholarly journals Node Value and Content Popularity-Based Caching Strategy for Massive VANETs

2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Jinyuan Gu ◽  
Yancheng Ji ◽  
Wei Duan ◽  
Guoan Zhang
Keyword(s):  
High Speed ◽  
Network Performance ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Smart Cities ◽  
Dynamic Environment ◽  
Privacy And Security ◽  
Hop Count ◽  
Caching Strategy ◽  
Content Popularity

The high-speed dynamic environment and massive information transmitted via wireless communications in the vehicular ad hoc networks (VANETs) pose a great challenge to privacy and security. To overcome this issue, use of the content-centric networking (CCN) provides a potential and practical solution. In-network caching is a main feature for future smart cities, in which the content is mainly placed in network nodes. Therefore, how to effectively select the cache locality and cache content is essential to improve the overall network performance, which is an inevitable trend. With these observations, this article proposes a caching strategy based on the node value and content popularity (NVCP) for the massive VANET scenario. In the proposed NVCP scheme, different from the traditional caching strategies, we evaluate the node value from three aspects: the connectivity, intermediary, and eigenvector centralities, synthetically, since the content with different types of popularity is placed in nodes with different values, resulting in the redundancy deterioration and diversity improvement for the content. The proposed caching strategy is evaluated by the stochastic network topology with multifactors, which provides different impacts on the system performance. Simulation results show that the NVCP outperforms the traditional cache strategies for 6G-CCN in terms of the cache hit ratio, average hop count, and transmission latency. Moreover, placing the content in the neighbor nodes is also introduced to further improve the utilization of the cache space and achieve better cache performance.

scholarly journals Cooperation Promotion from the Perspective of Behavioral Economics: An Incentive Mechanism Based on Loss Aversion in Vehicular Ad-Hoc Networks

Electronics ◽  
2021 ◽  
Vol 10 (3) ◽  
pp. 225 ◽  
Author(s):  
Jiaqi Liu ◽  
Shiyue Huang ◽  
Hucheng Xu ◽  
Deng Li ◽  
Nan Zhong ◽  
...  
Keyword(s):  
Ad Hoc Networks ◽  
Loss Aversion ◽  
High Speed ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Incentive Mechanism ◽  
Final Decision ◽  
The Incentive Mechanism ◽  
Hoc Networks

As a special mobile ad-hoc network, Vehicular Ad-hoc Networks (VANETs) have the characteristics of high-speed movement, frequent topology changes, multi-hop routing, a lack of energy, storage space limitations, and the possible selfishness of the nodes. These characteristics bring challenges to the design of the incentive mechanism in VANETs. In the current research on the incentive mechanism of VANETs, the mainstream is the reward-based incentive mechanism. Most of these mechanisms are designed based on the expected utility theory of traditional economics and assume that the positive and negative effects produced by an equal amount of gain and loss are equal in absolute value. However, the theory of loss aversion points out that the above effects are not equal. Moreover, this will lead to a deviation between the final decision-making behavior of nodes and the actual optimal situation. Therefore, this paper proposed a Loss-Aversion-based Incentive Mechanism (LAIM) to promote the comprehensive perception and sharing of information in the VANETs. This paper designs the incentive threshold and the threshold factor to motivate vehicle nodes to cooperate. Furthermore, based on the number of messages that the nodes face, the utility function of nodes is redesigned to correct the assumption that a gain and a loss of an equal amount could offset each other in traditional economics. The simulation results show that compared with the traditional incentive mechanism, the LAIM can increase the average utility of nodes by more than 34.35%, which promotes the cooperation of nodes.

scholarly journals Performance Analysis of ECDSA Based SE-AODV Routing Protocol In VANETS

2018 ◽  
Vol 7 (3.16) ◽  
pp. 76
Author(s):  
Deepak . ◽  
Rajkumar .
Keyword(s):  
Routing Protocol ◽  
Network Performance ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Intelligent Transportation System ◽  
Secure Routing ◽  
The People ◽  
Main Challenge ◽  
Hoc Networks ◽  
Aodv Routing Protocol

Vehicular ad hoc networks is an emerging area for researchers to provide intelligent transportation system to the society. It is due to the wide area of applications of VANETs interest is developed among the people from different countries to be a part of it. Therefore many projects had been started and also presently working to implement VANETs in real world scenario. The main challenge in its implementation is to provide a secure mechanism against the various attacks and threats that have the capability to bring the network performance significantly down. In this paper to overcome different types of authentication based attacks in VANETs an ECDSA based secure routing protocol SE-AODV is proposed with security features incorporated in already existing AODV routing protocol. The performance of SE-AODV is evaluated and compared with original AODV and AODV with black hole attack (BH-AODV). The SE-AODV shows better performance with the parameters used for comparison with the variation in vehicle density, speed of vehicles and simulation time. 

scholarly journals Delay-Bounded and Cost-Limited RSU Deployment in Urban Vehicular Ad Hoc Networks

Sensors ◽  
2018 ◽  
Vol 18 (9) ◽  
pp. 2764 ◽  
Author(s):  
Huanhuan Yang ◽  
Zongpu Jia ◽  
Guojun Xie
Keyword(s):  
Ad Hoc Networks ◽  
Network Performance ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Random Variable ◽  
Population Diversity ◽  
Coverage Ratio ◽  
Binary Differential Evolution ◽  
Hoc Networks ◽  
Feasible Solutions

As an auxiliary facility, roadside units (RSUs) can well improve the shortcomings incurred by ad hoc networks and promote network performance in a vehicular ad hoc network (VANET). However, deploying a large number of RSUs will lead to high installation and maintenance costs. Therefore, trying to find the best locations is a key issue when deploying RSUs with the set delay and budget. In this paper, we study the delay-bounded and cost-limited RSU deployment (DBCL) problem in urban VANET. We prove it is non-deterministic polynomial-time hard (NP-hard), and a binary differential evolution scheme is proposed to maximize the number of roads covered by deploying RSUs. Opposite-based learning is introduced to initialize the first generation, and a binary differential mutation operator is designed to obtain binary coding. A random variable is added to the traditional crossover operator to increase population diversity. Also, a greedy-based individual reparation and promotion algorithm is adopted to repair infeasible solutions violating given constraints, and to gain optimal feasible solutions with the compromise of given limits. Moreover, after selection, a solution promotion algorithm is executed to promote the best solution found in generation. Simulation is performed on analog trajectories sets, and results show that our proposed algorithm has a higher road coverage ratio and lower packet loss compared with other schemes.

A Probabilistic Routing Protocol in VANET

2010 ◽  
Vol 2 (4) ◽  
pp. 21-37 ◽  
Author(s):  
Gongjun Yan ◽  
Stephan Olariu ◽  
Shaharuddin Salleh
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocol ◽  
High Speed ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Probability Model ◽  
Proposed Model ◽  
Probabilistic Routing ◽  
Hoc Networks ◽  
Manet Networks

The key attribute that distinguishes Vehicular Ad hoc Networks (VANET) from Mobile Ad hoc Networks (MANET) is scale. While MANET networks involve up to one hundred nodes and are short lived, being deployed in support of special-purpose operations, VANET networks involve millions of vehicles on thousands of kilometers of highways and city streets. Being mission-driven, MANET mobility is inherently limited by the application at hand. In most MANET applications, mobility occurs at low speed. By contrast, VANET networks involve vehicles that move at high speed, often well beyond what is reasonable or legally stipulated. Given the scale of its mobility and number of actors involved, the topology of VANET is changing constantly and, as a result, both individual links and routing paths are inherently unstable. Motivated by this latter truism, the authors propose a probability model for link duration based on realistic vehicular dynamics and radio propagation assumptions. The paper illustrates how the proposed model can be incorporated in a routing protocol, which results in paths that are easier to construct and maintain. Extensive simulation results confirm that this probabilistic routing protocol results in more easily maintainable paths.

Efficient Mechanisms and Performance Analysis of Routing Protocols in VANETs for Realistic Scenarios

2016 ◽  
Vol 8 (3) ◽  
pp. 20-49 ◽  
Author(s):  
Christos Bouras ◽  
Vaggelis Kapoulas ◽  
Enea Tsanai
Keyword(s):  
Ad Hoc Networks ◽  
Routing Protocols ◽  
High Speed ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Traffic Efficiency ◽  
Pattern Movement ◽  
Manet Routing ◽  
And Performance ◽  
Hoc Networks

Vehicular Ad Hoc Networks (VANETs) are considered as a special case of mobile Ad Hoc Networks (MANETs) and are recently gaining a great attention from the research community. The need for improved road safety, traffic efficiency and direct communication along with the great complexity in routing, makes VANETs a highly challenging field. Routing in VANETs has to adapt to special characteristics such as high speed and road pattern movement as well as high linkage break probability. In this work, the authors show that traditional MANET routing protocols cannot efficiently handle the challenges in a VANET environment and thus need further modifications. For this reason, they propose and implement an enhancement mechanism, applied to the GPSR routing protocol that adapts to the needs of a VANET. The proposed mechanism's performance is evaluated through simulation sets for urban and highway scenarios and compared to the performance of the most common MANET routing protocols adopted in VANETs. The proposed enhancement is shown to be considerably beneficial and it significantly outperforms the rest of the tested routing protocols for almost every topology setting.

scholarly journals A Remote Testbed System for Mobile Ad-hoc/Sensor Networks

2015 ◽  
Vol 11 (9) ◽  
pp. 22
Author(s):  
Jun Yin ◽  
Yuwang Yang ◽  
Xiayun Hu ◽  
Yanxiang Yin
Keyword(s):  
Sensor Networks ◽  
Packet Loss ◽  
High Speed ◽  
Network Performance ◽  
Ad Hoc ◽  
Main Idea ◽  
Software Simulation ◽  
Rotary Platform ◽  
Mobile Ad Hoc ◽  
Ad Hoc Sensor Networks

Nodes in a mobile ad-hoc/sensor networks (MANET) can move at any speed and direction independently. Thus, it's difficult to design a testbed system for network working under such circumstance. Different with traditional software simulation or vehicle-loaded methods, a remote network performance testbed system is proposed in this paper. The main idea of our proposed system is using the rotary motion to create such velocity-changing context. We designed and realized two high speed rotary turntable platforms. Nodes can be deployed on the rotary platform during test, thus it can movement at a speed upto 168 km/h in our testbed system. The operator can remotely monitor the test and receive the testing results simultaneously. Shown by the experiments, the approach is simple, efficient and reliable. In addition, the reason of network packet loss in our testbed is also analysed and tested in this research.

scholarly journals Vehicular Ad Hoc Networks and Security Issues: Survey

2017 ◽  
Vol 11 (5) ◽  
pp. 30 ◽  
Author(s):  
Zaid A. Abdulkader ◽  
Azizol Abdullah ◽  
Mohd Taufik Abdullah ◽  
Zuriati Ahmad Zukarnain
Keyword(s):  
Routing Protocol ◽  
Ad Hoc Network ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Transportation Networks ◽  
Privacy And Security ◽  
Smart Transportation ◽  
Security Issues ◽  
Hoc Networks ◽  
Time Critical

Vehicular ad hoc network (VANET) technologies are evolving networked communications advances that incorporate mobile-based routing protocol sets for inter-vehicular exchanges of information in support of smart transportation networks. Privacy and security difficulties are primary concerns in VANET research as a result of the repeated vehicular movements, time-critical responses, and hybrid VANET architectures that differentiate these from other ad hoc networking types. Therefore, the design of secure mechanisms for authenticating and validating message transmissions between vehicles and eliminating adversarial elements from networks are of considerable importance in VANET research. This report offers a review of VANET features and security difficulties. The paper also summarizes certain chief threats to the authentication, confidentiality, and availability of secure services.

scholarly journals A distributed trust mechanism for malicious behaviors in VANETs

2020 ◽  
Vol 19 (3) ◽  
pp. 1147
Author(s):  
Ali Kamil Ahmed ◽  
Mohanad Najm Abdulwahed ◽  
Behnam Farzaneh
Keyword(s):  
Network Performance ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Malicious Node ◽  
Topsis Method ◽  
Trust Mechanism ◽  
Related Information ◽  
Hoc Networks ◽  
Malicious Behaviors

<p>Vehicular Ad-hoc Networks (VANETs) are one of the most important types of networks which are widely used in recent years. Along with all the benefits of Quality of Service (QoS) improvements, vulnerability analysis for this type of networks is an important issue. For instance, a Gray-hole attack decreases network performance. We proposed a novel solution to help to secure these networks against this vulnerability. The proposed method can detect and prevent the Gray-hole attack. Anywhere in the network, each node (vehicle) can distinguish between the Gray-hole attack and the failed link. Some topology related information helps us to detect attacks more accurately. Also, the proposed method uses the most reliable path in terms of link failure when there is no malicious node. In this paper, we used the TOPSIS method for choosing the most trusted node for routing intelligently. We validated our proposal using a simulation model in the NS-2 simulator. Simulation results show that the proposed method can prevent Gray-hole attack efficiently with low overhead.</p>

Sign in / Sign up

Export Citation Format

Share Document