Data preservation under spatial failures in sensor networks

Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)

Volumn , Issue , 2010, Pages 171-180

  Azimi, Navid Hamed ^a   Gupta, Himanshu ^a   Hou, Xiaoxiao ^a   Gao, Jie ^a  

^a Stony Brook University   (United States)

Author keywords

Coding; Data replication; Fault tolerance; Sensor networks

Indexed keywords

APPROXIMATION ALGORITHMS; CODES (SYMBOLS); DIGITAL STORAGE; FAULT TOLERANCE; FORWARD ERROR CORRECTION; REDUNDANCY; SENSOR NETWORKS; SENSOR NODES;

CODING; COMMUNICATION COST; DATA DISTRIBUTION; DATA PRESERVATIONS; DATA REDUNDANCY; DATA REPLICATION; REDUNDANCY SCHEME; SPATIAL PROPERTIES;

MOBILE AD HOC NETWORKS;

EID: 78649281113     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1860093.1860117     Document Type: Conference Paper

References (15)

1. ACEDANSKI, S., DEB, S., MEDARD, M., AND KOETTER., R. How good is random linear coding based distributed networked storage. In Proceedings of the IEEE International Symposium on Network Coding (NetCod) (2005).
2. ALY, S. A., KONG, Z., AND SOLJANIN, E. Fountain codes based distributed storage algorithms for large-scale wireless sensor networks. In Proceedings of the International Conference on Information Processing in Sensor Networks (IPSN) (2008).
3. BOLLOBAS, B. Modern graph theory. Springer, 1998.
4. BOLLOBAS, B. Random graphs. Cambridge University Press, 2001.
5. BONDY, J., AND MURTY, U. Graph theory. Springer, 2007.
6. COOK, W., AND ROHE, A. Computing minimum-weight perfect matchings. INFORMS Journal on Computing (JOC) (1999).
7. DIMAKIS, A., PRABHAKARAN, V., AND RAMCHANDRAN, K. Decentralized erasure codes for distributed networked storage. IEEE/ACM Transactions on Networking (2006).
8. GAREY, M. R., AND JOHNSON, D. S. Computers and Intractability: A Guide to NP-Completeness. W. H. Freeman & Co., New York, NY, USA, 1990.
9. IBE, O. C. Fundamentals of applied probability and random processes. Academic Press, 2005.
10. KAHN, J., KATZ, R., AND PISTER, K. Next century challenges: Mobile networking for smart dust. In Proceedings of The International Conference on Mobile Computing and Networking (MobiCom) (1999).
11. KAMRA, A., MISRA, V., FELDMAN, J., AND RUBENSTEIN, D. Growth codes: maximizing sensor network data persistence. SIGCOMM Comput. Commun. Rev. 36, 4 (2006).
12. KUHN, F., WATTENHOFER, R., AND ZOLLINGER, A. Ad hoc networks beyond unit disk graphs. Wireless Networks 14, 5 (2008).
13. LIN, Y., LIANG, B., AND LI, B. Data persistence in large-scale sensor networks with decentralized fountain codes. In Proceedings of the IEEE International Conference on Computer Communications (INFOCOM) (2007).
14. LIN, Y., LIANG, B., AND LI, B. Geometric random linear codes in sensor networks. In Proceedings of the International Communications Conference (ICC) (2008).
15. NAVAS, J. C., AND IMIELINSKI, T. Geocast: geographic addressing and routing. In Proceedings of The International Conference on Mobile Computing and Networking (MobiCom) (1997).