A distributed mutual exclusion algorithm over multi-routing protocol for mobile ad hoc networks

Simple item page
dc.citation.epage218fr_FR
dc.citation.issue3fr_FR
dc.citation.spage197fr_FR
dc.citation.volume23fr_FR
dc.contributor.authorDerhab, Abdelouahid
dc.contributor.authorBadache, Nadjib
dc.date.accessioned2014-03-02T14:51:45Z
dc.date.available2014-03-02T14:51:45Z
dc.date.issued2008-04-15
dc.description.abstractIn this paper, we propose a new architecture to solve the problem of mutual exclusion in mobile ad hoc networks (MANET). The architecture is composed of two layers: (i) a middleware layer that contains a token-based distributed mutual exclusion algorithm (DMEA) and (ii) a network layer that includes two routing forwarding strategies: one to route request messages and the other to route the token message. We also propose a request ordering policy that ensures the usual mutual exclusion properties and reduces the number of hops traversed per critical section (CS) access. The paper also addresses the problem of network partitioning and unreachable nodes. The proposed mutual exclusion algorithm is further enhanced to provide fault tolerance by preventing the loss of the token and generating a new token if the token loss event occurs. The performance complexity as well as the experimental results show that the proposed algorithm experiences low number of hops per CS access.fr_FR
dc.identifier.doi10.1080/17445760701536084
dc.identifier.urihttp://dl.cerist.dz/handle/CERIST/622
dc.publisherTaylor et Francisfr_FR
dc.relation.ispartofInternational Journal of Parallel, Emergent and Distributed Systemsfr_FR
dc.subjectmobile ad hoc networksfr_FR
dc.subjectdistributed mutual exclusionfr_FR
dc.subjectrouting protocolsfr_FR
dc.subjectdirect acyclic graphfr_FR
dc.subjectfault-tolerancefr_FR
dc.titleA distributed mutual exclusion algorithm over multi-routing protocol for mobile ad hoc networksfr_FR
dc.typeArticle
Files
Collections
International Journal Papers