Reprogramming In Wireless Sensor Networks Research Articles

Energy efficient secured K means based unequal fuzzy clustering algorithm for efficient reprogramming in wireless sensor networks

Energy efficient secured K means based unequal fuzzy clustering algorithm for efficient reprogramming in wireless sensor networks

ReLog: A systematic approach for supporting efficient reprogramming in wireless sensor networks

Wireless sensor networks are shifting to application platforms that poses several challenges on reprogramming efficiency. To better support the efficient reprogramming, this paper proposes a systematic approach named ReLog which consists of a programming language, a compiler, and a virtual machine. To make application programs concise and easy to modify, the ReLog language extends from a traditional logical programming language and makes the extension part have the similar coding style. To reduce the size of data for reprogramming, the compiler first produces extremely compact executable code by compiling application programs into high-level representations. It also implements efficient incremental reprogramming to diminish differences between the current and new executable code. To mitigate the energy consumption incurred by interpretive execution, the virtual machine optimizes the executable code as well as the execution process to improve the runtime efficiency. We have implemented ReLog and evaluated it with respect to real reprogramming cases. Our experimental results show that it is easy to modify ReLog programs to satisfy new application requirements. Meanwhile, the compiler reduces the size of executable code by 61.4%–83.2% compared to the existing work. In addition, the lifetime of sensors running the ReLog virtual machine is close (97.04%–98.31%) to that running the native code.

Link-Correlation-Aware Data Dissemination in Wireless Sensor Networks

Reprogramming is a crucial technique for software deployment and update in wireless sensor networks (WSNs). Bulk data dissemination is an important building block for enabling wireless reprogramming. Dissemination for reprogramming is required to be fast and energy efficient. Recent studies show that wireless link correlation can have a significant impact on the performance of bulk data dissemination. In this paper, we propose correlated dissemination (CD), a fast and energy-efficient bulk data dissemination protocol for reprogramming in WSNs. The main contribution of CD is that it disseminates data according to a novel structure called correlated tree, which considers both link qualities and link correlations. The construction of correlated tree is lightweight and allows for more efficient data transmission. Moreover, it selectively and dynamically employs rateless codes to improve the performance, especially in circumstances where link correlation is inherently weak. We implement CD based on TelosB testbed with both TinyOS and OpenWSN (with 802.15.4e MAC). Evaluation results show that, compared with previous works, CD greatly improves the dissemination performance in terms of completion time, transmission cost, and energy efficiency.

Lightweight Reprogramming and Energy Balancing in Wireless Sensor Networks

Reprogramming in wireless sensor networks is important and challenged by the dynamic environment and its own characteristic, frequently sleeping. Although there has existed various approaches, they still suffer from message control redundancy and energy balancing issues. In this paper, we consider the problem of lightweight code distribution and energy balancing in wireless sensor networks by utilizing shared requests to reduce redundant control messages. Additionally, our contribution is enhanced by various solutions, such as multisegment advertisement strategy and edge-oriented strategy. Through analysis and evaluation sections, we confirm that our protocol does not only help to reduce update completion time by 1/3 compared with the Deluge protocol, but also significantly decreases redundant control messages and balances energy consumption among nodes in the updating process.

Elon

We present a new mechanism called Elon for enabling efficient and long-term reprogramming in wireless sensor networks. Elon reduces the transferred code size significantly by introducing the concept of replaceable component. It avoids the cost of hardware reboot with a novel software reboot mechanism. Moreover, it significantly prolongs the reprogrammable lifetime (i.e., the time period during which the sensor nodes can be reprogrammed) by avoiding flash writes for TelosB nodes. Experimental results show that Elon transfers up to 120--389 times less information than Deluge, and 18--42 times less information than Stream. The software reboot mechanism that Elon applies reduces the rebooting cost by 50.4%--53.87% in terms of beacon packets, and 56.83% in terms of unsynchronized nodes. In addition, Elon prolongs the reprogrammable lifetime by a factor of 3.3.

Optimizing sensor network reprogramming via in situ reconfigurable components

Wireless reprogramming of sensor nodes is a critical requirement in long-lived wireless sensor networks (WSNs) addressing several concerns, such as fixing bugs, upgrading the operating system and applications, and adapting applications behavior according to the physical environment. In such resource-poor platforms, the ability to efficiently delimit and reconfigure the necessary portion of sensor software—instead of updating the full binary image—is of vital importance. However, most existing approaches in this field have not been adopted widely to date due to the extensive use of WSN resources or lack of generality. In this article, we therefore consider WSN programming models and runtime reconfiguration models as two interrelated factors and we present an integrated approach for addressing efficient reprogramming in WSNs. The middleware solution we propose, <scp<RemoWare</scp<, is characterized by mitigating the cost of post-deployment software updates on sensor nodes via the notion of in situ reconfigurability and providing a component-based programming abstraction in order to facilitate the development of dynamic WSN applications. Our evaluation results show that <scp<RemoWare</scp< imposes a very low energy overhead in code distribution and component reconfiguration and consumes approximately 6% of the total code memory on a <scp<TelosB</scp< sensor platform.

Mitigating the Effects of Software Component Shifts for Incremental Reprogramming of Wireless Sensor Networks

Wireless reprogramming of sensor nodes is an essential requirement for long-lived networks because software functionality needs to be changed over time. The amount of information that needs to be wirelessly transmitted during reprogramming should be minimized to reduce reprogramming time and energy. In this paper, we present a multihop incremental reprogramming system called Hermes that transfers over the network the delta between the old and new software and lets the sensor nodes rebuild the new software using the received delta and the old software. It reduces the delta by using techniques to mitigate the effects of function and global variable shifts caused by the software modifications. Then it compares the binary images at the byte level with a method to create a small delta that needs to be sent over the wireless network to all the nodes. For the wide range of software change scenarios that we experimented with, we find that Hermes transfers up to 201 times less information than Deluge, the standard reprogramming system for TinyOS, and 64 times less than an existing incremental reprogramming system by Jeong and Culler.

Efficient Homomorphic Hashing Approach for Secure Reprogramming in Wireless Sensor Networks

While existing solutions can provide authentication services, they are insufficient for a new generation of network coding-based reprogramming protocols in wireless sensor networks. We present a security approach that is able to defend pollution attack against reprogramming protocols based on network coding. It employs a homomorphic hashing function and an identity-based aggregate signature to allow sensor nodes to check packets on-the-fly before they accept incoming encoded packets, and introduces an efficient mechanism to reduce the computation overhead at each node and to eliminate bad packets quickly. Castalia simulations show that when the 5% of the nodes in a network of 100 nodes are rogue, using our approach, the efficiency of the secure reprogramming protocol based on network coding improves almost ten-fold for a checking probability of 2%.

A multichannel code distribution protocol for remote reprogramming in WSNs

In view of the problem of low efficiency and high energy consumption in remote reprogramming in wireless sensor networks (WSNs), this paper presents a code distribution protocol based on multi-channel diffusion mechanism (MDM). In MDM, the network nodes classify the 16 channels in 2.4 GHz band by energy scanning, and then it selects an optimal channel to forward the code images by a specific channel selection mechanism. MDM achieves a number of adjacent nodes in a network transmit code images in different channels simultaneously. Furthermore, from the perspective of energy saving, MDM also introduces a sleep strategy for forwarding nodes. Simulation results demonstrate that MDM improves the efficiency and reduces the energy consumption of remote reprogramming in WSNs compared with other code distribution protocols, and moreover, it settles the problem of hidden terminal; with the increasing in the number of nodes and node spacing, optimization is obvious.

Scatter secure code authentication for efficient reprogramming in wireless sensor networks

Currently proposed solutions to secure code dissemination in wireless sensor networks (WSNs) involve the use of expensive public-key digital signatures. In this work, we present Scatter, a secure c...

Scatter – secure code authentication for efficient reprogramming in wireless sensor networks

Currently proposed solutions to secure code dissemination in wireless sensor networks (WSNs) involve the use of expensive public-key digital signatures. In this work, we present Scatter, a secure code dissemination protocol that enables sensor nodes to authenticate the program image efficiently. To achieve this, we use a scheme that offers source authentication in the group setting like a public-key signature scheme, but with signature and verification times much closer to those of a MAC (message authentication code). In this way, Scatter avoids the use of elliptic curve cryptography and manages to surpass all previous attempts for secure code dissemination in terms of energy consumption, memory and time efficiency. Besides the design and theoretical analysis of the protocol, we also report the experimental evaluation of Scatter in two different hardware platforms, Mica2 and MicaZ, which proves its efficiency in practice.

Elon

We present a new mechanism called Elon for enabling efficient and long-term reprogramming in wireless sensor networks. Elon reduces the transferred code size significantly by introducing the concept of replaceable component. It avoids the cost of hardware reboot with a novel software reboot mechanism. Moreover, it significantly prolongs the reprogramming lifetime by avoiding flash writes for TelosB nodes. Experimental results show that Elon transfers up to 120--389 times less information than Deluge, and 18-42 times less information than Stream. The software reboot mechanism that Elon applies reduces the rebooting cost by 50.4%-53.87% in terms of beacon packets, and 56.83% in terms of unsynchronized nodes. In addition, Elon prolongs the reprogramming lifetime by a factor of 2.3.

SYNAPSE++: Code Dissemination in Wireless Sensor Networks Using Fountain Codes

This paper presents SYNAPSE++, a system for over the air reprogramming of wireless sensor networks (WSNs). In contrast to previous solutions, which implement plain negative acknowledgment-based ARQ strategies, SYNAPSE++ adopts a more sophisticated error recovery approach exploiting rateless fountain codes (FCs). This allows it to scale considerably better in dense networks and to better cope with noisy environments. In order to speed up the decoding process and decrease its computational complexity, we engineered the FC encoding distribution through an original genetic optimization approach. Furthermore, novel channel access and pipelining techniques have been jointly designed so as to fully exploit the benefits of fountain codes, mitigate the hidden terminal problem and reduce the number of collisions. All of this makes it possible for SYNAPSE++ to recover data over multiple hops through overhearing by limiting, as much as possible, the number of explicit retransmissions. We finally created new bootloader and memory management modules so that SYNAPSE++ could disseminate and load program images written using any language. At the end of this paper, the effectiveness of SYNAPSE++ is demonstrated through experimental results over actual multihop deployments, and its performance is compared with that of Deluge, the de facto standard protocol for code dissemination in WSNs. The TinyOS 2 code of SYNAPSE++ is available at http://dgt.dei.unipd.it/download.

An Optimal Algorithm for Over-the-Air Reprogramming Protocol in WSNs

The over-the-air reprogramming has played an important role in Wireless Sensor Networks (WSNs), and has been widely researched. But the problems of low efficiency and high energy consumption have brought new challenges to the research. This paper presents an optimal algorithm, it is targeted to address the problem of relatively low efficiency and high energy consumption in over-the-air reprogramming in WSNs. Simulation results demonstrate that the optimal algorithm can improve the efficiency of over-the-air reprogramming in WSNs, and make the energy consumption in network not only lower but more balanced.