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 7 Issue 2, July 2012

On modeling of coevolution of strategies and structure in autonomous overlay networks
Yufeng Wang, Akihiro Nakao, Athanasios V. Vasilakos
Article No.: 17
DOI: 10.1145/2240166.2240167

Currently, on one hand, there exist much work about network formation and/or growth models, and on the other hand, cooperative strategy evolutions are extensively investigated in biological, economic, and social systems. Generally, overlay...

Adaptare: Supporting automatic and dependable adaptation in dynamic environments
Mônica Dixit, António Casimiro, Paolo Lollini, Andrea Bondavalli, Paulo Verissimo
Article No.: 18
DOI: 10.1145/2240166.2240168

Distributed protocols executing in uncertain environments, like the Internet or ambient computing systems, should dynamically adapt to environment changes in order to preserve Quality of Service (QoS). In earlier work, it was shown that QoS...

Conceptual modeling of flexible temporal workflows
Carlo Combi, Matteo Gozzi, Roberto Posenato, Giuseppe Pozzi
Article No.: 19
DOI: 10.1145/2240166.2240169

Workflow technology has emerged as one of the leading technologies in modeling, redesigning, and executing business processes. The management of temporal aspects in the definition of a workflow process has been considered only recently in the...

Improving differential evolution algorithm by synergizing different improvement mechanisms
Musrrat Ali, Millie Pant, Ajith Abraham
Article No.: 20
DOI: 10.1145/2240166.2240170

Differential Evolution (DE) is a well-known Evolutionary Algorithm (EA) for solving global optimization problems. Practical experiences, however, show that DE is vulnerable to problems like slow and/or premature convergence. In this article we...

Centralized and distributed task allocation in multi-robot teams via a stochastic clustering auction
Kai Zhang, Emmanuel G. Collins, Jr., Dongqing Shi
Article No.: 21
DOI: 10.1145/2240166.2240171

This article considers the problem of optimal task allocation for heterogeneous teams, for example, teams of heterogeneous robots or human-robot teams. It is well-known that this problem is NP-hard and hence computationally feasible approaches...

An erasure-resilient encoding system for flexible reading and writing in storage networks
Mario Mense, Christian Schindelhauer
Article No.: 22
DOI: 10.1145/2240166.2240172

We introduce the Read-Write-Coding-System (RWC), a very flexible class of linear block codes that generate efficient and flexible erasure codes for storage networks. In particular, given a message x of k symbols and a codeword...

A shared-secret free security infrastructure for wireless networks
Lifeng Sang, Anish Arora
Article No.: 23
DOI: 10.1145/2240166.2240173

This article develops a shared-secret free wireless security infrastructure that provides confidentiality, identity authentication, message authentication, integrity, sender nonrepudiation, receiver nonrepudiation, and anonymity. Our...

Designing and optimizing swarming in a distributed base station network: Application to power control
Philippe Leroux, Sébastien Roy
Article No.: 24
DOI: 10.1145/2240166.2240174

Todays' networks are becoming increasingly complex. They must provide a growing variety of services to a wide range of devices. In order to do so, they must make efficient use of modern technologies including MIMO, macrodiversity, power control,...

Choosing partners based on availability in P2P networks
Stevens Le Blond, Fabrice Le Fessant, Erwan Le Merrer
Article No.: 25
DOI: 10.1145/2240166.2240175

Availability of applications or devices is known to be one of the most critical variables impacting the performances of software systems. We study in this article the problem of finding peers matching a given availability pattern in a peer-to-peer...

Anonymous transactions in computer networks
Shlomi Dolev, Marina Kopeetsky
Article No.: 26
DOI: 10.1145/2240166.2240176

We present schemes for providing anonymous transactions while privacy and anonymity are preserved, providing user's anonymous authentication in distributed networks such as the Internet. We first present a practical scheme for anonymous...

First step towards automatic correction of firewall policy faults
Fei Chen, Alex X. Liu, Jeehyun Hwang, Tao Xie
Article No.: 27
DOI: 10.1145/2240166.2240177

Firewalls are critical components of network security and have been widely deployed for protecting private networks. A firewall determines whether to accept or discard a packet that passes through it based on its policy. However, most real-life...

RelaxDHT: A churn-resilient replication strategy for peer-to-peer distributed hash-tables
Sergey Legtchenko, Sébastien Monnet, Pierre Sens, Gilles Muller
Article No.: 28
DOI: 10.1145/2240166.2240178

DHT-based P2P systems provide a fault-tolerant and scalable means to store data blocks in a fully distributed way. Unfortunately, recent studies have shown that if connection/disconnection frequency is too high, data blocks may be lost. This is...

Control-based p-persistent adaptive communication protocol
Franco Blanchini, Daniele De Caneva, Pier Luca Montessoro, Davide Pierattoni
Article No.: 29
DOI: 10.1145/2240166.2240179

An enhancement to the CSMA p-persistent protocol family is proposed, based on a fully decentralized control that adjusts the message transmission rate of each node to the estimated density of surrounding transmitting nodes. The system does not...