Sensix Wireless Sensor Network Middleware    Home    Project Page    Download    CVS  Hosted by

/home/brennan/Software/sensix/source/L1/mote_sensix.c Go to the documentation of this file. /* * Copyright 2008. Los Alamos National Security, LLC. This material * was produced under U.S. Government contract DE-AC52-06NA25396 for * Los Alamos National Laboratory (LANL), which is operated by Los * Alamos National Security, LLC, for the Department of Energy. The * U.S. Government has rights to use, reproduce, and distribute this * software. NEITHER THE GOVERNMENT NOR LOS ALAMOS NATIONAL SECURITY, * LLC, MAKES ANY WARRANTY, EXPRESS OR IMPLIED, OR ASSUMES ANY LEGAL * LIABILITY FOR THE USE OF THIS SOFTWARE. If software is modified to * produce derivative works, such modified software should be clearly * marked, so as not to confuse it with the version available from LANL. * * Additionally, this program is free software; you can redistribute * it and/or modify it under the terms of the GNU General Public * License as published by the Free Software Foundation; version 2 of * the License. Accordingly, this program is distributed in the hope * it will be useful, but WITHOUT ANY WARRANTY; without even the * implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR * PURPOSE. See the GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA. */ #include <string.h> #include <stdlib.h> #define MOTE #define IMPL #include "sensix.h" #include "sense_impl.h" #include "mote_sensix.h" #include "mote_networking.h" #include "mote_impl.h" #include "mote_types.h" #include "mote_limits.h" #include "mote_state.h" mote_state _node_state[MAX_NODES]; // Integer Square Root function, copyright 2006 Paul Hsieh // Contributors include Arne Steinarson for the basic approximation idea, // Dann Corbit and Mathew Hendry for the first cut at the algorithm, // Lawrence Kirby for the rearrangement, improvements and range optimization // and Paul Hsieh for the round-then-adjust idea. static int32_t _square_root(int32_t x) { static const unsigned char sqq_table[] = { 0, 16, 22, 27, 32, 35, 39, 42, 45, 48, 50, 53, 55, 57, 59, 61, 64, 65, 67, 69, 71, 73, 75, 76, 78, 80, 81, 83, 84, 86, 87, 89, 90, 91, 93, 94, 96, 97, 98, 99, 101, 102, 103, 104, 106, 107, 108, 109, 110, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 128, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 144, 145, 146, 147, 148, 149, 150, 150, 151, 152, 153, 154, 155, 155, 156, 157, 158, 159, 160, 160, 161, 162, 163, 163, 164, 165, 166, 167, 167, 168, 169, 170, 170, 171, 172, 173, 173, 174, 175, 176, 176, 177, 178, 178, 179, 180, 181, 181, 182, 183, 183, 184, 185, 185, 186, 187, 187, 188, 189, 189, 190, 191, 192, 192, 193, 193, 194, 195, 195, 196, 197, 197, 198, 199, 199, 200, 201, 201, 202, 203, 203, 204, 204, 205, 206, 206, 207, 208, 208, 209, 209, 210, 211, 211, 212, 212, 213, 214, 214, 215, 215, 216, 217, 217, 218, 218, 219, 219, 220, 221, 221, 222, 222, 223, 224, 224, 225, 225, 226, 226, 227, 227, 228, 229, 229, 230, 230, 231, 231, 232, 232, 233, 234, 234, 235, 235, 236, 236, 237, 237, 238, 238, 239, 240, 240, 241, 241, 242, 242, 243, 243, 244, 244, 245, 245, 246, 246, 247, 247, 248, 248, 249, 249, 250, 250, 251, 251, 252, 252, 253, 253, 254, 254, 255 }; int xn; if (x < 1) { if (x < 0) return -1; if (x == 0) return 0; } if (x >= 0x10000) { if (x >= 0x1000000) { if (x >= 0x10000000) { if (x >= 0x40000000) xn = sqq_table[x>>24] << 8; else xn = sqq_table[x>>22] << 7; } else { if (x >= 0x4000000) xn = sqq_table[x>>20] << 6; else xn = sqq_table[x>>18] << 5; } } else { if (x >= 0x100000) { if (x >= 0x400000) xn = sqq_table[x>>16] << 4; else xn = sqq_table[x>>14] << 3; } else { if (x >= 0x40000) xn = sqq_table[x>>12] << 2; else xn = sqq_table[x>>10] << 1; } goto nr1; } } else { if (x >= 0x100) { if (x >= 0x1000) { if (x >= 0x4000) xn = (sqq_table[x>>8] >> 0) + 1; else xn = (sqq_table[x>>6] >> 1) + 1; } else { if (x >= 0x400) xn = (sqq_table[x>>4] >> 2) + 1; else xn = (sqq_table[x>>2] >> 3) + 1; } goto adj; } else return sqq_table[x] >> 4; } xn = (xn + 1 + x / xn) / 2; // standard convergence formula nr1: xn = (xn + 1 + x / xn) / 2; adj: if (xn * xn > x) // correct rounding if necessary xn--; return xn; } static byte_t _incr(byte_t var) { byte_t pre = var++; if (var >= 0xfe) var = 1; return pre; } static int_t _summation(functor *f) { uint_t i; int_t sum = 0; for (i = 0; i < f->size; i++) sum += f->results[i].data; return sum; } static int_t _difference(functor *f) { uint_t i; int_t max = 0; for (i = 0; i < f->size; i++) { int_t delta = f->results[i].data - max; if (delta < 0) delta = 0 - delta; if (delta > max) max = delta; } return max; } static int_t _average(functor *f) { int_t sum = _summation(f); if (f->size == 0) return -1; return sum / f->size; } static int_t _variance(functor *f) { uint_t i; int_t var = 0; int_t mean = _average(f); if (f->size == 0 || f->size == 1) return -1; for (i = 0; i < f->size; i++) { int_t x = f->results[i].data - mean; var += x * x; } return _square_root(var / (f->size - 1)); } mote_state *get_state(uint_t node) { return &(_node_state[node]); } functor *get_functor(uint_t idx, uint_t node) { if (node > MAX_NODES) { log_error("Pointing beyond valid state\n"); return NULL; } return &(_node_state[node].functor_pool[idx]); } void start_discovery(uint_t node) { discover_siblings(node); discover_ancestors(node); } void discover_ancestors(uint_t node) { if (node > MAX_NODES) { log_error("Pointing beyond valid state\n"); return; } xmit_metadata(DESCENDANTS, node); } void discover_siblings(uint_t node) { if (node > MAX_NODES) { log_error("Pointing beyond valid state\n"); return; } xmit_metadata(SIBLINGS, node); } void add_capability(byte_t cap, uint_t node) { uint_t idx; if (node > MAX_NODES) { log_error("Pointing beyond valid state\n"); return; } idx = _node_state[node].cap_size; _node_state[node].capabilities[idx] = cap; _node_state[node].cap_size++; } int_t initialize(uint_t id, uint_t node) { unsigned int i; if (node > MAX_NODES) { log_error("Pointing beyond valid state\n"); return -1; } memset(&(_node_state[node]), 0, sizeof(mote_state)); _node_state[node].ident = id; for (i = 0; i < MAX_FUNCTORS; i++) init_functor(&(_node_state[node].functor_pool[i]), node); _node_state[node].max_energy = check_energy(); init_functor(&(_node_state[node].ancestors), node); _node_state[node].ancestors.f_type = ANCESTORS; init_functor(&(_node_state[node].siblings), node); _node_state[node].siblings.f_type = SIBLINGS; init_self(); listen_radio(); return 0; } int_t f_apply(functor *f) { log_info("apply\n"); if (f == NULL || f->function == NULL) return -1; f->f_e = check_energy(); f->f_t = check_time(); return (*(f->function))(f); } int_t f_dataready(functor *f) { log_info("dataready\n"); if (f == NULL || f->function_done == NULL) return -1; if (!(f->bits & functor_data_ready)) return 1; if (f->collector == NULL) { f->f_e = energy_diff(f->f_e, check_energy()); f->f_t = time_diff(f->f_t, check_time()); } else { f->f_e = f->collector->f_e; f->f_t = f->collector->f_t; } return (*(f->function_done))(f); } int_t f_cancel(functor *f) { log_info("cancel\n"); f->bits &= ~functor_running; free_functor(f); return 0; } functor *allocate_functor(uint_t node) { uint_t idx = 0; if (node > MAX_NODES) { log_error("Pointing beyond valid state\n"); return NULL; } while (_node_state[node].functor_pool[idx].bits & functor_used) ++idx; if (idx >= MAX_FUNCTORS) return NULL; init_functor(&_node_state[node].functor_pool[idx], node); _node_state[node].functor_pool[idx].f_id = idx; _node_state[node].functor_pool[idx].f_e = check_energy(); _node_state[node].functor_pool[idx].f_t = check_time(); _node_state[node].functor_pool[idx].bits |= functor_used; return &(_node_state[node].functor_pool[idx]); } void init_functor(functor *f, uint_t node) { if (node > MAX_NODES) { log_error("Pointing beyond valid state\n"); return; } memset(f, 0, sizeof(functor)); //f->bits = f->f_type = f->priority = f->sensor = 0; f->f_id = 0xff; f->req_octet = WORDSIZE; //memset(f->requestor, 0, 4); f->function = NULL; f->function_done = NULL; f->collector = NULL; //f->task_id = 0; //f->threshold = 0; //f->rate = f->duration = f->size = f->result = 0; //memset(f->results, 0, MAX_RESULTS * sizeof(struct _res)); f->node_idx = node; } void free_functor(functor *f) { f->bits &= ~functor_used; if (f->collector != NULL) free_functor(f->collector); } static int_t f_sense_done(functor *f) { log_info("sense done\n"); f->bits &= ~functor_running; if (!f->bits & functor_pass_thru) xmit_datum(f); else { if (f_dataready(f->parent) > 0) return 1; } f_cancel(f); return 0; } int_t f_sense(functor *f) { log_info("sense\n"); if (f == NULL) return -1; f->f_type = ALPHA; f->function = &f_sense; f->function_done = &f_sense_done; listen_sense(f); return 0; } static int_t f_peak_sense_done(functor *f) { log_info("peak sense done\n"); f->bits &= ~functor_running; if (!f->bits & functor_pass_thru) xmit_datum(f); else { if (f_dataready(f->parent) > 0) return 1; } f_cancel(f); return 0; } int_t f_peak_sense(functor *f) { log_info("peak sense\n"); if (f == NULL) return -1; f->f_type = BETA; f->function = &f_peak_sense; f->function_done = &f_peak_sense_done; listen_sense(f); return 0; } static int_t f_time_series_done(functor *f) { int i; log_info("time series done\n"); f->bits &= ~functor_running; if (f->collector->size * f->collector->rate < f->duration) { f_apply(f->collector); return 1; } for(i = 0; i < f->collector->size; i++) f->results[f->size++].data = f->collector->results[i].data; if (!f->bits & functor_pass_thru) xmit_data(f); else f_dataready(f->parent); f_cancel(f); return 0; } int_t f_time_series(functor *f) { log_info("time series\n"); if (f == NULL || f->collector == NULL) return -1; f->f_type = THETA; f->function = &f_time_series; f->function_done = &f_time_series_done; f->collector->bits |= functor_pass_thru; f->size = 0; return f_apply(f->collector); } static int_t f_spatial_series_done(functor *f) { int i; log_info("spatial series done\n"); f->bits &= ~functor_running; if (f->collector->size < _node_state[f->node_idx].siblings.size && (check_time() - f->duration) < SPATIAL_SERIES_TIMEOUT) return 1; for(i = 0; i < f->collector->size; i++) { f->results[f->size].data = f->collector->results[i].data; memcpy(&(f->results[f->size].id), &(f->collector->results[f->size].id), ID_BYTE_LEN); f->size++; } if (!f->bits & functor_pass_thru) xmit_data(f); else f_dataready(f->parent); f_cancel(f); return 0; } int_t f_spatial_series(functor *f) { log_info("spatial series\n"); if (f == NULL || f->collector == NULL) return -1; f->f_type = PSI; f->f_e = check_energy(); f->f_t = check_time(); f->function = &f_spatial_series; f->function_done = &f_spatial_series_done; f->collector->bits |= functor_pass_thru; f->duration = check_time(); f->size = 0; xmit_command(f->collector); return f_apply(f->collector); } // recite not implemented for Level 1 static int_t f_recite_done(functor *f) { log_info("recite done\n"); f->bits &= ~functor_running; xmit_data(f); f_cancel(f); return 0; } int_t f_recite(functor *f) { log_info("recite\n"); if (f == NULL || f->collector == NULL) return -1; f->f_type = IOTA; f->function = &f_recite; f->function_done = &f_recite_done; f->collector->bits |= functor_pass_thru; return f_apply(f->collector); } static int_t f_sum_done(functor *f) { log_info("sum done\n"); f->bits &= ~functor_running; f->result = _summation(f->collector); xmit_datum(f); f_cancel(f); return 0; } int_t f_sum(functor *f) { log_info("sum\n"); if (f == NULL || f->collector == NULL) return -1; f->f_type = SUMMA; f->function = &f_sum; f->function_done = &f_sum_done; f->collector->bits |= functor_pass_thru; return f_apply(f->collector); } static int_t f_delta_done(functor *f) { log_info("delta done\n"); f->bits &= ~functor_running; f->result = _difference(f->collector); xmit_datum(f); f_cancel(f); return 0; } int_t f_delta(functor *f) { log_info("delta\n"); if (f == NULL || f->collector == NULL) return -1; f->f_type = DELTA; f->function = &f_delta; f->function_done = &f_delta_done; f->collector->bits |= functor_pass_thru; return f_apply(f->collector); } static int_t f_mean_done(functor *f) { log_info("mean done\n"); f->bits &= ~functor_running; f->result = _average(f->collector); xmit_datum(f); f_cancel(f); return 0; } int_t f_mean(functor *f) { log_info("mean\n"); if (f == NULL || f->collector == NULL) return -1; f->f_type = BARX; f->function = &f_mean; f->function_done = &f_mean_done; f->collector->bits |= functor_pass_thru; return f_apply(f->collector); } static int_t f_sigma_done(functor *f) { log_info("sigma done\n"); f->bits &= ~functor_running; f->result = _variance(f->collector); xmit_datum(f); f_cancel(f); return 0; } int_t f_sigma(functor *f) { log_info("sigma\n"); if (f == NULL || f->collector == NULL) return -1; f->f_type = SIGMA; f->function = &f_sigma; f->function_done = &f_sigma_done; f->collector->bits |= functor_pass_thru; return f_apply(f->collector); } static byte_t lambda_seq = 0; static int_t f_lambda_done(functor *f) { log_info("lambda done\n"); f->bits &= ~functor_running; #if 1 f_cancel(f); return -1; #else xmit_data(f); f_cancel(f); return 0; #endif } int_t f_lambda(functor *f) { log_info("lambda\n"); if (f == NULL) return -1; f->f_type = LAMBDA; f->task_id = _incr(lambda_seq); f->function = &f_lambda; f->function_done = &f_lambda_done; return f_apply(f->collector); } uint_t energy_diff(uint_t prev, uint_t cur) { return prev - cur; } uint_t time_diff(uint_t prev, uint_t cur) { return cur - prev; } static void __attribute((constructor)) init(void) { memset(_node_state, 0, sizeof(mote_state) * MAX_NODES); }

© 2008, Los Alamos National Security, LLC.