Logo
Distributed Genetic Programming Framework
print print

Package org.dgpf.gp.netautomaton

Here you can find all the information about the org.dgpf.gp.netautomaton package. You may explore the package using the directory listing below. This listing contains all the files contained directly in this package and all its sub-packages. There you can either download a file directly (by clicking on the "download"-link) or read it online (by clicking on its direct link left in the directoy listing. Further information about the package's contents is given at the bottom of this page.

Directory Listing

org.dgpf.gp.netautomaton
  ├[base]2012-05-02 03:10:50 GMT+0000
  ├[expressions]2012-05-02 03:10:51 GMT+0000
  ├[fitness]2012-05-02 03:10:51 GMT+0000
  ├[instructions]2012-05-02 03:10:51 GMT+0000
  └package.htmldownload download4.868 KB2012-05-02 03:10:50 GMT+0000

This package provides an extension to the Automaton Package for the Distributed Genetic Programming Framework.

Package Specification

Introducing a reusable network simulator, this package extends the normal automata of the automaton package by networking functionality. New instructions for data transmission and receiving are provided as well as statistical information.

To model a distributed system, many automata are simulated in parallel for each grown program. For this set of automata, the following assumptions will hold:

  1. All automata run at approximately the same speed, since they are based on the same virtual hardware. The execution speed might differ from automaton to automaton and cannot be regarded as constant either.
  2. Hence, the system of automata runs asynchronously, like real sensor nodes running asynchronously even if they were switched on at the same time.
  3. The automata will be started at different times.

The network simulator instance provides an absolute system time, keeps track on the transmissions currently underway, and also maintains global statistics. Fig. 5 shows how the automata of Fig. 4 will interact in a simulated network. Multiple automata need to be instantiated each time the fitness of an individual is evaluated; the network simulator can be reused. Since it is the most complex component in the simulation, this saves initialization time and memory capacity on the server nodes.

The network simulator evaluates systems that are connected wirelessly, and cannot a priori guarantee reliable communication. It therefore has the following properties:

  1. The links between the nodes are randomly created, yet it will be ensured that there are no network partitions.
  2. Messages are simple sequences of memory words with no predefined structure.
  3. Messages cannot be sent directly. Like radio broadcasts they will be received by any node in transmission distance. inding out which message is of concern will be in the responsibility of each node.
  4. Messages can get lost without special cause.
  5. Transmissions may take a random time until they reach their target.
  6. The collision of two transmissions underway leads to the loss of both messages.

Code working correctly in such an environment can also expected to be robust and adaptive in a real-world application.

This packages depends on the following packages:

This package allows you to evolve automata that communicate with each other. An automaton is a small device like a sensor node. Each automaton is driven by a program which is evolved by our Genetic Programming Framework. NetAutomata, as defined in this package, also have the ability to exchange message. While one simulates only one automaton when evolving normal programs, we now simulate a whole network of automata.

To model a distributed system, many automata are simulated in parallel for each grown program. For this set of automata, the following assumptions will hold:

  1. All automata run at approximately the same speed, since they are based on the same virtual hardware. The execution speed might differ from automaton to automaton and cannot be regarded as constant either.
  2. Hence, the system of automata runs asynchronously, like real sensor nodes running asynchronously even if they were switched on at the same time.
  3. The automata will be started at different times.

The network simulator evaluates systems that are connected wirelessly, and cannot a priori guarantee reliable communication. It therefore has the following properties:

  1. The links between the nodes are randomly created, yet it will be ensured that there are no network partitions.
  2. Messages are simple sequences of memory words with no predefined structure.
  3. Messages cannot be sent directly. Like radio broadcasts they will be received by any node in transmission distance. Finding out which message is of concern will be in the responsibility of each node.
  4. Messages can get lost without special cause.
  5. Transmissions may take a random time until they reach their target.
  6. The collision of two transmissions underway leads to the loss of both messages.

The goal of this approach is to evolve programs that cause the network of automata to perform specific tasks, assuming that code working correctly in such an environment can also expected to be robust and adaptive in a real-world application.

See the rich example collection also available on the web for feature demonstrations


statistics online since 2006-01-02.   RSS Feed
Contact us by sending an email to tweise@gmx.de to receive further information, to report errors, or to join our project.
All content on this site (http://dgpf.sourceforge.net/) is LGPL-licensed.
http://dgpf.sourceforge.net/scripts/source/source.php last modified at 2012-05-02 03:10:45 GMT+0000 served at 2014-07-29 10:41:59 GMT+0000.
Valid CSS Valid XHTML 1.1
Valid RSS SourceForge.net Logo