A Survey On power consumption in distributed mutual exclusion algorithms

سال انتشار: 1393
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 922

فایل این مقاله در 6 صفحه با فرمت PDF قابل دریافت می باشد

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این مقاله:

شناسه ملی سند علمی:

ICCECSG01_030

تاریخ نمایه سازی: 25 فروردین 1394

چکیده مقاله:

Resource sharing is a major problem in distributed networks as systems have resources in common. To guarantee the correctness of data written in the shared resource also called CS (critical section) mutual exclusion is proposed as a solution. Mobile ad hoc Networks are unstable distributed networks formed dynamically by the connections of wireless battery-powered nodes without the use of an existing network substructure so energy consumption during communication is a major depletion parameter. Eventually there is a strong need for the presence of energy efficient protocols. In this paper we review energy-consumption in distributed mutual exclusion algorithms which is a vital factor for wireless applications such as mobile ad-hoc networks.

نویسندگان

Elaheh Radmehr

Islamic Azad University Research and Science Branch Neishabour, Iran

Atefeh Talebian

Islamic Azad University Research and Science Branch Neishabour, Iran

Mohammad H. Moattar

Department of Software Engineering Mashhad Branch Mashhad, Iran

مراجع و منابع این مقاله:

لیست زیر مراجع و منابع استفاده شده در این مقاله را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود مقاله لینک شده اند :
  • I. Suzuki and T Kasami, _ distributed mutual exclusion _ ...
  • K. Raymond, _ tree-based algorithm for distributed mutual exclusion, " ...
  • I. Suzuki and T. Kasami. A distributed mutual exclusion algorithm. ...
  • G.Ricart And A. K Agrawala. An optimal algorithm for _ ...
  • L. Lamport, "Time, clocks, and the ordering of events in ...
  • G. Ricart and A. K. Agrawala, _ optimal algorithm for ...
  • _ ommunication of the ACM, vol. 24, no. I, pp. ...
  • Hsiou Mien Lien amd Shyan-Ming Yuan. A new approach ...
  • M.Maekawa. A _ algorithm for mutual exclusion in decentralised system. ...
  • _ _ _ _ Parallel and Distributed Systems, vol. I1, ...
  • G. Le Lann, Distributed systems towards of a formal approach, ...
  • E.W. Dikstra, Solution of a problem in concurrent ...
  • _ Communications of the ACM 8 (9 ...
  • _ _ _ _ _ _ Computers, vol. 38, no. ...
  • M. Maekawa, "A root N algorithm for mutual exclusion in ...
  • D. Agrawal and A. El Abbadi, _ efficient solution to ...
  • Transactions onComputer Systems, vol. 9, no. I, pp. 1- 20, ...
  • Sharma20 14token, A Token Based Protoc) for Mutual _ _ ...
  • Exploiting opportunistic overhearing to improve performance of mutual exclusion in ...
  • نمایش کامل مراجع