基于SJF的无基础设施网络调度算法

K. Thamizhmaran
{"title":"基于SJF的无基础设施网络调度算法","authors":"K. Thamizhmaran","doi":"10.48001/jocnv.2023.118-10","DOIUrl":null,"url":null,"abstract":"Some of recent researchers interested in the field of sensor network based wireless field (WSN) because of very difficult to communication via air medium due to lack of problems in using same carrier channel in all communication and easy to attack for security issues like malicious attacks or misbehaviour attacks, grey hole attacks, block hole attacks, etc. In truest based path not easy to fine this drawback overcome we proposed and implement one type of scheduling algorithm called shortest first job with help of infrastructure less network. This leading algorithm is overcome above issue of security issue in the wireless sensor networks problems, because of finding best cost and distance unbreakable path between sender to receiver simulated using NS2.","PeriodicalId":402315,"journal":{"name":"Journal of Computer Networks and Virtualization","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Scheduling Algorithm in Infrastructure Less Network for SJF\",\"authors\":\"K. Thamizhmaran\",\"doi\":\"10.48001/jocnv.2023.118-10\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Some of recent researchers interested in the field of sensor network based wireless field (WSN) because of very difficult to communication via air medium due to lack of problems in using same carrier channel in all communication and easy to attack for security issues like malicious attacks or misbehaviour attacks, grey hole attacks, block hole attacks, etc. In truest based path not easy to fine this drawback overcome we proposed and implement one type of scheduling algorithm called shortest first job with help of infrastructure less network. This leading algorithm is overcome above issue of security issue in the wireless sensor networks problems, because of finding best cost and distance unbreakable path between sender to receiver simulated using NS2.\",\"PeriodicalId\":402315,\"journal\":{\"name\":\"Journal of Computer Networks and Virtualization\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-06-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Computer Networks and Virtualization\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.48001/jocnv.2023.118-10\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Computer Networks and Virtualization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.48001/jocnv.2023.118-10","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

基于传感器网络的无线领域(WSN)由于在所有通信中使用同一载波信道的问题,使得通过空气介质进行通信非常困难,并且容易受到恶意攻击或不当行为攻击、灰洞攻击、块洞攻击等安全问题的攻击,近年来引起了一些研究人员的兴趣。克服了基于真实路径不易确定的缺点,提出并实现了一种基于无基础设施网络的最短首个作业调度算法。该算法克服了无线传感器网络中存在的安全问题,通过NS2模拟找到了发送端和接收端之间的最佳成本和距离不可破坏路径。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Scheduling Algorithm in Infrastructure Less Network for SJF
Some of recent researchers interested in the field of sensor network based wireless field (WSN) because of very difficult to communication via air medium due to lack of problems in using same carrier channel in all communication and easy to attack for security issues like malicious attacks or misbehaviour attacks, grey hole attacks, block hole attacks, etc. In truest based path not easy to fine this drawback overcome we proposed and implement one type of scheduling algorithm called shortest first job with help of infrastructure less network. This leading algorithm is overcome above issue of security issue in the wireless sensor networks problems, because of finding best cost and distance unbreakable path between sender to receiver simulated using NS2.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信