DISTRIBUTED ALGORITHMS FOR MOBILE HOSTS

Citation
Lm. Patnaik et al., DISTRIBUTED ALGORITHMS FOR MOBILE HOSTS, IEE proceedings. Computers and digital techniques, 144(2), 1997, pp. 49-56
Citations number
6
Categorie Soggetti
Computer Sciences","Computer Science Hardware & Architecture","Computer Science Theory & Methods
ISSN journal
13502387
Volume
144
Issue
2
Year of publication
1997
Pages
49 - 56
Database
ISI
SICI code
1350-2387(1997)144:2<49:DAFMH>2.0.ZU;2-0
Abstract
In a mobile environment the physical movement of hosts causes changes in the physical topology of the network with time. Therefore, the dire ct execution of the existing distributed algorithms in a mobile enviro nment renders them inefficient. Distributed algorithms are therefore m odified by assigning proxies, which are static hosts in the network, t o each of the mobile hosts. Proxies have been used at a level d(d grea ter than or equal to 1) in the logical hierarchy of location servers. A mutual exclusion algorithm has been redesigned, and the results of s imulations of the original and modified versions are presented. Genera l purpose procedures have been developed which can be used in any dist ributed algorithm designed for a mobile environment and which uses sta tic hosts as proxies.