2007-03-22 18:33:15 +01:00
|
|
|
/*
|
|
|
|
* Copyright (c) 2006, 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
|
2007-03-31 20:31:27 +02:00
|
|
|
* Multihop forwarding header file
|
2007-03-22 18:33:15 +01:00
|
|
|
* \author
|
|
|
|
* Adam Dunkels <adam@sics.se>
|
|
|
|
*/
|
|
|
|
|
2014-11-08 01:15:42 +01:00
|
|
|
/**
|
|
|
|
* \addtogroup rime
|
|
|
|
* @{
|
|
|
|
*/
|
|
|
|
|
|
|
|
/**
|
|
|
|
* \defgroup rimemultihop Best-effort multihop forwarding
|
|
|
|
* @{
|
|
|
|
*
|
|
|
|
* The multihop module implements a multihop forwarding mechanism. Routes
|
|
|
|
* must have already been setup with the route_add() function. Setting
|
|
|
|
* up routes is done with another Rime module such as the \ref
|
|
|
|
* routediscovery "route-discovery module".
|
|
|
|
*
|
|
|
|
* The multihop sends a packet to an identified node in the network by
|
|
|
|
* using multi-hop forwarding at each node in the network. The
|
|
|
|
* application or protocol that uses the multihop primitive supplies a
|
|
|
|
* routing function for selecting the next-hop neighbor. If the
|
|
|
|
* multihop primitive is requested to send a packet for which no
|
|
|
|
* suitable next hop neighbor is found, the caller is immediately
|
|
|
|
* notified of this and may choose to initiate a route discovery
|
|
|
|
* process.
|
|
|
|
*
|
|
|
|
*
|
2015-02-15 16:31:28 +01:00
|
|
|
* \section multihop-channels Channels
|
2014-11-08 01:15:42 +01:00
|
|
|
*
|
|
|
|
* The multihop module uses 1 channel.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
2013-11-24 16:57:08 +01:00
|
|
|
#ifndef MULTIHOP_H_
|
|
|
|
#define MULTIHOP_H_
|
2007-03-22 18:33:15 +01:00
|
|
|
|
2008-06-26 13:19:22 +02:00
|
|
|
#include "net/rime/unicast.h"
|
2013-12-12 23:58:52 +01:00
|
|
|
#include "net/linkaddr.h"
|
2007-03-22 18:33:15 +01:00
|
|
|
|
2008-07-04 00:36:02 +02:00
|
|
|
struct multihop_conn;
|
2007-03-22 18:33:15 +01:00
|
|
|
|
2009-03-12 22:58:20 +01:00
|
|
|
#define MULTIHOP_ATTRIBUTES { PACKETBUF_ADDR_ESENDER, PACKETBUF_ADDRSIZE }, \
|
|
|
|
{ PACKETBUF_ADDR_ERECEIVER, PACKETBUF_ADDRSIZE }, \
|
2009-03-23 17:20:37 +01:00
|
|
|
{ PACKETBUF_ATTR_HOPS, PACKETBUF_ATTR_BIT * 5 }, \
|
2009-01-15 23:15:51 +01:00
|
|
|
UNICAST_ATTRIBUTES
|
|
|
|
|
|
|
|
|
|
|
|
|
2008-07-04 00:36:02 +02:00
|
|
|
struct multihop_callbacks {
|
|
|
|
void (* recv)(struct multihop_conn *ptr,
|
2013-12-12 23:58:52 +01:00
|
|
|
const linkaddr_t *sender,
|
|
|
|
const linkaddr_t *prevhop,
|
2008-02-24 23:05:27 +01:00
|
|
|
uint8_t hops);
|
2013-12-12 23:58:52 +01:00
|
|
|
linkaddr_t *(* forward)(struct multihop_conn *ptr,
|
|
|
|
const linkaddr_t *originator,
|
|
|
|
const linkaddr_t *dest,
|
|
|
|
const linkaddr_t *prevhop,
|
2008-02-24 23:05:27 +01:00
|
|
|
uint8_t hops);
|
2007-03-22 18:33:15 +01:00
|
|
|
};
|
|
|
|
|
2008-07-04 00:36:02 +02:00
|
|
|
struct multihop_conn {
|
2008-06-26 13:19:22 +02:00
|
|
|
struct unicast_conn c;
|
2008-07-04 00:36:02 +02:00
|
|
|
const struct multihop_callbacks *cb;
|
2007-03-22 18:33:15 +01:00
|
|
|
};
|
|
|
|
|
2008-07-04 00:36:02 +02:00
|
|
|
void multihop_open(struct multihop_conn *c, uint16_t channel,
|
|
|
|
const struct multihop_callbacks *u);
|
|
|
|
void multihop_close(struct multihop_conn *c);
|
2013-12-12 23:58:52 +01:00
|
|
|
int multihop_send(struct multihop_conn *c, const linkaddr_t *to);
|
|
|
|
void multihop_resend(struct multihop_conn *c, const linkaddr_t *nexthop);
|
2007-03-22 18:33:15 +01:00
|
|
|
|
2013-11-24 16:57:08 +01:00
|
|
|
#endif /* MULTIHOP_H_ */
|
2007-03-31 20:31:27 +02:00
|
|
|
/** @} */
|
|
|
|
/** @} */
|