Efficient Algorithms for Distributed Mutual Exclusion in Mobile Ad-Hoc Network

Journal Title: Indian Journal of Computer Science and Engineering - Year 2011, Vol 2, Issue 6

Abstract

For distributed mutual exclusion problem in mobile environment we presented two algorithms.Both the algorithms are token based. The first algorithm is providing tokens to the nodes which are in critical section and the second one is hierarchical clustering based. A mobile ad-hoc networks (MANET) is hierarchically (two level) clustered to get logical tree network through which the token is passed from one node to another. However, we simulate the second algorithm only. The evaluation of the proposed algorithms show that its message requirement is optimal, and thus the second algorithm is an energy efficient algorithm.

Authors and Affiliations

R. Karthick , B. Gopinathan

Keywords

Related Articles

PROCESS MODEL FOR REUSABILITY IN CONTEXT-SPECIFIC REUSABLE SOFTWARE COMPONENTS

Constructing component based software using reusable components is becoming a promising approach. Context-specific reuse is a broadly used way to increase the value of reuse. This paper reports our on-going work aimed at...

DATA- FILE SECURITY ENCRYPTION ALGORITHM

Algorithm and implementation of a secure username and pass word encryption and file encryption technique is described.

Parallel Implementation of Similarity Measures on GPU Architecture using CUDA

Image processing and pattern recognition algorithms take more time for execution on a single core processor. Graphics Processing Unit (GPU) is more popular now-a-days due to their speed, programmability, low cost and mor...

Solving Scheduling problems using Selective Breeding Algorithm and Hybrid Algorithm

The n-job, m-machine scheduling problem is one of the general scheduling problems in a system. Scheduling problems vary widely according to specific production tasks but most are NP-hard problems. Scheduling problems are...

Artificial Intelligence – Making an Intelligent personal assistant 

A bot in computing is an autonomous program on a network (especially the Internet) which can interact with systems or users.[ Simpson, J., and Weiner, E. (1989)] This document gives the description of how memory of an Ar...

Download PDF file
  • EP ID EP97599
  • DOI -
  • Views 153
  • Downloads 0

How To Cite

R. Karthick, B. Gopinathan (2011). Efficient Algorithms for Distributed Mutual Exclusion in Mobile Ad-Hoc Network. Indian Journal of Computer Science and Engineering, 2(6), 873-884. https://europub.co.uk/articles/-A-97599