Data Dissemination Protocol Research Articles

Performance evaluation of multi service provisioning for multi-hop cooperative data dissemination in SDHVN

A large number of RSUs are deployed to improve vehicular ad-hoc networks (VANETs) in recent years. On the other hand, it leads to an increase in the cost of the network. Multi-hop cooperative data dissemination (MHCDD) protocols can reduce using RSUs. These RSUs must cope with intermittent connectivity for longer distance communication. Minimizing the RSUs increases the data traffic and end-to-end delay. Moreover, mobility management, handling the connection time between vehicles, and data traffic in VANETs are challenging tasks in dense networks. In this context, we proposed a multi-hop cooperative data dissemination technique using a virtual network functioning and software-defined network-enable on the heterogeneous vehicular network (SDHVN). The problem of packet scheduling on the buffer occupancy is solved using an enhanced periodic update (ePU) and enhancing event-driven deadline (eEDD). The results illustrate the proposed algorithm’s significant performance in terms of availability with the limited wireless channels. The queueing models adopted for optimizing the load balancing are by using the mobile edge controller. These queueing model minimizes the latency and maximizes network utility.

A UAV-Enabled Data Dissemination Protocol With Proactive Caching and File Sharing in V2X Networks

In Vehicle-to-Everything (V2X) networks, where all vehicles and infrastructures are interconnected for information sharing, data dissemination is increasingly playing a significant role in superior and pluralistic communication services. To empower the efficiency of data dissemination, in this paper, we propose a novel unmanned aerial vehicle (UAV)-enabled scheduling protocol consisting of a proactive caching policy and a file sharing strategy in V2X networks. In the proactive caching process, we deploy UAVs as flying base stations (BSs) with caching capability, where we propose a UAV dynamic trajectory scheduling (DTS) algorithm to optimize the caching duration. Whereas in the file sharing strategy, based on the previous vehicular caching status, we provide a framework of file sharing cycle for data dissemination scheduling and employ a channel prediction algorithm to alleviate communication overhead. Moreover, we propose a relay ordering algorithm to effectively improve the file sharing process. Simulation results demonstrate that, our proposed scheduling protocol can enhance the efficiency of data dissemination and achieve an improved network performance in terms of caching process, system throughput, and file sharing latency in V2X networks.

Analyzing cooperative monitoring and dissemination of critical mobile events by VANETs

The treatment of mobile and simultaneous critical urban events requires effective actions by the appropriate authorities. Additionally it implies communication challenges in the speed and accuracy of their occurrence by the entities, as well as dealing with the dynamics and speed in these environments. Cooperative solutions with shared resources that address these challenges become a real option in helping to handle these events. This paper presents an evaluation of dynamic monitoring and collaborative dissemination supported by vehicular groups. It aims to analyze the impact of multiple mobile and fixed events in an urban environment on information propagation, considering barriers imposed by the events and the environment. Differently from other studies in the literature, this work takes into account both fixed and mobile events, as well as simultaneous events. NS3 results show that the evaluated system monitored at least 87% and 51.5% of the time for mobile and fixed events respectively, and delivered information over 77% and 50% of the time for those events, with average delay remains close to 0.3s in most scenarios. The results also reveal that a more continuous monitoring of the mobile events is highly dependent on the orientation of the vehicles. The main contribution of this work consists of the performance analysis of both fixed and mobile simultaneous events to support studies on how moving events impact on the dissemination and delivery of real-time data, and thus encouraging the development of new data dissemination protocols for VANETs.

Optimal Adaptive Data Dissemination Protocol for VANET Road Safety Using Optimal Congestion Control Algorithm

Introduction: VANET is a mobile ad-hoc system (MANET) that concerns vehicle-to-vehicle and vehicle-to-infrastructure communication. Unique characteristics such as higher node speeds and restricted road topology extricate VANET from other MANETs. Messages between vehicles and roadside infrastructure in VANET is over short to medium range wireless technologies. Dedicated Short Range Communications (DSRC) is a RF technology-based standard that has been designed exclusively for automotive communications. Like most MANETs, data are broadcasted in VANETs through the exchange of messages between the nodes. The limited road topology unlike MANETs, executes a directional way to the message flow. It becomes important that the data to be transmitted in the most effective ways with less delay, due to higher node speeds and unbalanced connectivity among the nodes. Hence, propagating data to the intended node or region of interest is a unique problem in VANETs and requires incorporating effective techniques to disseminate data. Data broadcasted from a vehicle will be received by all the nodes within the broadcast range. The difficulty of data dissemination is hence related to propagating data, not within but beyond the transmission range of the sender. An intuitively simple way to disseminate data beyond the transmission range is through flooding. In flooding each node which receives the message would simply rebroadcast the message without any regard to its current position or any other factors. Thus, data are propagated beyond the transmission range when a node at the border of the broadcast range rebroadcasts the message. For effective broadcasting, each vehicle upon receiving a message would make a decision to rebroadcast the message depending on whether or not it is the farthest node in the transmission range. Thus, the decision-making ability of each vehicle on participating in the message propagation is dependent on its awareness of vehicles around it and determines the overall effectiveness of the technique used in disseminating data. Objective: To identify an optimal cluster head based on effective parameters to reduce Control Overhead messages in a collision based traffic network. Methods: The proposed system consists of two processes namely candidate selection and control OH message reduction. The candidate selection process is carried out by Chaotic Fish Swarm Optimization (CFSO) algorithm which consists of cluster formation and Cluster Head (CH) selection. The control OH messages are reduced by a Predictor based Decision Making (PDM) algorithm. Results: Based on the performance metrics such as success rate, redundant rate, collision rate, number of control OH messages, data propagation distance, data propagation time and data dissemination efficiency, the proposed system is evaluated. The results shows that the proposed system performs well than the existing system. Conclusion: In this paper, we have suggested an Optimal Adaptive Data Dissemination Protocol (OAddP) for VANET road safety. The proposed OAddP mechanism uses the Chaotic Fish Swarm Optimization (CFSO) algorithm to perform the clustering and uses a Predictor based Decision Making (PDM) algorithm for control overhead messages reduction.

Lama: Link characteristic aware multicast data dissemination for computational RFIDs

Computational radio frequency identification can be successfully employed in a range of applications. The efficient data dissemination is a building block for useful functions such as parameter configuration, code debug fixing, and wireless reprogramming. Many recent data dissemination protocols have adopted transmission methods from a reader to a single tag following EPC C1G2. Even if the same data need to be transmitted to multiple tags, they can only be distributed individually; however, tags in the reader antenna coverage area can hear commands from the reader, which motivates us to pursue a multicast data dissemination scheme that is compatible with the existing protocol. In this paper, we propose Lama, an efficient multicast data dissemination protocol that considers tag link characteristics (link quality and charging efficiency). This method improves the efficiency of data dissemination by selecting an appropriate master tag. Experiments based on a commercial reader demonstrate that Lama reduces the dissemination delay compared with state-of-the-art protocols.

Comment on “Lightweight Secure Message Broadcasting Protocol for Vehicle-to-Vehicle Communication”

In the advanced technological world, vehicular communications are used in numerous business and safety applications for smart traffic management. With the help of vehicle-to-vehicle (V2V) communication, users can transfer substantial information directly to the reachable vehicles. Generally, the movement of vehicles on the highway is faster than crossroads, thus, to communicate securely and efficiently, a robust vehicular communication system is required. Therefore, a number of message dissemination protocols have been designed by the researchers, but distinct interests (i.e, storage cost, high communication overhead, more execution time, and security threats) are sought in these systems, which lead toward unreliability for on-the-fly communication. Very recently, Limbasiya-Das ( Ieee System Journal , pp 1937–9234, 10.1109/JSYST.2019.2932807) introduced a hash-based secure and efficient V2V data dissemination protocol to transfer significant information at the receiver end. Limbasiya-Das claimed the security of their protocol against numerous security attacks. However, in this comment, we highlight the loopholes of Limbasiya-Das protocol and show that their protocol is vulnerable to impersonation attack. Moreover, it has irrelevant usage of timestamp and does not offer user's anonymity. In addition, it lacks message confidentiality because an adversary can determine and view the messages exchanged among the legitimate vehicles by intercepting the messages disseminated over public channel. Finally, we provide probable remedy to mitigate the deficiencies of Limbasiya-Das protocol.

HDDS: Hierarchical Data Dissemination Strategy for energy optimization in dynamic wireless sensor network under harsh environments

The primary issue in Wireless Sensor Network (WSN) based monitoring applications is the preservation of the sensing coverage under the harsh physical environment. WSN forms the monitoring infrastructure, where a large set of energy-constrained sensor nodes are deployed to collect the physical parameters of the environment. The sensor nodes communicate their data to the nearby edge server (ES) where data is processed locally before it is forwarded to the distant cloud platform. Most of WSN’s existing routing algorithms aim to develop an energy-efficient data transmission route without recognizing the effect of harsh external environment, rendering it non-adaptive to environmental changes. In this paper, we have focused to develop an energy-efficient hierarchical data dissemination protocol for the sensor to ES communication. Along with energy optimization, the proposed protocol aims to preserve the network coverage and supports the dynamic changes in network topology like node failure, node addition, etc., due to harsh environmental interface. As the sensor nodes are required to operate autonomously, the proposed protocols are designed by considering only the local information of a sensor node. Simulation and experimental results show the efficiency of the proposed protocol over many state-of-the-art protocols with respect to several parameters such as energy consumption, lifetime of the network, coverage ratio, packet delivery ratio, latency, etc.

A blockchain-based data storage framework: A rotating multiple random masters and error-correcting approach

A blockchain is resistant to modification based on the consensus of the network majority, which requires a large amount of communication among distributed nodes. Existing data dissemination protocol solves the wrong block problem also at a high communication cost. This paper investigates the error-correcting tamper-proofing data storage problem and proposes a three-layer framework to store the data in the blockchain to achieve data integrity. The data are stored as blocks, and we design a two-dimension chain data structure consisting of horizontal and vertical chains. This paper proposes a Rotating multiple random Masters and Error-Correcting data storage framework based on blockchain (RMEC) to strike a trade-off between system decentralization and the amount of communication. The proposed Rotating Multiple Random Sampling consensus mechanism (RMRS) randomly selects multiple temporary master nodes to handle each data access request so as to reduce the communication cost. We also propose two error-correcting mechanisms to validate and correct the wrong data blocks. Finally, we implement a prototype and conduct analyses on the system performance. The experiments demonstrate that the framework can achieve data tamper-proof and effectively reduce the communication cost.

Data dissemination for Internet of vehicle based on 5G communications: A survey

AbstractWith the increase of the number of connected vehicles on roads, the data dissemination within traditional network suffers from many limitations like high latency, a significant amount of dropped packets and network congestion. Therefore, the Internet of vehicles (IoV) has been designed as an emerging paradigm that combines the intelligent transportation system (ITS) with Internet of Things (IoT) technology. IoV allows vehicles to exchange data with its surroundings in order to enhance the traffic safety and to provide digital services to road users. In this paper, a taxonomy of data dissemination protocols proposed for IoV is surveyed according to three main categories namely, the smart control‐based category, social networks‐based category, and traditional approaches. We also review the data dissemination in IoV based on the fifth generation (5G) communications with emphasis on enabling technologies, architectures, services, and challenges. Moreover, we suggest in this study a new generic 5G‐based IoV architecture named IoVs based on fifth generation communications to enhance data dissemination by the promising and efficient transmission technologies such as fifth‐generation network properties, software‐defined network functionalities (SDN), and cloud‐fog computing services. The proposed scheme helps to meet challenges in the low latency, high reliability and security, high performance, mobility contrary to conventional architectures.

A multi-hop broadcast wave approach for floating car data collection in vehicular networks

Inter-Vehicle Communication (IVC) is bringing connected and cooperative mobility closer to reality. Vehicles today are able to produce huge amounts of information, known in the literature as Floating Car Data (FCD), containing status information gathered from sensing the internal condition of the vehicle and the external environment. Adding networking capabilities to vehicles allows them to share this information among themselves and with the infrastructure. Collecting real-time FCD information from vehicles opens up the possibility of having access to an enormous amount of useful information that can boost the development of innovative services and applications in the domain of Intelligent Transportation System (ITS). In this paper we propose several solutions to efficiently collect real-time FCD information in Dedicated Short-Range Communication (DSRC)-enabled Vehicular Ad Hoc Networks (VANETs). The goal is to improve the efficiency of the FCD collection operation while keeping the impact on the DSRC communication channel as low as possible. We do this by exploiting a slightly modified version of a standardized data dissemination protocol to create a backbone of relaying vehicles that, by following local rules, generate a multi-hop broadcast wave of collected FCD messages. The proposed protocols are evaluated via realistic simulations under different vehicular densities and urban scenarios.

IoVCom: Reliable Comprehensive Communication System for Internet of Vehicles

By 2020, around 25 billion “things” will be connected to the Internet for a better society using different technological systems. Vehicle users have better experience by collaborating the Internet of Things (IoT) and vehicular ad-hoc network (VANET) architectures, and this emerging field is called the Internet of vehicles (IoV). Therefore, the IoV architecture will play an important role in the industry, research organization, and academics for various public and commercial applications. However, the IoV structure should ensure secure and efficient performance for vehicular communications, else an attacker may interfere in the system. In this article, we propose protected comprehensive data dissemination protocols (say IoVCom) based on one-way hash function and elliptic curve cryptography (ECC) for the IoV structure. Next, we analyze security strengths of the IoVCom against various security attacks and discuss performance results in terms of communication overhead, computation time, storage cost, and energy consumption.

Performance Evaluation of Data Dissemination Protocols for Connected Autonomous Vehicles

An overwhelmed number of vehicles has wrecked the current system of transportation due to rapid growth in population. Smart cities are the novel innovation that is inevitable to curb the problems of traffic jams, unorganized traffic, environmental pollution, and slow response rate to emergency situations. The intelligent transportation system (ITS) is an integral part of smart cities allowing communications and interaction among vehicles. An autonomous vehicle is the key element of ITS and the mass implementation of this emerging technology is the solution to traffic problems linked to the current transportation system. Autonomous vehicles lead to the need for efficient and reliable external vehicular communications particularly through vehicular ad hoc networks (VANET). However, utilizing a suitable routing protocol to provide stable routing and efficient performance for vehicular communications in autonomous vehicles is a key factor. Routing protocols are particularly important for establishing vehicular to vehicular and vehicular to infrastructure (V2X) communication, which is incredibly challenging due to the movement of nodes. The quality of inter-vehicular communications is widely affected by numerous factors such as routing protocols, traffic environment, and traffic density. This article presents a detailed evaluation of three commonly used protocols, i.e., Ad-hoc On-demand Distance Vector Routing (AODV), Dynamic Source Routing (DSR), and Destination-Sequenced Distance-Vector Routing (DSDV) under three different traffic environments. To investigate the performance of these routing protocols under diverse environments, simulations are extended further by using the varying density of vehicles. This study aims at finding the best routing protocol for efficient and reliable packet dissemination among vehicles under different scenarios.

Oppo-Flood: An Energy-Efficient Data Dissemination Protocol for Asynchronous Duty-Cycled Wireless Sensor Networks

In this paper, we propose a data dissemination protocol for asynchronous duty-cycling wireless sensor networks. In an asynchronous duty-cycling network, each node independently selects its wake-up time. In this environment, data dissemination becomes energy consuming, because broadcasting a packet does reach all neighbors but only the neighbors that are awake at the time. A node can forward its packet to all neighbors by continuously transmitting the packet for a whole wake-up interval, but it leads to high energy consumption and high dissemination delay. The idea proposed in this paper is to use opportunistic forwarding, where each node forwards the packet to a neighbor that wakes up early and receives the packet. Each node forwards the packet, as long as there is a neighboring node that has not received the packet yet. The main benefit of this opportunistic forwarding-based dissemination is that every time a packet is disseminated, it may take a different path to reach the nodes. At the beginning of dissemination, a sender needs to transmit for a very short duration of time because there are plenty of neighboring nodes to receive the packet. As more nodes receive the packet, the transmit duration of the sender becomes longer, thus consuming more energy. Since the order of dissemination is different every time, energy consumption is naturally balanced among the nodes, without explicit measures. Through extensive simulations, we show that the proposed protocol achieves longer network lifetime and shorter dissemination delay compared to other dissemination protocols in various network environments.

Simulated annealing-based reprogramming scheme of wireless sensor nodes

Code dissemination is a main component of reprogramming which enables over-the-air software update in wireless sensor networks. In this paper, we present a Simulated Annealing-based reprogramming scheme (SA). Unlike well-known wireless reprogramming data dissemination protocols such as Deluge, whose primary goal is to minimize energy consumption, SA’s design criterion is to minimize energy consumption while balancing the energy consumption of the entire sensor network. To achieve these goals, we first establish the NP-hard model of data dissemination routing and its simplified form. Then, the relaying nodes and corresponding communication radius are determined by their remaining energy and the balanced consumption of the covered nodes, respectively. Finally, the iterative optimization strategy with simulated annealing is achieved. Physical experimental results and numerical analysis show that the proposed algorithm can find the near-optimal solutions to reduce and balance the total energy consumption when there is an energy imbalance among different nodes.

Heuristic data dissemination for mobile sink networks

Mobile sinks have advantages such as solving the hotspot problem which occurs because some sensor nodes deplete energy faster than others and enhancing energy balance among the sensor nodes. However, sink mobility raises two challenges, frequent location updates and packets delivery delay. To tackle these two problems, this work proposes a protocol that involves two mechanisms. First, to reduce the frequent location updates of the mobile sink to all sensor nodes, we proposed an accessible virtual structure (Double Ring) that acts as an intermediate structure between the sink and the sensor nodes when exchanging metadata and query packets. Second, to accelerate packets delivery, we proposed a heuristic data dissemination protocol, called HDD, in which the heuristic function is based on four values, direction, transmission distance, perpendicular distance, and residual energy. The experimental results showed that our proposed protocol outperforms the state of art protocols in terms of energy consumption, delivery rate, latency, and network lifetime.

Optimal Rate-Adaptive Data Dissemination in Vehicular Platoons

In intelligent transportation systems, wireless connected vehicles moving in platoons can improve roads’ throughput. For managing driving status of the platoon, a lead vehicle transmits driving information to following autonomous vehicles by using multi-hop data dissemination. We study a novel data dissemination protocol which investigates a chain-based transmit rate control to reduce data dissemination latency. The optimal resource allocation algorithm is formulated to minimize the total dissemination latency of the platoon under guaranteed bit error rates, and can be judiciously reformulated and solved using standard optimization techniques. A novel dynamic programming algorithm is presented to solve the platooning resource allocation optimization, which uses backward induction to significantly reduce the resource allocation complexity. In addition, we interpret the vehicular platoon as one-dimensional Markov chain, and derive a closed form of dissemination latency. Simulations are carried out to evaluate the performance of the proposed dynamic programming algorithm. The numerical results show that our algorithm achieves optimal solutions with cutting off the complexity by orders of magnitude, while improving dissemination rate in the vehicular platoon.

A baseline for context-aware system for safety messages dissemination in VANETs

Vehicular ad-hoc networks (VANETs) are mobile networks with highly dynamic contexts of operation. The design and application of context-aware systems could be critical to enhance the performance of protocols deployed in VANETs, which depend on both network and traffic conditions, to detect hostile communication environments, as well as to offer a novel way to make decisions in real-time. In this paper, we present a baseline study for the design of a context-aware system for dissemination of safety messages in VANETs. We model a realistic vehicular intersection and perform extensive simulations to evaluate two well-known dissemination mechanisms, namely the Slotted 1-persistence and the Traffic Adaptive Data Dissemination (TrAD) Protocol, with a set of parameters according to different operation scenarios. We show how the dissemination mechanisms’ performance could be improved, or worsened, by choosing a different set of parameter values. By characterizing the operation scenarios, it is possible to adequate the parameters of the dissemination mechanism with the values that work best in a given context, improving in this way the general performance of the dissemination mechanisms under study.

Efficient data dissemination protocol based on complex networks\u2019 metrics for urban vehicular networks

Services that aim to make the current transportation system more secure, sustainable, and efficient constitute the Traffic Management Systems (TMS). Vehicular Ad hoc Networks (VANETs) exert a strong influence for TMS applications, due to TMS services require data, communication, and processing for operation. Besides, VANET allows direct communication between vehicles, and data are exchanged and processed between them. Several TMS services require disseminated information among decision-making vehicles. However, such dissemination is a challenging task, due to the specific characteristics of VANETs, such as short-range communication and high node mobility, resulting in several variations in their topology. In this article, we introduce an extensive analysis of our proposed data dissemination protocol based on complex networks’ metrics for urban VANET scenarios, called DDRX. Each vehicle must build a subgraph to identify the relay node to continue the dissemination process. Based on the local graph, it is possible to select the relay nodes based on complex networks’ metrics. Simulation results show that DDRX offers high efficiency in terms of coverage, number of transmitted packets, delay, and packet collisions compared to well-known data dissemination protocols. Also, DDRX provides significant improvements to a TMS that needs efficient data dissemination.

Location Privacy Protection in Distributed IoT Environments Based on Dynamic Sensor Node Clustering.

One of the most significant challenges in Internet of Things (IoT) environments is the protection of privacy. Failing to guarantee the privacy of sensitive data collected and shared over IoT infrastructures is a critical barrier that delays the wide penetration of IoT technologies in several user-centric application domains. Location information is the most common dynamic information monitored and lies among the most sensitive ones from a privacy perspective. This article introduces a novel mechanism that aims to protect the privacy of location information across Data Centric Sensor Networks (DCSNs) that monitor the location of mobile objects in IoT systems. The respective data dissemination protocols proposed enhance the security of DCSNs rendering them less vulnerable to intruders interested in obtaining the location information monitored. In this respect, a dynamic clustering algorithm is that clusters the DCSN nodes not only based on the network topology, but also considering the current location of the objects monitored. The proposed techniques do not focus on the prevention of attacks, but on enhancing the privacy of sensitive location information once IoT nodes have been compromised. They have been extensively assessed via series of experiments conducted over the IoT infrastructure of FIT IoT-LAB and the respective evaluation results indicate that the dynamic clustering algorithm proposed significantly outperforms existing solutions focusing on enhancing the privacy of location information in IoT.

Secret Key Agreement for Data Dissemination in Vehicular Platoons

In a vehicular platoon, the lead vehicle that is responsible for managing the platoon's moving directions and velocity periodically disseminates messages to the following automated vehicles in a multi-hop vehicular network. However, due to the broadcast nature of wireless channels, this kind of communication is vulnerable to eavesdropping and message modification. Generating secret keys by extracting the shared randomness in a wireless fading channel is a promising way for wireless communication security. We study a security protocol for data dissemination in the platoon, where the vehicles cooperatively generate a shared secret key based on the quantized fading channel randomness. To improve conformity of the generated key, the probability of secret key agreement is formulated, and a novel secret key agreement algorithm is proposed to recursively optimize the channel quantization intervals, maximizing the key agreement probability. Numerical evaluations demonstrate that the key agreement probability achieved by our security protocol given different platoon size, channel quality, and number of quantization intervals. Furthermore, by applying our security protocol, the probability that the encrypted data being cracked by an eavesdropper is less than 5%.