Overflow of fountain codes in multi-hop wireless sensor networks
Claire Goursaud2011, IEEE International Symposium on Personal, Indoor and Mobile Radio Communications
Sign up for access to the world's latest research
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Abstract
This paper concentrates on the proper use of fountain codes for the transmission of sporadic data in a wireless sensor network (WSN). Fountain codes offer great perspectives for the self-organization of WSNs: they self adapt to the channel error rate without control packets. Deploying fountain codes in a WSN raises two problems. First, the size of the data transmitted by a sensor is small in comparison to the size usually considered with fountain codes. Second, WSNs mostly rely on multi-hop transmissions. It implies a non null transmission duration for the end-to-end acknowledgement of the reception. During this period of time, the source is still transmitting useless packets, creating a specific overhead we define as the overflow. This paper brings the overflow problem to light and analyses its impact on the network performance. Our work can be viewed as the networking counterpart of the results presented by Pakzad et al. at ISIT 2005 applied to WSNs.
Related papers
On the Flooding Overhead of Fountain Codes in Wireless Sensor Networks
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.
The design of degree distribution for distributed fountain codes in wireless sensor networks
2014 IEEE International Conference on Communications (ICC), 2014
In this paper, we first analyse bit error rate (BER) bounds of the distributed network coding (DNC) scheme based on the Luby-transform (LT) codes, which is a class of fountain codes, for wireless sensor networks (WSNs). Then we investigate the effect from two parameters of the degree distributions, i.e., the degree value and the proportion of odd degree, to the performance of the LT-based DNC scheme. Based on the analysis and investigation results, a degree distribution design criteria is proposed for the DNC scheme based on fountain codes over Rayleigh fading channels. We compare the performance of the DNC scheme based on fountain codes using degree distributions designed in this paper with other schemes given in the literature. The comparison results show that the degree distributions designed by using the proposed criteria have better performance.
Fountain Codes Based Distributed Storage Algorithms for Large-Scale Wireless Sensor Networks
2008 International Conference on Information Processing in Sensor Networks (ipsn 2008), 2008
We consider large-scale networks with n nodes, out of which k are in possession, (e.g., have sensed or collected in some other way) k information packets. In the scenarios in which network nodes are vulnerable because of, for example, limited energy or a hostile environment, it is desirable to disseminate the acquired information throughout the network so that each of the n nodes stores one (possibly coded) packet and the original k source packets can be recovered later in a computationally simple way from any (1 + ǫ)k nodes for some small ǫ > 0. We developed two distributed algorithms for solving this problem based on simple random walks and Fountain codes. Unlike all previously developed schemes, our solution is truly distributed, that is, nodes do not know n, k or connectivity in the network, except in their own neighborhoods, and they do not maintain any routing tables. In the first algorithm, all the sensors have the knowledge of n and k. In the second algorithm, each sensor estimates these parameters through the random walk dissemination. We present analysis of the communication/transmission and encoding/decoding complexity of these two algorithms, and provide extensive simulation results as well 1 .
SYNAPSE++: Code Dissemination in Wireless Sensor Networks Using Fountain Codes
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.
Fountain Coded Wireless Transmission Model
Indian journal of science and technology, 2016
Background/Objectives: Rateless codes have recently attracted much engrossment in community communication research as the Luby Transform codes and Raptor codes are most renowned. The Fountain codes do not have the requirement of the receiver to inform the transmitter of the identity of the packets that are corrupted resulting in expelling the need of automatic repeat request transmission. Analysis: The fountain codes have high performance near to shanon limit and they have very low bit error rates as compared to channel codes used, they further have an advantage over these codes in criterion like overhead and space required for storage. Erasure codes based Forward Error Correction schemes and transfer protocols that support such codes approach to distribution of data. Wireless communication system requires error control coding at the physical layer in order to communicate over noisy channels, but they can also benefit from erasure correcting coding at the higher layer. The aggregation of good channel code with CRC code can transform a channel with noise characteristics into erasure channel by discarding the packet that fail. Results/Findings: This paper revisits the fountain codes and proposes a research work which uses fountain coding in encoding processes for wireless channel transmissions for various future studies and analysis. Conclusion/Applications: The use of fountain codes seems to be the best solution for wireless transmission over the channels with vast packet failures and disturbances. These findings may be used for deployment in MIMO models and other wireless transmission techniques.
Performance of Fountain Codes over Wireless Mobile Relay Network
Cooperative communications, where parallel relays forward information to a destination node, can effectively improve the latency in ad hoc networks. In practice, the performance of data transmission often compromises with the variation of channel coefficient and the mobility of network nodes. The conventional fixed rate cooperative relaying cannot make the outage probability reach zero without having precise channel state information (CSI) at the transmitter. In this paper we study the performance of using fountain codes in a mobile relay network. Specifically, we develop both feedback and non-feedback fountain coded cooperative communication protocols and analyze the performance of these protocols in terms of transmission efficiency. It is observed that the number of total relay nodes plays a significant role on the performance improvement. Simulation results justify that the proposed feedback based protocol always outperforms its non-feedback counterpart in a variety of metrics.
SYNAPSE: A Network Reprogramming Protocol for Wireless Sensor Networks Using Fountain Codes
2008
Wireless reprogramming is a key functionality in Wireless Sensor Networks (WSNs). In fact, the requirements for the network may change in time, or new parameters might have to be loaded to change the behavior of a given protocol. In large scale WSNs it makes economical as well as practical sense to upload the code with the needed functionalities without human intervention, i.e., by means of efficient over the air reprogramming. This poses several challenges as wireless links are affected by errors, data dissemination has to be 100% reliable, and data transmission and recovery schemes are often called to work with a large number of receivers. State-of-the-art protocols, such as Deluge, implement error recovery through the adaptation of standard Automatic Repeat reQuest (ARQ) techniques. These, however, do not scale well in the presence of channel errors and multiple receivers. In this paper, we present an original reprogramming system for WSNs called SYNAPSE, which we designed to improve the efficiency of the error recovery phase. SYNAPSE features a hybrid ARQ (HARQ) solution where data are encoded prior to transmission and incremental redundancy is used to recover from losses, thus considerably reducing the transmission overhead. For the coding, digital Fountain Codes were selected as they are rateless and allow for lightweight implementations. In this paper, we design special Fountain Codes and use them at the heart of SYNAPSE to provide high performance while meeting the requirements of WSNs. Moreover, we present our implementation of SYNAPSE for the Tmote Sky sensor platform and show experimental results, where we compare the performance of SYNAPSE with that of state of the art protocols.
Mathematical Analysis of the throughput using Fountain Code-Enabled DCF on IEEE802.11 based Wireless Sensor Networks
This paper presents a simple approximation mathematical model of fountain code-enabled distribution coordination function to calculate the throughput for the ideal condition of IEEE802.11 using the request to send/clear to send of four-way handshaking technique. This estimation introduces a new linear approximation model that reduces the complexity of the nonlinear of the analytical model. However, the resolution of non-linear system and performance modeling analysis of the IEEE 802.11 network in all its various extensions have been the subject of several studies. Because the analytical results for these non-linear models are difficult to verify and some equations are given without clear proof. This analysis is validated by comparison with simulation results using Matlab. Keywords — Mathematical Analysis, Wireless Sensor Network, Fountain Code, Throughput, Markov Chain. International Journal of Computer Science and Information Security (IJCSIS), Vol. 13, No. 11, November 2015 https://sites.google.com/site/ijcsis/ ISSN 1947-5500
Forward Correction and Fountain Codes in Delay-Tolerant Networks
IEEE/ACM Transactions on Networking, 2000
Delay tolerant Ad-hoc Networks leverage the mobility of relay nodes to compensate for lack of permanent connectivity and thus enable communication between nodes that are out of range of each other. To decrease delivery delay, the information to be delivered is replicated in the network. Our objective in this paper is to study a class of replication mechanisms that include coding in order to improve the probability of successful delivery within a given time limit. We propose an analytical approach that allows to quantify tradeoffs between resources and performance measures (energy and delay). We study the effect of coding on the performance of the network while optimizing parameters that govern routing. Our results, based on fluid approximations, are compared to simulations which validate the model. 1 .
Network Coded Transmission of Fountain Codes over Cooperative Relay Networks
2010 Ieee Wireless Communication and Networking Conference, 2010
In this paper, a transmission strategy of fountain codes over cooperative relay networks is proposed. When more than one relay nodes are available, we apply network coding to fountain-coded packets. By doing this, partial information is made available to the destination node about the upcoming message block. It is therefore able to reduce the required number of transmissions over erasure channels, hence increasing the effective throughput. Its application to wireless channels with Rayleigh fading and AWGN noise is also analysed, whereby the role of analogue network coding and optimal weight selection is demonstrated.
Related papers
Study the Performance of Fountain Codes in Wireless Communication Systems
In wireless, satellite, and space communication systems reducing error is critical. High bit error rates of the wireless communication system require employing various coding methods on the data transferred. To address the large latency and degraded network throughput due to the retransmission triggered by frame loss in high speed wireless networks, the purpose of this paper is to study and investigate the performance of fountain codes that is used to encode and decode the data stream in digital communication. This solution intelligently encodes a number of redundant frames from original frames upon link loss rate so that a receiver can effectively recover lost original frames without significant retransmissions. Since then, many digital Fountain coding methods have been invented such as Tornado codes, Luby transform (LT) codes and Raptor codes. https://sites.google.com/site/ijcsis/
Performance of Combined Fountain Code with Network Coding Over Wireless Channels
Recent advances in sparse graph codes have led to the proposal of fountain coding (FC). It becomes as an error correction coding scheme of choice for many multicasting and broadcasting systems. Network coding (NC) is used in modern wireless communication networks in order to gain throughput and some other advantages. In this paper, NC is used in conjunction with FC in order to obtain advantages of both techniques. A simple packet based network coding for butterfly network topology with FC is modelled and simulated. The system is tested over different wireless fading channel models and with different FC-NC arrangements.The results of the tests have shown that combined FC and NC techniques improve throughput over the original system without FC by more than (70%) at relatively low signal-to-noise power ratios for the considered models of wireless channels. An optimum bit error rate performance (zero error) is achieved using the combined FC with NC over the original system (i.e using NC...
Towards increasing diversity for the relaying of LT Fountain Codes in Wireless Sensor Networks
Computing Research Repository, 2010
Diversity is a powerful means to increase the transmission performance of wireless communications. For the case of fountain codes relaying, it has been shown previously that introducing diversity is also beneficial since it counteracts transmission losses on the channel. Instead of simply hop-by-hop forwarding information, each sensor node diversifies the information flow using XOR combinations of stored packets. This approach has been shown to be efficient for random linear fountain codes. However, random linear codes exhibit high decoding complexity. In this paper, we propose diversity increased relaying strategies for the more realistic Luby Transform code in order to maintain high transmission performance with low decoding computational complexity in a linear network. Results are provided herein for a linear network assuming uniform imperfect channel states.
Fountain Broadcast for Wireless Sensor Networks
Code dissemination in wireless ad hoc network is an important aspect of network deployment. Once deployed, the network 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 principles of modern erasure codes. FBcast provides high reliability and data confidentiality: often considered critical for disseminating codes. Simulation results on TOSSIM show that FBcast offers higher reliability with lower number of retransmissions than traditional broadcasts.
Towards increasing packet diversity for relaying LT Fountain Codes in Wireless Sensor Networks
2010
Diversity is a powerful means to increase the transmission performance of wireless communications. For the case of fountain codes relaying, it has been shown previously that introducing diversity is also beneficial since it counteracts transmission losses on the channel. Instead of simply hop-by-hop forwarding information, each sensor node diversifies the information flow using XOR combinations of stored packets. This approach has been shown to be efficient for random linear fountain codes. However, random linear codes exhibit high decoding complexity. In this paper, we propose diversity increased relaying strategies for the more realistic Luby Transform code in order to maintain high transmission performance with low decoding computational complexity in a linear network. Results are provided herein for a linear network assuming uniform imperfect channel states.
Toward Increasing Packet Diversity for Relaying LT Fountain Codes in Wireless Sensor Networks
IEEE Communications Letters, 2011
Diversity is a powerful means to increase the transmission performance of wireless communications. For the case of fountain codes relaying, it has been shown previously that introducing diversity is also beneficial since it counteracts transmission losses on the channel. Instead of simply hop-by-hop forwarding information, each sensor node diversifies the information flow using XOR combinations of stored packets. This approach has been shown to be efficient for random linear fountain codes. However, random linear codes exhibit high decoding complexity. In this paper, we propose diversity increased relaying strategies for the more realistic Luby Transform code in order to maintain high transmission performance with low decoding computational complexity in a linear network. Results are provided herein for a linear network assuming uniform imperfect channel states.
Performance Analysis of Fountain Codes in Multihop Relay Networks
IEEE Transactions on Vehicular Technology, 2013
Overlapped Fountain Coding: Design and Analysis
2017
The concept of fountain codes has gained considerable attention in the past few years due to its simplicity, reliability, and feasibility. Nowadays, fountain codes are used in many applications including, but not limited to, data storage, data broadcasting, and point-to-point communications. While traditional fountain codes achieve the channel capacity over the binary erasure channel universally and asymptotically, they offer much room for improvement over other channels, architectures, and regimes. With the development of new technologies for smart cities and the Internet-of-Things (IoT), data transmission methodologies with arguably the highest level of flexibility and adaptability are required. With these technologies, the end users have a very diverse set of capabilities in terms of memory, power, and processing. Besides, the end users are connected via a wide range of links with various qualities and capacities. As a result, the required methodologies must provide a comprehensi...
Joint network channel fountain scheme for reliable communication in wireless networks
2014
Joint network-channel coding (JNCC) has attracted significant interest recently for reliable data transmission over error-prone transmission channel. However, it appears that no fixed-rate channel coding is capable of driving the outage probability to zero without channel state information at the transmitter. In this paper we employ rateless coding and network coding for reliable communication in wireless relay networks. Specially we develop a scheme of joint network and fountain coding (JNFC), which can effectively combat the detrimental effect of wireless fading channel by seamlessly coupling fountain and network paradigms. Simulation results justify that our proposed JNFC has significant performance advantage over other schemes in a variety of metrics. Index Terms-cooperative communications, fountain codes, network coding.
The performance evaluation of fountain codes with feedback in cooperative systems
2013 21st Iranian Conference on Electrical Engineering (ICEE), 2013
In this paper a new strategy of fountain code transmission over cooperative relay networks is proposed. The rateless characteristic of fountain codes makes them suitable for sending data over erasure channels. In addition, the presence of relay nodes can help to improve the performance. Until now, traditional rateless codes, rarely use feedback communication channels between receivers and broadcasters, a feature that is available in many wireless settings and helps to have better performance. Thus, in this paper we provide a feedback channel between the destination and the relay in order to help the relay to have more efficient transmissions. It ends to decrease the overall overhead in transmission over erasure channels. Thereby, significant savings in time and energy are obtained.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.