An analytic evaluation of the Trickle algorithm: Towards efficient, fair, fast and reliable data dissemination

Wireless Sensor Networks (WSNs) are popular in smart homes to implement context-aware and intelligent services. Due to fixing bugs and adding new functions, the software on sensor nodes needs to be updated depending on efficient bulk data dissemination. Existing page transfer of data dissemination protocols employ pipelining technique to achieve spatial multiplexing. The conventional pipelining inefficiency, however, becomes a bottleneck in terms of dissemination delay and communication overhead. In this paper, we propose SAPM, a novel Self-Adjusting Pipelining Mechanism for efficient bulk data dissemination. By considering the impact of link correlation, detecting accumulated pages in sensor nodes, and carefully selecting the number of pages to request, SAPM shortens the dissemination delay effectively and reduces communication overhead to improve current bulk data dissemination protocols' performance. Our evaluation results on test bed experiments and extensive simulations show that SAPM reduces the completion time of state-of-the-art bulk data dissemination protocols by 27.8% on average compared to naive solution and the number of transmissions by 17.4% on average under high link correlation while having a low memory overhead.

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.

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.

In this paper, we propose a channel assortment strategy for Reliable\nCommunication in Multi-Hop Cognitive Radio Networks.\n

In this paper, we consider a delay sensitive multimedia data dissemination in V2I network based on Systematic Network Coding (SNC). We propose an algorithm that improves SNC based data transmission by transmitting network coded data at the idle time of packet transmission between handovers. The experiment results using actual traffic data show that the proposed approach can reduce not only the overall decoding error rate but also decoding failure rates.

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.

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.

Wireless Sensor Networks (WSNs) are networks of small, low-cost, low-power, and wirelessly connected sensor nodes. These sensor nodes can be distributed over a large area and can collect data about the environment, such as temperature, humidity, light, sound, vibration, and motion. WSNs are useful in a variety of applications, including environmental monitoring, smart agriculture, healthcare, industrial automation, and security. They can be used to gather data in remote or hard-to-reach locations, and they can also be used to monitor large areas continuously and in real-time. The nodes in a WSN are typically battery-powered and have limited processing and communication capabilities. Therefore, energy efficiency is a critical concern in WSNs, and the nodes are designed to conserve energy wherever possible. Proper choice of Communication protocols are essential for energy conservation in Wireless Sensor Networks (WSNs).This paper discuss about various communication protocols and its types. They help to reduce idle listening time, minimize data transmission, optimize routing, and control transmission power. By using energy-efficient communication protocols, WSNs can achieve longer network lifetime, better data accuracy, and improved network performance.

The growing needs to support efficient data communications in wireless sensor networks (WSN) cannot be ignored. The resource constrained nature of WSN requires it to efficiently transmit the data with little consumption of network resources. We present a gossip based K - BackTrack (KBT) reliable data dissemination protocol for unstructured ad-hoc WSNs1. The goal of our proposed protocol is to ensure reliable data delivery and, at the same time, keeping the overhead associated with reliability low. The basic idea we employ is that each node to delay the acknowledgement message until it reaches Kth hop in the WSN. Then the Kth node then acknowledge the receipt of the message to the source directly. By increasing the value of K, we can minimize the network traffic. Moreover, the data dissemination in our proposed protocol exhibits low bandwidth cost (by minimizing the acknowledgement) and increases network lifetime (since critical sensors, ie. close to the control center are not overused). Through extensive experimental evaluation and comparison, our findings demonstrate that our protocol achieves significant improvements in energy efficiency and network lifetime.

Virtual tube storage scheme for supporting mobile sink groups in wireless sensor networks

Wireless sensor network is spatially distributed sensors with limited resources such as energy and buffer. Data loss prevention is challenging task in wireless sensor network (WSN), and hence, reliable data dissemination is desirable. In WSN, event detection ratio should be very high. In such condition, huge data are generated by event node. But there is always limitation of buffer size. As a result, it gets overflow. The data which are important may get lost. The proposed data loss prevention scheme will help to prevent the data loss. The effective tour strategy of mobile data collector node will improve QoS parameters of WSN.

The advantages of deploying mobile sinks (MSs) in wireless sensor networks (WSNs) have attracted tremendous attention recently, because mobility of a sink provides an efficient method to improve data gathering performance in WSNs. However, in such kind of WSN, the efficiency of data dissemination is obviously affected by the trajectory of the MS. Therefore, optimal moving schemes of the MS have been studied in many researches. Nevertheless, in many cases, the trajectory of the MS is not able to change ideally as previous studies assumed but depending on the environmental conditions. In this paper, we focus on the efficiency of data gathering in WSN with a MS whose trajectory cannot change ideally and propose a new data diffusion scheme - implementing a new Pre-Diffusion Algorithm (PDA) in a hierarchical WSN aimed at improving data gathering efficiency. This hierarchical WSN is composed of several clusters, and datatransmission is done by higher powered cluster head (CH) node. Our scheme predetermines the cluster area where the MS is going to arrive in most probability in next period of time. MS fulfills data converging in the cluster head (CH)whose distance to the MS may the smallest compared with other CHs when data gathering starts. Thus more data can be collected with less trajectory length of MS. Simulation results show that our proposed scheme improves data gathering efficiency as compared to conventional scheme.

Bluetooth is an omnipresent communication technology, available on billions of connected devices today. While it has been traditionally limited to peer-to-peer and star network topology, the recent Bluetooth 5 standard introduces new operating modes to allow for increased reliability and Bluetooth Mesh supports multi-hop networking based on message flooding. In this paper, we present BlueFlood. It adapts concurrent transmissions, as introduced by Glossy, to Bluetooth. The result is fast and efficient network-wide data dissemination in multi-hop Bluetooth networks. Moreover, we show that BlueFlood floods can be reliably received by offthe-shelf Bluetooth devices such as smartphones, opening new applications of concurrent transmissions and a seamless integration with existing technologies. We present an in-depth experimental feasibility study of concurrent transmissions over Bluetooth PHY in a controlled environment. Further, we build a small-scale testbed where we evaluate BlueFlood in real-world settings of a residential environment. We show that BlueFlood achieves 99% end-toend delivery ratio in multi-hop networks with a duty cycle of 0.13% for 1-second intervals.

This paper presents a survey on the current state-of-the-art in Wireless Sensor Network (WSN) Operating Systems (OSs). In recent years, WSNs have received tremendous attention in the research community, with applications in battlefields, industrial process monitoring, home automation, and environmental monitoring, to name but a few. A WSN is a highly dynamic network because nodes die due to severe environmental conditions and battery power depletion. Furthermore, a WSN is composed of miniaturized motes equipped with scarce resources e.g., limited memory and computational abilities. WSNs invariably operate in an unattended mode and in many scenarios it is impossible to replace sensor motes after deployment, therefore a fundamental objective is to optimize the sensor motes’ life time. These characteristics of WSNs impose additional challenges on OS design for WSN, and consequently, OS design for WSN deviates from traditional OS design. The purpose of this survey is to highlight major concerns pertaining to OS design in WSNs and to point out strengths and weaknesses of contemporary OSs for WSNs, keeping in mind the requirements of emerging WSN applications. The state-of-the-art in operating systems for WSNs has been examined in terms of the OS Architecture, Programming Model, Scheduling, Memory Management and Protection, Communication Protocols, Resource Sharing, Support for Real-Time Applications, and additional features. These features are surveyed for both real-time and non-real-time WSN operating systems.

Wireless Sensor and Actor Networks (WSANs) have received increased attention from the research community in the recent years. This is mainly because as an extension to Wireless Sensor Networks(WSN), they have the ability to actively participate in the environment trough the actors. However, this introduces new challenges as to how to transfer commands between nodes, actors and central station who may be from different manufacturers and use different communication protocols. Another important aspect is the ability of the WSAN to present the data to the interested party or to receive the command from the operator, and do this with in the simplest and most user friendly way as possible. In this paper we propose architecture for interconnection between different layers of WSANs and the central stations that would allow building a simple interface that would ease the operation with WSANs in view of Control and Data Acquisition.