Abstract
A distributed storage approach is proposed to access data reliably and to cope with node failures in wireless sensor networks. This approach is based on random linear network coding in combination with a scheduling algorithm based on backpressure. Upper bounds are provided on the maximum rate at which data can be reliably stored. Moreover, it is shown that the backpressure algorithm allows to operate the network in a decentralized fashion for any rate below this maximum.
Original language | Undefined |
---|---|
Title of host publication | Proceedings of the 31st Symposium on Information Theory in the Benelux |
Publisher | Werkgemeenschap voor Informatie- en Communicatietheorie (WIC) |
Pages | 193-200 |
Number of pages | 8 |
ISBN (Print) | 978-90-710-4823-4 |
Publication status | Published - 11 May 2010 |
Event | 31st WIC Symposium on Information Theory in the Benelux 2010 - Rotterdam, Netherlands Duration: 11 May 2010 → 12 May 2010 Conference number: 31 |
Publication series
Name | |
---|---|
Publisher | Werkgemeenschap voor Informatie- en Communicatietheorie |
Conference
Conference | 31st WIC Symposium on Information Theory in the Benelux 2010 |
---|---|
Country | Netherlands |
City | Rotterdam |
Period | 11/05/10 → 12/05/10 |
Keywords
- IR-71768
- METIS-270819
- EWI-17898
- Network coding
- Distributed Storage
- Wireless Sensor Network