During the route discovery process, a node ends up finding at least one “neighbor” – with whom the node will pass the message to. These routes are maintained, so there is knowledge (somewhere) of who an individual node’s neighbors are.
Is it possible to gain access to this list of neighbors / routes? How can I discover which nodes are considered to be “one-hop” away from me?
The reason for my interest in this information is that I need to perform synchronization between nodes and need to know that the maximum time required for a message to be exchange will be bounded by the unicast one hop time.