Research Article
Network Coding Strategies for Data Persistence in Static and Mobile Sensor Networks
@INPROCEEDINGS{10.1109/WIOPT.2007.4480101, author={Daniele Munaretto and Jorg Widmer and Michele Rossi and Michele Zorzi}, title={Network Coding Strategies for Data Persistence in Static and Mobile Sensor Networks}, proceedings={1st International ICST Workshop on Wireless Networks: Communication, Cooperation and Competition}, publisher={IEEE}, proceedings_a={WNC\^{}3}, year={2008}, month={3}, keywords={Algorithm design and analysis Analytical models Broadcasting Computational modeling Computer networks Decoding Network coding Network topology Protocols Sensor phenomena and characterization}, doi={10.1109/WIOPT.2007.4480101} }- Daniele Munaretto
Jorg Widmer
Michele Rossi
Michele Zorzi
Year: 2008
Network Coding Strategies for Data Persistence in Static and Mobile Sensor Networks
WNC^3
IEEE
DOI: 10.1109/WIOPT.2007.4480101
Abstract
Network coding promises to bring significant performance improvements to sensor network protocols but algorithms need to be designed to cope with the often very constrained resources of sensor nodes. Growth codes proposed by Kamra et al. (Kamra, 2006) are one such example aimed at improving sensor network data persistence. The codes use simple coding operations and require comparatively little memory. However, growth codes are based on the assumption of an extremely dynamic network topology and do not perform well in more stable settings. In this paper we propose modifications to growth codes that are able to achieve good performance over a wider range of static and dynamic scenarios. In particular, we investigate changes of how many and which symbols the transmitted information is coded over and how the decoding is performed. These modifications are analyzed in detail by means of simulations.
