首页> 外文期刊>Wireless Networks >Potential position node placement approach via oppositional gravitational search for fulfill coverage and connectivity in target based wireless sensor networks
【24h】

Potential position node placement approach via oppositional gravitational search for fulfill coverage and connectivity in target based wireless sensor networks

机译:通过对立重力搜索的潜在位置节点放置方法,可在基于目标的无线传感器网络中实现覆盖和连接

获取原文
获取原文并翻译 | 示例
           

摘要

Wireless Sensor Network (WSN) has appeared as a powerful technological platform with tremendous and novel applications. Now-a-days, monitoring and target tracking are the most major application in WSNs. In target based WSN, coverage and connectivity are the two most important issues for definite data forwarding from every target to a remote base station. An NP entire issue is to find least number of potential or possible locations to set sensor nodes gratifying both coverage and connectivity from a given a group of target points. In this article, we propose an Oppositional Gravitational Search algorithm (OGSA) based approach to solve this problem. This approach helps that the sensor nodes are prone to failure, the proposed system provides l-coverage to all targets and n-connectivity to each sensor node. This OGSA based system is presented with agent representation, derivation of efficient fitness function along with the usual Gravitational Search algorithm operators. The approach is simulated broadly with various scenarios of Wireless Sensor Network. The experimentation results are compared with some relevant existing algorithms to demonstrate the efficiency of the proposed approach.
机译:无线传感器网络(WSN)已成为具有众多新颖应用程序的强大技术平台。如今,监视和目标跟踪是WSN中最主要的应用。在基于目标的WSN中,覆盖范围和连通性是从每个目标到远程基站的确定数据转发的两个最重要的问题。 NP的整个问题是找到最少数量的潜在或可能位置来设置传感器节点,从而满足给定一组目标点的覆盖范围和连通性。在本文中,我们提出了一种基于对立引力搜索算法(OGSA)的方法来解决此问题。这种方法有助于使传感器节点容易出现故障,所提出的系统为所有目标提供l覆盖,并为每个传感器节点提供n连接。该基于OGSA的系统具有代理表示,有效适应度函数的推导以及常用的引力搜索算法运算符。该方法在无线传感器网络的各种情况下得到了广泛的仿真。将实验结果与一些相关的现有算法进行比较,以证明该方法的有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号