Skip to main content
SpringerLink
Log in

Distributed Algorithms for Mobile Environment

  • Chapter
  • First Online:
Wireless Networking and Mobile Data Management

Abstract

This chapter begins with a short introduction to the characteristics of distributed algorithms for a conventional distributed system consisting of all static nodes connected by a wired network. Then it describes a two tier cost model for evaluation of the efficiencies of the distributed algorithms for a mobile distributed environment (MDE). The cost model is evolved by taking into account the differences between an MDE and a conventional distributed system. Using the cost model we distinguish between two different execution models, namely, coordinator based system and non coordinator based system. Lamport’s bakery algorithm, and Dijkstra token ring algorithm have been analyzed for implementations on a non-coordiator based MDE both with and without exception machines. For coordinator based systems, two variations in model are possible, namely fixed coordinator and moving coordinator. Atomic broadcast algorithm been analyzed for coordinator based system with both variations in the model. Next, we show how existing distributed algorithms can be structured efficiently by exploiting the asymmetry in cost model. The chapter ends with a description of termination detection algorithm in an mobile distributed environment.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. M.H. Dunham, A. Helal, Mobile computing and databases: anything new? SIGMOD Rec. 24(4), 5–9 (1995). December

    Google Scholar 

  2. G. Liu, G. Maguire Jr., A class of mobile motion prediction algorithms for wireless mobile computing and communication. Mob. Networks Appl. 1(2), 113–121 (1996)

    Google Scholar 

  3. A.L. Murphy, G.C. Roman, G. Varghese, An algorithm for message delivery to mobile units, in The 16th ACM Symposium on Principles of Distributed Computing (PODC’97), pp. 292–292, 1997

    Google Scholar 

  4. K. Kumar, Lu Yung-Hsiang, Cloud computing for mobile users: can offloading computation save energy? Computer 43(4), 51–56 (2010)

    Article  Google Scholar 

  5. K. Yang, S. Ou, H.H. Chen, On effective offloading services for resource-constrained mobile devices running heavier mobile internet applications. IEEE Commun. Mag. 46(1), 56–63 (2008)

    Article  Google Scholar 

  6. S. Acharya, M. Franklin, S. Zdonik, Dissemination-based data delivery using broadcast disks. IEEE Pers. Commun. 2(6), 50–60 (2001)

    Article  Google Scholar 

  7. B.R. Badrinath, A. Acharya, T. Imielinski, Designing distributed algorithms for mobile computing networks. Comput. Commun. 19(4), 309–320 (1996)

    Article  Google Scholar 

  8. L. Lamport, A new solution of dijkstra’s concurrent programming problem. Commun. ACM 17, 453–455 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  9. E.W. Dijkstra, Self-stabilizing systems in spite of distributed control. Commun. ACM 17, 643–644 (1974)

    Article  MATH  Google Scholar 

  10. K.M. Chandy, L. Lamport, Distributed snapshots: determining global states of distributed systems. ACM Trans. Comput. Syst. (TOCS), 3(1), 63–75 (1985)

    Google Scholar 

  11. E.W. Dijkstra, C.S. Scholten, Termination detection for diffusing computations. Inf. Process. Lett. 11, 1–4 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  12. S. Huang, Detecting termination of distributed computations by external agents, in The IEEE Nineth International Conference on Distributed Computer Systems, pp. 79–84, 1989

    Google Scholar 

  13. F. Mattern, Golbal quiescence detection based on credit distribution and recovery. Inf. Proc. Lett. 30, 95–200 (1989)

    Article  MathSciNet  Google Scholar 

  14. Y.C. Tseng, Detecting termination by weight-throwing in a faulty distributed system. J. Parallel Distrib. Comput. 25, 7–15 (1995)

    Article  Google Scholar 

  15. Y.C. Tseng, C.C. Tan, Termination detection protocols for mobile distributed systems. IEEE Trans. Parallel Distrib. Syst. 12(6), 558–566 (2001)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, IIT Kanpur, Kanpur, Uttar Pradesh, India

    R. K. Ghosh

Authors
  1. R. K. Ghosh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to R. K. Ghosh .

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Nature Singapore Pte Ltd.

About this chapter

Cite this chapter

Ghosh, R.K. (2017). Distributed Algorithms for Mobile Environment. In: Wireless Networking and Mobile Data Management. Springer, Singapore. https://doi.org/10.1007/978-981-10-3941-6_11

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-3941-6_11

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-3940-9

  • Online ISBN: 978-981-10-3941-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation