Fig 9 - uploaded by Jaime Lloret
Content may be subject to copyright.
Source publication
Location determination is one of the most difficult tasks to be achieved in Vehicular Ad Hoc networks (VANETs), as the nodes change their positions quickly due to high velocity. So, data dissemination to the vehicles in presence of high node mobility is one of the challenging issues to be resolved. To address these issues, in this paper, we propose...
Context in source publication
Context 1
... snapshot of network is taken and shown in Fig. 9. Now, in this network, vehicle A wants to access the contents of vehicle H, but the network is disconnected at vehicle E, as it is in most real scenario. Other protocols have problem to access the information but, the proposed scheme stores the information at replica vehicle. Hence, all what vehicle A has to do is approach the replica vehicle, i.e., vehicle D which stores the information of vehicle H. This information is communicated to vehicle A for further ...
Citations
... In [31], to decrease the end-to-end delay (E2ED) and reduce storage cost in emergency applications, a new method is presented regarding geographical location segmentation and prioritization of different regions. Routing algorithms are found to be effective in improving and manage data propagation [32][33][34]. At high densities, congestion control algorithms are used to maximize reliability and real-time constraints [14,35]. ...
In vehicular ad hoc networks (VANETs), data propagation is quite challenging due to the high mobility of vehicles, the instability of communication links, and the inherent topology changes. This paper presents FWDP, a fuzzy logic-based vehicle weighting model (VWM) for scheduling prioritized data in VANETs. FWDP employs roadside units (RSUs) to dominate the frequent topology changes and manage the data propagation. A Fuzzy C-Mean clustering (FCMC) is used for handling clustered vehicles that compete to utilize the shared channel. RSUs receive prioritized data from cluster heads (CHs) in the proposed model wherein CHs allocate scheduled service channels to weighted vehicles during an interval. FWDP is equipped with a fuzzy inference system (FIS) for vehicle weighting according to the velocity and inter-vehicle distance metrics. In addition, RSUs compute the signal-to-noise and the interference ratio (SINR) to solve the hidden terminal problem to prevent radio interference. The OMNET++ simulator is used to show the performance improvement of FWDP in terms of the packet delivery ratio, interference ratio, suspend data ratio, Throughput, end-to-end delay, channel utilization, and packet loss ratio metrics intended for low, intermediate, and high vehicle densities.
... It also delivers higher PDR values with limited network performance for the urban environment. Kumar et al. [26] suggested a novel Replication-Aware Data Dissemination (RADD) protocol for vehicular network. It is based on the idea where the vehicle position was initially estimated, and then the Bloom filter was utilized to find out a similar location. ...
Vehicle Ad-Hoc Network (VANET) is a dynamic decentralized network that consists of various wireless mobile vehicles with no individual user management. Several routing protocols can be used for VANETs, for example, the Location-Aided Routing (LAR) protocol that utilizes location information provided by the Global Positioning System (GPS) sensors. It can help to reduce the search space for the desired route—limiting the search space results in fewer route discovery messages. However, two essential aspects are ignored while applying the LAR protocol in the VANET-based environment. Firstly, the LAR does not exploit the fact that nodes in VANET do not have pure random movement. In other words, nodes in LAR predict the position of destination node by ignoring the fact that the pre-defined constraint on the destination node navigation is met. Secondly, the nodes in the conventional LAR (or simply stated as LAR) protocol use the location information of the destination node before selecting the route location, which is most likely to expire because of the fast movement of the nodes in the VANET environment. This study presents an estimation based on a heuristic approach that was developed to reject weak GPS location data and accept accurate ones. The proposed routing protocol stated as Rectangle-Aided LAR (RALAR) is based on a moving rectangular zone according to the node′s mobility model. Additionally, the proposed RALAR protocol was optimized by using the Genetic Algorithm (GA) by selecting the most suitable time-out variable. The results were compared with LAR and Kalman-Filter Aided-LAR (KALAR), the most commonly utilized protocols in VANET for performance metrics using Packet Delivery Ratio (PDR), average End-to-End Delay (E2E Delay), routing overhead and average energy consumption. The results showed that the proposed RALAR protocol achieved an improvement over the KALAR in terms of PDR of 4.7%, average E2E delay of 60%, routing overhead of 15.5%, and 10.7% of energy consumption. The results proved that the performance of the RALAR protocol had outperformed the KALAR and LAR protocol in terms of regular network performance measures in the VANET environment.
... Where, SIFS=Short Inter-Frame Space interval, and DIFS=Distributed Inter-Frame Space interval. The model focuses on lowering delays in the transmission of emergency messages, reducing message redundancy, and preventing message collision [21]. ...
Broadcasting is a transmission of the same message to multiple recipients to form the communication process between wireless vehicular networks. Yet, many challenges still need to be addressed to ensure proper broadcasting. These include resolving the different security problems that affect the vehicular network efficiency while exchanging messages, and achieving low dissemination overhead and minimum broadcast delay while maintaining high delivery ratio. In this paper, we present a novel model for trusting the safety message before disseminating it, through multi-hop V2V communication. We also, ensured message high delivery rate with minimum time delay. To this end, we recommend the idea of dividing the digital roadmap of the interested area into small fixed size segments. To transmit the packets between vehicles, we depend on pairs of concatenated information composed of the beacon message and the safety message, where the sending time is arranged according to the road density. The model relies on the idea of using a forwarder to rebroadcast the safety message between segments. Choosing the best forwarder is thus based on a calculated weight value for links between the vehicles. Our contribution is achieved by adding two decentralized data trust stages: to entrust the safety message information in one-hop, and before disseminating it farther through multi-hop. The simulation results using NS2 and SUMO showed the effectiveness of the model. The two stages of the trust method are also verified.
... Most of the applications in this area offer convenience and improvement in road safety. In addition, the safety applications contain information to alert drivers in case of accidents, traffic congestion, repair work, emergency braking, available parking spaces, and the presence of police radar and emergency response vehicles [2]. Vehicle nodes are taking advantage of new and advanced networking technologies, and they are reducing the • Firstly, the design of ISR is presented considering segment formation, head node selection, and score calculation. ...
The real-time traffic information dissemination among on-road vehicles has been envisioned via realizing vehicular ad hoc networks (VANETs) as smart service-oriented roadside wireless sensor networks. The network enables various types of real-time traffic applications related to safety and infotainment for drivers and passengers. The information dissemination-centric routing protocols for vehicular networks have to dynamically adopt under the constrained network environment while considering the higher mobility of vehicular nodes and unpredictable physical topologies in the network. The issue needs to be addressed through smart and network-aware routing protocols. Geographical routing protocols have witnessed significant attention for information dissemination under these types of dynamic vehicular network environment. To this end, this paper presents an improved road segment-based geographical routing (ISR) protocol focusing on better head node selection for information dissemination. It divides the forwarding area into a number of road segments and selects a head node on each segment by focusing on traffic-aware information including the location, direction, and link quality-centric score for every vehicle on each road segment. Algorithms were developed for the complete process of head node selection and information dissemination among vehicles on the road segments. The simulation results attested the performance benefits of the proposed routing framework as compared to the state-of-the-art protocols considering dynamic vehicular traffic environment-related metrics.
... As node i evaluates node j, it will send request to its neighboring nodes. The neighboring nodes receive the request and send the trust value with node j to node i. Node i collects the trust values and intergrates them to gain a total recommendation trust value T i,j recom , calculated by (11). ...
In complex vehicular cyber physical systems (CPS) network environment, there exist trust-based recommendation schemes that could effectively filter most of the false data. Though, these schemes may exhaust vehicular network resources, including energy, computation ability, and storage, causing a network outage. To ensure real-time data transmission and security in a vehicular CPS network, a novel trust-based recommendation scheme (TBRS) is proposed in this research. The main contributions presented in this paper are as follows: (1) The isomerism of vehicular sensor nodes in CPS networks, where the differences of mobility between normal nodes and selfish/malicious nodes are analyzed. Besides, a trust model is designed based on delivery credibility and position intimacy of nodes. This model can adjust the weight coefficient of direct trust parameters, which can be utilized to analyze the secure and trustable tasks in data transmission, and (2) To address attacks caused by selfish/malicious nodes and sparsity issues of nodes in vehicular CPS, a secure filtering algorithm based on K-Nearest Neighbor (KNN) cooperative computing is proposed. The trust value is calculated by the proposed trust model. The cooperative computing-based filtering algorithm is utilized to filter false recommendation trust values from selfish/malicious nodes, which greatly reduces interference of selfish/malicious nodes on the performance of vehicular CPS network. The way of calculating trust value cooperatively and recommend trust value makes the TBRS model more secure and reliable than previous ones. Experimental results show that the TBRS scheme is superior to the existing schemes in terms of delivery rate, transmission delay and reliability. Besides, the resistance against illegal eavesdropping attacks has increased by an average of 32.53% when compared to other algorithms.
... Lin et al. [26] presented a novel moving-zone-based architecture and a corresponding routing protocol for message dissemination in VANETs by using pure V2V communications; the authors claimed that this was the first study that applied moving object techniques to vehicular networks. Kumer et al. [27] aimed to achieve lower message dissemination delay and reduce redundant rate. Bi et al. [28] used the time and angle method to determine the replicated node when RFID was not installed, to avoid network disconnection and improve message disseminating. ...
Efficient data dissemination in vehicular ad hoc networks (VANETs) is a challenging issue due to the dynamic nature of the network. To improve the performance of data dissemination, we study distributed data replication algorithms in VANETs for exchanging information and computing in an arbitrarily-connected network of vehicle nodes. To achieve low dissemination delay and improve the network performance, we control the number of message copies that can be disseminated in the network and then propose an efficient distributed data replication algorithm (EDDA). The key idea is to let the data carrier distribute the data dissemination tasks to multiple nodes to speed up the dissemination process. We calculate the number of communication stages for the network to enter into a balanced status and show that the proposed distributed algorithm can converge to a consensus in a small number of communication stages. Most of the theoretical results described in this paper are to study the complexity of network convergence. The lower bound and upper bound are also provided in the analysis of the algorithm. Simulation results show that the proposed EDDA can efficiently disseminate messages to vehicles in a specific area with low dissemination delay and system overhead.
... In [36], a replication-aware data dissemination (RADD) is presented for VANETs using location prediction to address the challenges of disconnection due to high node mobility. The new replication-aware scheme has been suggested to estimate the location of nodes. ...
... A revocation mechanism, TIaaS thin-client concept for vehicles, and efficient mobility vectors framework have been designed. [32] @ @ @ COHORT [33] @ @ @ @ OC-DSG [34] @ @ @ @ CARD [35] @ @ @ @ RADD [36] @ @ @ LTE-A [37] @ @ @ @ RSAP [38] @ @ @ @ ClouDiV [39] @ @ @ GaaS [40] @ @ @ @ PORP [41] @ @ @ IP6-VCN [42] @ @ @ RAR-MCV [43] @ @ @ @ @ SMDP [44] @ @ @ CM, conceptual model; CF, complete framework; AL, algorithm; IM, implementation. @ = Yes. ...
... The design and how to transmit data in CC-V need to be critically addressed. Even though some work has been done in [32][33][34][35][36][37][38][39][40][41][42][43][44] by suggesting solutions to handle various type of data dissemination issues using clustering, data-centric, and other routing approaches, yet many issues have not covered, such as location verification, data dissemination, and video-centric routing. The conventional VANETs routing [65][66][67] may not be suitable in the case of CC-V due to the connectivity challenges in mobility. ...
Cloud computing in VANETs (CC-V) has been investigated into two major themes of research including vehicular cloud computing (VCC) and vehicle using cloud (VuC). VCC is the realization of autonomous cloud among vehicles to share their abundant resources. VuC is the efficient usage of conventional cloud by on-road vehicles via a reliable Internet connection. Recently, a number of advancements have been made to address the issues and challenges in VCC and VuC. This paper qualitatively reviews CC-V with the emphasis on layered architecture, network component, taxonomy, and future challenges. Specifically, a four-layered architecture for CC-V is proposed including perception, coordination, artificial intelligence and smart application layers. Three
network components of CC-V, namely, vehicle, connection, and computation are explored with their cooperative roles. A taxonomy for CC-V is presented considering major themes of research in the area including design of architecture, data dissemination, security, and applications. Related literature on each theme is critically investigated with comparative assessment of recent advances. Finally, some open research challenges are identified as future issues. The challenges are the outcome of the critical and qualitative assessment of the literature on CC-V.
... A VANET can provide safety, cost-effectiveness, and convenience through communication between vehicles and between vehicles and infrastructures and improve service satisfaction while moving by providing information appropriate to drivers' requests. In addition, it can reduce the cost associated with road traffic congestion and vehicle collisions, thereby facilitating comfortable and safe driving environments [25][26][27]30,31]. Since, unlike mobile ad hoc networks (MANETs), VANETs provide services for fast-moving vehicles, it is difficult to apply the data transfer and routing schemes used in MANETs due to the rapidly changing network topology [10,13,14]. ...
As studies on vehicular ad hoc networks have been conducted actively in recent years, convenient and reliable services can be provided to vehicles through traffic information, surrounding information, and file sharing. To provide services for multiple requests, road side units (RSUs) should receive requests from vehicles and provide a scheduling scheme for data transfer according to priority. In this paper, we propose a new scheduling scheme by which multiple RSUs are connected through wired networks and data is transferred through the collaboration of RSUs. The proposed scheme transfers safety and non-safety data by employing a collaborative strategy of multiple RSUs as well as reducing the deadline miss ratio and average response time. When safety data is generated, data is transferred from the previous RSU in advance, while priority is assigned considering the deadline and reception rate. Since non-safety data is an on-demand data processed by user requests, the proposed scheme provides a method that reduces the deadline miss ratio upon loads generated in RSUs. To prove the superiority of the proposed scheme, we perform a performance evaluation in which the number and velocities of vehicles were changed. It is shown through the performance evaluation that the proposed scheme has better deadline miss ratios and faster response time than the existing schemes.
... A new election process begins when the previously selected node is no longer appropriate because it has left the region. In RADD [Kumar et al. 2015], the vehicles in a region decide on the best replica, based on their number of connections, velocity, communication range, and the number of replicas in the vicinity. They exchange messages containing their parameters, and the one with the highest index is selected as the replica. ...
A significant number of promising applications for vehicular ad-hoc networks (VANETs) are becoming a reality. Most of these applications require a variety of heterogenous content to be delivered to vehicles and to their on-board users. However, the task of content delivery in such dynamic and large-scale networks is easier said than done. In this paper, we propose a classification of content delivery solutions applied to VANETs while highlighting their new characteristics and describing their underlying architectural design. First, the two fundamental building blocks that are part of an entire content delivery system are identified: replica allocation and content delivery. The related solutions are then classified according to their architectural definition. Within each category, solutions are described based on the techniques and strategies that have been adopted. As result, we present an in-depth discussion on architecture, techniques, and strategies adopted by studies in the literature that tackle problems related to vehicular content delivery networks.
... Such issues make the security of VANET a really crucial aspect [6]. Current schemes lay stress on preventive measures and thus bypass all other important factors related to both of an attacker and the defender [7]. However, the security schemes should focus on both attacker's attack strategy and defender's defense strategy because they both are correlated to each other [8]. ...
Vehicular Ad-hoc Networks (VANETs) are prone to several types of attacks due to their decentralized nature and mobility. The involvement of traffic and human beings makes it important to secure VANETs to a maximum extent. There is an urgent need to move one step ahead of just preventing the attacks. We need to have a mechanism that can access and analyze the risk priority of an attacker's way of attacking and defender's way of defending. The attacker may have several ways for achieving his goal of causing damage and every way has a different severity and impact.. So, the assessment of all these ways can help the defender to get the insight into the psyche of attacker. This assessment will definitely help the society to get prevention from such unwanted attacks. In this paper, a risk priority assessment model of SSL SYN attack is designed using attack-defense tree model in VANETs. Attack-defense tree model is used to analyze and present the approaches used by attackers to achieve SSL SYN attack. A game theoretic approach is adopted by attacker and defender to maximize their objectives. The rationality of the attack defense model using game theory is investigated using risk priority number on the basis of severity, occurrence and detection ratings. The mathematical assessment shows the impact of this work.
