Dissemination Protocol Research Articles

A novel hybrid broadcasting protocol based on coverage area segmentation and delay adjustment for VANETs

We propose a reliable dissemination protocol for broadcasting safety messages in vehicular ad hoc networks called Segment Delay Based Broadcasting Protocol (SDBP). The protocol has a twofold goal: limiting the risk of interference and reducing the dissemination time. To achieve these goals, two mechanisms are proposed. The first one divides vehicle's coverage area into several segments depending on the local density. Thereafter, the priority to relay a message is given to nodes that are in the farthest segment from the source node. The second mechanism allows reducing the waiting time thanks to a periodic update process. The performances of SDBP have been studied in an environment with multiple concurrent data traffics. The goal was to validate its capacity when the radio channel becomes overloaded. The comparison study (in terms of delivery ratio, dissemination time, forwarders and redundancy packets ratio) shows that SDBP outperforms two VANETs' broadcasting protocols.

Energy Efficient and Secured Data Dissemination in Wsn

Data dissemination is a high level application service, provided to WSN to update the configuration parameter to make the node perform intended services. The configuration parameters of the nodes are updated by means of reprogramming and reconfiguration through over air programming. In data dissemination, the data are so sensitive that even a small change in a data will lead to data corruption and nodes will not perform intended services. In most of the existing systems, providing energy efficient secured data dissemination is a major concern. The attackers can interrupt the process data dissemination and launch various types of attacks, In-order to overcome these challenges. In this paper, a novel Secure Based Dissemination protocol is proposed which can provide energy efficient data dissemination. The proposed protocol ensures better authentication during data dissemination. The proposed protocol is implemented in NS2 simulator. Simulation results justifies that, proposed protocol output forms the existing techniques and has better Packet Delivery Ratio, throughput , network life time, energy consumption, end to end delay and routing overhead .

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.

Scalable Downward Routing for Wireless Sensor Networks Actuation

In this paper, we study the downward routing for network control/actuation in large-scale and heterogeneous wireless sensor networks (WSNs). We propose the opportunistic source routing (OSR), a scalable and reliable downward routing protocol for WSNs. OSR introduces opportunistic routing into traditional source routing based on the parent set of a node’s upward routing in data collection, significantly addressing the drastic link dynamics in low-power and lossy WSNs. We devise a novel adaptive Bloom filter mechanism to effectively and efficiently encode the downward source-route in OSR, which enables a significant reduction of the length of source-route field in the packet header. OSR is scalable to very large-size WSN deployments, since each resource-constrained node in the network stores only the set of its direct children. We present an analytical scalability model and evaluate the performance of OSR via both the simulations and real-world testbed experiments, in comparison with the standard RPL (both storing mode and non-storing mode), ORPL, and the representative dissemination protocol Drip. Our results show that the OSR significantly outperforms RPL and ORPL in scalability and reliability. OSR also achieves significantly better energy efficiency compared with TinyRPL and Drip which are based on the same TinyOS platform as OSR implementation.

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.

Sec-Didrip: A Secure Routing Protocol for Wsn Using Ns-3

Wireless sensor networks (WSN) are responsible on improving or updating and distributing security commands for the data discovery and the dissemination protocols to update the sensor Node configuration parameters. There are two drawbacks to all current data discovery and the dissemination protocols. First, they are based on the centralized strategy; the data item can only be distributed by the base station. For emerging multi-owner-multi-user WSNs, such a strategy is not appropriate. Furthermore, those conventions have not been proposed in view of security and in this manner, assailants can promptly dispatch endeavors to harm the system. This article proposes the first-named convention (Sec-DiDrip) for secure and circulated data discovery and dissemination.

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.

Adaptive alert content dissemination protocol inspired from volunteer's dilemma game for Vehicular Ad-hoc Networks

Vehicular Ad hoc Networks (VANETs) can serve to guarantee road safety and comfort for drivers. This is done using broadcasting which is the most used technique to disseminate data. If done blindly, it leads to the famous broadcast storm problem. The broadcast storm problem occurs when a huge amount of messages is sent, which increases resource consumption. Therefore, to solve this problem, it is important to find the compromise between minimizing the number of rebroadcast messages while maintaining good latency, throughput, and reachability. In this work, we opt for a non-cooperative forwarding, which is a valuable technique enabling vehicle nodes to cover the network with a minimum amount of rebroadcasts. We modeled this behavior using game theory through a volunteer dilemma approach. This paper presents a novel broadcasting protocol called the Nash Equilibrium Scheme (NES), which investigates how a volunteer dilemma approach can be implemented in the context of VANETs. This is aiming to mitigate the storm problem. Using this approach, we successfully solved the content and alert incident messages dissemination problem. Simulations were performed using NS2 while considering two scenarios (a highway and a grid). The performance simulation shows that our implementation outperforms prior work in terms of several metrics.

SocialMANET: A Publish/Subscribe Events Dissemination Protocol for Mobile Ad-Hoc Networks

The popularization of mobile equipment capable of communicating autonomously nowadays offers the possibility of thinking more seriously about a mode of communication in which stakeholders communicate in an ad-hoc manner and use mobility to convey information. However, due to their mobile nature, such equipments are limited by their low energy and storage capacity. Algorithms designed for them must therefore be able to deal with these limitations. In this paper, we present SocialMANET, a distributed publish/subscribe events dissemination protocol for mobile ad-hoc networks. It implements the hierarchical subjects subscription model which, in addition to allowing to formulate refined subscriptions requests close to the content-based subscription model, also permits to minimize the number of subscriptions required to receive events in several topics: to this end, we have proposed a strategy for generating subject identifiers based on the dynamic level numbering technique. Through the use of a dedicated message format that we have defined, SocialMANET minimizes the number of exchanges required between terminals during (fugitive) contacts to detect and respond to their needs by making the best use of the information extracted from these exchanges. This message format, coupled with the concept of lazily altruistic nodes that we propose, allows SocialMANET to guarantee a high rate of events receipt, even in situations where the interests of the network nodes tend to diverge: the results of the simulations conducted show that, compared to other dissemination protocols of the literature, SocialMANET guarantees a better rate of receiving event while minimizing the power consumption of network nodes. We also present in this paper an application prototype for the dissemination of academic informations within a community of students; it’s based on an implementation of SocialMANET.

Design and performance evaluation of a LoRa-based mobile emergency management system (LOCATE)

Smartphone devices can play a key role on emergency scenarios thanks to their pervasiveness, and the possibility to convey emergency requests from the involved people to the rescue teams. At the same time, the effective utilization of such devices on critical scenarios with limited mobile Internet access is challenging. As an alternative, several recent research studies have proposed Emergency Communication System (ECS) based on short-range Device-to-Device (D2D) solutions available on Commercial Off The Shelf (COTS) devices (e.g. Wi-Fi Direct); however, the target of these solutions is constituted by small indoor areas, since the scalability on large-scale environments is often a problem. In this paper, we overcome such issue by proposing LOCATE, a novel phone-based ECS enabling long-range communication among survivors and rescue teams over critical environments where 3/4G cellular connectivity is not available and the traditional geo-localization technologies (e.g. the GPS) provide only partial coverage of the environment. The proposed system consists of a mobile application connected to a LoRa transceiver via Bluetooth Low Energy (BLE); through the app, users can send emergency requests that are re-broadcasted by other peers until reaching a rescue personnel who is able to handle the emergency. Three novel contributions are provided in this paper. First, we provide extensive measurements of the LoRa technology, and investigate its suitability for ECS-related applications. Second, we describe the LOCATE prototype and the enabling algorithms; specifically, we propose a novel multi-hop dissemination algorithm which maximizes the probability to deliver an emergency request to the destination (e.g. rescue personnel) within a user-defined temporal threshold, while minimizing the number of message re-transmissions. Third, we extensively evaluate the LOCATE performance through OMNeT++ simulations, assessing the capability of the dissemination protocol to spread out the emergency requests over large-scale scenarios, and through experiments, assessing the capability of LoRa-based trilateration technique to provide accurate GPS-free localization. The results demonstrate that the LOCATE protocol is able to minimize the time required to handle the emergency when compared to other dissemination strategies (e.g. flooding, continuous, once-per-contact), and they highlight the considerable improvement provided by the LoRa technology over other D2D solutions available on COTS smartphones (e.g. Wi-Fi Direct).

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%.

A parenting intervention for middle childhood: An expansion of a Circle of Security intensive individual protocol

The intensive Circle of Security intervention is an attachment-based program that utilises video feedback to support parents to understand and respond to their children’s attachment needs. The original group format was developed into an individual protocol for flexible delivery and broad dissemination. This protocol, described elsewhere, has been previously meaningfully applied to caregiver-child dyads up to preschool age. The present case study describes an expansion of the protocol’s applicability to dyads in middle childhood by demonstrating its use with a mother who presented with difficulties managing the externalising behaviours of her 8-year-old daughter.

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.

Healing the Past by Nurturing the Future—co-designing perinatal strategies for Aboriginal and Torres Strait Islander parents experiencing complex trauma: framework and protocol for a community-based participatory action research study

IntroductionChild maltreatment and other traumatic events can have serious long-term physical, social and emotional effects, including a cluster of distress symptoms recognised as ‘complex trauma’. Aboriginal and Torres Strait Islander...