Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Effective Scheduling for Coded Distributed Storage in Wireless Sensor Networks
 

Summary: Effective Scheduling for Coded Distributed Storage in
Wireless Sensor Networks
Jan-Willem van Bloem, Richard J. Boucherie, Jasper Goseling, Maurits de Graaf,
Geert Heijenk, Jan-Kees van Ommeren and Roel Schiphorst
Faculty of EEMCS, University of Twente, Enschede, The Netherlands
{J.W.H.vanbloem, R.J.Boucherie, J.Goseling, M.deGraaf,
Geert.Heijenk, J.C.W.vanOmmeren, R.Schiphorst}@utwente.nl
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.
1 Introduction
In wireless sensor networks, reliable data storage is essential for coping with fail-
ures. Wireless sensor networks consist of cooperating devices that have sensing
capabilities to monitor environmental data. These sensor devices have limited com-
putational power, buffer and storage capabilities. A common application of wire-

  

Source: Al Hanbali, Ahmad - Department of Applied Mathematics, Universiteit Twente

 

Collections: Engineering