Data Dissemination Protocol Research Articles

A Distance-Vector-Based Multi-Path Routing Scheme for Static-Node-Assisted Vehicular Networks.

Vehicular Ad hoc NETworks (VANET) has been well studied for a long time as a means to exchange information among moving vehicles. As vehicular networks do not always have connected paths, vehicular networks can be regarded as a kind of delay-tolerant networks (DTNs) when the density of vehicles is not high enough. In this case, packet delivery ratio degrades significantly so that reliability of networks as an information infrastructure is hardly held. Past studies such as SADV (Static-node Assisted Data dissemination protocol for Vehicular networks) and RDV (Reliable Distance-Vector routing) showed that the assistance of low-cost unwired static nodes located at intersections, which work as routers to provide distance-vector or link-state routing functions, significantly improves the communication performance. However, they still have problems: SADV does not provide high-enough delivery ratio and RDV suffers from traffic concentration on the shortest paths. In this paper, we propose MP-RDV (Multi-Path RDV) by extending RDV with multiple paths utilization to improve performance against both of those problems. In addition, we apply a delay routing metric, which is one of the major metrics in this field, to RDV to compare performance with the traffic-volume metric, which is a built-in metric of RDV. Evaluation results show that MP-RDV achieves high load-balancing performance, larger network capacity, lower delivery delay, and higher fault tolerance against topology changes compared to RDV. As for routing metrics, we showed that the traffic-volume metric is better than the delay one in RDV because delay measurement is less stable against traffic fluctuation.

Dynamic speed adaptive classified (D-SAC) data dissemination protocol for improving autonomous robot performance in VANETs

ABSTRACTIn robotics, mechanized and computer simulation for accurate and fast crash detection between general geometric models is a fundamental problem. The explanation of this problem will gravely improve driver safety and traffic efficiency, vehicular ad hoc networks (VANETs) have been employed in many scenarios to provide road safety and for convenient travel of the people. They offer self-organizing decentralized environments to disseminate traffic data, vehicle information and hazardous events. In order to avoid accidents during roadway travels, which are a major burden to the society, the data, such as traffic data, vehicle data and the road condition, play a critical role. VANET is employed for disseminating the data. Still the scalability issues occur when the communication happens under high-traffic regime where the vehicle density is high. The data redundancy and packet collisions may be high which cause broadcast storm problems. Here the traffic regime in the current state is obtained from the speed of the vehicle. Thus the data reduction is obtained. In order to suppress the redundant broadcast D-SAC data, dissemination protocol is presented in this paper. Here the data are classified according to its criticality and the probability is determined. The performance of the D-SAC protocol is verified through conventional methods with simulation.

AEA-FCP: an adaptive energy-aware fixed clustering protocol for data dissemination in wireless sensor networks

Through the past years, wireless sensor networks (WSNs) have witnessed great efforts to improve its performance and efficiency in terms of energy consumption and network throughput. Among all efficiency aspects, the energy awareness has captured the significant attention of current researchers. In this paper, we propose an adaptive energy-aware fixed clustering data dissemination protocol (AEA-FCP) for WSNs that mainly aims at minimizing and balancing the energy consumption among all nodes that are participating in such networks. In particular, this work proposes multiple novel mechanisms to achieve this goal. Firstly, a new approach is presented for the construction of clusters with balanced size and even distribution during the initial cluster head selection. Secondly, a novel scheme is introduced for distributing the cluster head task, dependent upon a node’s energy and location information within each cluster. Lastly, a multi-hop routing paradigm is employed to minimize the communication distances and save the nodes’ energy. The results of the simulation showed that our protocol’s performance surpasses other directly connected works in both continuous data and event-based applications.

Hybrid routing scheme using imperialist competitive algorithm and RBF neural networks for VANETs

Vehicular ad hoc network (VANET), a special type of mobile ad-hoc networks (MANETs), is characterized by a very high mobility. Due to the dynamic nature of vehicle nodes and unstable wireless links, the design of an efficient and effective routing scheme is serious challenging for VANETs. Thus, proposing a reliable routing protocol for important data dissemination is essential for VANETs. In this paper, a clustering-based routing protocol is introduced where nodes are clustered according to movement information such as node degree and velocity of vehicles by means of imperialist competitive algorithm. Then, the cluster head is selected by means of radial basis function neural network algorithm according to amount of free buffer space and expected transmission count. Simulation results indicated that the proposed scheme improves the other related algorithms in terms of the parameters of packet delivery rate, throughput and end-to-end delay.

Efficient Data Dissemination for Urban Vehicular Environments

Vehicular communication systems play an important role in the context of smart cities. Different applications are being proposed and evaluated to improve our daily driving in terms of safety and convenience. These applications require efficient data dissemination that guarantees full coverage with minimum overhead and delay. Existing data dissemination protocols often rely on extra communication to gather knowledge about the neighborhood and set the dissemination criteria accordingly. This extra communication poses serious overhead issues that affect the scalability of data dissemination, which is an essential criterion under high density scenarios. In this paper, we propose and evaluate an Efficient multi-directional Data Dissemination Protocol (EDDP), which considers the requirements of an urban vehicular environment without requiring the extra communication overhead. We rely only on simple local data to indicate the road condition for better dissemination performance. In this paper, the design considerations of urban layout include message format, broadcast suppression mechanism, and delay control. The EDDP utilizes the properties of the received messages along with positioning information to make decisions on suppressing broadcasts, with the objective of improving coverage in different directions without unnecessary transmissions. Simulation results show that the EDDP can effectively disseminate traffic data with a high data delivery ratio and a minimized overhead.

Exploiting Mobile Edge Computing for Enhancing Vehicular Applications in Smart Cities.

Mobile edge computing (MEC) has been recently proposed to bring computing capabilities closer to mobile endpoints, with the aim of providing low latency and real-time access to network information via applications and services. Several attempts have been made to integrate MEC in intelligent transportation systems (ITS), including new architectures, communication frameworks, deployment strategies and applications. In this paper, we explore existing architecture proposals for integrating MEC in vehicular environments, which would allow the evolution of the next generation ITS in smart cities. Moreover, we classify the desired applications into four major categories. We rely on a MEC architecture with three layers to propose a data dissemination protocol, which can be utilized by traffic safety and travel convenience applications in vehicular networks. Furthermore, we provide a simulation-based prototype to evaluate the performance of our protocol. Simulation results show that our proposed protocol can significantly improve the performance of data dissemination in terms of data delivery, communication overhead and delay. In addition, we highlight challenges and open issues to integrate MEC in vehicular networking environments for further research.

Clustering-Based Data Dissemination Protocol Using the Path Similarity for Autonomous Vehicles

The VANET (Vehicle Ad Hoc Network) is gathering attention for autonomous vehicles and the MANET (Mobile Ad Hoc Network) is attracting interest as well. Therefore, efforts have been made to overcome the challenges of the VANET in which the topology changes in real time and instability exists due to the difference in speed and physical phase. Particularly in the IoT era, the total amount of network nodes in addition to vehicle nodes is expected to increase dramatically. Therefore, a clustering algorithm for a mesh network capable of autonomous configuration is suitable for reducing the load of the central control device and data redundancy on the network, which is expected to increase as the IoT era progresses. However, since clustering algorithms based on the existing research have been developed for the current traffic situation, inefficiency is inevitable in the future autonomous navigation period in which traveling path prediction can be accurately performed. Therefore, this paper discusses a clustering algorithm and a data propagation algorithm between clusters using path information. The main content of this paper is as follows. First, we propose a clustering algorithm using path information and considering the existing research results. In the autonomous navigation period, if the path is predictable, the probability that the nodes in the same cluster are in the same block for a longer time than the conventional one can converge to 100%. Therefore, the survival time of the cluster can be dramatically improved. Second, we developed a data propagation algorithm that can increase the information propagation rate of the entire network using path information. The cluster temporarily stores the data to be disseminated and then disseminates it when it encounters another cluster of neighbors. Therefore, data can be disseminated even for noncontiguous clusters. To summarize, this paper proposes clustering-based data dissemination algorithms and protocols using vehicle pathways for autonomous navigation and compares them with clustering-based data dissemination algorithms using existing directions.

A Robust Energy Saving Data Dissemination Protocol for IoT-WSNs

In Wireless Sensor Networks (WSNs) for Internet of Things (IoT) environment, fault tolerance is a most fundamental issue due to strict energy constraint of sensor node. In this paper, a robust energy saving data dissemination protocol for IoT-WSNs is proposed. Minimized energy consumption and dissemination delay time based on signal strength play an important role in our scheme. The representative dissemination protocol SPIN (Sensor Protocols for Information via Negotiation) overcomes overlapped data problem of the classical Flooding scheme. However, SPIN never considers distance between nodes, thus the issue of dissemination energy consumption is becoming more important problem. In order to minimize the energy consumption, the shortest path between sensors should be considered to disseminate the data through the entire IoT-WSNs. SPMS (Shortest Path Mined SPIN) scheme creates routing tables using Bellman Ford method and forwards data through a multi-hop manner to optimize power consumption and delay time. Due to these properties, it is very hard to avoid heavy traffic when routing information is updated. Additionally, a node failure of SPMS would be caused by frequently using some sensors on the shortest path, thus network lifetime might be shortened quickly. In contrast, our scheme is resilient to these failures because it employs energy aware concept. The dissemination delay time of the proposed protocol without a routing table is similar to that of shortest path-based SPMS. In addition, our protocol does not require routing table, which needs a lot of control packets, thus it prevents excessive control message generation. Finally, the proposed scheme outperforms previous schemes in terms of data transmission success ratio, therefore our protocol could be appropriate for IoT-WSNs environment.

An Effective and Efficient Adaptive Probability Data Dissemination Protocol in VANET

Mobile network topology changes dynamically over time because of the high velocity of vehicles. Therefore, the concept of the data dissemination scheme in a VANET environment has become an issue of debate for many research scientists. The main purpose of VANET is to ensure passenger safety application by considering the critical emergency message. The design of the message dissemination protocol should take into consideration effective data dissemination to provide a high packet data ratio and low end-to-end delay by using network resources at a minimal level. In this paper, an effective and efficient adaptive probability data dissemination protocol (EEAPD) is proposed. EEAPD comprises a delay scheme and probabilistic approach. The redundancy ratio (r) metric is used to explain the correlation between road segments and vehicles’ density in rebroadcast probability decisions. The uniqueness of the EEAPD protocol comes from taking into account the number of road segments to decide which nodes are suitable for rebroadcasting the emergency message. The last road segment is considered in the transmission range because of the probability of it having small vehicle density. From simulation results, the proposed protocol provides a better high-packet delivery ratio and low-packet drop ratio by providing better use of the network resource within low end-to-end delay. This protocol is designed for only V2V communication by considering a beaconless strategy. the simulations in this study were conducted using Ns-3.26 and traffic simulator called “SUMO”.

Two energy and time-efficient data dissemination protocols for large-scale wireless sensor networks

In a wireless sensor network (WSN) where positioning information is not assumed or is partially available, efficient data access is a very challenging issue especially in an environment with multiple random sources and sinks. Few years back, an interesting rumor-agent based protocol named rumor routing (RR) was proposed. The key concept RR introduced is that the agents are used to spread request and environmental information in an attempt to not affect the limited bandwidth of WSN. Moreover, in this protocol, the cooperation of agents helps build optimal paths leading to events with low energy cost. In this paper, we first review the major RR extensions classifying them into two categories: location-based and free location-based. Then, based on this classification, we propose two rumor-based data dissemination protocols designed to ensure both energy and time-efficient data access for realistic WSN deployments. The two proposed protocols have been compared with the relevant previous works through simulation campaigns. Performance evaluation results show that our proposed protocols achieve significant improvements in terms of data accessibility, generated traffic, and query latency.

Performance modeling of SEAD protocol in vehicular environment

Toward the growing number of the transport safety applications offered by VANET, a large amount of messages need to be efficiently disseminated between connected vehicles. The requirement for an efficient data dissemination in vehicular environment is ensuring the highest data reachability, using the minimum network resources within a short end to end delay. To meet these properties, researchers have addressed the data dissemination challenges, mainly the famous broadcast storm, which has lead to a wide variety of solutions. In this work, we present two Simple and Efficient Adaptive data Dissemination protocols called SEAD1 and SEAD2 that combine a probabilistic and a delay based approach. The originality of these protocols is that they can be adaptively tuned according to the VANET applications’ requirements. Therefore, a rigorous performance evaluation of the protocols is proposed through an analytic model and a large set of NS3 simulations. The analytic results show excellent fits to the simulation results which confirm the accuracy of the proposed model. Moreover, based on our analytic model we became able to thoroughly study the protocols parameters’ behavior and derive an accurate configuration. Thereby, a proper trade-off between the packet delivery ratio and the redundancy ratio is possible in attempt to tune the protocols performance according to the application criticality level.

Active data dissemination for mobile sink groups in wireless sensor networks

In wireless sensor networks, a mobile sink group brings out many challenging issues with regard to data dissemination due to its twofold mobility: group mobility and individual one. All member sinks of a group should move together toward the same destination in relation to the group mobility, but each member sink can also move randomly within a certain group area in relation to the individual mobility. For supporting such groups, geocasting may decrease data delivery ratio due to continuous group area shifting by the group mobility, and multicasting may increase energy consumption due to frequent multicast tree reconstructions by the individual sink mobility. Recently, mobile geocasting protocols have been proposed, which enable a mobile sink group to periodically register its current group area information to a source and member sinks in the group to passively receive data from the source by flooding within the registered group area. However, due to the passive data dissemination, they suffer from excessive energy consumption of sensor nodes due to flooding data within the large group area and result in high data delivery failures of member sinks on edge of the group due to asynchrony between the registered group area and the actual group area. Therefore, we propose an active data dissemination protocol that exploits a local data area constructed by considering the moving direction and pattern of a mobile sink group. In the proposed protocol, a source sends data to nodes in the local data area in advance, and member sinks in the group actively receive the data from the local data area when they potentially pass it. To efficiently construct a local data area, we investigate the pattern of group mobility and classify into three major categories according to the prediction level: a regular movement, a directional movement, and a random movement. We then present three different data dissemination schemes with an efficient local data area to effectively operate for each mobility pattern. Experimental results conducted in various environments show that the proposed protocol has better performance than previous protocols in terms of the data delivery ratio and the energy consumption.

Reliability and energy-efficiency analysis of safety message broadcast in VANETs

Safety applications in vehicular ad hoc networks (VANETs) rely heavily on broadcast schemes for the exchange of status messages. Reliable and on-time delivery of safety messages is critical in VANETs that requires extremely efficient broadcast models. In this paper, we model the reliability of flooding used as the underlying data dissemination protocol for time-critical safety messages. We consider a multi-hop VANET and model end-to-end reliability provided by the network layer. The analytical results unleash important insights about the flooding mechanism. For instance, the reliability drops exponentially beyond a certain threshold value of packet loss probability. Secondly, the impact of hop length on reliability can be catastrophic if not handled appropriately. Keeping in view of the fact that energy-efficient protocols is a key requirement in the upcoming Internet of Vehicles (IoV), we also show that restrictive flooding is more energy-efficient than plain flooding under the same reliability constraint. We validate our theoretical findings through simulations and propose modifications to plain flooding to make it more reliable.

RNOB: Receiver Negotiation Opportunity Broadcast Protocol for Trustworthy Data Dissemination in Wireless Sensor Networks

The broadcast data dissemination is an important transmission mode of wireless sensor networks (WSNs) in Internet-of-Things (IoT) systems. Seeking the optimal forwarding path of the broadcast data is a non-deterministic polynomial problem, and therefore, we tried to use the theory of opportunistic routing for reducing redundant rebroadcasts and enhancing the trustworthiness of transmission. However, minimum research is available focusing on the opportunistic broadcast in planar structure network which is point-to-multipoint transmission model. This paper explores the performance of broadcast data dissemination by using opportunistic routing for point-to-multipoint in theory. A new protocol called receiver negotiation opportunity broadcast (RNOB) protocol is proposed, including the distributed cooperation scheme and the priority scheduling algorithm. Simulation results showed that the performance of RNOB is better than traditional protocols, which shall improve the trustworthiness and efficiency of data transmission for WSNs in IoT systems.

A Neighbor-Based Probabilistic Broadcast Protocol for Data Dissemination in Mobile IoT Networks

The recent trend of implementing Internet of Things (IoT) applications is to transmit sensing data to a powerful data center and try to discover the valuable knowledge behind “Big Data” by various intelligent but resource-consuming algorithms. However, from the discussion with some industrial companies, it is understood that disseminating real-time sensing data to their nearby network-edge applications directly would produce a more economical design and lower service latency for some important smart city applications. Therefore, this paper proposes an efficient broadcast protocol to disseminate data in mobile IoT networks. The proposed protocol exploits the neighbor knowledge of mobile nodes to determine a rebroadcast delay that prioritizes different packet broadcasts according to their profits. An adaptive connectivity factor is also introduced to make the proposed protocol adaptive to the node density of different network parts. By combining the neighbor knowledge of nodes and adaptive connectivity factor, a reasonable probability is calculated to determine whether a packet should be rebroadcasted to other nodes or be discarded to prevent redundant packet broadcast. Extensive simulation results have validated that this protocol can improve the success ratio of packet delivery by 13% ~ 28% with a similar end-to-end transmission delay and network overhead of the most state-of-art approaches.

Using a Distributed Roadside Unit for the Data Dissemination Protocol in VANET With the Named Data Architecture

Vehicular ad hoc network (VANET) has recently become one of the highly active research areas for wireless networking. Since VANET is a multi-hop wireless network with very high mobility and intermittent connection lifetime, it is important to effectively handle the data dissemination issue in this rapidly changing environment. However, the existing TCP/IP implementation may not fit into such a highly dynamic environment because the nodes in the network must often perform rerouting due to their inconsistency of connectivity. In addition, the drivers in the vehicles may want to acquire some data, but they do not know the address/location of such data storage. Hence, the named data networking (NDN) approach may be more desirable here. The NDN architecture is proposed for the future Internet, which focuses on the delivering mechanism based on the message contents instead of relying on the host addresses of the data. In this paper, a new protocol named roadside unit (RSU) assisted of named data network (RA-NDN) is presented. The RSU can operate as a standalone node [standalone RSU (SA-RSU)]. One benefit of deploying SA-RSUs is the improved network connectivity. This study uses the NS3 and SUMO software packages for the network simulator and traffic simulator software, respectively, to verify the performance of the RA-NDN protocol. To reduce the latency under various vehicular densities, vehicular transmission ranges, and number of requesters, the proposed approach is compared with vehicular NDN via a real-world data set in the urban area of Sathorn road in Bangkok, Thailand. The simulation results show that the RA-NDN protocol improves the performance of ad hoc communications with the increase in data received ratio and throughput and the decrease in total dissemination time and traffic load.

Industrial Internet of Things Based Efficient and Reliable Data Dissemination Solution for Vehicular Ad Hoc Networks

Industrial Internet of Things (IIoT) is the other name of industrial Internet. It integrates a variety of existing industrial automation technologies with computing, machine learning, and communication technologies. Vehicular ad hoc network, an application of IIoT, is a self‐organized network of vehicles which tends to provide improved road safety, diminished traffic congestion, and ultimate comfort to the travellers. In VANETs, vehicles exchange data with each other directly or through roadside units (RSUs). Data dissemination in VANETs experiences numerous challenging issues including broadcast storm, network partitions, intermittent connectivity between vehicles, and limited bandwidth. In literature, various data dissemination schemes are proposed. However, most of these schemes are designed for either urban or highway VANET scenarios and evaluated under sparse or dense traffic conditions. Moreover, these schemes do not effectively overcome the aforementioned issues simultaneously. In this paper, we present a new data dissemination protocol for VANETs, which disseminates the emergency messages in different scenarios under varying traffic conditions. During dense traffic conditions, DDP4V employs the segmentation of transmission region of a vehicle in order to select the most appropriate next forwarding vehicle (NFV). Accordingly, it divides the transmission region of a vehicle in three distinct segments and selects vehicle(s) inside the highest priority segment to forward the message to all neighbour vehicles, whereas it also uses implicit acknowledgements for guaranteed message delivery during sparse traffic Conditions. Simulation results show that DDP4V protocol outperforms the other existing related protocols in terms of coverage, network overhead, collision, and end‐to‐end delay.

A scalable data dissemination protocol based on vehicles trajectories analysis

Since the last decade, the emergence of affordable wireless devices in vehicle ad-hoc networks has been a key step towards improving road safety as well as transport efficiency. Informing vehicles about interesting safety and non-safety events is of key interest. Thus, the design of an efficient data dissemination protocol has been of paramount importance. A careful scrutiny of the pioneering vehicle-to-vehicle data dissemination approaches highlights that geocasting is the most feasible approach for VANET applications, more especially in safety applications, since safety events are of interest mainly to vehicles located within a specific area, commonly called ZOR or Zone Of Relevance, close to the event. Indeed, the most challenging issue in geocast protocols is the definition of the ZOR for a given event dissemination. In this paper, we introduce a new geocast approach, called Data Dissemination Protocol based on Map Splitting (DPMS). The main thrust of DPMS consists of building the zones of relevance through the mining of correlations between vehicles’ trajectories and crossed regions. To do so, we rely on the Formal Concept Analysis (FCA), which is a method of extracting interesting clusters from relational data. The performed experiments show that DPMS outperforms its competitors in terms of effectiveness and efficiency.

Resolving Hydrometeorological Data Discontinuities along an International Border

AbstractMonitoring, understanding, and forecasting the hydrologic cycle of large freshwater basins often requires a broad suite of data and models. Many of these datasets and models, however, are susceptible to variations in monitoring infrastructure and data dissemination protocols when watershed, political, and jurisdictional boundaries do not align. Reconciling hydrometeorological monitoring gaps and inconsistencies across the international Laurentian Great Lakes–St. Lawrence River basin is particularly challenging because of its size and because the basin’s dominant hydrologic feature is the vast surface waters of the Great Lakes.For tens of millions of Canadian and U.S. residents that live within the Great Lakes basin, seamless binational datasets are needed to better understand and predict coastal water-level fluctuations and other conditions that could potentially threaten human and environmental health. Binational products addressing this need have historically been developed and maintained by the Coordinating Committee on Great Lakes Basic Hydraulic and Hydrologic Data (Coordinating Committee). The Coordinating Committee recently held its one-hundredth semiannual meeting and reflected on a range of historical accomplishments while setting goals for future work. This article provides a synthesis of those achievements and goals. Particularly significant legacy and recently developed datasets of the Coordinating Committee include historical Great Lakes surface water elevations, basin-scale tributary inflow to the Great Lakes, and basin-scale estimates of both over-lake and over-land precipitation. Moving forward, members of the Coordinating Committee will work toward customizing state-of-the-art hydrologic and meteorological forecasting systems across the entire Great Lakes basin and toward promoting their products and protocols as templates for successful binational coordination across other large binational freshwater basins.

CADD: connectivity-aware data dissemination using node forwarding capability estimation in partially connected VANETs

The recent development of the vehicular ad hoc networks (VANETs) has motivated an increasing interest in vehicular services and applications, such as active safety service and the infotainment service. Effective data Dissemination has become more and more important in vehicular services sharing. In this paper, the connectivity characteristics of VANETs are theoretically analyzed and implemented to show the partial connections in vehicle to vehicle communication. Hence, we propose the connectivity-aware data dissemination (CADD) in partially connected VANETs will improve the data transmission capacity. In the CADD protocol, a new metric of the node forwarding capability estimation is introduced. The metric is designed by the combination the throughput function and the active connection time estimation. And then, the high efficiency data dissemination protocol is designed by the new metric. Simulation results show that the CADD protocol outperforms existing solutions in terms of the packet delivery ratio, the transmission delay, and the protocol overhead under the condition of the intermittent network connectivity.