Routing Protocol for Wireless Sensor Networks Using Swarm Intelligence-ACO with ECPSOA

J. Kumar, S. Tripathi, R. Tiwari
{"title":"Routing Protocol for Wireless Sensor Networks Using Swarm Intelligence-ACO with ECPSOA","authors":"J. Kumar, S. Tripathi, R. Tiwari","doi":"10.1109/ICIT.2016.018","DOIUrl":null,"url":null,"abstract":"In the wireless sensor networks(WSNs) with static and dynamic nodes, the movement of nodes or failure of sensor nodes may lead to the breakage of the existing routes. End-to-end delay, power consumption, and communication cost are some of the most important metrics in a wireless sensor networks when routing from a source to a destination. Recent approaches using the swarm intelligence (SI) technique proved that the local interaction of several simple agents to meet a global goal has a significant impact on WSNs routing. In this paper, a proposed routing algorithm that has an ant colony optimisation (ACO) algorithm with an endocrine cooperative particle swarm optimisation algorithm (ECPSOA) is used to improve the various metrics in WSNs routing. The ACO algorithm uses mobile agents as ants to identify the most feasible and best path in a network. Additionally, the ACO algorithm helps to locate paths between two nodes in a network. In the ECPSOA, finds the best solution for a particle's position and velocity, which can enhance the capacity of global search and improve the speed of convergence and accuracy of the algorithm. This routing algorithm has an improved performance when compared with the simple ACO algorithm in terms of delay, power consumption, and communication cost. Simulate with the help of network simulator OMNNET++, and analysis the result.","PeriodicalId":220153,"journal":{"name":"2016 International Conference on Information Technology (ICIT)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 International Conference on Information Technology (ICIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIT.2016.018","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

In the wireless sensor networks(WSNs) with static and dynamic nodes, the movement of nodes or failure of sensor nodes may lead to the breakage of the existing routes. End-to-end delay, power consumption, and communication cost are some of the most important metrics in a wireless sensor networks when routing from a source to a destination. Recent approaches using the swarm intelligence (SI) technique proved that the local interaction of several simple agents to meet a global goal has a significant impact on WSNs routing. In this paper, a proposed routing algorithm that has an ant colony optimisation (ACO) algorithm with an endocrine cooperative particle swarm optimisation algorithm (ECPSOA) is used to improve the various metrics in WSNs routing. The ACO algorithm uses mobile agents as ants to identify the most feasible and best path in a network. Additionally, the ACO algorithm helps to locate paths between two nodes in a network. In the ECPSOA, finds the best solution for a particle's position and velocity, which can enhance the capacity of global search and improve the speed of convergence and accuracy of the algorithm. This routing algorithm has an improved performance when compared with the simple ACO algorithm in terms of delay, power consumption, and communication cost. Simulate with the help of network simulator OMNNET++, and analysis the result.
基于群智能-蚁群算法的无线传感器网络路由协议
在具有静态和动态节点的无线传感器网络中,节点的移动或传感器节点的故障都可能导致现有路由的中断。端到端延迟、功耗和通信成本是无线传感器网络中从源路由到目的路由时最重要的指标。最近使用群体智能(SI)技术的方法证明了几个简单代理为实现全局目标而进行的局部交互对wsn路由有重要影响。本文提出了一种采用蚁群优化(ACO)算法和内分泌协同粒子群优化算法(ECPSOA)的路由算法来改进无线传感器网络路由中的各种指标。蚁群算法使用移动代理作为蚂蚁来识别网络中最可行和最佳的路径。此外,蚁群算法有助于定位网络中两个节点之间的路径。在ECPSOA中,寻找粒子位置和速度的最优解,增强了全局搜索能力,提高了算法的收敛速度和精度。与简单的蚁群算法相比,该算法在时延、功耗和通信开销等方面都有很大的提高。借助网络模拟器omnnet++进行仿真,并对结果进行分析。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信