New Rime module: unique anonymous best effort broadcast
This commit is contained in:
parent
8147f47aab
commit
accea52d88
3 changed files with 201 additions and 1 deletions
|
@ -1,5 +1,5 @@
|
|||
CONTIKI_SOURCEFILES += rimebuf.c queuebuf.c rimeaddr.c ctimer.c rime.c \
|
||||
ibc.c uc.c suc.c ruc.c sibc.c sabc.c abc.c nf.c \
|
||||
ibc.c uc.c suc.c ruc.c sibc.c sabc.c abc.c nf.c uabc.c \
|
||||
mesh.c route.c \
|
||||
tree.c neighbor.c \
|
||||
trickle.c
|
||||
|
|
118
core/net/rime/uabc.c
Normal file
118
core/net/rime/uabc.c
Normal file
|
@ -0,0 +1,118 @@
|
|||
/*
|
||||
* 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: uabc.c,v 1.1 2007/03/20 11:59:55 adamdunkels Exp $
|
||||
*/
|
||||
|
||||
/**
|
||||
* \file
|
||||
* Unique Anonymous best effort local area BroadCast (uabc)
|
||||
* \author
|
||||
* Adam Dunkels <adam@sics.se>
|
||||
*/
|
||||
|
||||
#include "net/rime.h"
|
||||
#include "net/rime/uabc.h"
|
||||
#include "lib/rand.h"
|
||||
|
||||
#include <string.h>
|
||||
|
||||
/*---------------------------------------------------------------------------*/
|
||||
static void
|
||||
recv(struct abc_conn *abc)
|
||||
{
|
||||
struct uabc_conn *c = (struct uabc_conn *)abc;
|
||||
if(c->q != NULL &&
|
||||
rimebuf_datalen() == queuebuf_datalen(c->q) &&
|
||||
memcmp(rimebuf_dataptr(), queuebuf_dataptr(c->q),
|
||||
rimebuf_datalen()) == 0) {
|
||||
/* We received a copy of our own packet, so we do not send out
|
||||
packet. */
|
||||
queuebuf_free(c->q);
|
||||
ctimer_stop(&c->t);
|
||||
if(c->cb->dropped) {
|
||||
c->cb->dropped(c);
|
||||
}
|
||||
}
|
||||
if(c->cb->recv) {
|
||||
c->cb->recv(c);
|
||||
}
|
||||
}
|
||||
/*---------------------------------------------------------------------------*/
|
||||
static void
|
||||
send(void *ptr)
|
||||
{
|
||||
struct uabc_conn *c = ptr;
|
||||
|
||||
if(c->q != NULL) {
|
||||
queuebuf_to_rimebuf(c->q);
|
||||
queuebuf_free(c->q);
|
||||
abc_send(&c->c);
|
||||
if(c->cb->sent) {
|
||||
c->cb->sent(c);
|
||||
}
|
||||
}
|
||||
}
|
||||
/*---------------------------------------------------------------------------*/
|
||||
static const struct abc_callbacks abc = { recv };
|
||||
/*---------------------------------------------------------------------------*/
|
||||
void
|
||||
uabc_open(struct uabc_conn *c, u16_t channel,
|
||||
const struct uabc_callbacks *cb)
|
||||
{
|
||||
abc_open(&c->c, channel, &abc);
|
||||
c->cb = cb;
|
||||
}
|
||||
/*---------------------------------------------------------------------------*/
|
||||
void
|
||||
uabc_close(struct uabc_conn *c)
|
||||
{
|
||||
abc_close(&c->c);
|
||||
ctimer_stop(&c->t);
|
||||
if(c->q != NULL) {
|
||||
queuebuf_free(c->q);
|
||||
}
|
||||
}
|
||||
/*---------------------------------------------------------------------------*/
|
||||
int
|
||||
uabc_send(struct uabc_conn *c, clock_time_t interval)
|
||||
{
|
||||
if(c->q != NULL) {
|
||||
/* If we are already about to send a packet, we cancel the old one. */
|
||||
queuebuf_free(c->q);
|
||||
}
|
||||
c->q = queuebuf_new_from_rimebuf();
|
||||
if(c->q != NULL) {
|
||||
ctimer_set(&c->t, rand() % interval, send, c);
|
||||
return 1;
|
||||
}
|
||||
return 0;
|
||||
}
|
||||
/*---------------------------------------------------------------------------*/
|
82
core/net/rime/uabc.h
Normal file
82
core/net/rime/uabc.h
Normal file
|
@ -0,0 +1,82 @@
|
|||
/**
|
||||
* \addtogroup rime
|
||||
* @{
|
||||
*/
|
||||
|
||||
/**
|
||||
* \defgroup uabc Unique Anonymous best effort local area BroadCast
|
||||
* @{
|
||||
*
|
||||
* Send one packet that is unique within a time interval.
|
||||
*
|
||||
*/
|
||||
|
||||
/*
|
||||
* 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: uabc.h,v 1.1 2007/03/20 11:59:55 adamdunkels Exp $
|
||||
*/
|
||||
|
||||
/**
|
||||
* \file
|
||||
* Header file for Unique Anonymous best effort local area BroadCast (uabc)
|
||||
* \author
|
||||
* Adam Dunkels <adam@sics.se>
|
||||
*/
|
||||
|
||||
#ifndef __UABC_H__
|
||||
#define __UABC_H__
|
||||
|
||||
#include "net/rime.h"
|
||||
|
||||
struct uabc_conn;
|
||||
|
||||
struct uabc_callbacks {
|
||||
void (* recv)(struct uabc_conn *c);
|
||||
void (* sent)(struct uabc_conn *c);
|
||||
void (* dropped)(struct uabc_conn *c);
|
||||
};
|
||||
|
||||
struct uabc_conn {
|
||||
struct abc_conn c;
|
||||
const struct uabc_callbacks *cb;
|
||||
struct ctimer t;
|
||||
struct queuebuf *q;
|
||||
};
|
||||
|
||||
void uabc_open(struct uabc_conn *c, u16_t channel,
|
||||
const struct uabc_callbacks *cb);
|
||||
void uabc_close(struct uabc_conn *c);
|
||||
int uabc_send(struct uabc_conn *c, clock_time_t interval);
|
||||
|
||||
#endif /* __UABC_H__ */
|
||||
|
||||
/** @} */
|
||||
/** @} */
|
Loading…
Reference in a new issue