98 lines
3.1 KiB
C
98 lines
3.1 KiB
C
|
/**
|
||
|
|
* \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.
|
||
|
|
*
|
||
|
|
* $Id: rpl-of0.c,v 1.1 2010/04/30 13:43:53 joxe Exp $
|
||
|
|
*/
|
||
|
|
/**
|
||
|
|
* \file
|
||
|
|
* An implementation of RPL's objective function 0.
|
||
|
|
*
|
||
|
|
* \author Joakim Eriksson <joakime@sics.se>, Nicolas Tsiftes <nvt@sics.se>
|
||
|
|
*/
|
||
|
|
|
||
|
|
#include "net/rpl/rpl.h"
|
||
|
|
|
||
|
|
#define DEBUG DEBUG_ANNOTATE
|
||
|
|
#include "net/uip-debug.h"
|
||
|
|
|
||
|
|
static rpl_neighbor_t *best_parent(rpl_neighbor_t *, rpl_neighbor_t *);
|
||
|
|
static rpl_rank_t increment_rank(rpl_rank_t, rpl_neighbor_t *);
|
||
|
|
|
||
|
|
rpl_of_t rpl_of0 = {
|
||
|
|
best_parent,
|
||
|
|
increment_rank,
|
||
|
|
0
|
||
|
|
};
|
||
|
|
|
||
|
|
#define DEFAULT_RANK_INCREMENT 4
|
||
|
|
#define MINIMUM_RANK_INCREMENT 1
|
||
|
|
#define MAXIMUM_RANK_INCREMENT 16
|
||
|
|
#define MAXIMUM_RANK_STRETCH 4
|
||
|
|
|
||
|
|
static rpl_rank_t
|
||
|
|
increment_rank(rpl_rank_t rank, rpl_neighbor_t *parent)
|
||
|
|
{
|
||
|
|
if((rpl_rank_t)(rank + DEFAULT_RANK_INCREMENT) < rank) {
|
||
|
|
PRINTF("RPL: OF0 rank %d incremented to infinite rank due to wrapping\n",
|
||
|
|
rank);
|
||
|
|
return INFINITE_RANK;
|
||
|
|
}
|
||
|
|
return rank + DEFAULT_RANK_INCREMENT;
|
||
|
|
}
|
||
|
|
|
||
|
|
static rpl_neighbor_t *
|
||
|
|
best_parent(rpl_neighbor_t *p1, rpl_neighbor_t *p2)
|
||
|
|
{
|
||
|
|
PRINTF("RPL: Comparing parent ");
|
||
|
|
PRINT6ADDR(&p1->addr);
|
||
|
|
PRINTF(" (confidence %d, rank %d) with parent ",
|
||
|
|
p1->local_confidence, p1->rank);
|
||
|
|
PRINT6ADDR(&p2->addr);
|
||
|
|
PRINTF(" (confidence %d, rank %d)\n",
|
||
|
|
p2->local_confidence, p2->rank);
|
||
|
|
|
||
|
|
/* TODO: Add other rules. */
|
||
|
|
if(p1->local_confidence > p2->local_confidence) {
|
||
|
|
return p1;
|
||
|
|
} else if(p2->local_confidence > p1->local_confidence) {
|
||
|
|
return p2;
|
||
|
|
}
|
||
|
|
|
||
|
|
if(p1->rank < p2->rank) {
|
||
|
|
return p1;
|
||
|
|
}
|
||
|
|
|
||
|
|
return p2;
|
||
|
|
}
|