ACM DL

Autonomous and Adaptive Systems (TAAS)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Autonomous and Adaptive Systems (TAAS), Volume 3 Issue 4, November 2008

Introduction to special issue on stabilization, safety, and security of distributed systems
Ajoy K. Datta
Article No.: 12
DOI: 10.1145/1452001.1452002

Self-stabilizing population protocols
Dana Angluin, James Aspnes, Michael J. Fischer, Hong Jiang
Article No.: 13
DOI: 10.1145/1452001.1452003

This article studies self-stabilization in networks of anonymous, asynchronously interacting nodes where the size of the network is unknown. Constant-space protocols are given for Dijkstra-style round-robin token circulation, leader election in...

MiniMax equilibrium of networked differential games
Hui Cao, Emre Ertin, Anish Arora
Article No.: 14
DOI: 10.1145/1452001.1452004

Surveillance systems based on wireless sensor network technology have been shown to successfully detect, classify and track evaders over a large area. State information collected via the sensor network also enables these systems to actuate mobile...

An exercise in selfish stabilization
Johanne Cohen, Anurag Dasgupta, Sukumar Ghosh, Sébastien Tixeuil
Article No.: 15
DOI: 10.1145/1452001.1452005

Stabilizing distributed systems expect all the component processes to run predefined programs that are externally mandated. In Internet scale systems, this is unrealistic, since each process may have selfish interests and motives related to...

Circle formation of weak mobile robots
Yoann Dieudonné, Ouiddad Labbani-Igbida, Franck Petit
Article No.: 16
DOI: 10.1145/1452001.1452006

We consider distributed systems made of weak mobile robots, that is, mobile devices, equipped with sensors, that are anonymous, autonomous, disoriented, and oblivious. The Circle Formation Problem (CFP)...

Self-stabilizing device drivers
Shlomi Dolev, Reuven Yagel
Article No.: 17
DOI: 10.1145/1452001.1452007

This work presents approaches for designing the input-output device management components of self-stabilizing operating systems. As an example, we demonstrate the nonstability of the ata standard protocol for storage devices. We state the...

Logarithmic keying
Ehab S. Elmallah, Mohamed G. Gouda, Sandeep S. Kulkarni
Article No.: 18
DOI: 10.1145/1452001.1452008

Consider a communication network where each process needs to securely exchange messages with its neighboring processes. In this network, each sent message is encrypted using one or more symmetric keys that are shared only between two processes:...

Safe peer-to-peer self-downloading
Kajari Ghosh Dastidar, Ted Herman, Colette Johnen
Article No.: 19
DOI: 10.1145/1452001.1452009

A goal of peer-to-peer applications is to share files between users themselves rather than downloading files from file servers. Self-downloading protocols have the property that, eventually, every user downloads only from other users....

A general characterization of indulgence
R. Guerraoui, N. Lynch
Article No.: 20
DOI: 10.1145/1452001.1452010

An indulgent algorithm is a distributed algorithm that, besides tolerating process failures, also tolerates unreliable information about the interleaving of the processes. This article presents a general characterization of indulgence in an...

Reviewers 2008

Article No.: 21
DOI: 10.1145/1452001.1452011