虫洞攻击实施-传感器
我正在尝试为网络传感器实现虫洞攻击检测程序。我在互联网上查找了这方面的源代码，但没有找到。有谁知道在哪里可以找到虫洞传感器攻击（用于模拟目的）或虫洞检测的源代码？如果有的话，在哪里？它可以是任何编程语言。谢谢大家。
注意：我知道有一些带有伪代码的文档可以重新创建，但我想知道是否已经有源代码以节省我一些时间。如果没有，那么我将编码它。
编辑：我现在甚至会用伪代码来获取。
I am trying to implement a wormhole attack detection program for network sensors. I have looked around the internet for source code on this, but have found none. Does anyone know where to find source code for Wormhole sensor Attacks (for simulation purposes) or wormhole detection? If so, where?. It can be in any programming language. Thanks everyone.
Note: I know there are documents out there with Psuedocode on them that I can recreate, but I was wondering if there is source code already out there in order to save me some time. If not,then I'll code it.
Edit: I'll even take ones with Psuedocode right now.
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
发布评论
评论（3）
虫洞攻击有很多案例我们应该牢记在心。
网络已建立，并没有计划添加更多节点（简单，不要让任何东西连接，但我想以我对临时的有限理解，这可能毫无意义）
网络已设置并且节点经常添加（它们看起来像普通计算机，我认为它们收集的表发生了变化应该指向虫洞集向上）
虫洞不可见并镜像另一个网络一侧，根本不更改数据包，仅复制它们（在这种情况下，您必须使用数据包到达目标的时间，这非常“资源繁重”）
网络没有两侧，它有很多或一侧。
我肯定错过了其他案例，但我认为最好解释一下您的调查内容。
我认为，如果您有一个带有网桥的网络，您只需检查以确保所有数据包都以某种方式发送到它。
在您列出的论文中，他们列出了禁止路线。当他们发现虫洞被制造出来时，他们就知道有一个虫洞。假设 A 端有一个名为 D 的节点，并且它永远不应该在少于 4 跳的时间内链接到 Q，这向我们展示了虫洞。
我认为，如果将其分解为一个问题，那么这个问题会更容易回答。
因此，如果您想尝试解释您正在寻找的内容，我会看看我可以挖掘出什么或编写非常糟糕的代码。我认为找到一个可以模拟网络的程序会很好，然后添加一个随机虫洞并看看有什么变化。从逻辑上讲，我们知道网络的布局，但我们需要一个始终有效的案例，而这很难实现。
也许我忽略了一个基本情况？
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?
我会尝试找到任何可能有用的东西：
I'll try and find anything which might be useful:
看来你可以向这些学生询问他们的实施情况。 http://www.wings.cs.sunysb.edu/~ritesh/wormhole .html
It looks like you can ask these students for their implementation. http://www.wings.cs.sunysb.edu/~ritesh/wormhole.html