Navid Hamed Azimi
Jie Gao
ABSTRACT
In this paper, we address the problem of preserving generated data in a sensor network in case of node failures. We focus on the type of node failures that have explicit spatial shapes such as circles or rectangles (e.g., modeling a bomb attack or a river overflow). We consider two different schemes for introducing redundancy in the network, by simply replicating data or by using erasure codes, with the objective to minimize the communication cost incurred to build such data redundancy. We prove that the problem is NP-hard using either replication or coding. We design Oα-approximation centralized and distributed algorithms for the two redundancy schemes, where α is the "fatness" of the potential node failure events. Using erasure codes, data distribution can be handled in an efficient distributed manner. Simulation results show that by exploiting the spatial properties of the node failure patterns, one can substantially reduce the communication cost compared to the resilient data storage schemes in the prior literature.
- }}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).Google Scholar
- }}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). Google ScholarDigital Library
- }}Bollobas, B. Modern graph theory. Springer, 1998.Google ScholarCross Ref
- }}Bollobas, B. Random graphs. Cambridge University Press, 2001.Google ScholarCross Ref
- }}Bondy, J., and Murty, U. Graph theory. Springer, 2007. Google ScholarDigital Library
- }}Cook, W., and Rohe, A. Computing minimum weight perfect matchings. INFORMS Journal on Computing (JOC)(1999). Google ScholarDigital Library
- }}Dimakis, A., Prabhakaran, V., and Ramchandran, K. Decentralized erasure codes for distributed networked storage. IEEE/ACM Transactions on Networking (2006).Google Scholar
- }}Garey, M. R., and Johnson, D. S. Computers and Intractability: A Guide to NP-Completeness. W. H. Freeman & Co., New York, NY, USA, 1990. Google ScholarDigital Library
- }}Ibe, O. C. Fundamentals of applied probability and random processes. Academic Press, 2005.Google Scholar
- }}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). Google ScholarDigital Library
- }}Kamra, A., Misra, V., Feldman, J., and Ruben stein, D. Growth codes: maximizing sensor network data persistence. SIGCOMM Comput. Commun. Rev. 36, 4 (2006). Google ScholarDigital Library
- }}Kuhn, F., Wattenhofer, R., and Zollinger, A. Ad hoc networks beyond unit disk graphs. Wireless Networks 14, 5 (2008). Google ScholarDigital Library
- }}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).Google ScholarDigital Library
- }}Lin, Y., Liang, B., and Li, B. Geometric random linear codes in sensor networks. In Proceedings of the International Communications Conference (ICC) (2008).Google ScholarCross Ref
- }}Navas, J. C., and Imielinski, T. Geocast: geographic addressing and routing. In Proceedings of The International Conference on Mobile Computing and Networking (MobiCom)(1997). Google ScholarDigital Library
Index Terms
- Data preservation under spatial failures in sensor networks
Recommendations
Redundancy Analysis and a Distributed Self-Organization Protocol for Fault-Tolerant Wireless Sensor Networks
Sensor nodes in a distributed sensor network can fail due to a variety of reasons, e.g., harsh environmental conditions, sabotage, battery failure, and component wear-out. Since many wireless sensor networks are intended to operate in an unattended ...
Data Preservation in Data-Intensive Sensor Networks With Spatial Correlation
Mobidata '15: Proceedings of the 2015 Workshop on Mobile Big DataMany data-intensive sensor network applications are potential big-data enabler: they are deployed in challenging environments to collect large volume of data for a long period of time. However, in the challenging environments, it is not possible to ...
An efficient adjustable grid-based data replication scheme for wireless sensor networks
Wireless Sensor Networks (WSNs) consist of hundreds or thousands of sensor nodes connected to each other through short-distance wireless links. Because sensor nodes are energy-constrained, efficient energy use is a critical issue for WSNs. In WSNs, the ...
Comments