首页> 外文会议>American Applied Science Research Institute Conference on Parallel and Distributed Computing and Systems >Co-SRL: A Convex Optimization Algorithm for Anchor Localization in Wireless Sensor Networks
【24h】

Co-SRL: A Convex Optimization Algorithm for Anchor Localization in Wireless Sensor Networks

机译:CO-SRL:无线传感器网络中锚定本地化的凸优化算法

获取原文

摘要

This paper proposed a Convex Optimization method which is called Co-SRL and is used to localize sensor location in Wireless Sensor Networks.Co-SRL can be used to help the node to localize a friendnode or mobile node using anchors. In Co-SRL, convex optimization algorithm is used forme estimationof malicious nodeposition.Simulation result shows that Co-SRL is both secure and robust, in an environment without colluding, Co-SRLcan identify more than half of the malicious nodes; and in an environment with colluding, no more than 15% of malicious nodescan escape from the identification of our methods.
机译:本文提出了一种被称为CO-SRL的凸优化方法,用于本地化无线传感器网络中的传感器位置。可用于帮助节点使用锚点本地化FriendNode或移动节点。 在CO-SRL中,使用凸优化算法Forme估计恶意Nodeposition.Simulation结果表明,CO-SRL既安全且强大,在没有勾结的环境中,CO-SRLCAN标识超过一半的恶意节点; 在勾结的环境中,不超过15%的恶意Nodescan逃离我们的方法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号