Distributed algorithms for mobile hosts

Access Full Text

Distributed algorithms for mobile hosts

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IEE Proceedings - Computers and Digital Techniques — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© IEE
Published

In a mobile environment the physical movement of hosts causes changes in the physical topology of the network with time. Therefore, the direct execution of the existing distributed algorithms in a mobile environment renders them inefficient. Distributed algorithms are therefore modified by assigning proxies, which are static hosts in the network, to each of the mobile hosts. Proxies have been used at a level d(d ≥ 1) in the logical hierarchy of location servers. A mutual exclusion algorithm has been redesigned, and the results of simulations of the original and modified versions are presented. General purpose procedures have been developed which can be used in any distributed algorithm designed for a mobile environment and which uses static hosts as proxies.

Inspec keywords: distributed algorithms; client-server systems; wireless LAN; message passing

Other keywords: static hosts; mobile hosts; distributed algorithms; proxies; mobile environment; mutual exclusion algorithm

Subjects: Local area networks; Distributed systems software; Parallel programming and algorithm theory

References

    1. 1)
      • L. Lamport . Time, clocks, and the ordering of events in a distributed system. Commun. ACM , 7 , 558 - 565
    2. 2)
      • Lann, G.Le.: `Distributed systems, towards a formal approach', IFIP Congress, 1977, Toronto.
    3. 3)
      • K. Raymond . A tree-based algorithm for distributed mutual exclusion. ACM Trans. Comput. Syst. , 1 , 61 - 77
    4. 4)
      • F. Teraoka , K. Uehara , H. Sunahara , J. Murai . VIP: A protocol providing host mobility. Commun. ACM , 8 , 67 - 113
    5. 5)
      • Ioannidis, J., Duchamp, D., Maguire, G.Q.: `IP-based protocols for mobile internetworking', Proc. SIGCOMM, September 1991, 21, p. 235–245no. 4, .
    6. 6)
      • Badrinath, B.R., Acharya, A., Imielinski, T.: `Structuring distributed algorithms for mobile hosts', Proc. 14th Int. Conf. on Distributed computing systems, June 1994, p. 1–12.
http://iet.metastore.ingenta.com/content/journals/10.1049/ip-cdt_19970952
Loading

Related content

content/journals/10.1049/ip-cdt_19970952
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading