7165a3866f
* the new version makes use of MAC-layer feedback so that bad paths can be identified quicker and then avoided. * the new code uses transport layer ACKs that contain feedback from the collect protocol: when a packet cannot be forwarded due to lack of resources, the ACK contains a flag that indicates that the packet could not be forwarded. ACKs also contain the routing metric of the sender, which improves agility in face of rapid path changes. * loop detection and management has been improved: with higher path metric agility, the system is more prone to short-lived routing loops. Instead of dropping looping packets, the new version adjusts the routing metric for the routes that exhibit loops so that the risk for future loops is reduced. * make use of packet attributes to inform the MAC layer of how many times packets should be retransmitted.
116 lines
4 KiB
C
116 lines
4 KiB
C
/**
|
|
* \addtogroup rime
|
|
* @{
|
|
*/
|
|
|
|
/**
|
|
* \defgroup rimecollect Tree-based hop-by-hop reliable data collection
|
|
* @{
|
|
*
|
|
* The collect module implements a hop-by-hop reliable data collection
|
|
* mechanism.
|
|
*
|
|
* \section channels Channels
|
|
*
|
|
* The collect module uses 2 channels; one for neighbor discovery and one
|
|
* for data packets.
|
|
*
|
|
*/
|
|
|
|
/*
|
|
* Copyright (c) 2007, 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.h,v 1.13 2010/02/28 09:18:01 adamdunkels Exp $
|
|
*/
|
|
|
|
/**
|
|
* \file
|
|
* Header file for hop-by-hop reliable data collection
|
|
* \author
|
|
* Adam Dunkels <adam@sics.se>
|
|
*/
|
|
|
|
#ifndef __COLLECT_H__
|
|
#define __COLLECT_H__
|
|
|
|
#include "net/rime/announcement.h"
|
|
#include "net/rime/runicast.h"
|
|
#include "net/rime/neighbor-discovery.h"
|
|
|
|
#define COLLECT_PACKET_ID_BITS 4
|
|
|
|
#define COLLECT_ATTRIBUTES { PACKETBUF_ADDR_ESENDER, PACKETBUF_ADDRSIZE }, \
|
|
{ PACKETBUF_ATTR_EPACKET_ID, PACKETBUF_ATTR_BIT * 4 }, \
|
|
{ PACKETBUF_ATTR_PACKET_ID, PACKETBUF_ATTR_BIT * COLLECT_PACKET_ID_BITS }, \
|
|
{ PACKETBUF_ATTR_TTL, PACKETBUF_ATTR_BIT * 4 }, \
|
|
{ PACKETBUF_ATTR_HOPS, PACKETBUF_ATTR_BIT * 4 }, \
|
|
{ PACKETBUF_ATTR_MAX_REXMIT, PACKETBUF_ATTR_BIT * 3 }, \
|
|
{ PACKETBUF_ATTR_PACKET_TYPE, PACKETBUF_ATTR_BIT }, \
|
|
UNICAST_ATTRIBUTES
|
|
|
|
struct collect_callbacks {
|
|
void (* recv)(const rimeaddr_t *originator, uint8_t seqno,
|
|
uint8_t hops);
|
|
};
|
|
|
|
struct collect_conn {
|
|
struct unicast_conn unicast_conn;
|
|
#if ! COLLECT_CONF_ANNOUNCEMENTS
|
|
struct neighbor_discovery_conn neighbor_discovery_conn;
|
|
#else /* ! COLLECT_CONF_ANNOUNCEMENTS */
|
|
struct announcement announcement;
|
|
#endif /* COLLECT_CONF_ANNOUNCEMENTS */
|
|
const struct collect_callbacks *cb;
|
|
struct ctimer t;
|
|
uint16_t rtmetric;
|
|
uint8_t sending, transmissions, max_rexmits;
|
|
uint8_t seqno, last_received_seqno;
|
|
rimeaddr_t last_received_addr;
|
|
uint8_t eseqno;
|
|
struct ctimer retransmission_timer;
|
|
rimeaddr_t current_receiver;
|
|
};
|
|
|
|
void collect_open(struct collect_conn *c, uint16_t channels,
|
|
const struct collect_callbacks *callbacks);
|
|
void collect_close(struct collect_conn *c);
|
|
|
|
int collect_send(struct collect_conn *c, int rexmits);
|
|
|
|
void collect_set_sink(struct collect_conn *c, int should_be_sink);
|
|
|
|
int collect_depth(struct collect_conn *c);
|
|
|
|
#define COLLECT_MAX_DEPTH 255
|
|
|
|
#endif /* __COLLECT_H__ */
|
|
/** @} */
|
|
/** @} */
|