Improving the Efficiency of Wireless Sensor Networks Using Fountain Codes

Fountain codes are erasure codes that are characterized by their rateless property and their global acknowledgment. the larger the network size, the more efficient the fountain codes are degraded because of multi-hops causing an overflow. the optimization of wireless communication is also a focus of study exciting and an important issue always to maximize performance, the lifetime of the sensor nodes, and to reduce the consumption of energy. estimation becomes one of the attractive topics in wireless sensor networks nowadays. in this paper, i consider a distributed estimation scheme composing of a sensor member and a fusion center, which is the cluster head. to minimize the number of transmissions as well as the impact of overflow, i determine the optimal minimal number of encoded packets needed for successful decoding. sensor observations are encoded using fountain codes, and then messages are collected at the cluster head where a final estimation is provided with a classification based on bayes rule. the main goal of this paper is to estimate the total number of received packets using the bayes rule so that it is possible to minimize the overflow and extend the network lifetime.