SAPM: Self-Adjusting Pipelining Mechanism for Efficient Bulk Data Dissemination in Smart Homes

Bulk data dissemination is a basic building block for enabling software update and reprogramming in wireless sensor networks. The recent structure based approach looks promising for efficient dissemination since it facilitates transmission and sleep scheduling. However, a number of limitations exist in existing structured protocols. In this paper, we propose a correlated core based solution for efficient bulk data dissemination in wireless sensor networks. We propose an efficient backbone node selection algorithm to construct the core structure by exploiting link correlation. We also design a novel negotiation mechanism which greatly reduces the control message overhead as compared to the existing structured protocols. We conduct both simulation and testbed experiments, and the results show that our proposed solution outperforms the state-of-the-art in terms of both the number of transmissions and the completion time.

Wireless sensor network-based (WSN-based) applications need an efficient and reliable data dissemination service to facilitate maintenance, management and data distribution tasks. As WSNs nowadays are becoming pervasive and data intensive, bulk data dissemination protocols have been extensively studied recently. This paper provides a comprehensive survey of the state-of-the-art bulk data dissemination protocols. The large number of papers available in the literature propose various techniques to optimize the dissemination protocols. Different from the existing survey works which separately explores the building blocks of dissemination, our work categorizes the literature according to the optimization purposes: Reliability, Scalability and Transmission/Energy efficiency. By summarizing and reviewing the key insights and techniques, we further discuss on the future directions for each category. Our survey helps unveil three key findings for future direction: (1) The recent advances in wireless communications (e.g., study on cross-technology interference, error estimating codes, constructive interference, capture effect) can be potentially exploited to support further optimization on the reliability and energy efficiency of dissemination protocols; (2) Dissemination in multi-channel, multi-task and opportunistic networks requires more efforts to fully exploit the spatial-temporal network resources to enhance the data propagation; (3) Since many designs incur changes on MAC layer protocols, the co-existence of dissemination with other network protocols is another problem left to be addressed.

Due to the dynamically changing topology of Internet of Vehicles (IoV), it is a challenging issue to achieve efficient data dissemination in IoV. This paper considers strongly connected IoV with a number of heterogenous vehicular nodes to disseminate information and studies distributed replication-based data dissemination algorithms to improve the performance of data dissemination. Accordingly, two data replication algorithms, a deterministic algorithm and a distributed randomised algorithm, are proposed. In the proposed algorithms, the number of message copies spread in the network is limited and the network will be balanced after a series of average operations among the nodes. The number of communication stages needed for network balance shows the complexity of network convergence as well as network convergence speed. It is proved that the network can achieve a balanced status after a finite number of communication stages. Meanwhile, the upper and lower bounds of the time complexity are derived when the distributed randomised algorithm is applied. Detailed mathematical results show that the network can be balanced quickly in complete graph; thus highly efficient data dissemination can be guaranteed in dense IoV. Simulation results present that the proposed randomised algorithm outperforms the present schemes in terms of transmissions and dissemination delay.

Security and efficient data dissemination over wireless network has been the focus of research in academic, military and commercial domains for many years. Unfortunately, proposed security solutions for data dissemination over wireless network are not efficient enough. In this work, a novel security and efficient data dissemination scheme which integrates authentication into a SE-Raptor (security enhanced Raptor) codes is investigated. In SE-Raptor codes, encoding packets with degree one are encoded again, and many promiscuous packets are took part in encoding. Simulation results show that the proposed method has better performance in terms of encoding ratio, degree ratio, encoding and decoding efficiency. Additionally, our analysis shows that data confidentiality, bogus data protection and deny of service properties are provided by the proposed scheme.

Achieving efficient data dissemination to a mobile sink moving is one of the main challenges in wireless sensor networks. In this paper, we describe DHA, a data Dissemination protocol based on Home agent and Access node. DHA introduces the home agent and access node concepts to represent the mobile sink in sensor networks. The movement of the mobile sink affects only the access nodes and home agent, and the sensor nodes can transfer data to the fixed home agent without knowing the position of mobile sink. All the sensor nodes except the home agent and access node don't need to be updated in the direction of forwarding future data. DHA provides reliable and efficient data delivery to a mobile sink with minimum overheads. Our result shows that DHA increases the reliability of data delivery to the mobile sink and reduces the number of broadcast packets, thereby increasing the lifetime of sensor networks.

The technique of distributed storage coding has been widely used in wireless sensor networks for increasing the robustness of data storage and efficiency of data retrieval. Existing works mainly focus on scenarios in which each storage node stores a linear combination of a subset of K data packets generated by different source nodes. By solving the linear equations, a collector can recover all the K data packets with high probability. This paper explores the problem of flexible and efficient data dissemination and retrieval in wireless sensor networks. Our scheme exploits the broadcast nature of wireless transmission and improves the traditional random walk algorithm for efficient data dissemination. Furthermore, through the use of Fountain codes in data encoding, it enables a mobile collector to recover up-to-date data generated by any subset of source nodes. Specifically, by querying any t(1 + ε) storage nodes at the t-th time slot, the target data can be retrieved without having to decode all the source packets. Simulation results validate our analysis and show that the proposed schemes are flexible and efficient.

A holistic sensor network design for energy conservation and efficient data dissemination

HashQuery, a Hash-area-based data dissemination protocol, was designed in wireless sensor networks. Using a Hash function which uses time as the key, both mobile sinks and sensors can determine the same Hash area. The sensors can send the information about the events that they monitor to the Hash area and the mobile sinks need only to query that area instead of flooding among the whole network, and thus much energy can be saved. In addition, the location of the Hash area changes over time so as to balance the energy consumption in the whole network. Theoretical analysis shows that the proposed protocol can be energy-efficient and simulation studies further show that when there are 5 sources and 5 sinks in the network, it can save at least 50% energy compared with the existing two-tier data dissemination(TTDD) protocol, especially in large-scale wireless sensor networks.

The vehicular adhoc networks (VANETs) is an integral part of the intelligent transportation system required for delivering safety and non-safety messages to vehicles in real-time via vehicle to vehicle and vehicle to everything communication modes. The purpose of VANETs is to provide efficient routing, message security, congestion-free traffic, and other services related to entertainment and comfortable journey. All these VANETs services, at the core, are related to efficient and secure data dissemination. In this paper, we have focused on clustering in VANETs for efficient data dissemination and resource sharing tasks. Considering the importance of fog computing for fast computing and processing, we have focused on clustering techniques in Fog-based VANET as well that can enhance the range of transmission and expand the number of available resources. This survey paper discusses the existing clustering techniques in VANETs scenario, cluster head selection parameters, the context-based techniques, and cluster performance parameters in VANETs.

Pattern transformation-invariant schemes for wireless sensor networks based on an edge detection gradient-based mechanism

The goal of this paper is to design and implement an efficient data dissemination algorithm for wireless sensor networks. The proposed approach requires nodes in a network to publish their characteristics to their neighboring nodes. Each node selects its parent node for data forwarding using a method similar to natural selection. Fitness score for selection is locally calculated considering several characteristics of a neighboring node such as: battery level, distance, and hierarchy level. The main goal of this algorithm is to extend the wireless sensor network lifetime by distributing the traffic load among the nodes that have higher probabilities of predicted survival, which is identified by their fitness score. In addition, this approach can provide a framework to study the emergent behaviors of networks when different local rules for node selection are applied.

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.

Data dissemination from multiple sources to mobile sinks is fundamental and challenging in WSN applications due to limited energy supply of sensor nodes and sink mobility. Previous data dissemination protocols either rely on an energy-consuming coordinate system or build an inefficient backbone. In this paper, we propose a hierarchical role-based data dissemination (HRDD) protocol in wireless sensor networks. In HRDD, a small number of sensor nodes are assigned to serve as cluster heads and agents to form the data dissemination backbone and mitigate unnecessary query forwarding. In addition, HRDD designs an efficient data delivery mechanism that provides shorter paths to accelerate data delivery as well as reduce the number of data transmissions. An adaptive backbone maintenance mechanism is also introduced for low-energy cluster heads and agents to reduce their load, thereby prolonging the network lifetime. The experimental results show that HRDD achieves the longer network lifetime, the shorter delay, and the high success ratio compared to the prior work.

Vehicular sensor networks (VSNs) have emerged as a new technology, which combines wireless communication offered by vehicular ad hoc NETworks with sensing devices installed in vehicles or in roadsides. VSN creates a huge opportunity to extend the roadside sensor infrastructure of existing traffic control systems. The main issues in VSNs are inherent in the data collection and its dissemination in such a large-scale network, characterized by frequent topology changes and network partitioning. This paper proposes a new multi-hop data collection and dissemination protocol based on data replication approach. The aim is an efficient collection and dissemination of data from a defined geographic area. Differently from other data collection protocols for VSNs, which have for purpose to collect data for traffic control applications or monitoring applications, our proposed protocol called Collaborative Data Collection Protocol (CDCP for VSNs) focuses on collecting data to be used in non-delay tolerant applications, so CDCP aims to collect the requested data within an optimized delay, but also, focuses in making this data accessible for other potential requests. Simulation results show the effectiveness of our proposed protocol.

In wireless sensor networks, there have recently been studies on mobile sinks groups such as groups of soldiers on battlefields, which are characterized by geographically collective movement. Although the existing protocols for individual mobile sinks can support the mobile sinks groups, they suffer from high congestion and control overhead due to location updates by each sink in the groups. To solve the location update problem by individual sinks, a protocol, called M-Geocasting only updates the region information of the mobile sink groups to sources. However, since M-Geocasting uses the flooding within the group regions for data delivery to member sinks, it excessively consumes the energy of sensor nodes in the group region. Moreover, the flooding potentially causes broadcast storms within the group region when many events exist. Thus, in this paper, we propose an efficient data dissemination protocol which can avoid the flooding within the group region for supporting mobile sink group. The proposed protocol introduces a virtual pipe in the group region for data dissemination as data storage. In the proposed protocol, a source sends data to the pipe and member sinks retrieve data directly from the pipe. Simulation results show that the proposed protocol is superior to the existing protocols in terms of the energy consumption and the data delivery ratio.