This paper studies the use of highly dynamic networks as infrastructures for persistent storage of data that offer services at specific geographical zones in a decentralized and distributed way. We propose a new algorithm, based on repulsion techniques, to self-organize the nodes that store and serve the information. In this work, we focus on the evaluation of our algorithm when faced to different simulated failures in order to measure its robustness and compare it with an existing approach. Categories and Subject Descriptors C.2.4 [Distributed Systems]; C.2.3 [Microcomputers]: Portable devices; B.3.0 [Memory Structures] General Terms Algorithms, Performance Keywords mobile code, spatial computing, data dissemination, wireless network