– This paper presents a reliable decentralized mutual exclusion algorithm for distributed systems in which processes communicate by asynchronous message passing. When any failure...
Moharram Challenger, Peyman Bayat, Mohammad Reza M...
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
— We consider the problem of tracking multiple moving robots using noisy sensing of inter-robot and interbeacon distances. Sensing is local: there are three fixed beacons at kno...
Jeremy Schiff, Erik B. Sudderth, Kenneth Y. Goldbe...
This paper presents a distributed implementation of RAND, a randomized time slot scheduling algorithm, called DRAND. DRAND runs in O() time and message complexity where is the max...
We describe LEAP (Localized Encryption and Authentication Protocol), a key management protocol for sensor networks that is designed to support in-network processing, while at the ...