Ensuring strong data guarantees in highly mobile ad hoc networks via quorum systems

  • Authors:

  • Daniela Tulone

  • Affiliations:

  • MIT Computer Science and Artificial Intelligence Lab, United States

  • Venue:
  • Ad Hoc Networks
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Ensuring the consistency and the availability of replicated data in highly mobile ad hoc networks is a challenging task because of the lack of a backbone infrastructure. Previous work provides strong data guarantees by limiting the motion and the speed of the mobile nodes during the entire system lifetime, and by relying on assumptions that are not realistic for most mobile applications. We provide a small set of mobility constraints that are sufficient to ensure strong data guarantees and that can be applied when nodes move along unknown paths and speed, and are sparsely distributed. In the second part of the paper, we analyze the problem of conserving energy while ensuring strong data guarantees, using quorum system techniques. We devise a condition necessary for a quorum system to guarantee data consistency and data availability under our mobility model. This condition shows the unsuitability of previous quorum systems and is the basis for a novel class of quorum systems suitable for highly mobile networks, called mobile dissemination quorum (MDQ) systems. We also show a MDQ system that is provably optimal in terms of communication cost by proposing an efficient implementation of a read/write atomic shared memory. The suitability of our mobility model and MDQ systems is validated through simulations using the random waypoint model and the restricted random waypoint on a city section. Finally, we apply our results to assist routing and coordinate the low duty cycle of mobile nodes while maintaining network connectivity.