Contiki:Communication Architecture

Paper:An Adaptive communication Architecture for Wireless Sensor Nerworks

1.An architecture of WSN is difficult in the stack and a reasonable header packet.

2.The Chameleon architecture consists of two parts: the Rime communication stack and a set of packet transformation modules.

3.The Chameleion Architecture

The Chameleon Architecture

 

Two applications communicating using Rime.

4.The Rime stack provides a set of communication primitives, ranging from best-effort local neighbor broadcast and reliable local neighbor unicast, to best-effort network flooding and hop-by-hop reliable multi-hop unicast.

4.1 The protocol in the Rime stack are arranged in a layered fashion where the more complex protocols  are implemented using the less complex protocols.

The communication primitives in the Rime stack and how they are layered.

abc:the anonymous best-effort single-hop broadcast primitive is the most basic communication primitive in Rime.

ibc:The best-effort single-hop broadcast primitives sends packet to all lacals neighbors.

uc:The best-effort single-hop unicast primitive sends a packet to an identified single-hop neighbor.

suc:The stuborn single-hop unicast primitive repeatedly sends a packet to a single-hop nieghbor using the uc primitive.

While it's possible for applications and protocols that use Rime to use the stubborn single-hop unicast primitive directly the stuc primitive is primarily used by the reliable single-hop unicast(ruc) primitive

ruc:The reliable single-hop unicast primitive reliably sends a packet to a single-hop neighbor.

polite: The polite single-hop broadcast primitive is a generalization of the polite gossip form Tricket. The polite gossip algorithm is designed to reduce the total amount of packet transmissions by not repeating a message that others nodes have already sent.

ipolite: Identified polite single-hop broadcast works in the same way as the polite primitive but adds the identity of the sender as a packet attribute the use of ibc layer.

mh: The best-effort multi-hop unicast primitive sends a packet to an identified node in the network b using multihop forwarding at each node in the network.

rmh:The hop-by-hop reliable multi-hop unicast primitive is similar to the best-effort multi-hop unicast primitive except that it uses the reliable single-hop primitive for the communication between two single-hop neighbors.

nf:the best-effort network flooding primitive send a single-packet to all nodes in the network.

4.3 Cross-layer information Sharing

The communication primitive in the Rime stack use packet attributes to pass information between layers. One a packet attribute has been set, it's not removed as the stack processes the packet.

5.Header Transformation

The Chameleon header transformation modules produce the headers for outgoing packets before passing the packets to the MAC or link layer.

The header packing mechanism packs the packet attributes of outgoing packets into a packet header based on the packet attribute specification used on the channel

The default header unpacking mechanism does the reverse of the default packing mechanism: it pares incoming bit-packed headers and turns them into packet attributes before sending the incoming data and packet attributes to the Rime stack.

7.Network Protocols

7.1 Data Collection

 To implement the Data Collection protocol with Rime, we use two Rime primitives: the reliable multi-hop module primitive for sending messages  towards the sink, and the identified polite broadcast primitive for setting up the collection tree.

7.2 Data Dissemination

The multi-packet dissemination protocol uses the single-packet dissemination protocol to send the data. Negative acknowledgements and repair packets are sent with identified polite broadcast. The polite thus uses three logical channels: two fro the single packet dissemination protocol and one for the identified, polite broadcast.

7.3 Mesh Routing

The Rime implementation of the mesh routing protocol uses the network flooding primitive (nf) kto send route requests to the entire network and the best-effort multi-hop forwarding primitive(mh) to send multi-hop unicasts.

10.

The narrow waist should be placed between the network layer
and the link layer.

Network layer

     |

     |

Rime/Chameleon

     |

     |

MAC/Link layer