Академический Документы
Профессиональный Документы
Культура Документы
1. INTRODUCTION
In the last 15 years, we have witnessed unprecedented growth of the Internet. The tremendous size and complexity that is associated with any large-scale, distributed system is pushing the limits of our ability to manage the network, or even to fully understand its behavior. Moreover, the Internet continues to evolve at a rapid pace in order to utilize the latest technological advances and meet new usage demands. Although the Internet is perhaps the worlds newest large-scale, complex system, it is certainly not the first nor the only one. Certainly the oldest large-scale, complex systems are biological. Biological systems have been evolving over billions of years, adapting to an ever-changing environment. They share several fundamental properties with the Internet, such as the absence of centralized control, and the increasing complexity as the system grows in size, and the interaction of a large number of individual, self-governing components, just to name a few. As many researchers have argued there is a great opportunity to find solutions in biology that can be applied to problems in networking. In this report I present a survey of the bio-inspired networking and communication protocols and algorithms devised by looking at biology as a source of inspiration, and by mimicking the laws and dynamics governing these systems . .At the level of atoms and molecules, nanomachines can be considered as the most basic functional unit. Nanomachines are biological or artificial created nano-devices or components that are capable of performing only very simple tasks of computation, sensing, or actuation (e.g., detection of molecules, generation of motion, or performing chemical reactions) in its very close environment, because of their limited size and limited complexity. Hence, if multiple nanomachines communicate, they may execute collaborative and synchronous tasks in a distributed manner so further capabilities and applications will be enabled. Networked nanomachines may also cover larger areas, ranging from meters to kilometers, and expand the limited workspace of a single nanomachine which can only perform nano-scale objectives. Furthermore, if a large number of them cooperate, macro-scale tasks can be executed. However when deployed over broad areas, interaction with a specific nanomachine is ex-
Page 1
tremely difficult. Nanonetworks will provide the infrastructure and mechanism to enable that communication.
2. CHALLENGES IN NETWORKING
There exist many challenges for the realization of the existing and the next generation network architectures. At the same time, similar problems and their naturally evolved biological solution approaches also exist for these networking paradigms. Here we review the most challenging fundamental issues for networking and highlight the analogies with their counterparts and corresponding solution approaches which already exist in biological systems. Here instead of exploring networking problems in terms of functionalities and algorithms in each layer of communication protocol stacks for diverse set of network architectures, we overview the main common challenges of the existing and the next generation networks brought about by the evolution in communication technologies and the increasing demand posed upon them.
Page 2
Page 3
Page 4
a certain environmental stimuli. Despite this inherent heterogeneity, colonies can globally optimize the task allocation and selection processes via their collective intelligence. Similar approaches can be adopted to address task assignment and selection in SANETs, for spectrum sharing in heterogeneous cognitive radio networks, as well as multi-path routing in overlay networks .
Page 5
2. Understanding detailed modeling of realistic bio- logical behavior, 3. Engineering model simplification and tuning for technical applications.
Model Modeling of Understanding realistic biological Engineering simplification and tuning for ICT behavior applications
Fig x:
4.1
Page 6
Further ants are recruited that follow the trail on the shortest path towards the food. The ants therefore communicate based on environmental changes (pheromone trail), i.e. they use stigmergic communication techniques for communication and collaboration. The most important aspect in this algorithm is the transition probability pij for an ant k to move from i to j. This probability represents the routing information for the exploring process. Each move depends on the following parameters:
Jki is the tabu list of not yet visited nodes, i.e. by exploiting Jki an ant k can avoid visiting a node i more than once. nij is the visibility of j when standing at I, i.e. the inverse of the distance. Tij is the pheromone level of edge(i,j), i.e. the learned desirability of choosing node j and current at node i. and are adjustable parameters that control the relative weight of the trail intensity T ij and the visibility nij respectively.
ij (t ) ij k pij = [ il (t )] [ il ] k l J i 0
] [ ]
if j J ik otherwise
Two recent trends in social insect-inspired routing are applying ACO principles to routing in mobile, ad-hoc wireless networks (MANETs) and taking inspiration from insects other than ants.
4.2
Firefly Synchronization
Precise synchronization in massively distributed systems is a complex issue and hard to achieve.
Page 7
Recently, new models for clock synchronization have been proposed based on synchronization principles of fireflies. Basically, firefly synchronization is based on the pulse coupled oscillators. The simple model for synchronous firing of biological oscillators consists of a population of identical integrate-and-fire oscillators. Multiple oscillators are assumed to interact inform of simple pulse coupling; when a given oscillator fires, it pulls the others up by a fixed amount , or brings them to the firing threshold, whichever is less. As a result, for almost all initial conditions the population evolves to a state in which all the oscillators are firing synchronously. The present concept of self-organized clock synchronization has been successfully applied to synchronization in ad hoc networks. Using a linearly incrementing phase function i, the local pulse of a node is controlled: when i reaches a threshold th , the local oscillator fires. For a period of T, this can be described as follows: d i(t)/dt = th/T
Fig x:Additional effort is needed to compensate the transmission delays in ad hoc and sensor networks. This can be done by selecting appropriate values for . In particular, the phase shift is dynamically updated according to the estimated transmission delay. Many other wireless networks, particularly sensor networks, require all of their sensors to perform actions that are coordinated in time. This may be simply to synchronize duty cycles to save power, or because the sensors are measuring time-sensitive events. This is an example of a problem nature has solved. The Mirollo and Strogatz model has some limitations when applied to real-world wireless networks. In particular, it assumes no propagation delays, no lossy links, and a fully connected
Page 8
network. Nevertheless, it has inspired a number of synchronization schemes for wireless networks. One of the earliest of these schemes was designed for ultra-wide bandwidth wireless networks where it is feasible for each node to hear every other node. This avoids one of the major limitations in applying the Mirollo and Strogatz model. The authors then modified the model to account for propagation delay and loss. Later work by Lucarelli and Wang extended this work, showing that, in theory, the modified Mirollo and Stro Researchers at Harvard University further extended this result into an actual protocol implementation for sensor networks. After some further modifications to the theoretical model, they initial results were inconclusive but promising. Upon further refinement, they were able to implement a TDMA protocol which significantly outperforms existing TDMA protocols for sensor networks, according to their evaluation.
4.3
Page 9
AIS has been designed to detect misbehavior in Dynamic Source Routing (DSR), a typical reactive MANET protocol. For the representation of routing events, letters from the alphabet are used, e.g. A=RREQ sent or E=RREQ received. Antibodies are represented as received sequences of such routing events. Then, a matching function can be defined using sequences of those letters, e.g. Gene 1=#E in sequence (refer to for more details). Then, the AIS is used to identify a node as suspicious if a corresponding antigen is matching any antibody. Furthermore, a no de is classified as misbehaving if the probability that the node is suspicious, estimated over a sufficiently large number of data sets, is above a threshold.
Page 10
4.4
Epidemic Spreading
Epidemic spreading is frequently used as an analogy to understand the information dissemination in wireless adhoc networks. Information dissemination in this context can refer to the distribution of information particles (as usually provided by ad hoc routing techniques) or to the spread of viruses in the Internet or on mobile devices. Biological models of virus transmission provide means for assessing such emerging threats and to understand epidemics as a general purpose communication mechanism. Two of the most common models, the susceptible-infective-susceptible (SIS) and susceptibleinfective-removed (SIR) models, have been used extensively by network researchers to model the spread of information in computer networks, and are therefore worth describing in some detail. In the SIS model, nodes are divided into two groups the susceptible group S and the infective group I. A node from the susceptible group S can acquire the infection from a node in the infective group I with some probability. This probability can be determined in any number of ways, as we will discuss in the following section. Once a node becomes infective, it can recover from the disease, but it does not acquire any immunity, meaning it moves back to the susceptible group S. The recovery time is a random number that follows a certain probability distribution based on the characteristics of the disease. When a node moves from the infective group I to the susceptible group S, it can once again contract the disease from any of the remaining nodes in the infective group I. Thus, nodes can repeatedly move from one group to the other, and, under the right conditions, the disease may never die out. In contrast, in the SIR model, a node cannot transition back and forth between the susceptible group S and the infective group I. Once a no de contracts the disease, it can recover from it, again after a random period of time. When a node recovers (or is removed from the population, e.g., through death), it moves to the removed group R and cannot contract the disease again. In addition, nodes in the susceptible group S cannot contract the disease from any of the nodes of the removed group R. Thus, in the SIR mo del, a disease will eventually die out, assuming the population of the nodes does not increase over time.
Page 11
Page 12
Apparently, cellular signaling networks are the fundamental source of inspiration for the design of nanonetworks. Therefore, the solution approaches for the commu nication and networking problems in nanonetworks may also be inspired by the similar biological processes. The main communication mechanism of cellular signaling is based on transmission and reception of certain type of molecules, i.e., molecular communication, which is, indeed, the most promising and explored communication mechanism for nanonetworks. First nanonetworks models are inspired by molecular communication schemes observed in biological systems. Biological nanonetworks are used for intra-cell, inter-cell and intra-specie communication. Intra-cell and inter-cell communication are referred as short-range techniques due to the size of the living cells and their internal components. Most of the intra-cell communication are based on molecular motors. Molecular motors e.g., dynein, are proteins or protein complexes that transform chemical energy into mechanical work at nano-scale their use as information shuttles or communication carriers for nano machines within a short range has been widely proposed. These molecular motors can be found in eukaryotic cells in living organisms.
5. Current Research Project in Bio-Inspired Networking 5.1 ANA: Autonomic Network Architecture (http://www.ana-project.org/)
The ANA Project aims at exploring novel ways of organizing and using networks beyond legacy Internet technology. The ultimate goal is to design and develop a novel autonomic network architecture that enables flexible, dynamic, and fully autonomous formation of network nodes as well as whole networks. Universities and research institutes from Europe and Northern America are participating in this project.
Page 13
The resulting autonomic network architecture will allow dynamic adaptation and re-organization of the network according to the working, economical and social needs of the users. This is expected to be especially challenging in a mobile context where new resources become available dynamically, administrative domains change frequently, and the economic models may vary. The challenge addressed in this project is to come up with network architecture and to fill it with the functionality needed to demonstrate the feasibility of autonomic networking within the coming years.
We believe that the challenges faced by future network applications have already been overcome in large scale biological systems and that future network applications will benefit by adopting key biological principles and mechanisms. The Bio-Networking Architecture is a paradigm as well as middleware for the design and implementation of scalable, adaptive, and survivable/available network applications. The paradigm is based on the principles and mechanisms that allow biological systems to scale, adapt, and survive.
6.3
Biologically
Inspired
Network
and
services
(http://www.bionets.eu/index.php?area=11)
The motivation for BIONETS comes from emerging trends towards pervasive computing and communication environments, where myriads of networked devices with very different features will enhance our five senses, our communication and tool manipulation capabilities. The complexity of such environments will not be far from that of biological organisms, ecosystems, and socio-economic communities. Traditional communication approaches are ineffective in this
Page 14
context, since they fail to address several new features: a huge number of nodes including lowcost sensing/identifying devices, a wide heterogeneity in node capabilities, high node mobility, the management complexity, the possibility of exploiting spare node resources. BIONETS aims at a novel approach able to address these challenges. Nature and society exhibit many instances of systems in which large populations are able to reach efficient equilibrium states and to develop effective collaboration and survival strategies, able to work in the absence of central control and to exploit local interactions. BIONETS overcomes device heterogeneity and achieves scalability via an autonomic and localized peer-to-peer communication paradigm. Services in BIONETS are also autonomic, and evolve to adapt to the surrounding environment, like living organisms evolve by natural selection.
Page 15
and mechanisms that can extend the functionality of existing technological artefacts (mobile phone, WI-FI devices, robots and robot-like artefacts, etc.) and can lead to the development of new artefacts. The project aimed to develop concepts, tools, and models for analysing collections of both natural and artificial agents, and algorithms, definitions of dynamical systems, and performance analysis tools for designing artefacts that consist of evolving populations of interacting and communicating embodied agents. The project also aimed to investigate basic properties of different communication systems, from simple communication systems in animals to human language and technology-supported human communication, to clarify the nature of existing communications systems and to provide ideas for designing new technologies based on collections of embodied and communicating devices.
6.7
Swarmnoid:
Towards
Humanoid
Robotic
Swarms
Page 16
(http:/www.swarmnoid.org)
The Swarmanoid project (IST-022888) is a Future and Emerging Technologies (FET-OPEN) project funded by the European Commission. The main scientific objective of this research project is the design, implementation and control of a novel distributed robotic system. The system will be made up of heterogeneous, dynamically connected, small autonomous robots. Collectively, these robots will form what we call a swarmanoid. The swarmanoid that we intend to build will be comprised of numerous (about 60) autonomous robots of three types: eye-bots, hand-bots, and foot-bots. The Swarmanoid project is the successor project to the Swarm-bots project, and will build on the results obtained during the Swarm-bots project.
Page 17
they must be secure and highly available they should require minimal human configuration and management
6. CONCLUSION
A great deal of successful research in the field of computer networks has been inspired by biological systems. Yet, we believe biologically inspired networking still has much room to grow. In particular, there are great opportunities in exploring a new approach. Observe some high-level behavior in nature which has a direct parallel to a desirable behavior for computer networks. Explore the basic biology of this behavior what individual components make up the system, the processes these components perform, what mathematical models have been used to describe this behavior and so on. Look for components, processes, or models that seem like they could map well to the computer networking domain. Turn these components, processes, or models into algorithms, new mathematical models, or software implementations. Generally attempt to stay as close as possible to the biological implementation. However, as others have recognized, the next generation of bio-inspired research will be most successful if it takes a more conceptual, systems-level approach. This means studying not just the behavior of individual components of the system, but their interactions, and the characteristics of the system that forms as a result. Approaches that too closely mimic the machinery of biological systems risk inheriting their quirks and constraints, imposed upon them by the randomness of evolution and the limits of the physical world. Therefore, the goal of bio-inspired research should be to find broader lessons and principles in the way large biological systems are built, then determine how to apply these lessons and principles to the design of networked systems. This goal requires a new high-level approach:
7. References
[1] Falko, Dressler, Ozgur B.Akan A survey on Bio Inspired Networking [2] Ian F.Akyildiz, Fernando Brunetti, Christina Blazquez Nanonetworks : A new communication paradigm.
Page 18
[3]
Page 19