Current Version: 1.3 beta
Last update: February 2011

Atarraya is licensed for free use under the GNU license agreement. Therefore, all users must comply with its rules and regulations.

Remember! Atarraya is a free software, but you need to reference it when used in you public work.

In order to be able to notify you with the latest information about Atarraya, we encourage you to email Dr. Miguel A. Labrador at labrador@cse.usf.edu and/or Dr. Pedro Wightman at pwightman@uninorte.edu.co with the following information:

• Your name
• Affiliation
• Position
• Email
• Intended use
• If you are a student, please include the your advisor's information.

Atarraya's code is a Netbean 6.9.1 project folder, contained in a .rar or .zip file of less than 2MB. You will need Java 6. For linux users, the GUI style has been formatted based on Windows' design, but it can be changed on the Main class of the project; however, it will require some effort to format the GUI under the default scheme.

Atarraya 1.3 beta - Public version NEW!!

This version includes several new features:

• A renewed internal structure of the application, following a Facade-Observer design pattern which disintegrated the GUI from the functional sections of the code. This should allow the development of non graphical GUI for Atarraya.
• The inclusion of the idea of communication model, which now allows the development of realistic radio propagation models that will allow the development of more robust protocols. Atarraya now includes the radio and energy models of the XBow Mica2 and the Libelium WaspMote motes. You are more than welcome to develop your own!
• Some tweaks of the GUI in order to improve the quality of the graphics of the network topology, and the file type to save it on.
• This version includes two new topology construction protocols: A3Cov, based on A3 but that takes into account coverage as well as connectivity, and KNEIGH-Tree, a modified version of the KNEIGH in which a few simple changes now guarantee connectivity in the network.
• Get the code here

Atarraya 1.2.3 - Public version

This version solves the following three bugs:

• Corrections on the implementation of the energy models in the nodes, and the introduction of the EnergyState concept that determines the energy use of the nodes
• Major corrections on the topology maintenance protocols to support the new energy model architecture
• New metric: number of invocations of the maintenance protocols for lifetime-based experiments
• Get the code here

Atarraya 1.2.1.1 - Public version

This version solves the following three bugs:

• The method compareTo() in the node class was completed
• The sensor event handler was not being instantiated in one of the methods to do this in the NodeHandler class
• The getRegister() method did not validate an entry less than 0, which would cause and exception
• Get the code here

The following metrics have been added:

• Average K Sensing Coverage: The average of number of times that each pixel is covered by nodes, including the non-covered ones
• Average K Sensing Area Coverage: The average of number of times that each pixel is covered by nodes, including only the covered ones
• The execution of the brute-force optimal CDS now also shows the number of combinations that it is evaluating
• Get the code here

Atarraya 1.2.1 - Public version

• We solved a very strange bug that made the node data structure to return null values under unknown conditions
• The energy model was changed from the NodeNetworkConfiguration class to the Node class. It carries some changes to the protocols because now the invocations of the UseEnergy method do not need the definition of the active VNI or tree
• The energy model now is part of the creation word of the node and will be stored and read from the topology file. If that parameter is not in the deployment file, Atarraya will use the default value of 0
• Get the code here

• Bug corrected on calculating the covered area using the BFS
• Change LoadTopology() for ResetTopology() when simulations with replicate to speed up process
• Coverage statistics are now saved automatically in result logs without having to chech on the checkbox in the Atarraya tab
• Get the code here

• Two new node deployment methodologies:
  • Grid Lambda: based on a grid with cell size of Rsense*Rsense grid, lambda nodes are deployed randomly in each cell
  • Grid Poisson: based on a grid with cell size of Rsense*Rsense grid, a Poisson(lambda)-distributed random number of nodes are deployed randomly in each cell

• Creation of the brute-force algorithm for solving the MCDS problem. It can work with multiple files and generate a summarized results report file
• The simulator has a new option to save the results (active nodes) of the Topology Construction experiment

• Elimination of the semaphore in the GetNode() method to save time
• Reduction in the refresh rate of the clock and the current events; those two slowed down greatly the simulation
• Other changes to reduce execution time

• New support for different energy model. Apart from the simple model, a new "in development" energy model for the nodes is introduced, based on the specifications of the Mica2 motes. The values are still in revision, so any contributions on that matter will be more that welcome.
• Get the code here

• Implementation of a new topology construction protocol, based on the KNEIGH algorithm. This protocol modifies the network topology by reducing the transmission range of the nodes. This is the first algorithm of its kind implemented in Atarraya, so it can be used to develop new algorithms. However, this algorithm is not the pure KNEIGH, in the sense that the execution of the algorithm follows the creation of a tree, similar to the JustTree algorithm, already implemented in Atarraya.
• A new option to reset a loaded topology, without having to loaded again
• New GUI that simplifies the execution of batch simulations
• Improved the statistics provided in the lifetime analysis
• The mobility model can be applied now just to a subset of the nodes. This can be done by checking the "move?" checkbox during the addition of a new creation word.

• This version includes the mobility module for the nodes in the topology. The mobility is modeled as another EventHandler. A simple mobility model is included: a node will move a random distance no greater that a parameter d, and the position change will be executed randomly discretely in time, with a time delay no greater than a variable t. The discrete time can be assumed as the delay between the position is being updated
• A new option to save a snapshot of the topology in a jpeg file. This funtionality was contributed by Mykhailo Zelyanovskyy, Ph.D. Candidate, Institute of Telecommunications, Radioelectronics and Electronic Engineering, University “Lvivska Politehnika”, Lviv, Ukraine.
• Get the code here

• Improved the statistics provided in the message count and energy consumption
• Get the code here

• This version is the one used for the experiments performed in the book.
• Several topology construction and several topology maintenance algorithms and protocols
• Deployment generation using different distributions
• Simulation agent for initial topology construction based on an available algorithm (the user can create and add its own)
• Message generator that can be used to test endurance of the network after the TC algorithm was applied
• Simulation results can be stored in a csv file that can be open in many math analysis software. Also, simulations in batch can be executed
• Get the code here