Summary: Efficient and Robust Local Mutual Exclusion
in Mobile Ad Hoc Networks
(Extended Abstract)
Hagit Attiya
Dept. of Computer Science
Technion, Israel
hagit@cs.technion.ac.il
Alex Kogan
Dept. of Computer Science
Technion, Israel
sakogan@cs.technion.ac.il
Jennifer L. Welch
Dept. of Computer Science
Texas A&M University, TX
welch@cs.tamu.edu
Abstract
This paper presents two algorithms for the local mu-
tual exclusion problem, an extension of the dining philoso-
phers problem for mobile ad hoc networks. A solution to
this problem allows nodes that are currently geographically

Source: Attiya, Hagit - Department of Computer Science, Technion, Israel Institute of Technology

Collections: Computer Technologies and Information Sciences