Low Powered Mesh Network stack
From Embedded Systems Learning Academy
Revision as of 20:14, 27 July 2013 by Preet (talk | contribs) (Created page with "This article is '''under construction''', but it shows the design of low-powered mesh network. == Features == * Addressed network with auto-retries, and auto-acknowledge * ...")
This article is under construction, but it shows the design of low-powered mesh network.
Features
- Addressed network with auto-retries, and auto-acknowledge
- Minimal RAM/ROM footprint, with NO HEAP usage
- Each node can participate in the mesh network to deliver packets to a destined node.
- Each packet may dictates maximum hops it can take.
Detailed Features
- Each packet sent can use existing route, and if route has changed, a new route is automatically discovered using a special retry packet.
- Each node's ACK contains some piggy-back data about the node itself.
- This data includes information about its routing table, and other statistics
- Duplicate packets are absorbed but an ACK is still replied if its a duplicate, but a retry packet.
- An ACK packet or a response to an ACK all use retries; even the repeating nodes participate to make sure the packet is delivered.
Payload
The minimum payload is 9 bytes, of which, 8 bytes will be the mesh header overhead. The higher the payload, the higher the efficiency of the network. The eight bytes of payload header contains the network source and destination information, along with packet type and hop count information.
Example Mesh Network
TODO
