Hi, following from a couple of previous forum discussions, I think this topic deserve a thread.
I’m re-reading the source for the message distribution algorithm
And - oh boy - I think there is a lot of room for improvement.
I’m trying to come up with and idea that works in more than one use case, for example hiking and long-range data transmission.
Also I think the algorithm for message distribution should be at the same time energy-aware and inherently robust to guarantee the delivery of the message.
The first idea that come to mind is to have two classes of nodes: moving and stationary.
Router nodes, highly requested in other threads, will be a subset of the stationary ones; for those nodes a couple of assumptions will be made: the energy consumption is ‘less’ of a problem, and their geographical position is not changing over time (duh).
Moving nodes will be assumed to have less energy available (being only battery-powered) and constantly moving, meaning that their access to other nodes is subject to change.
This categorization can be derived from GPS data, or user-defined in some other way.
As soon as I come up with a more complete idea I’ll update the thread!