Distribution of data in mobile ad hoc networks is challenged when the mobility of nodes leads to frequent topology changes. Existing approaches so far address either the network partitioning problem or are capable of handling large amounts of data, but not both at the same time. In this paper a novel approach is presented which is based on a negotiation scheme enhanced by an adaptive repetition strategy. Different strategies for the selection of repeated data are presented and evaluated. Simulation results show a reduction of data transfer volume compared to hyper-flooding by 30 to 40% even in the presence of frequent network partitions.