An assault attack has many cases that we must keep in mind.
The network is set up and does not plan to add new hosts (just don't let anyone connect, but I think my limited understanding of ah hoc is probably pointless)
The network is set up and nodes are often added (they look like a regular computer, I think that the changes in the tables that they collect should indicate the establishment of a wormhole)
the wormhole is invisible and mirrors the other side of the network without changing packets at all, just copying them (in this case, you should use the time at which the packet falls on it, and this is a very "heavy resource")
There are no two parties on the network that have many or one.
I'm sure I missed other cases, but I think itβs best to explain what you are looking at.
I would think that if you have a network with a bridge, you can simply check that all packets are somehow sent to it.
The list you specified lists the prohibited routes. When they discover that they are created, they know that there is a wormhole. let's say that there is a node side on side A named D, and it should never reference Q in less than 4 jumps, which shows us a wormhole.
I think this is easier to answer if taken in parts and then embedded in one problem.
therefore, if you want to try to explain what you are looking for, and I will see that I can fix or code very badly. I think that finding a program that will be sim on the network will be nice, and then add a random wormhole and see what changes. logically we know the layout of the network, but we need a case that will always work and that is hard to find.
Perhaps there is a basic version that I'm looking at?
Dennis hayden
source share