Contiki-Inga 3.x
Main Page
Related Pages
Modules
Data Structures
Files
Examples
File List
Globals
core
net
rime
polite.h
Go to the documentation of this file.
1
/**
2
* \addtogroup rime
3
* @{
4
*/
5
6
/**
7
* \defgroup rimepolite Polite anonymous best effort local broadcast
8
* @{
9
*
10
* The polite module sends one local area broadcast packet within one
11
* time interval. If a packet with the same header is received from a
12
* neighbor within the interval, the packet is not sent.
13
*
14
* The polite primitive is a generalization of the polite gossip
15
* algorithm from Trickle (Levis et al, NSDI 2004). The polite gossip
16
* algorithm is designed to reduce the total amount of packet
17
* transmissions by not repeating a message that other nodes have
18
* already sent. The purpose of the polite broadcast primitive is to
19
* avoid that multiple copies of a specific set of packet attributes
20
* is sent on a specified logical channel in the local neighborhood
21
* during a time interval.
22
*
23
* The polite broadcast primitive is useful for implementing broadcast
24
* protocols that use, e.g., negative acknowledgements. If many nodes
25
* need to send the negative acknowledgement to a sender, it is enough
26
* if only a single message is delivered to the sender.
27
*
28
* The upper layer protocol or application that uses the polite
29
* broadcast primitive provides an interval time, and message along
30
* with a list of packet attributes for which multiple copies should
31
* be avoided. The polite broadcast primitive stores the outgoing
32
* message in a queue buffer, stores the list of packet attributes,
33
* and sets up a timer. The timer is set to a random time during the
34
* second half of the interval time.
35
*
36
* During the first half of the time interval, the sender listens for
37
* other transmissions. If it hears a packet that matches the
38
* attributes provided by the upper layer protocol or application, the
39
* sender drops the packet. The send timer has been set to a random
40
* time some time during the second half of the interval. When the
41
* timer fires, and the sender has not yet heard a transmission of the
42
* same packet attributes, the sender broadcasts its packet to all its
43
* neighbors.
44
*
45
* The polite broadcast module does not add any packet attributes to
46
* outgoing packets apart from those added by the upper layer.
47
*
48
* \section channels Channels
49
*
50
* The polite module uses 1 channel.
51
*
52
*/
53
54
/*
55
* Copyright (c) 2007, Swedish Institute of Computer Science.
56
* All rights reserved.
57
*
58
* Redistribution and use in source and binary forms, with or without
59
* modification, are permitted provided that the following conditions
60
* are met:
61
* 1. Redistributions of source code must retain the above copyright
62
* notice, this list of conditions and the following disclaimer.
63
* 2. Redistributions in binary form must reproduce the above copyright
64
* notice, this list of conditions and the following disclaimer in the
65
* documentation and/or other materials provided with the distribution.
66
* 3. Neither the name of the Institute nor the names of its contributors
67
* may be used to endorse or promote products derived from this software
68
* without specific prior written permission.
69
*
70
* THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
71
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
72
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
73
* ARE DISCLAIMED. IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
74
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
75
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
76
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
77
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
78
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
79
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
80
* SUCH DAMAGE.
81
*
82
* This file is part of the Contiki operating system.
83
*
84
*/
85
86
/**
87
* \file
88
* Header file for Polite Anonymous best effort local Broadcast (polite)
89
* \author
90
* Adam Dunkels <adam@sics.se>
91
*/
92
93
#ifndef POLITE_H_
94
#define POLITE_H_
95
96
#include "
net/rime/abc.h
"
97
#include "
net/queuebuf.h
"
98
#include "
sys/ctimer.h
"
99
100
struct
polite_conn
;
101
102
#define POLITE_ATTRIBUTES ABC_ATTRIBUTES
103
104
/**
105
* \brief A structure with callback functions for a polite connection.
106
*
107
* This structure holds a list of callback functions used
108
* a a polite connection. The functions are called when
109
* events occur on the connection.
110
*
111
*/
112
struct
polite_callbacks
{
113
/**
114
* Called when a packet is received on the connection.
115
*/
116
void (*
recv
)(
struct
polite_conn
*c);
117
118
/**
119
* Called when a packet is sent on the connection.
120
*/
121
void (*
sent
)(
struct
polite_conn
*c);
122
123
/**
124
* Called when a packet is dropped because a packet was heard from a
125
* neighbor.
126
*/
127
void (*
dropped
)(
struct
polite_conn
*c);
128
};
129
130
/**
131
* An opaque structure with no user-visible elements that holds the
132
* state of a polite connection,
133
*/
134
struct
polite_conn
{
135
struct
abc_conn c;
136
const
struct
polite_callbacks
*cb;
137
struct
ctimer t;
138
struct
queuebuf *q;
139
uint8_t hdrsize;
140
};
141
142
/**
143
* \brief Open a polite connection
144
* \param c A pointer to a struct polite_conn.
145
* \param channel The channel number to be used for this connection
146
* \param cb A pointer to the callbacks used for this connection
147
*
148
* This function opens a polite connection on the
149
* specified channel. The callbacks are called when a
150
* packet is received, or when another event occurs on the
151
* connection (see \ref "struct polite_callbacks").
152
*/
153
void
polite_open
(
struct
polite_conn
*c, uint16_t channel,
154
const
struct
polite_callbacks
*cb);
155
156
/**
157
* \brief Close a polite connection
158
* \param c A pointer to a struct polite_conn that has previously been opened with polite_open().
159
*
160
* This function closes a polite connection that has
161
* previously been opened with polite_open().
162
*/
163
void
polite_close
(
struct
polite_conn
*c);
164
165
166
/**
167
* \brief Send a packet on a polite connection.
168
* \param c A pointer to a struct polite_conn that has previously been opened with polite_open().
169
* \param interval The timer interval in which the packet should be sent.
170
* \param hdrsize The size of the header that should be unique within the time interval.
171
*
172
* This function sends a packet from the packetbuf on the
173
* polite connection. The packet is sent some time during
174
* the time interval, but only if no other packet is
175
* received with the same header.
176
*
177
*/
178
int
polite_send
(
struct
polite_conn
*c, clock_time_t interval, uint8_t hdrsize);
179
180
/**
181
* \brief Cancel a pending packet
182
* \param c A pointer to a struct polite_conn that has previously been opened with polite_open().
183
*
184
* This function cancels a pending transmission that has
185
* previously been started with polite_send().
186
*/
187
void
polite_cancel
(
struct
polite_conn
*c);
188
189
#endif
/* POLITE_H_ */
190
191
/** @} */
192
/** @} */
Generated on Thu Apr 24 2014 16:26:12 for Contiki-Inga 3.x by
1.8.3.1