| Hi-index | 0.00 |
Distribution of data in mobile ad hoc networks is challengedwhen the mobility of nodes leads to frequent topologychanges. Existing approaches so far address either thenetwork partitioning problem or are capable of handlinglarge amounts of data, but not both at the same time.In this paper a novel approach is presented which is basedon a negotiation scheme enhanced by an adaptive repetitionstrategy. Different strategies for the selection of repeateddata are presented and evaluated. Simulation results showa reduction of data transfer volume compared to hyper-floodingby 30 to 40% even in the presence of frequent networkpartitions.