ACM Transactions on Autonomous and Adaptive Systems (TAAS)最新文献_第9页

Topology Control for Diverse Coverage in Underwater Wireless Sensor Networks 水下无线传感器网络中不同覆盖的拓扑控制

ACM Transactions on Autonomous and Adaptive Systems (TAAS) Pub Date : 2016-09-20 DOI: 10.1145/2928273

Linfeng Liu, Jinglin Du, Ye Liu

{"title":"Topology Control for Diverse Coverage in Underwater Wireless Sensor Networks","authors":"Linfeng Liu, Jinglin Du, Ye Liu","doi":"10.1145/2928273","DOIUrl":"https://doi.org/10.1145/2928273","url":null,"abstract":"Underwater wireless sensor networks (UWSNs) have been developed for a set of underwater applications, including the resource exploration, pollution monitoring, tactical surveillance, and so on. However, the complexity and diversity of the underwater environment differentiate it significantly from the terrestrial environment. In particular, the coverage requirements (i.e., coverage degrees and coverage probabilities) at different regions probably differ underwater. Nevertheless, little effort has been made so far on the topology control of UWSNs given the diverse coverage requirements. To this end, this article proposes two algorithms for the diverse coverage problem in UWSNs: (1) Traversal Algorithm for Diverse Coverage (TADC), which adjusts the sensing radii of nodes successively, that is, at each round only one node alters its sensing radius, and (2) Radius Increment Algorithm for Diverse Coverage (RIADC), which sets the sensing radii of nodes incrementally, that is, at each round multiple nodes may increase their sensing radii simultaneously. The performances of TADC and RIADC are analyzed through mathematical analysis and simulations. The results reveal that both TADC and RIADC can achieve the diverse coverage while minimizing the energy consumption. Moreover, TADC and RIADC perform nicely in obtaining optimal sensing radii and reducing message complexity, respectively. Such merits further indicate that TADC and RIADC are suitable for small-scale and large-scale UWSNs, respectively.","PeriodicalId":377078,"journal":{"name":"ACM Transactions on Autonomous and Adaptive Systems (TAAS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128785298","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 7

Attributed Graph Rewriting for Complex Event Processing Self-Management 基于属性图改写的复杂事件处理自管理

ACM Transactions on Autonomous and Adaptive Systems (TAAS) Pub Date : 2016-09-20 DOI: 10.1145/2967499

W. Higashino, Cédric Eichler, Miriam A. M. Capretz, L. Bittencourt, T. Monteil

{"title":"Attributed Graph Rewriting for Complex Event Processing Self-Management","authors":"W. Higashino, Cédric Eichler, Miriam A. M. Capretz, L. Bittencourt, T. Monteil","doi":"10.1145/2967499","DOIUrl":"https://doi.org/10.1145/2967499","url":null,"abstract":"The use of Complex Event Processing (CEP) and Stream Processing (SP) systems to process high-volume, high-velocity Big Data has renewed interest in procedures for managing these systems. In particular, self-management and adaptation of runtime platforms have been common research themes, as most of these systems run under dynamic conditions. Nevertheless, the research landscape in this area is still young and fragmented. Most research is performed in the context of specific systems, and it is difficult to generalize the results obtained to other contexts. To enable generic and reusable CEP/SP system management procedures and self-management policies, this research introduces the Attributed Graph Rewriting for Complex Event Processing Management (AGeCEP) formalism. AGeCEP represents queries in a language- and technology-agnostic fashion using attributed graphs. Query reconfiguration capabilities are expressed through standardized attributes, which are defined based on a novel classification of CEP query operators. By leveraging this representation, AGeCEP also proposes graph rewriting rules to define consistent reconfigurations of queries. To demonstrate AGeCEP feasibility, this research has used it to design an autonomic manager and to define a selected set of self-management policies. Finally, experiments demonstrate that AGeCEP can indeed be used to develop algorithms that can be integrated into diverse CEP systems.","PeriodicalId":377078,"journal":{"name":"ACM Transactions on Autonomous and Adaptive Systems (TAAS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116592016","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

Designing Self-Stabilizing Systems Using Game Theory 用博弈论设计自稳定系统

ACM Transactions on Autonomous and Adaptive Systems (TAAS) Pub Date : 2016-09-20 DOI: 10.1145/2957760

Li-Hsing Yen, Jean-Yao Huang, V. Turau

{"title":"Designing Self-Stabilizing Systems Using Game Theory","authors":"Li-Hsing Yen, Jean-Yao Huang, V. Turau","doi":"10.1145/2957760","DOIUrl":"https://doi.org/10.1145/2957760","url":null,"abstract":"Self-stabilizing systems tolerate transient faults by always returning to a legitimate system state within a finite time. This goal is challenged by several system features such as arbitrary system states after faults, various process execution models, and constrained process communication means. This work designs self-stabilizing distributed algorithms from the perspective of game theory, achieving an intended system goal through private goals of processes. We propose a generic game design for identifying a maximal independent set (MIS) or a maximal weighted independent set (MWIS) among all processes in a distributed system. From the generic game several specific games can be defined which differ in whether and how neighboring players influence each other. Turning the game designs into self-stabilizing algorithms, we obtain the first algorithms for the MWIS problem and also the first self-stabilizing MIS algorithm that considers node degree (including an analysis of its performance ratio). We also show how to handle simultaneous moves of processes in some process execution models. Simulation results indicate that, for various representative network topologies, the new algorithm outperforms existing methods in terms of MIS size and convergence rate. For the MWIS problem, the new algorithms performed only slightly worse than centralized greedy counterparts.","PeriodicalId":377078,"journal":{"name":"ACM Transactions on Autonomous and Adaptive Systems (TAAS)","volume":"246 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122931113","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 7

A Support System for Clustering Data Streams with a Variable Number of Clusters 具有可变簇数的数据流聚类支持系统

ACM Transactions on Autonomous and Adaptive Systems (TAAS) Pub Date : 2016-07-25 DOI: 10.1145/2932704

J. Silva, Eduardo R. Hruschka

{"title":"A Support System for Clustering Data Streams with a Variable Number of Clusters","authors":"J. Silva, Eduardo R. Hruschka","doi":"10.1145/2932704","DOIUrl":"https://doi.org/10.1145/2932704","url":null,"abstract":"Many algorithms for clustering data streams that are based on the widely used k-Means have been proposed in the literature. Most of these algorithms assume that the number of clusters, k, is known and fixed a priori by the user. Aimed at relaxing this assumption, which is often unrealistic in practical applications, we propose a support system that allows not only estimating the number of clusters automatically from data but also monitoring the process of the data-stream clustering. We illustrate the potential of the proposed system by means of a prototype that implements eight algorithms for clustering data streams, namely, Stream LSearch-OMRk, Stream LSearch-BkM, Stream LSearch-IOMRk, Stream LSearch-IBkM, CluStream-OMRk, CluStream-BkM, StreamKM++-OMRk, and StreamKM++−BkM. These algorithms are combinations of three state-of-the-art algorithms for clustering data streams with fixed k, namely, Stream LSearch, CluStream, and StreamKM++, with two algorithms for estimating the number of clusters, which are Ordered Multiple Runs of k-Means (OMRk) and Bisecting k-Means (BkM). We experimentally compare the performance of these algorithms using both synthetic and real-world data streams. Analyses of statistical significance suggest that the algorithms that are based on OMRk yield the best data partitions, while the algorithms that are based on BkM are more computationally efficient. Additionally, StreamKM++−OMRk and Stream LSearch-IBkM provide the best tradeoff relationship between accuracy and efficiency.","PeriodicalId":377078,"journal":{"name":"ACM Transactions on Autonomous and Adaptive Systems (TAAS)","volume":"s3-46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130213949","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 7

Distributed Multirobot Formation and Tracking Control in Cluttered Environments 混乱环境下的分布式多机器人编队与跟踪控制

ACM Transactions on Autonomous and Adaptive Systems (TAAS) Pub Date : 2016-07-25 DOI: 10.1145/2910584

Muhammad Umer Khan, Shuai Li, Qixin Wang, Z. Shao

{"title":"Distributed Multirobot Formation and Tracking Control in Cluttered Environments","authors":"Muhammad Umer Khan, Shuai Li, Qixin Wang, Z. Shao","doi":"10.1145/2910584","DOIUrl":"https://doi.org/10.1145/2910584","url":null,"abstract":"In this article, we propose formation control of nonholonomic mobile robots avoiding obstacles in a distributed manner for cluttered environments. The introduction of a virtual robot restructures the formation control problem into a tracking control problem between the virtual reference robot and follower robots. A novel obstacle avoidance approach is proposed based upon the scaling of whole (partial) formation corresponding to a centralized (distributed) framework. For the distributed environment with limited communication, our approach utilized proportional-integral average consensus estimators, whereby information from each robot diffuses through the communication network. The theoretical contribution is to determine the time constant involved in the diffusion process, which can affect overall system performance. The asymptotic convergence of follower robots to the position and orientation of the reference robot is ensured using the Lyapunov function. The new technique is tested with complete, limited, and no information availability. Several simulation results are provided that demonstrate the formation control and obstacle avoidance for multirobots using the proposed scheme.","PeriodicalId":377078,"journal":{"name":"ACM Transactions on Autonomous and Adaptive Systems (TAAS)","volume":"37 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126063535","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 24

SASO 2014

ACM Transactions on Autonomous and Adaptive Systems (TAAS) Pub Date : 2016-07-25 DOI: 10.1145/2939206

Mirko Viroli, A. Diaconescu, Nagarajan Kandasamy

引用次数: 0

Transparent and Efficient Parallelization of Swarm Algorithms 透明高效的群算法并行化

ACM Transactions on Autonomous and Adaptive Systems (TAAS) Pub Date : 2016-06-06 DOI: 10.1145/2897373

F. Cicirelli, Agostino Forestiero, Andrea Giordano, C. Mastroianni

引用次数: 21

Controlling Large-Scale Self-Organized Networks with Lightweight Cost for Fast Adaptation to Changing Environments 基于轻成本控制的大规模自组织网络快速适应环境

ACM Transactions on Autonomous and Adaptive Systems (TAAS) Pub Date : 2016-06-06 DOI: 10.1145/2856424

Naomi Kuze, D. Kominami, K. Kashima, T. Hashimoto, M. Murata

{"title":"Controlling Large-Scale Self-Organized Networks with Lightweight Cost for Fast Adaptation to Changing Environments","authors":"Naomi Kuze, D. Kominami, K. Kashima, T. Hashimoto, M. Murata","doi":"10.1145/2856424","DOIUrl":"https://doi.org/10.1145/2856424","url":null,"abstract":"Self-organization has potential for high scalability, adaptability, flexibility, and robustness, which are vital features for realizing future networks. Convergence of self-organizing control, however, is slow in some practical applications compared to control with conventional deterministic systems using global information. It is therefore important to facilitate convergence of self-organizing controls. In controlled self-organization, which introduces an external controller into self-organizing systems, the network is controlled to guide systems to a desired state. Although existing controlled self-organization schemes could achieve this feature, convergence speed for reaching an optimal or semioptimal solution is still a challenging task. We perform potential-based self-organizing routing and propose an optimal feedback method using a reduced-order model for faster convergence at low cost. Simulation results show that the proposed mechanism improves the convergence speed of potential-field construction (i.e., route construction) by at most 22.6 times with low computational and communication cost.","PeriodicalId":377078,"journal":{"name":"ACM Transactions on Autonomous and Adaptive Systems (TAAS)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124713865","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 11

A Game-Theoretic Approach for Elastic Distributed Data Stream Processing 弹性分布式数据流处理的博弈论方法

ACM Transactions on Autonomous and Adaptive Systems (TAAS) Pub Date : 2016-06-06 DOI: 10.1145/2903146

G. Mencagli

{"title":"A Game-Theoretic Approach for Elastic Distributed Data Stream Processing","authors":"G. Mencagli","doi":"10.1145/2903146","DOIUrl":"https://doi.org/10.1145/2903146","url":null,"abstract":"Distributed data stream processing applications are structured as graphs of interconnected modules able to ingest high-speed data and to transform them in order to generate results of interest. Elasticity is one of the most appealing features of stream processing applications. It makes it possible to scale up/down the allocated computing resources on demand in response to fluctuations of the workload. On clouds, this represents a necessary feature to keep the operating cost at affordable levels while accommodating user-defined QoS requirements. In this article, we study this problem from a game-theoretic perspective. The control logic driving elasticity is distributed among local control agents capable of choosing the right amount of resources to use by each module. In a first step, we model the problem as a noncooperative game in which agents pursue their self-interest. We identify the Nash equilibria and we design a distributed procedure to reach the best equilibrium in the Pareto sense. As a second step, we extend the noncooperative formulation with a decentralized incentive-based mechanism in order to promote cooperation by moving the agreement point closer to the system optimum. Simulations confirm the results of our theoretical analysis and the quality of our strategies.","PeriodicalId":377078,"journal":{"name":"ACM Transactions on Autonomous and Adaptive Systems (TAAS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127247748","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 25

Artificial Immunology for Collective Adaptive Systems Design and Implementation 集体适应系统设计与实现中的人工免疫学

ACM Transactions on Autonomous and Adaptive Systems (TAAS) Pub Date : 2016-06-06 DOI: 10.1145/2897372

Nicola Capodieci, E. Hart, Giacomo Cabri

{"title":"Artificial Immunology for Collective Adaptive Systems Design and Implementation","authors":"Nicola Capodieci, E. Hart, Giacomo Cabri","doi":"10.1145/2897372","DOIUrl":"https://doi.org/10.1145/2897372","url":null,"abstract":"Distributed autonomous systems consisting of large numbers of components with no central control point need to be able to dynamically adapt their control mechanisms to deal with an unpredictable and changing environment. Existing frameworks for engineering self-adaptive systems fail to account for the need to incorporate self-expression—that is, the capability of a system to dynamically adapt its coordination pattern during runtime. Although the benefits of incorporating self-expression are well known, currently there is no principled means of enabling this during system design. We propose a conceptual framework for principled design of systems that exhibit self-expression, based on inspiration from the natural immune system. The framework is described as a set of design principles and customizable algorithms and then is instantiated in three case studies, including two from robotics and one from artificial chemistry. We show that it enables self-expression in each case, resulting in systems that are able to adapt their choice of coordination pattern during runtime to optimize functional and nonfunctional goals, as well as to discover novel patterns and architectures.","PeriodicalId":377078,"journal":{"name":"ACM Transactions on Autonomous and Adaptive Systems (TAAS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132467098","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 8