mirror of
https://github.com/meshtastic/meshtastic.git
synced 2025-01-28 14:21:34 -08:00
Route plot image as preview
This commit is contained in:
parent
34468562c1
commit
0a1e2ce00b
|
@ -6,7 +6,7 @@ authors: [thebentern, GUVWAF]
|
|||
tags: [meshtastic, technical]
|
||||
date: 2024-08-18T12:00
|
||||
hide_table_of_contents: false
|
||||
image: "/design/web/social-preview-1200x630.png"
|
||||
image: "/static/img/blog/route_plot.png"
|
||||
---
|
||||
|
||||
Designing a low-bandwidth wireless mesh network to run on low-power microprocessors with limited memory is challenging. Arguably the simplest mesh routing protocol is Flood Routing: each radio receiving a packet will rebroadcast this again, up to a certain hop limit. Although Meshtastic is based on this strategy, there are a few subtle, but significant enhancements. Most importantly, before a node rebroadcasts, it waits a short while and listens if anyone else is rebroadcasting already. If so, it won’t rebroadcast again. Therefore, “Managed Flood Routing” would be a better name. For more details on the enhancements, please review our [documentation](https://meshtastic.org/docs/overview/mesh-algo/).
|
||||
|
|
Loading…
Reference in a new issue