This letter presents the globally optimal data replication in the distributed networks. We propose a distributed approach based on the metropolis-hastings algorithm to achieve the globally optimal data replication without requiring any global information. Experimental results show that the proposed approach works well and the error can be held below 0.6% easily.

A novel routing protocol, named candidate-based routing, for mobile ad hoc networks is presented. Instead of flooding over the whole network, it improves and rebuilds routing paths among a limited number of candidate nodes, which are dynamically elected without incurring or exchanging any additional information. Experimental results show that the proposed protocol performs well in terms of overhead and improvement in route efficiency, especially in the high mobility speed environments.