首页> 外文会议>IEEE Annual Consumer Communications and Networking Conference >Optimal New Node Insertion for Strong Minimum Energy Topology in IoT Networks
【24h】

Optimal New Node Insertion for Strong Minimum Energy Topology in IoT Networks

机译:最佳新节点插入IOT网络中的强度最小能量拓扑

获取原文
获取外文期刊封面目录资料

摘要

To provide seamless services by low powered small devices having stringent energy constraint in Internet of Things (IoT) networks, it is highly sought over the past few decades to design a competent energy-aware network. In that sense, thereof, the strong minimum energy topology (SMET) is investigated in the existing works to minimize the total power consumption while maintaining the strong connectivity between any pair of nodes (small IoT devices) in the network consisting only bidirectional links. Nevertheless, to significantly improve it, in this paper, we further explore the SMET with respect to insertion of a new node among the existing nodes which is defined as node insertion problem (NIP) for SMET (NIP-SMET). It has been proved that the NIP-SMET is NP-complete, therefore, we propose a heuristic based on Prim-incremental power greedy heuristic to solve it in polynomial time. Also, analytically, it has been shown that the NIP-SMET can provide significant energy-aware improvement over SMET. Via obtained numerical results, we find that the proposed heuristic can reduce the total power dissipation by 50% against the existing heuristic for SMET.
机译:为了提供无缝服务,通过低功耗的小型设备在内容网络(IOT)网络中具有严格的能量限制,在过去的几十年中受到了高度追捧,以设计一个能源感知网络。从这种意义上讲,在现有的作品中研究了强的最小能量拓扑(SMET),以最小化总功耗,同时保持仅在网络中的任何一对节点(小型设备设备)之间的强连接,仅包括双向链路。然而,为了显着改进它,在本文中,我们进一步探索了在现有节点中插入新节点的SMET,其被定义为SMET(NIP-SMET)的节点插入问题(NIP)。有人证明,尼普斯 - SMET是NP-Trice,因此,我们提出了一种基于Prim-uplental Power Greedy Heuuristic来解决多项式时间的启发式。另外,在分析上,已经表明辊隙SMET可以提供对SMET的显着能量感知的改进。通过获得的数值结果,我们发现拟议的启发式可以将总功率耗散降低50%,以防止现有的机启发式。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号