...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE transactions on dependable and secure computing >Security Games for Node Localization through Verifiable Multilateration
【24h】

Security Games for Node Localization through Verifiable Multilateration

机译：通过可验证的多边化进行节点本地化的安全游戏

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Most applications of wireless sensor networks (WSNs) rely on data about the positions of sensor nodes, which are not necessarily known beforehand. Several localization approaches have been proposed but most of them omit to consider that WSNs could be deployed in adversarial settings, where hostile nodes under the control of an attacker coexist with faithful ones. Verifiable multilateration (VM) was proposed to cope with this problem by leveraging on a set of trusted landmark nodes that act as verifiers. Although VM is able to recognize reliable localization measures, it allows for regions of undecided positions that can amount to the 40 percent of the monitored area. We studied the properties of VM as a noncooperative two-player game where the first player employs a number of verifiers to do VM computations and the second player controls a malicious node. The verifiers aim at securely localizing malicious nodes, while malicious nodes strive to masquerade as unknown and to pretend false positions. Thanks to game theory, the potentialities of VM are analyzed with the aim of improving the defender's strategy. We found that the best placement for verifiers is an equilateral triangle with edge equal to the power range $(R)$, and maximum deception in the undecided region is approximately $(0.27R)$. Moreover, we characterizedâin terms of the probability of choosing an unknown node to examine furtherâthe strategies of the players.
机译：无线传感器网络（WSN）的大多数应用都依赖于有关传感器节点位置的数据，这些数据不一定事先已知。已经提出了几种本地化方法，但是大多数方法都忽略了WSN可以部署在对抗环境中的情况，在这种环境中，受攻击者控制的敌对节点与忠实节点共存。通过利用一组充当验证者的受信任地标节点，提出了可验证多边（VM）来解决此问题。尽管VM能够识别可靠的本地化措施，但它允许未确定位置的区域占监视区域的40％。我们研究了VM作为非合作型两人游戏的性质，其中第一人使用许多验证程序来进行VM计算，第二人控制恶意节点。验证程序旨在安全地定位恶意节点，而恶意节点则力图伪装成未知节点并假装虚假位置。借助博弈论，分析了虚拟机的潜力，旨在改进防御者的策略。我们发现，验证者的最佳位置是等边三角形，其边缘等于幂范围$（R）$，并且未定区域中的最大欺骗效果约为$（0.27R）$。此外，我们根据选择未知节点进行进一步检查的可能性来表征玩家的策略。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号