Route classification scheme based on covering rough set approach in mobile ad hoc network (CRS-MANET)

IF 0.8 Q4 ROBOTICS
T. Sudhakar, H. Inbarani, S. S. Kumar
{"title":"Route classification scheme based on covering rough set approach in mobile ad hoc network (CRS-MANET)","authors":"T. Sudhakar, H. Inbarani, S. S. Kumar","doi":"10.1108/ijius-08-2019-0046","DOIUrl":null,"url":null,"abstract":"\nPurpose\nThe purpose of this paper is to obtain correctly classified routes based on their parameters.\n\n\nDesign/methodology/approach\nIn this paper, a covering rough set (CRS) approach is proposed for route classification in wireless ad hoc networks. In a wireless network, mobile nodes are deployed randomly in a simulation region. This work addresses the problem of route classification.\n\n\nFindings\nThe network parameters such as bandwidth, delay, packet byte rate and packet loss rate changes due to the frequent mobility of nodes lead to uncertainty in wireless networks. This type of uncertainty can be very well handled using a rough set concept. An ultimate aim of classification is to correctly predict the decision class for each instance in the data.\n\n\nOriginality/value\nThe traditional classification algorithms, named K-nearest neighbor, J48, general rough set theory, naive Bayes, JRIP and multilayer perceptron, are used in this work for comparison and for the proposed CRS based on route classification approach revealing better accuracy than traditional classification algorithms.\n","PeriodicalId":42876,"journal":{"name":"International Journal of Intelligent Unmanned Systems","volume":" ","pages":""},"PeriodicalIF":0.8000,"publicationDate":"2019-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1108/ijius-08-2019-0046","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Intelligent Unmanned Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1108/ijius-08-2019-0046","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ROBOTICS","Score":null,"Total":0}
引用次数: 5

Abstract

Purpose The purpose of this paper is to obtain correctly classified routes based on their parameters. Design/methodology/approach In this paper, a covering rough set (CRS) approach is proposed for route classification in wireless ad hoc networks. In a wireless network, mobile nodes are deployed randomly in a simulation region. This work addresses the problem of route classification. Findings The network parameters such as bandwidth, delay, packet byte rate and packet loss rate changes due to the frequent mobility of nodes lead to uncertainty in wireless networks. This type of uncertainty can be very well handled using a rough set concept. An ultimate aim of classification is to correctly predict the decision class for each instance in the data. Originality/value The traditional classification algorithms, named K-nearest neighbor, J48, general rough set theory, naive Bayes, JRIP and multilayer perceptron, are used in this work for comparison and for the proposed CRS based on route classification approach revealing better accuracy than traditional classification algorithms.
基于覆盖粗糙集方法的移动自组织网络路由分类方案
目的本文的目的是根据路线的参数获得正确分类的路线。设计/方法论/方法本文提出了一种用于无线自组织网络路由分类的覆盖粗糙集(CRS)方法。在无线网络中,移动节点被随机部署在模拟区域中。这项工作解决了路线分类的问题。发现由于节点的频繁移动,网络参数如带宽、延迟、数据包字节率和丢包率的变化导致了无线网络的不确定性。使用粗糙集概念可以很好地处理这种类型的不确定性。分类的最终目的是正确预测数据中每个实例的决策类别。独创性/价值本文使用了传统的分类算法,即K-近邻、J48、通用粗糙集理论、朴素贝叶斯、JRIP和多层感知器进行比较,并提出了基于路径分类的CRS方法,该方法比传统分类算法具有更好的准确性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
3.50
自引率
0.00%
发文量
21
×
引用
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学术官方微信