I'm having trouble finding information on the topic I'm interested in, and maybe my problem is just how I'm wording things.
So, let's say I have a repeater-based communication system, where one node in the system receives a message, and then passes it along to the next node.
For this example, let's say we have nodes 1, 2, 3, 4, 5, and 6. Also let's assume nodes can always receive the message from their neighbors, but may or may not receive it from further nodes. (ex. 3 will always receive from 2 and 4, and it might receive it from 6)
I'm wanting to find some information on different wants to determine the path.
For instance, i can always assume the path is fixed, where the message goes from Node 1 to 2, 2 to 3, etc. so the path would be 1-2-3-4-5-6. By doing this, the message only needs to contain the node number of the node sending the message
But what if I want to send the path that I want the message to go through, with the smallest amount of data possible? For instance I might want one message to go through the path 1-2-5-6, and another message to go through the path 1-5-2-3-6.
My thoughts to do this is to use a lookup table that is saved on all nodes, but the problem arises when I have a lot of nodes. If I have 100+ nodes, my table is huge and therefore the data I send to associate the path to the table gets large.
Could anyone point me to the right direction to even look at this subject matter?