首页> 外文期刊>International Journal of Computers & Applications >An Improved Fruit Fly Optimization (IFFOA) based Cluster Head Selection Algorithm for Internet of Things
【24h】

An Improved Fruit Fly Optimization (IFFOA) based Cluster Head Selection Algorithm for Internet of Things

机译:基于果蝇优化(IFFOA)基于互联网的集群头选择算法

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

摘要

Efficient data broadcasting to nodes of the target is feasible due to the Internet of Things (IoT) which includes a battery priced at a small value and having a smaller size, along with nodes that are hinged with aggregate for sensing which consume a small amount of power. In technique related to routing an essential part is played by clustering such that power is conserved. At this context, transmitting of data that is organized by a dependable network, which is being sustained, one cluster head is being chosen. The concern that is crucial in loT, namely choosing a Cluster Head (CH) is focused at present work. CH is chosen based on energy that is of a residue in it, length of the path towards base-station, the node to node link for communicating as well as how farther it is to the vicinity. Network's longevity can be achieved formerly using optimizing. Now, Improved Fruit Fly Optimization Algorithm (IFFOA) is the proposal for choosing cluster-head. Scheme proposed indicates by results simulated that present analysis conserves power, lengthening the longevity of the network as well as doing choosing proper CH. The simulations are checked by looking at IFFOA with FCPSO, PSO, and LEACH.
机译:由于内容(物联网)(物联网)的互联网(IOT),所需的高效数据广播是可行的,其包括在小值下且具有较小尺寸的电池,以及具有铰接的骨料以供感测的节点,其消耗少量力量。在与路由相关的技术中,通过聚类来播放必要部分,使得功率是节省的。在此上下文中,选择由正在持续的可靠网络组织的数据,该数据正在被选中一个群集头。至关重要的关注,即选择群集头(CH)在目前的工作中重点。基于IT中的残留物的能量选择CH,基站站的路径的长度,节点用于通信的节点链路以及其到附近的更远。网络的寿命可以以前使用优化来实现。现在,改进的果蝇优化算法(IFFOA)是选择群集头的提案。提出的方案表明,结果模拟了当前分析节能,延长网络的寿命以及选择适当的CH。通过使用FCPSO,PSO和LEACH查看IFFOA来检查模拟。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号