591766e663
* Loop detection and untangling. Now uses in-band loop detection that works. * Link quality estimation. Now starts with a conservative / pessimistic estimate for new links. * Retransmissions. MAC layer and network layer retransmissions are now decoupled. * Loss handling. Deals better with losses now. * Concurrent applications. Each connection now maintains its own neighbor table with separated cost to sink estimates for each connection.
109 lines
3.8 KiB
C
109 lines
3.8 KiB
C
/**
|
|
* \addtogroup rimelinkestimate
|
|
* @{
|
|
*/
|
|
/*
|
|
* 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: collect-link-estimate.c,v 1.2 2010/09/13 13:28:14 adamdunkels Exp $
|
|
*/
|
|
|
|
/**
|
|
* \file
|
|
* Implementation of Collect link estimate based on ETX
|
|
* \author
|
|
* Adam Dunkels <adam@sics.se>
|
|
*/
|
|
|
|
#include "net/rime/collect.h"
|
|
#include "net/rime/collect-link-estimate.h"
|
|
|
|
/* This defines the window used by the ETX computation when computing
|
|
the ETX. It cannot be larger than
|
|
COLLECT_LINK_ESTIMATE_HISTORY_SIZE, which is defined in
|
|
collect-link-estimate.h. */
|
|
#define ETX_HISTORY_WINDOW 16
|
|
|
|
/*---------------------------------------------------------------------------*/
|
|
void
|
|
collect_link_estimate_new(struct collect_link_estimate *le)
|
|
{
|
|
int i;
|
|
|
|
/* Start with a conservative / pessimistic estimate of link quality
|
|
for new links. */
|
|
for(i = 0; i < ETX_HISTORY_WINDOW; i++) {
|
|
le->history[i] = 4;
|
|
}
|
|
le->historyptr = 0;
|
|
}
|
|
/*---------------------------------------------------------------------------*/
|
|
void
|
|
collect_link_estimate_update_tx_fail(struct collect_link_estimate *le, int tx)
|
|
{
|
|
if(le != NULL) {
|
|
le->history[le->historyptr] = tx * 2;
|
|
le->historyptr = (le->historyptr + 1) % ETX_HISTORY_WINDOW;
|
|
}
|
|
}
|
|
/*---------------------------------------------------------------------------*/
|
|
void
|
|
collect_link_estimate_update_tx(struct collect_link_estimate *le, int tx)
|
|
{
|
|
if(le != NULL) {
|
|
le->history[le->historyptr] = tx;
|
|
le->historyptr = (le->historyptr + 1) % ETX_HISTORY_WINDOW;
|
|
}
|
|
}
|
|
/*---------------------------------------------------------------------------*/
|
|
void
|
|
collect_link_estimate_update_rx(struct collect_link_estimate *n)
|
|
{
|
|
|
|
}
|
|
/*---------------------------------------------------------------------------*/
|
|
int
|
|
collect_link_estimate(struct collect_link_estimate *le)
|
|
{
|
|
int i, etx;
|
|
|
|
/* printf("collect_link_estimate: ");*/
|
|
etx = 0;
|
|
for(i = 0; i < ETX_HISTORY_WINDOW; ++i) {
|
|
/* printf("%d ", le->history[i]);*/
|
|
etx += le->history[i];
|
|
}
|
|
/* printf(", %d\n", (COLLECT_LINK_ESTIMATE_UNIT * etx) / ETX_HISTORY_WINDOW);*/
|
|
return (COLLECT_LINK_ESTIMATE_UNIT * etx) / ETX_HISTORY_WINDOW;
|
|
}
|
|
/*---------------------------------------------------------------------------*/
|
|
|
|
/** @} */
|