ACM Home Page
Please provide us with feedback. Feedback
Data persistence in sensor networks: towards optimal encoding for data recovery in partial network failures
Full text PdfPdf (309 KB)
Source ACM SIGMETRICS Performance Evaluation Review archive
Volume 33 ,  Issue 2  (September 2005) table of contents
Special issue on the workshop on MAthematical performance Modeling And Analysis (MAMA 2005)
Pages: 24 - 26  
Year of Publication: 2005
ISSN:0163-5999
Authors
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 26,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1101892.1101901
What is a DOI?

ABSTRACT

Sensor networks consist of a number of sensors spread across a geographical area. Each sensor has communication capability and some level of intelligence for signal processing and networking of data. Each sensor node in the network routinely 'senses' and stores data from its immediate environment. An important requirement of the sensor network is that the collected data be disseminated to the proper end users. In some cases, there are fairly strict requirements on this communication. For example, the detection of an intruder in a surveillance network should be immediately communicated to the police authorities. Each sensor node also has some storage capacity to store the collected data or to assemble the data prior to communicating it to another node.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
S. Acedanski, S. Deb, M. Medard and R. Koetter, "How Good is Random Linear Coding Based Distributed Networked Storage," in Workshop on Network Coding, Theory and Applications, 2005.
 
2
A. G. Dimakis, V. Prabhakaran and K. Ramchandran, "Ubiquitous Acess to Distributed Data in Large-Scale Sensor Networks through Decentralized Erasure Codes," in Symposium on Information Processing in Sensor Networks, 2005.
 
3
R. Ahlswede, N. Cai, S. Y. R. Li and R. W. Yeung, "Network Information Flow," in IEEE Transactions on Information Theory, 2000, vol. 46, pp. 1004--1016.
 
4
N. Cai, S. Y. R. Li and R. W. Yeung, "Linear Network Coding," in IEEE Transactions on Information Theory, 2003, vol. 49, pp. 371--381.
 
5
 
6
C. Gkantsidis and P. Rodriguez, "Network Coding for Large Scale Content Distribution," in Proceedings of INFOCOM, 2005.
 
7
Lin and Costello, Error Control Coding: Fundamentals and Applications, 1983.
 
8
M. Luby, M. Mitzenmacher, M. A. Shokrollahi and D. Spielman, "Efficient Erasure Correcting Codes," in IEEE Transactions on Information Theory, 2001, vol. 47, pp. 569--584.
 
9

Collaborative Colleagues:
Abhinav Kamra: colleagues
Jon Feldman: colleagues
Vishal Misra: colleagues
Dan Rubenstein: colleagues