Security Challenges for Swarm Robotics

Swarm robotics is a relatively new technology that is being explored for its potential use in a variety of dierent applications and environments. Previous emerging technologies have often overlooked security until later developmen- tal stages, when it has had to be undesirably (and sometimes expensively) retrotted. We identify a number of security challenges for swarm robotics and argue that now is the right time to address these issues and seek solu- tions. We also identify several idiosyncrasies of swarm robotics that present some unique security challenges. In particular, swarms of robots potentially employ dierent types of communication channels; have special concepts of identity; and exhibit adaptive emergent behaviour which could be modied by an intruder. Addressing these issues now will prevent undesirable conse- quences for many applications of this type of technology

ANTIDS: Self-Organized Ant-based Clustering Model for Intrusion Detection System

Security of computers and the networks that connect them is increasingly becoming of great significance. Computer security is defined as the protection of computing systems against threats to confidentiality, integrity, and availability. There are two types of intruders: the external intruders who are unauthorized users of the machines they attack, and internal intruders, who have permission to access the system with some restrictions. Due to the fact that it is more and more improbable to a system administrator to recognize and manually intervene to stop an attack, there is an increasing recognition that ID systems should have a lot to earn on following its basic principles on the behavior of complex natural systems, namely in what refers to self-organization, allowing for a real distributed and collective perception of this phenomena. With that aim in mind, the present work presents a self-organized ant colony based intrusion detection system (ANTIDS) to detect intrusions in a network infrastructure. The performance is compared among conventional soft computing paradigms like Decision Trees, Support Vector Machines and Linear Genetic Programming to model fast, online and efficient intrusion detection systems.Comment: 13 pages, 3 figures, Swarm Intelligence and Patterns (SIP)- special track at WSTST 2005, Muroran, JAPA

Fake View Analytics in Online Video Services

Online video-on-demand(VoD) services invariably maintain a view count for each video they serve, and it has become an important currency for various stakeholders, from viewers, to content owners, advertizers, and the online service providers themselves. There is often significant financial incentive to use a robot (or a botnet) to artificially create fake views. How can we detect the fake views? Can we detect them (and stop them) using online algorithms as they occur? What is the extent of fake views with current VoD service providers? These are the questions we study in the paper. We develop some algorithms and show that they are quite effective for this problem.Comment: 25 pages, 15 figure

Spatio-Temporal Patterns act as Computational Mechanisms governing Emergent behavior in Robotic Swarms

open access articleOur goal is to control a robotic swarm without removing its swarm-like nature. In other words, we aim to intrinsically control a robotic swarm emergent behavior. Past attempts at governing robotic swarms or their selfcoordinating emergent behavior, has proven ineffective, largely due to the swarm’s inherent randomness (making it difficult to predict) and utter simplicity (they lack a leader, any kind of centralized control, long-range communication, global knowledge, complex internal models and only operate on a couple of basic, reactive rules). The main problem is that emergent phenomena itself is not fully understood, despite being at the forefront of current research. Research into 1D and 2D Cellular Automata has uncovered a hidden computational layer which bridges the micromacro gap (i.e., how individual behaviors at the micro-level influence the global behaviors on the macro-level). We hypothesize that there also lie embedded computational mechanisms at the heart of a robotic swarm’s emergent behavior. To test this theory, we proceeded to simulate robotic swarms (represented as both particles and dynamic networks) and then designed local rules to induce various types of intelligent, emergent behaviors (as well as designing genetic algorithms to evolve robotic swarms with emergent behaviors). Finally, we analysed these robotic swarms and successfully confirmed our hypothesis; analyzing their developments and interactions over time revealed various forms of embedded spatiotemporal patterns which store, propagate and parallel process information across the swarm according to some internal, collision-based logic (solving the mystery of how simple robots are able to self-coordinate and allow global behaviors to emerge across the swarm)

Challenges in the Safety-Security Co-Assurance of Collaborative Industrial Robots

The coordinated assurance of interrelated critical properties, such as system safety and cyber-security, is one of the toughest challenges in critical systems engineering. In this chapter, we summarise approaches to the coordinated assurance of safety and security. Then, we highlight the state of the art and recent challenges in human-robot collaboration in manufacturing both from a safety and security perspective. We conclude with a list of procedural and technological issues to be tackled in the coordinated assurance of collaborative industrial robots.Comment: 23 pages, 4 tables, 1 figur

Estimation and Improvements of the Fundamental QoS in Networks with Random Topologies

The computer communication paradigm is moving towards the ubiquitous computing and Internet of Things (IoT). Small autonomous wirelessly networked devices are becoming more and more present in monitoring and automation of every human interaction with the environment, as well as in collecting various other information from the physical world. Applications, such as remote health monitoring, intelligent homes, early fire, volcano, and earthquake detection, traffic congestion prevention etc., are already present and all share the similar networking philosophy. An additional challenging for the scientific and engineering world is the appropriateness of the alike networks which are to be deployed in the inaccessible regions. These scenarios are typical in environmental and habitat monitoring and in military surveillance. Due to the environmental conditions, these networks can often only be deployed in some quasi-random way. This makes the application design challenging in the sense of coverage, connectivity, network lifetime and data dissemination. For the densely deployed networks, the random geometric graphs are often used to model the networking topology. This paper surveys some of the most important approaches and possibilities in modeling and improvement of coverage and connectivity in randomly deployed networks, with an accent on using the mobility in improving the network functionality

Estimation and Improvements of the Fundamental QoS in Networks with Random Topologies

The computer communication paradigm is moving towards the ubiquitous computing and Internet of Things (IoT). Small autonomous wirelessly networked devices are becoming more and more present in monitoring and automation of every human interaction with the environment, as well as in collecting various other information from the physical world. Applications, such as remote health monitoring, intelligent homes, early fire, volcano, and earthquake detection, traffic congestion prevention etc., are already present and all share the similar networking philosophy. An additional challenging for the scientific and engineering world is the appropriateness of the alike networks which are to be deployed in the inaccessible regions. These scenarios are typical in environmental and habitat monitoring and in military surveillance. Due to the environmental conditions, these networks can often only be deployed in some quasi-random way. This makes the application design challenging in the sense of coverage, connectivity, network lifetime and data dissemination. For the densely deployed networks, the random geometric graphs are often used to model the networking topology. This paper surveys some of the most important approaches and possibilities in modeling and improvement of co verage and connectivity in randomly deployed networks, with an accent on using the mobility in improving the network functionality