{"title":"Centralised, Decentralised, and Self-Organised Coverage Maximisation in Smart Camera Networks","authors":"Lukas Esterle","doi":"10.1109/SASO.2017.9","DOIUrl":"https://doi.org/10.1109/SASO.2017.9","url":null,"abstract":"When maximising the coverage of a camera network, current approaches rely on a central approach and rarely consider the decentralised or even self-organised potential. In this paper, we study the performance of decentralised and self-organised approaches in comparison to centralised ones in terms of geometric coverage maximisation. We present a decentralised and self-organised algorithm to maximise coverage in a camera network using a Particle Swarm Optimiser (PSO) and compare them to a centralised version of PSO. Additionally, we present a decentralised and self-organised version of ARES, a centralised approximation algorithm for optimal plans combining PSO, Importance Splitting, and an adaptive receding horizons at its core. We first show the benefits of ARES over using PSO as a single, centralised optimisation algorithm when used before deployment time. Second, since cameras are not able to change instantaneously, we investigate gradual adaptation of individual cameras during runtime. Third, we compare achieved geometrical coverage of our decentralised approximation algorithm against the centralised version of ARES. Finally, we study the benefits of a self-organised version of PSO and ARES, allowing the system to improve its coverage over time. This allows the system to deal with quickly unfolding situations.","PeriodicalId":438331,"journal":{"name":"2017 IEEE 11th International Conference on Self-Adaptive and Self-Organizing Systems (SASO)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130507640","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}
{"title":"Resource Adaptation via Test-Based Software Minimization","authors":"Arpit Christi, Alex Groce, Rahul Gopinath","doi":"10.1109/SASO.2017.15","DOIUrl":"https://doi.org/10.1109/SASO.2017.15","url":null,"abstract":"Building software systems that adapt to changing resource environments is challenging: developers cannot anticipate all future situations that a software system may face, and even if they could, the effort required to handle such situations would often be too onerous for practical purposes. We propose a novel approach to allow a system to generate resource usage adaptations: use delta-debugging to generate versions of software systems that are 1-minimal with respect to satisfying various (labeled) subsets of a system's test suite. Many such variations will, while retaining core system functionality, use fewer resources. We describe an efficient tool for computing such variants and show how it reduces with respect to randomly selected subsets of Java class test suites, and propose an infrastructure in which this approach leads to a method for resource adaptation in the field. Using the NetBeans IDE, we demonstrate that even without additional infrastructure or heuristics, our approach is capable of quickly and cleanly removing a program's undo functionality, significantly reducing its resource usage, with no more effort than simply labeling three test cases asundo-related.","PeriodicalId":438331,"journal":{"name":"2017 IEEE 11th International Conference on Self-Adaptive and Self-Organizing Systems (SASO)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127276453","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}
{"title":"Edge Detection in Static and Dynamic Environments using Robot Swarms","authors":"Yara Khaluf","doi":"10.1109/SASO.2017.17","DOIUrl":"https://doi.org/10.1109/SASO.2017.17","url":null,"abstract":"Robotic systems offer an attractive solution for a large spectrum of real-world applications that are hosted in dangerous or inaccessible areas for humans. In such applications, one of the fundamental tasks is to detect and mark particular features (e.g., pollution areas) in order to develop a proper response. In this paper, we focus on the specific problem of environmental edge detection using a swarm of homogeneous robots that can sense and act distributively using a large number of individuals. In our study, we consider both static and dynamic 2D environments, in which the spatial distribution of the feature(s) may change over time. We verify our results using a set of physics-based simulations.","PeriodicalId":438331,"journal":{"name":"2017 IEEE 11th International Conference on Self-Adaptive and Self-Organizing Systems (SASO)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122075029","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}
{"title":"Xor-Overlay Topology Management beyond Kademlia","authors":"Erick Lavoie, M. Correia, L. Hendren","doi":"10.1109/SASO.2017.14","DOIUrl":"https://doi.org/10.1109/SASO.2017.14","url":null,"abstract":"Kademlia is a widely successful Distributed Hash Table (DHT) implementation, better known for its use in the BitTorrent protocol. In this paper, we revisit its overlay management separately from the DHT operations to allow it to be used with other distributed abstractions by providing an accurate and consistent view of the k-closest nodes to any given identifier. We then present invariants that avoid the irregularities that are necessary with the original k-bucket design and improve on later published solutions by not needing an additional parameter to tune. We then provide a specification of a distributed abstraction that provides the automatic management of routing tables using our invariants and a pseudo-code implementation of that abstraction. We finally sketch how our abstraction may be used for a security mechanism and how it could be combined with other known distributed abstractions to provide other services than file sharing in xor-based overlay networks enabling xor-based network overlays to go beyond their original Kademlia design.","PeriodicalId":438331,"journal":{"name":"2017 IEEE 11th International Conference on Self-Adaptive and Self-Organizing Systems (SASO)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121031266","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}
Mahmut Tamersoy, Erdem Eser Ekinci, R. C. Erdur, Oğuz Dikenelli
{"title":"A Requirements Model for Adaptive Multi-Organizational Systems","authors":"Mahmut Tamersoy, Erdem Eser Ekinci, R. C. Erdur, Oğuz Dikenelli","doi":"10.1109/SASO.2017.13","DOIUrl":"https://doi.org/10.1109/SASO.2017.13","url":null,"abstract":"The objective of our research is to define a requirements model for Adaptive Multi-organizational Systems. Our work considers the functional complexity of contemporary internet-based, multi-organizational systems. Not only the business functions, but also the interactions between the components of such systems are highly dynamic and global. Furthermore, these systems function in extremely uncertain environments. This contextual uncertainty demands adaptability which further complicates the task of requirements modeling. Our model addresses this complexity by using a hierarchy of artifacts: goals encapsulating tasks, roles encapsulating goals, and organizations encapsulating roles. We express adaptation requirements in terms of non-functional requirements, quality constraints, and domain assumptions. Adaptivity is then modeled in all three organizational layers: goals, roles, and organizations. Contrary to existing methods, our approach enables modeling adaptivity and reduces the requirements modeling complexity in Adaptive Multi-organizational Systems.","PeriodicalId":438331,"journal":{"name":"2017 IEEE 11th International Conference on Self-Adaptive and Self-Organizing Systems (SASO)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128103815","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}
Giorgio Audrito, Roberto Casadei, Ferruccio Damiani, Mirko Viroli
{"title":"Compositional Blocks for Optimal Self-Healing Gradients","authors":"Giorgio Audrito, Roberto Casadei, Ferruccio Damiani, Mirko Viroli","doi":"10.1109/SASO.2017.18","DOIUrl":"https://doi.org/10.1109/SASO.2017.18","url":null,"abstract":"With the constant increase in the number of interconnected devices in today networks, and the high demand of adaptiveness, more and more computations can be designed according to self-organisation principles. In this context, a key building block for large-scale system coordination, called gradient, is used to estimate distances in a fully-distributed way: it is the basis for a vast variety of higher level patterns including information broadcast, events forecasting, distributed sensing, and so on. However, computing gradients is very problematic in mobile environments: the fastest self-healing gradient conceived so far (called BIS) achieves a reaction speed proportional to the single-path speed of information in the network. In this paper we introduce a new gradient algorithm, SVD (Stale Values Detection) gradient, which uses broadcasts to reach a reaction speed that is equal to the multi-path speed of information, namely, the fastest speed possibly achievable by network algorithms. We then combine SVD with other blocks (metric correction, smooth filtering, BIS gradient, information damping) proposing a composed block called ULT(imate) gradient. We evaluate the resulting algorithm and compare it with other approaches, showing it scores best both on accuracy and smoothness while keeping communication cost under control.","PeriodicalId":438331,"journal":{"name":"2017 IEEE 11th International Conference on Self-Adaptive and Self-Organizing Systems (SASO)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129292192","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}
{"title":"Self-Stabilising Target Counting in Wireless Sensor Networks Using Euler Integration","authors":"Danilo Pianini, S. Dobson, Mirko Viroli","doi":"10.1109/SASO.2017.10","DOIUrl":"https://doi.org/10.1109/SASO.2017.10","url":null,"abstract":"Target counting is an established challenge for sensor networks: given a set of sensors that can count (but not identify) targets, how many targets are there? The problem is complicated because of the need to disambiguate duplicate observations of the same target by different sensors. A number of approaches have been proposed in the literature, and in this paper we take an existing technique based on Euler integration and develop a fully-distributed, self-stabilising solution. We derive our algorithm within the field calculus from the centralised presentation of the underlying integration technique, and analyse the precision of the counting through simulation of several network configurations.","PeriodicalId":438331,"journal":{"name":"2017 IEEE 11th International Conference on Self-Adaptive and Self-Organizing Systems (SASO)","volume":"28 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120910393","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}
{"title":"Interactional Justice and Self-Governance of Open Self-Organising Systems","authors":"J. Pitt","doi":"10.1109/SASO.2017.12","DOIUrl":"https://doi.org/10.1109/SASO.2017.12","url":null,"abstract":"We investigate a formal characterisation of interactional justice asa mechanism for self-organisation of institutional rules in an open system, in order to address issues of congruence, acceptability and risk. The process of interactional justice uses opinion formation over a social network with respect to a shared set of congruent values, to transform a set of individual, subjective self-assessments into a collective, relative, aggregated assessment. A negative collective assessment can provide a stimulus for self-organisedreformation of the rules of, or the appointments to roles in, the institution. We describe the implementation of a multi-agent simulator, and report resultsof experiments which show how interactional justice performs in different contexts:firstly in an economy of scarcity, and secondly in the presence of self-interested cliques. We conclude thatinteractional justice makes three important contributions to 'good' self-governance:in managing knowledge, increasing stability, and reducing conflict.","PeriodicalId":438331,"journal":{"name":"2017 IEEE 11th International Conference on Self-Adaptive and Self-Organizing Systems (SASO)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131014598","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}
{"title":"Identifying Self-Organization and Adaptability in Complex Adaptive Systems","authors":"Lachlan Birdsey, Claudia Szabo, K. Falkner","doi":"10.1109/SASO.2017.22","DOIUrl":"https://doi.org/10.1109/SASO.2017.22","url":null,"abstract":"Self-organization and adaptability are critical properties of complex adaptive systems (CAS), and their analysis provides insight into the design of these systems, consequently leading to real-world advancements. However, these properties are difficult to analyze in real-world scenarios due to performance constraints, metric design, and limitations in existing modeling tools. Several metrics have been proposed for their identification, but metric effectiveness under the same experimental settings has not been studied before. In this paper we present an observation tool, part of a complex adaptive systems modeling framework, that allows for the analysis of these metrics for large-scale complex models. We compare and contrast a wide range of metrics implemented in our observation tool. Our experimental analysis uses the classic model of Game of Life to provide a baseline for analysis, and a more complex Emergency Department model to further explore the suitability of these metrics and the modeling and analysis challenges faced when using them.","PeriodicalId":438331,"journal":{"name":"2017 IEEE 11th International Conference on Self-Adaptive and Self-Organizing Systems (SASO)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126388955","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}
{"title":"Multi-Level Control Mechanisms for Non-Structured and Structured 2-Dimensional Self-Assembling","authors":"C. Paduraru, R. Mincu, Gheorghe Stefanescu","doi":"10.1109/SASO.2017.19","DOIUrl":"https://doi.org/10.1109/SASO.2017.19","url":null,"abstract":"We present a multi-level approach to control the assembling of 2-dimensional patterns. The top control level uses abstract tiles, where the borders and the bodies of the tiles are labeled by abstract symbols. Tile assembling requires the match of border labels on the common borders, leading to specific 2-dimensional patterns. Further control levels may be introduced adding new data (on borders) and relations connecting these data (on bodies). This refinement process may be repeated going from an abstract and often nondeterministic self-assembling specification to a more controlled and detailed targeted specification - the former may be more related to the infrastructure, while the latter with the functionality mapped on that infrastructure. The approach is further instantiated to work with both non-structured and structured control mechanisms. The first one uses border labels to control tile assembling. It has a more pronounced self-assembling character, where tiles have little knowledge on the emerging result. The second, structured approach takes advantage on a recently introduced new class of 2-dimensional regular expressions. These expressions are based on a global knowledge of the resulted patterns and on their generation. It is a higher level control mechanism letting tiles and their composites to assemble according to the shapes described by these expressions. While the approach may be used with any kind of interpretation of the dimensions, our applications have focused on the case when one dimension represents space and the other time. In this case, the approach has produced non-structured and structured models and programming languages for open, interactive, distributed processes. We illustrate the approach with the sketch of a program for smart-car modeling.","PeriodicalId":438331,"journal":{"name":"2017 IEEE 11th International Conference on Self-Adaptive and Self-Organizing Systems (SASO)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133294539","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}