A Cognitive Based Channel Assortment Using Ant-Colony Optimized Stable Path Selection in an IoTN

N. Kumar, G. Bala
{"title":"A Cognitive Based Channel Assortment Using Ant-Colony Optimized Stable Path Selection in an IoTN","authors":"N. Kumar, G. Bala","doi":"10.1109/ICDCS48716.2020.243536","DOIUrl":null,"url":null,"abstract":"Routing protocols have ability to discover and maintain routes in the network. However, the efficiency of designed routing protocol depends on the node capability and application requirement. IoTN (Internet of Things Network) is being adopted into real time applications such as finding shortest path to reach destination, traffic management, rerouting path based on weather conditions, happy home architectures, weather systems and so on. Despite enormous applications of IoTN, the battery life and energy efficiency are limited to fulfil applications in IoTN. Hence the selected features for the proposed algorithm contribute towards optimizing the path to select best and least distance path to destination using ant-based system. Proposed Ant-colony optimized stable path (AOSP) selection algorithm focus on network selection stages like Selection of acquaintances, channel decisions and Energy management. Sensors can communicate with target BS (Base station) to forward or relay the data efficiently to reach server. The optimal intermediate sensors can act as cluster head and collect information from group of sensors with minimal energy spent which increase the throughput and decrease the packet dropping ratio.","PeriodicalId":6300,"journal":{"name":"2012 IEEE 32nd International Conference on Distributed Computing Systems","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2020-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE 32nd International Conference on Distributed Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCS48716.2020.243536","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Routing protocols have ability to discover and maintain routes in the network. However, the efficiency of designed routing protocol depends on the node capability and application requirement. IoTN (Internet of Things Network) is being adopted into real time applications such as finding shortest path to reach destination, traffic management, rerouting path based on weather conditions, happy home architectures, weather systems and so on. Despite enormous applications of IoTN, the battery life and energy efficiency are limited to fulfil applications in IoTN. Hence the selected features for the proposed algorithm contribute towards optimizing the path to select best and least distance path to destination using ant-based system. Proposed Ant-colony optimized stable path (AOSP) selection algorithm focus on network selection stages like Selection of acquaintances, channel decisions and Energy management. Sensors can communicate with target BS (Base station) to forward or relay the data efficiently to reach server. The optimal intermediate sensors can act as cluster head and collect information from group of sensors with minimal energy spent which increase the throughput and decrease the packet dropping ratio.
一种基于认知的基于蚁群优化稳定路径选择的通道分类方法
路由协议具有发现和维护网络中的路由的能力。然而,所设计的路由协议的效率取决于节点的能力和应用需求。物联网(IoTN)正在被应用于实时应用中,如寻找到达目的地的最短路径、交通管理、根据天气状况重新路由路径、幸福家庭架构、天气系统等。尽管IoTN的应用非常广泛,但电池寿命和能源效率有限,无法满足IoTN的应用。因此,该算法所选择的特征有助于利用基于蚁群的系统对路径进行优化,以选择到目的地的最佳和最小距离路径。提出的蚁群优化稳定路径(AOSP)选择算法主要关注熟人选择、渠道决策和能量管理等网络选择阶段。传感器可以与目标基站通信,有效地转发或中继数据到达服务器。最优的中间传感器可以作为簇头,以最小的能量从一组传感器中收集信息,从而提高了吞吐量,降低了丢包率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信