Effective Scheduling for Coded Distributed Storage in Wireless Sensor Networks

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademic

22 Downloads (Pure)

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 languageUndefined
Title of host publicationProceedings of the 31st Symposium on Information Theory in the Benelux
PublisherWerkgemeenschap voor Informatie- en Communicatietheorie (WIC)
Pages193-200
Number of pages8
ISBN (Print)978-90-710-4823-4
Publication statusPublished - 11 May 2010
Event31st WIC Symposium on Information Theory in the Benelux 2010 - Rotterdam, Netherlands
Duration: 11 May 201012 May 2010
Conference number: 31

Publication series

Name
PublisherWerkgemeenschap voor Informatie- en Communicatietheorie

Conference

Conference31st WIC Symposium on Information Theory in the Benelux 2010
CountryNetherlands
CityRotterdam
Period11/05/1012/05/10

Keywords

  • IR-71768
  • METIS-270819
  • EWI-17898
  • Network coding
  • Distributed Storage
  • Wireless Sensor Network

Cite this