Mesh-networking Alternatives

Similar projects and alternatives to mesh-networking

yggdrasil-go

23 3,331 8.5 Go mesh-networking VS yggdrasil-go

An experiment in scalable routing as an encrypted IPv6 overlay network
PJON

20 2,718 0.0 C++ mesh-networking VS PJON

PJON (Padded Jittering Operative Network) is an experimental, arduino-compatible, multi-master, multi-media network protocol.
SurveyJS

surveyjs.io sponsored

Open-Source JSON Form Builder to Create Dynamic Forms Right in Your App. With SurveyJS form UI libraries, you can build and style forms in a fully-integrated drag & drop form builder, render them in your JS app, and store form submission data in any backend, inc. PHP, ASP.NET Core, and Node.js.

NOTE: The number of mentions on this list indicates mentions on common posts plus user suggested alternatives. Hence, a higher number means a better mesh-networking alternative or higher similarity.

Suggest an alternative to mesh-networking

mesh-networking reviews and mentions

Posts with mentions or reviews of mesh-networking. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2021-03-07.

What Happens Inside a 100-Hop IPv6 Wireless Mesh Network?
3 projects | news.ycombinator.com | 7 Mar 2021

Heh walked a similar path a few years ago. Wanted to get started developing a mesh network routing algorithm that could handle a hundred hops, got distracted and built a mesh networking test harness / simulation system instead (https://github.com/pirate/mesh-networking).
Never got around to finishing a full routing algorithm, though we did have a lot of fun testing wacky network topologies and protocols that solved subsets of the problem.
The closest we came was designing a 2 or 3 tiered system, where nodes self-arrange into clusters of up to 256 nodes with one elected leader to coordinate. The routing table is replicated on all nodes (eventually consistent), but the leader handles all changes. Then there's Layer 2 routing between clusters with a similar leader election system to handle inter-cluster routing.
We tried to figure out a way to make the routing stateless, (e.g. by encoding a node's position in the graph in its id, sort of like a phone number has a country code, then area code, etc.), but stopped working on it before figuring out a good approach for broadcasting ID changes without flooding the network with broadcast traffic beyond small network sizes.
Nowadays there are established mesh routing algorithms that solve all these problems (like B.A.T.M.A.N., 802.11s, or even BGP), but it's still a really exciting field that I dream of working in professionally someday.
https://www.open-mesh.org/projects/open-mesh/wiki