Title
On the number of transmissions vs. redundancy tradeoff for flooded fountain codes
Abstract
We consider a multihop ad hoc network where a source node must reliably deliver a set of data packets to a given destination node. To do so, the source applies a fountain code and floods the encoded packets through the network, until they reach their destination or are lost in the process. We model the probability that the destination can recover the original transmissions from the received coded packets as a function of the network topology and of the number of redundant packets generated by the source, and show that our analytical results predict the outcome of simulations very well. These results are finally employed to discuss how the number of cooperating relays and the redundancy of the code should be set in order to achieve a good working point on the tradeoff between the reliability of end-to-end communications and the number of packet transmissions that take place in the network.
Year
DOI
Venue
2014
10.1109/CAMAD.2014.7033203
Computer Aided Modeling and Design of Communication Links and Networks
Keywords
Field
DocType
ad hoc networks,codes,cooperative communication,redundancy,telecommunication network reliability,telecommunication network topology,coded packets,data packets,destination node,flooded fountain codes,multihop ad hoc network,network topology,redundancy tradeoff
Fountain code,Computer science,Network packet,Computer network,Real-time computing,Network topology,Redundancy (engineering),Wireless ad hoc network,Decoding methods,Spread spectrum
Conference
ISSN
Citations 
PageRank 
2378-4865
1
0.35
References 
Authors
8
3
Name
Order
Citations
PageRank
Paolo Casari133432.89
Waqas bin Abbas2666.13
Michele Zorzi37079736.49