/** * \addtogroup uip6 * @{ */ /* * Copyright (c) 2010, Swedish Institute of Computer Science. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. Neither the name of the Institute nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. * * This file is part of the Contiki operating system. * */ /** * \file * The minrank-hysteresis objective function (OCP 1). * * This implementation uses the estimated number of * transmissions (ETX) as the additive routing metric. * * \author Joakim Eriksson , Nicolas Tsiftes */ #include "net/rpl/rpl-private.h" #include "net/neighbor-info.h" #define DEBUG DEBUG_NONE #include "net/uip-debug.h" static void reset(rpl_dag_t *); static void parent_state_callback(rpl_parent_t *, int, int); static rpl_parent_t *best_parent(rpl_parent_t *, rpl_parent_t *); static rpl_rank_t calculate_rank(rpl_parent_t *, rpl_rank_t); static void update_metric_container(rpl_dag_t *); rpl_of_t rpl_of_etx = { reset, parent_state_callback, best_parent, calculate_rank, update_metric_container, 1 }; #define NI_ETX_TO_RPL_ETX(etx) \ ((etx) * (RPL_DAG_MC_ETX_DIVISOR / NEIGHBOR_INFO_ETX_DIVISOR)) #define rpl_path_metric_tO_NI_ETX(etx) \ ((etx) / (RPL_DAG_MC_ETX_DIVISOR / NEIGHBOR_INFO_ETX_DIVISOR)) /* Reject parents that have a higher link metric than the following. */ #define MAX_LINK_METRIC 10 /* Reject parents that have a higher path cost than the following. */ #define MAX_PATH_COST 100 /* An initial guess of the link metric. */ #define INITIAL_LINK_METRIC 3 /* * The rank must differ more than 1/PARENT_SWITCH_THRESHOLD_DIV in order * to switch preferred parent. */ #define PARENT_SWITCH_THRESHOLD_DIV 2 typedef uint16_t rpl_path_metric_t; static uint16_t calculate_path_metric(rpl_parent_t *p) { return p->mc.obj.etx + NI_ETX_TO_RPL_ETX(p->etx); } static void reset(rpl_dag_t *dag) { } static void parent_state_callback(rpl_parent_t *parent, int known, int etx) { } static rpl_rank_t calculate_rank(rpl_parent_t *p, rpl_rank_t base_rank) { rpl_rank_t new_rank; rpl_rank_t rank_increase; if(p == NULL) { if(base_rank == 0) { return INFINITE_RANK; } rank_increase = INITIAL_LINK_METRIC * DEFAULT_MIN_HOPRANKINC; } else { if(p->etx == 0) { p->etx = INITIAL_LINK_METRIC * NEIGHBOR_INFO_ETX_DIVISOR; } rank_increase = (p->etx * p->dag->min_hoprankinc) / NEIGHBOR_INFO_ETX_DIVISOR; if(base_rank == 0) { base_rank = p->rank; } } if(INFINITE_RANK - base_rank < rank_increase) { /* Reached the maximum rank. */ new_rank = INFINITE_RANK; } else { /* Calculate the rank based on the new rank information from DIO or stored otherwise. */ new_rank = base_rank + rank_increase; } return new_rank; } static rpl_parent_t * best_parent(rpl_parent_t *p1, rpl_parent_t *p2) { rpl_dag_t *dag; rpl_path_metric_t min_diff; rpl_path_metric_t p1_metric; rpl_path_metric_t p2_metric; dag = p1->dag; /* Both parents must be in the same DAG. */ min_diff = RPL_DAG_MC_ETX_DIVISOR / PARENT_SWITCH_THRESHOLD_DIV; p1_metric = calculate_path_metric(p1); p2_metric = calculate_path_metric(p2); /* Maintain stability of the preferred parent in case of similar ranks. */ if(p1 == dag->preferred_parent || p2 == dag->preferred_parent) { if(p1_metric < p2_metric + min_diff && p1_metric > p2_metric - min_diff) { PRINTF("RPL: MRHOF hysteresis: %u <= %u <= %u\n", p2_metric - min_diff, p1_metric, p2_metric + min_diff); return dag->preferred_parent; } } return p1_metric < p2_metric ? p1 : p2; } static void update_metric_container(rpl_dag_t *dag) { #if RPL_DAG_MC == RPL_DAG_MC_ETX dag->mc.type = RPL_DAG_MC_ETX; dag->mc.flags = RPL_DAG_MC_FLAG_P; dag->mc.aggr = RPL_DAG_MC_AGGR_ADDITIVE; dag->mc.prec = 0; dag->mc.length = sizeof(dag->mc.obj.etx); if(dag->rank == ROOT_RANK(dag)) { dag->mc.obj.etx = 0; } else { dag->mc.obj.etx = calculate_path_metric(dag->preferred_parent); } #elif RPL_DAG_MC == RPL_DAG_MC_ENERGY dag->mc.type = RPL_DAG_MC_ENERGY; dag->mc.flags = RPL_DAG_MC_FLAG_P; dag->mc.aggr = RPL_DAG_MC_AGGR_ADDITIVE; dag->mc.prec = 0; dag->mc.length = sizeof(dag->mc.obj.energy); if(dag->rank == ROOT_RANK(dag)) { dag->mc.obj.energy.flags = RPL_DAG_MC_ENERGY_TYPE_MAINS << RPL_DAG_MC_ENERGY_TYPE; } else { dag->mc.obj.energy.flags = RPL_DAG_MC_ENERGY_TYPE_BATTERY << RPL_DAG_MC_ENERGY_TYPE; } dag->mc.obj.energy.energy_est = calculate_path_metric(dag->preferred_parent); #else #error "Unsupported RPL_DAG_MC configured. See rpl.h." #endif /* RPL_DAG_MC */ PRINTF("RPL: My path ETX to the root is %u.%u\n", dag->mc.obj.etx / RPL_DAG_MC_ETX_DIVISOR, (dag->mc.obj.etx % RPL_DAG_MC_ETX_DIVISOR * 100) / RPL_DAG_MC_ETX_DIVISOR); }