The wormhole attack has a lot of cases we should keep in mind.
The network is set up and has no plans to add anymore nodes (easy dont let anything connect but i guess with my limited understanding of ah hoc this maybe pointless)
The network is setup and nodes are added often (they look like a normal computer i think changes in the tables they collect should point to a wormhole set up)
the wormhole is not seen and mirrors the other side of the network with out changing the packets at all only copying them (in this case you have to use the time the packet gets to it's target and that is very "resource heavy")
The network does not have two sides it has many or one.
I am sure missed other cases but I think it maybe best to explain what your looking into.
I would think that if you have a network with a bridge you can just check to in sure all packets are somehow sent to it.
In the paper you have listed they list forbidden routes. When they find that one is made they know there is a wormhole. say that there is a node on A side named D and it should never link to Q in less then 4 hops that shows us a wormhole.
I think this is easier to answer if taken in parts then built in to one problem.
so if you want try to explain what you're looking for and i'll see what i can dig up or code very poorly. I think finding a program that will sim a network will be nice 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's hard to come by.
Maybe there is a base case I am over looking?