Solutions for data dissemination in traditional peer-to-peer networks are not suitable for mobile peer-to-peer networks due to the special characteristics of mobile environments, particularly highly variable connectivity, and disconnection. Mobile peer-to-peer data dissemination over Delay Tolerant Networks (DTNs) is a promising paradigm since they can tolerate frequent and long network partitions. DTNs exploit collaborative data storage and node mobility to bridge disconnected nodes and enable communication between them. Recent studies based on real world traces reveal that node mobility exhibits certain patterns influenced by the centrality and the regularity of nodes in the network. Many existing routing algorithms for DTNs exploit only one of the mobility properties, e.g., only node centrality, or only node regularity to route messages from a source node to a destination node. In this paper, we present an adaptive routing algorithm that exploits either centrality or regularity according to the situation to achieve the best possible routing performance in delay tolerant networks. Simulations performed on real mobility traces show that our algorithm outperforms the existing routing algorithms that utilize only one mobility property.