Changes between Version 13 and Version 14 of Check


Ignore:
Timestamp:
Oct 12, 2010, 5:36:06 PM (14 years ago)
Author:
andrei.voinescu
Comment:

--

Legend:

Unmodified
Added
Removed
Modified

  • Check

    v13 v14  
    77
    88The Check architecture consists of the following entities:
    9  * '''WSN Island''': Sensor nodes organize into a multi-hop wireless network with tree topology in which some nodes act as routers for the end node leaves.
    10  * '''Edge Router''': An embedded network coordinator. Acts as a sink to the sensor node data and routes the island network traffic to an IPv6 network.
    11  * '''Gateway''': Binary Web Services (COAP) running on a machine in the same network with the Edge Router.
    12  * '''Check Services''': Self-healing, Task Scheduling and Monitoring Framework.
     9 * WSN Island: Sensor nodes organize into a multi-hop wireless network with tree topology in which some nodes act as routers for the end node leaves.
     10 * Edge Router: An embedded network coordinator. Acts as a sink to the sensor node data and routes the island network traffic to an IPv6 network.
     11 * Gateway: Binary Web Services (COAP) running on a machine in the same network with the Edge Router.
     12 * Check Services: Self-healing, Task Scheduling and Monitoring Framework.
    1313
    1414== Software Architecture ==
    15 
    16 The entire Check WSN architecture is given in the diagram below. The sensor network itself is built around [http://www.atmel.com/dyn/Products/tools_card.asp?tool_id=4291 RZRAVEN]
    1715[[Image(sensei+rum.png, center)]]
    1816= Monitoring and reprogramming=
    … …  
    139137
    140138= Scheduling =
     139
     140The Scheduling algorithm is presented as a stand-alone application that gathers information about the network from a Resource Directory (types of nodes, topology).
     141
     142Prerequisite: Prior to executing the scheduler the sub-tasks of the application have to be already programmed on the nodes, as stopped tasks.
     143
     144{{{
     145./check-schedule <RD> <input file> <task mapping>
     146}}}
     147
     148The input file needed is a Task Dependency Acyclic Graph (DAG). One run of the application is enough to calculate the best scheduling of the application over the network, the application will directly access the nodes and start the required tasks.
     149
     150The task mapping input file associates the Task Dependency Acyclic Graph to the names of the tasks that have to be run on the network.
    141151= Self-healing =