基于信任的延迟感知移动自组网(MANET)集群服务发现方案

Q4 Computer Science
Prabu B., G. Jagatheeshkumar
{"title":"基于信任的延迟感知移动自组网(MANET)集群服务发现方案","authors":"Prabu B., G. Jagatheeshkumar","doi":"10.22247/ijcna/2023/223425","DOIUrl":null,"url":null,"abstract":"– Service discovery is one of the most difficult aspects of MANETs. The primary concern is the assignment of the optimal service to the service requester. This work intends to address this issue by proposing a clustered trustworthy service discovery scheme. The Cluster Head (CH) node selection and recycling, 𝑺𝑬𝑹𝑽 𝑨𝑫 , request, response and service ranking are the crucial phases of this work. The CH node is chosen by considering the trust parameters like mobility, energy and number of neighbors. The selected CH node calculates the level of trust for each of its member nodes by employing trust criteria such as energy consumption, packet forwarding ratio, and node behavior. The node responsible for requesting services delivers the 𝑺𝑬𝑹𝑽 𝑹𝒆𝒒 packet to the CH node, which thereafter searches its local memory for the corresponding service. Finally, the matching services are evaluated based on the distance of the service, the level of trust and the workload of the service provider. As significant metrics are considered for recommending service, the service requester is assured with reliable and faster service provisioning, which is proven by the experimental results.","PeriodicalId":36485,"journal":{"name":"International Journal of Computer Networks and Applications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Delay Aware Clustered Service Discovery Scheme Based on Trust for Mobile Ad Hoc Networks (MANET)\",\"authors\":\"Prabu B., G. Jagatheeshkumar\",\"doi\":\"10.22247/ijcna/2023/223425\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"– Service discovery is one of the most difficult aspects of MANETs. The primary concern is the assignment of the optimal service to the service requester. This work intends to address this issue by proposing a clustered trustworthy service discovery scheme. The Cluster Head (CH) node selection and recycling, 𝑺𝑬𝑹𝑽 𝑨𝑫 , request, response and service ranking are the crucial phases of this work. The CH node is chosen by considering the trust parameters like mobility, energy and number of neighbors. The selected CH node calculates the level of trust for each of its member nodes by employing trust criteria such as energy consumption, packet forwarding ratio, and node behavior. The node responsible for requesting services delivers the 𝑺𝑬𝑹𝑽 𝑹𝒆𝒒 packet to the CH node, which thereafter searches its local memory for the corresponding service. Finally, the matching services are evaluated based on the distance of the service, the level of trust and the workload of the service provider. As significant metrics are considered for recommending service, the service requester is assured with reliable and faster service provisioning, which is proven by the experimental results.\",\"PeriodicalId\":36485,\"journal\":{\"name\":\"International Journal of Computer Networks and Applications\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Computer Networks and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.22247/ijcna/2023/223425\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Computer Science\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computer Networks and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22247/ijcna/2023/223425","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Computer Science","Score":null,"Total":0}
引用次数: 0

摘要

本文章由计算机程序翻译,如有差异,请以英文原文为准。
Delay Aware Clustered Service Discovery Scheme Based on Trust for Mobile Ad Hoc Networks (MANET)
– Service discovery is one of the most difficult aspects of MANETs. The primary concern is the assignment of the optimal service to the service requester. This work intends to address this issue by proposing a clustered trustworthy service discovery scheme. The Cluster Head (CH) node selection and recycling, 𝑺𝑬𝑹𝑽 𝑨𝑫 , request, response and service ranking are the crucial phases of this work. The CH node is chosen by considering the trust parameters like mobility, energy and number of neighbors. The selected CH node calculates the level of trust for each of its member nodes by employing trust criteria such as energy consumption, packet forwarding ratio, and node behavior. The node responsible for requesting services delivers the 𝑺𝑬𝑹𝑽 𝑹𝒆𝒒 packet to the CH node, which thereafter searches its local memory for the corresponding service. Finally, the matching services are evaluated based on the distance of the service, the level of trust and the workload of the service provider. As significant metrics are considered for recommending service, the service requester is assured with reliable and faster service provisioning, which is proven by the experimental results.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
International Journal of Computer Networks and Applications
International Journal of Computer Networks and Applications Computer Science-Computer Science Applications
CiteScore
2.30
自引率
0.00%
发文量
40
×
引用
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学术官方微信