Changes between Version 14 and Version 15 of Check


Ignore:
Timestamp:
Oct 12, 2010, 5:37:39 PM (14 years ago)
Author:
dan.tudose
Comment:

--

Legend:

Unmodified
Added
Removed
Modified

  • Check

    v14 v15  
    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
     10 * '''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.
     11 * '''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.
     12 * '''Gateway''': Binary Web Services (COAP) running on a machine in the same network with the Edge Router.
     13 * '''Check Services''': Self-healing, Task Scheduling and Monitoring Framework.
    1314
    1415== Software Architecture ==
     16
     17The 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] and Sparrow nodes that form a heterogeneous multi-hop network using a modified version of Atmel's [http://sensei-dev1.grid.pub.ro:8184/rd RUM] protocol over which we ported the Binary Web Services application and our own task scheduling and monitoring apps.
     18
     19The gateway is an embedded ARM7 board
     20
    1521[[Image(sensei+rum.png, center)]]
    1622= Monitoring and reprogramming=
    … …  
    137143
    138144= Scheduling =
    139 
    140 The Scheduling algorithm is presented as a stand-alone application that gathers information about the network from a Resource Directory (types of nodes, topology).
    141 
    142 Prerequisite: 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 
    148 The 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 
    150 The task mapping input file associates the Task Dependency Acyclic Graph to the names of the tasks that have to be run on the network.
    151145= Self-healing =