Fountain Broadcast for Wireless Sensor Networks

Lecture Notes in Computer Science, 2006

Efficient and reliable dissemination of information over a large area is a critical ability of a sensor network for various reasons such as software updates and transferring large data objects (e.g., surveillance images). Thus efficiency of wireless broadcast is an important aspect of sensor network deployment. In this paper, we study FBcast, a new broadcast protocol based on the principles of modern erasure codes. We show that our approach provides high reliability, often considered critical for disseminating codes. In addition FBcast offers limited data confidentiality. For a large network, where every node may not be reachable by the source, we extend FBcast with the idea of repeaters to improve reliable coverage. Simulation results on TOSSIM show that FBcast offers higher reliability with lower number of retransmissions than traditional broadcasts.

2005

Code dissemination in wireless ad hoc network is an impor- tant aspect of network deployment. Once deployed, the net- work nodes may still need software updates to keep up with the changing application demand, thus making wireless broadcast an important aspect of any wireless network deployment. We present FBcast, a new broadcast protocol based on the princi- ples of modern

International Journal of Distributed Sensor Networks, 2013

We suggest an enhanced approach for reliable bulk data transmission of image files, multimedia video files, and successive log files for monitoring systems over wireless sensor networks. Recently, some approaches have been proposed that use multiple blocks in a frame. These approaches simply drop the block that contains the error and the error-free blocks are transmitted to other nodes. This paper proposes an enhanced FEC scheme, called M-FEC, which reduces the overhead and the total number of transmissions. M-FEC fragments bulk data into many small blocks and these blocks are encoded using rateless codes. Only the erroneous blocks that are detected in a frame are dropped and a relay node waits for other incoming blocks in order to construct a full-sized frame. This simple approach can improve the performance of the FEC scheme over WSNs. Our experiments show that M-FEC reduces the number of received frames at the sink node by almost half compared to the previous approach. We compare...

Wireless Sensor Networks (WSNs) comprises of nodes, exchanges information wirelessly with each other. Important concept used is code dissemination during which code is wirelessly propagated to all target nodes in the network. Flooding is leveraged to establish route to destination for routing. Each node informs other nodes its latest link, flooded across network. Trickle one of the important network protocols, performs flooding the code, by a technique known as Code Dissemination. During broadcast, there may be loss created at each node because of random traffic created between the nodes. This leads to traffic implosion. This limitation is reduced by using flooding schemes that achieve high reliability while reducing redundant traffic by controlling the number of broadcasts.

IEEE Transactions on Mobile Computing, 2000

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.

2011 11th International Conference on ITS Telecommunications, 2011

In this paper we propose a data dissemination technique based on Fountain codes, that is particularly suitable for vehicular environments, where mobility and connectivity issues often occur. We investigate the reliability of a real-time service and data delivery for multicast transmission over lossy Vehicular Ad-hoc NETworks (VANETs). The proposed technique represents the next work of a previous approach initially applied to traditional Mobile Ad-Hoc NETworks (MANETs). This technique combines application layer channel coding based on Luby Transform (LT) codes with multicast delivery in a wireless network exploiting PUMA (Protocol for Unified Multicasting through Announcements). The main goal is to achieve a real-time service with an high quality level in a lossy vehicular network environment. The rateless property, the ability of adapt the code on-the-fly, makes Fountain codes an attractive solution for data broadcast/multicast applications, like the well-known comfort applications. In a VANET scenario characterized by dynamic topology conditions, packet losses and disconnections, the proposed approach leads to an improvement on arrival times of packets towards destination vehicles. Simulation results provide the effectiveness of our technique compared with traditional data dissemination approach.

2007

Due to its low communication cost, stateful broadcast encryption is an appealing solution for secure content distribution in mobile ad hoc wireless networks (MANETs). Unfortunately, the inherent limitations of MANETs prevent a standard application of such schemes since they require receivers to be online. In this paper, we present a reliable message delivery mechanism for MANETs that is based on erasure codes and that leverages node mobility in order to achieve non-interactive recovery of missed messages.

2010

This paper concentrates on the proper use of fountain codes for the transmission of sporadic data in a wireless sensor network (WSN). Fountain codes oer great perspectives for the self-organization of WSNs: they self adapt to the channel error rate without any control data. When deploying fountain codes on a WSN, two problems arise. First, the size of the data transmitted by a sensor is small in comparison to the size considered traditionally with fountain codes. The analysis of the decoding overhead for fountain codes is often done for large data. Second, the communications are done in an hop-by-hop fashion. It implies that the destination of the data can not acknowledge instantaneously its reception to the source. Therefore, the transmissions of useless packets for the destination can not be prevented. The impact of this ooding trac is analyzed. It depends on the data size k and on number of hops n between the source and the destination. Our work can be viewed as the networking counterpart of the results presented by Pakzad and al. at ISIT 2005 applied to WSNs. The context of our study is a line network, i.e. a cascade of n erasure channels. The ooding trac has been evaluated as well through realistic simulations for three dierent relaying strategies where packets are lost due to both small scale fading and collisions for an unslotted IEEE 802.15.4 medium access layer.

Lecture Notes in Computer Science, 2014

In this paper, we present CodeDrip, a data dissemination protocol for Wireless Sensor Networks. Dissemination is typically used to query nodes, send commands, and reconfigure the network. CodeDrip utilizes Network Coding to improve energy efficiency, reliability, and speed of dissemination. Network coding allows recovery of lost packets by combining the received packets thereby making dissemination robust to packet losses. While previous work in combining network coding and dissemination focused on bulk data dissemination, we optimize the design of CodeDrip for dissemination of small values. We perform extensive evaluation of CodeDrip on simulations and a large-scale testbed and compare against the implementations of Drip, DIP and DHV protocols. Results show that CodeDrip is faster, smaller and sends fewer messages than Drip, DHV and DIP protocols.

2014 IEEE/ACS 11th International Conference on Computer Systems and Applications (AICCSA), 2014

The future of the Internet envisions connecting all objects around us in a proactive way in what is known as the Internet of Things (IoT). Wireless sensor networks (WSN) represent a prominent example of IoT. Broadcasting is one of most important procedures in wireless networks. However, broadcast may have immense effect on the network's performance in what is know as the broadcast storm problem. In this work, we propose a new broadcast scheme to address the broadcast storm problem. The proposed scheme is an amalgamation of three popular broadcast schemes: the probabilistic scheme, the distance-based scheme and the counter-based scheme. The proposed scheme is implemented and tested on the QualNet simulation environment where it is integrated into the Ad-hoc On-Demand Distance Vector (AODV) routing protocol. The results show that the percentage of saved rebroadcasts can reach more than 50% in some cases.