Impact of mobility on distributed computations

ABSTRACT

The integration of mobile/portable computers within existing static networks introduces a new set of issues to distributed computations. A mobile host can connect to the network from different locations at different times; distributed algorithms therefore, cannot rely on the assumption that a participant maintains a fixed and universally known location in the network at all times. Mobile hosts communicate with the rest of the network via a wireless broadcast medium and portable computers such as laptops and palmtops, often operate in a "disconnected" or "doze" mode to conserve battery power. These unique physical features of a mobile computing environment need to be considered as well, while designing distributed algorithms for such systems.

REFERENCES

• 1: [1] Arup Acharya and B. R. Badrinath. Delivering multicast messages in networks with mobile hosts. In Proc. of the 13th Intl. Conf. on Distributed Computing Systems, May 1993.
• 2: [2] Raphael Alonso and Hank Korth. Database system issues in nomadic computing. Technical report, MITL, December 1992.
• 3: Baruch Awerbuch , David Peleg, Concurrent online tracking of mobile users, Proceedings of the conference on Communications architecture & protocols, p.221-233, September 03-06, 1991, Zurich, Switzerland
• 4: [4] B. R. Badrinath, Arup Acharya, and T. Imielinski. Structuring distributed algorithms for mobile hosts. In preparation.
• 5: [5] B.R. Badrinath and T. Imielinski. Replication and mobility. In Proc. of the 2nd workshop on the management of replicated data, pages 9-12, 1992.
• 6: [6] B. R. Badrinath, T. Imielinski, and A. Virmani. Locating strategies for personal communication networks. IEEE Globecom 92 Workshop on networking of personal communications applications, 1992.
• 7: Tomasz Imielinski , B. R. Badrinath, Querying in Highly Mobile Distributed Environments, Proceedings of the 18th International Conference on Very Large Data Bases, p.41-52, August 23-27, 1992
• 8: [8] T. Imielinski and B. R. Badrinath. Mobile wireless computing: Solutions and challenges in data management. Technical report, WINLAB/Rutgers Tech. Rept., February, 1993.
• 9: John Ioannidis , Dan Duchamp , Gerald Q. Maguire, Jr., IP-based protocols for mobile internetworking, Proceedings of the conference on Communications architecture & protocols, p.235-245, September 03-06, 1991, Zurich, Switzerland
• 10: [10] John Ioannidis and Gerald Q. Maguire Jr. The design and implementation of a mobile internetworking architecture. In 1992 Winter Usenix, Jan. 1993.
• 11: James J. Kistler , M. Satyanarayanan, Disconnected operation in the Coda File System, ACM Transactions on Computer Systems (TOCS), v.10 n.1, p.3-25, Feb. 1992 [doi>10.1145/146941.146942]
• 12: [12] G. Le Lann. Distributed systems, towards a formal approach. IFIP Congress, Toronto, pages 155-160, 1977.
• 13: Kerry Raymond, A tree-based algorithm for distributed mutual exclusion, ACM Transactions on Computer Systems (TOCS), v.7 n.1, p.61-77, Feb. 1989 [doi>10.1145/58564.59295]
• 14: [14] Yakhov Rekhter and Charles Perkins. Optimal routing for mobile hosts using ip's loose source route option. In Internet Draft, October 1992.
• 15: [15] Samuel Sheng, Ananth Chandrasekaran, and R. W. Broderson. A portable multimedia terminal for personal communications. IEEE Communications Magazine, December 1992.
• 16: Carl D. Tait , Dan Duchamp, Service interface and replica management algorithm for mobile file system clients, Proceedings of the first international conference on Parallel and distributed information systems, p.190-197, December 1991, Miami, Florida, United States
• 17: [17] Hiromi Wada, Takashi Yozawa, Tatsuya Ohnishi, and Yasunori Tanaka. Mobile computing environment based on internet packet forwarding. In 1992 Winter Usenix, Jan. 1993.

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS

Additional Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.1 Network Architecture and Design
          Subjects: Network communications

  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS
      G.2.2 Graph Theory
          Subjects: Network problems

General Terms:
Algorithms, Design, Performance