Skip to main content

Exploiting Opportunistic Overhearing to Improve Performance of Mutual Exclusion in Wireless Ad Hoc Networks

  • Conference paper
Wired/Wireless Internet Communication (WWIC 2012)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 7277))

Included in the following conference series:

Abstract

We design two mutual exclusion algorithms for wireless networks. Our mutual exclusion algorithms are distributed token based algorithms which exploit the opportunistic message overhearing in wireless networks. One of the algorithms is based on overhearing of token transmission. In the other algorithm, overhearing of both token and request messages is exploited. The design goal is to decrease the number of transmitted messages and delay per critical section entry using the information obtained from overheard messages.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Raymond, K.: A tree-based algorithm for distributed mutual exclusion. ACM Trans. Comput. Syst. 7, 61–77 (1989)

    Article  Google Scholar 

  2. Naimi, M., Trehel, M.: A distributed algorithm for mutual exclusion based on data structures and fault tolerance. In: Conference Proceedings of Sixth Annual International Phoenix Conference on Computers and Communications, pp. 33–39 (1987)

    Google Scholar 

  3. Walter, J., Welch, J., Vaidya, H.: A mutual exclusion algorithm for ad hoc mobile networks. Wireless Networks 7, 585–600 (2001)

    Article  MATH  Google Scholar 

  4. Manivannan, D., Singhal, M.: An efficient fault-tolerant mutual exclusion algorithm for distributed systems. In: Proceedings of the International Conference on Parallel and Distributed Computing Systems, pp. 525–530 (1994)

    Google Scholar 

  5. Agrawal, D., Abbadi, A.: An efficient and fault-tolerant solution for distributed mutual exclusion. ACM Trans. Comput. Syst. 9, 1–20 (1991)

    Article  Google Scholar 

  6. Singhal, M.: A heuristically-aided algorithm for mutual exclusion in distributed systems. IEEE Transactions on Computers 38, 651–662 (1989)

    Article  Google Scholar 

  7. Wu, W., Cao, J., Raynal, M.: A Dual-Token-Based Fault Tolerant Mutual Exclusion Algorithm for MANETs. In: Zhang, H., Olariu, S., Cao, J., Johnson, D.B. (eds.) MSN 2007. LNCS, vol. 4864, pp. 572–583. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  8. Bulgannawar, S., Vaidya, N.: A distributed k-mutual exclusion algorithm. In: ICDCS, pp. 153–160 (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hosseinabadi, G., Vaidya, N.H. (2012). Exploiting Opportunistic Overhearing to Improve Performance of Mutual Exclusion in Wireless Ad Hoc Networks. In: Koucheryavy, Y., Mamatas, L., Matta, I., Tsaoussidis, V. (eds) Wired/Wireless Internet Communication. WWIC 2012. Lecture Notes in Computer Science, vol 7277. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30630-3_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30630-3_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30629-7

  • Online ISBN: 978-3-642-30630-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics