Designing distributed algorithms for mobile computing networks

  • Authors:

  • B. R. Badrinath;Arup Acharya;Tomasz Imielinski

  • Affiliations:

  • Department of Computer Science, Rutgers University, New Brunswick, NJ 08903, USA;Department of Computer Science, Rutgers University, New Brunswick, NJ 08903, USA;Department of Computer Science, Rutgers University, New Brunswick, NJ 08903, USA

  • Venue:
  • Computer Communications
  • Year:
  • 1996

Quantified Score

Hi-index 0.25

Visualization

Abstract

Mobile computing represents a new paradigm that aims to provide continuous network connectivity to users regardless of their location. To realize this aim, it is necessary to design distributed algorithms that explicitly account for host mobility and the physical constraints associated with such networks. This paper presents an operational system model for explicitly incorporating the effects of host mobility with appropriate cost measures. It points out the drawbacks of executing distributed algorithms in this model that are not explicitly designed for mobile hosts. To overcome the resource constraints of mobile hosts, we propose a two tier principle for structuring distributed algorithms for mobile hosts so that the computation and communication requirements of an algorithm are borne by the static hosts to the extent possible. In addition, since location of a mobile host could change after initiating a distributed computation and before receiving the result, location management of mobile participants needs to be explicitly integrated with algorithm design.