7 * \defgroup rime The Rime communication stack
10 * The Rime communication stack provides a set of lightweight
11 * communication primitives ranging from best-effort anonymous local area
12 * broadcast to reliable network flooding.
14 * The protocols in the Rime stack are arranged in a layered fashion,
15 * where the more complex protocols are implemented using the less
18 * We have chosen the communication primitives in the Rime stack based
19 * on what typical sensor network protocols use. Applications or
20 * protocols running on top of the Rime stack attach at any layer of
21 * the stack and use any of the communication primitives.
23 * The Rime stack supports both single-hop and multi-hop communication
24 * primitives. The multi-hop primitives do not specify how packets are
25 * routed through the network. Instead, as the packet is sent across
26 * the network, the application or upper layer protocol is invoked at
27 * every node to choose the next-hop neighbor. This makes it possible
28 * to implement arbitrary routing protocols on top of the multi-hop
31 * Protocols or applications running on top of the Rime stack can
32 * implement additional protocols that are not in the Rime stack. If a
33 * protocol or application running on top of the Rime stack would need
34 * a communication primitive that is not currently in the Rime stack,
35 * the application or protocol can implement it directly on top of
36 * other communication primitive in the stack.
38 * For more information, see:
40 * Adam Dunkels, Fredrik Ă–sterlind, and Zhitao He. An adaptive
41 * communication architecture for wireless sensor networks. In
42 * Proceedings of the Fifth ACM Conference on Networked Embedded
43 * Sensor Systems (SenSys 2007), Sydney, Australia, November 2007.
45 * http://www.sics.se/~adam/dunkels07adaptive.pdf
46 * http://www.sics.se/~adam/slides/dunkels07adaptive.ppt