607 research outputs found
The Vital Network: An Algorithmic Milieu of Communication and Control
The biological turn in computing has influenced the development of algorithmic control and what I call the vital network: a dynamic, relational, and generative assemblage that is self-organizing in response to the heterogeneity of contemporary network processes, connections, and communication. I discuss this biological turn in computation and control for communication alongside historically significant developments in cybernetics that set out the foundation for the development of self-regulating computer systems. Control is shifting away from models that historically relied on the human-animal model of cognition to govern communication and control, as in early cybernetics and computer science, to a decentred, nonhuman model of control by algorithm for communication and networks. To illustrate the rise of contemporary algorithmic control, I outline a particular example, that of the biologically-inspired routing algorithm known as a ‘quorum sensing’ algorithm. The increasing expansion of algorithms as a sense-making apparatus is important in the context of social media, but also in the subsystems that coordinate networked flows of information. In that domain, algorithms are not inferring categories of identity, sociality, and practice associated with Internet consumers, rather, these algorithms are designed to act on information flows as they are transmitted along the network. The development of autonomous control realized through the power of the algorithm to monitor, sort, organize, determine, and transmit communication is the form of control emerging as a postscript to Gilles Deleuze’s ‘postscript on societies of control.
A Self-Organization Framework for Wireless Ad Hoc Networks as Small Worlds
Motivated by the benefits of small world networks, we propose a
self-organization framework for wireless ad hoc networks. We investigate the
use of directional beamforming for creating long-range short cuts between
nodes. Using simulation results for randomized beamforming as a guideline, we
identify crucial design issues for algorithm design. Our results show that,
while significant path length reduction is achievable, this is accompanied by
the problem of asymmetric paths between nodes. Subsequently, we propose a
distributed algorithm for small world creation that achieves path length
reduction while maintaining connectivity. We define a new centrality measure
that estimates the structural importance of nodes based on traffic flow in the
network, which is used to identify the optimum nodes for beamforming. We show,
using simulations, that this leads to significant reduction in path length
while maintaining connectivity.Comment: Submitted to IEEE Transactions on Vehicular Technolog
Bio-inspired enhancement of reputation systems for intelligent environments
Providing security to the emerging field of ambient intelligence will be difficult if we rely only on existing techniques, given their dynamic and heterogeneous nature. Moreover, security demands of these systems are expected to grow, as many applications will require accurate context modeling. In this work we propose an enhancement to the reputation systems traditionally deployed for securing these systems. Different anomaly detectors are combined using the immunological paradigm to optimize reputation system performance in response to evolving security requirements. As an example, the experiments show how a combination of detectors based on unsupervised techniques (self-organizing maps and genetic algorithms) can help to significantly reduce the global response time of the reputation system. The proposed solution offers many benefits: scalability, fast response to adversarial activities, ability to detect unknown attacks, high adaptability, and high ability in detecting and confining attacks. For these reasons, we believe that our solution is capable of coping with the dynamism of ambient intelligence systems and the growing requirements of security demands
Recommended from our members
Biologically Inspired Near Extinct System Reconstruction
Recovery software system operations from a state of extensive damage without human intervention is a challenging problem as it may need to be based on a different infrastructure from the one that the system was originally designed for and deployed on (i.e., computational and communication devices) and significant reorganization of system functionalities. In this paper, we introduce a bio-inspired approach for reconstructing nearly extinct complex software systems. Our approach is based on encoding a computational DNA (co-DNA) of a system and computational analogues of biological processes to enable the transmission of co-DNA over computational devices and, through it, the transformation of these devices into system cells that can realise chunks of the system functionality, and spread further its reconstruction process
Design and Performance Analysis of Genetic Algorithms for Topology Control Problems
In this dissertation, we present a bio-inspired decentralized topology control mechanism, called force-based genetic algorithm (FGA), where a genetic algorithm (GA) is run by each autonomous mobile node to achieve a uniform spread of mobile nodes and to provide a fully connected network over an unknown area. We present a formal analysis of FGA in terms of convergence speed, uniformity at area coverage, and Lyapunov stability theorem.
This dissertation emphasizes the use of mobile nodes to achieve a uniform distribution over an unknown terrain without a priori information and a central control unit. In contrast, each mobile node running our FGA has to make its own movement direction and speed decisions based on local neighborhood information, such as obstacles and the number of neighbors, without a centralized control unit or global knowledge.
We have implemented simulation software in Java and developed four different testbeds to study the effectiveness of different GA-based topology control frameworks for network performance metrics including node density, speed, and the number of generations that GAs run.
The stochastic behavior of FGA, like all GA-based approaches, makes it difficult to analyze its convergence speed. We built metrically transitive homogeneous and inhomogeneous Markov chain models to analyze the convergence of our FGA with respect to the communication ranges of mobile nodes and the total number of nodes in the system. The Dobrushin contraction coefficient of ergodicity is used for measuring convergence speed for homogeneous and inhomogeneous Markov chain models of our FGA. Furthermore, convergence characteristic analysis helps us to choose the nearoptimal values for communication range, the number of mobile nodes, and the mean node degree before sending autonomous mobile nodes to any mission.
Our analytical and experimental results show that our FGA delivers promising results for uniform mobile node distribution over unknown terrains. Since our FGA adapts to local environment rapidly and does not require global network knowledge, it can be used as a real-time topology controller for commercial and military applications
- …