Research of an Innovative P2P-Based Botnet

Q1 Social Sciences
Jian Gao, Yixian Yang, K. Zheng, Zhengming Hu
{"title":"Research of an Innovative P2P-Based Botnet","authors":"Jian Gao, Yixian Yang, K. Zheng, Zhengming Hu","doi":"10.1109/MVHI.2010.135","DOIUrl":null,"url":null,"abstract":"The research recently focuses on the integration of peer-to-peer frame as incremental improvements to botnet. In hybrid P2P botnet, it is important to find a mechanism to select neighbor list for every super node, in order to improve stability of communication when some super nodes lose. At the same time, it needs to select high performance and nearest node as a super node, to provide command request and file transport for other ordinary nodes. In this paper, we propose a neighbor list selecting method based on Strongly Connected Graph and analysis a super node selecting mechanism based on AHP. Evaluation shows that this mechanism can increase coverage probability of commands and decrease average connection time (ACT) between super node and ordinary node.","PeriodicalId":34860,"journal":{"name":"HumanMachine Communication Journal","volume":"11 1","pages":"214-218"},"PeriodicalIF":0.0000,"publicationDate":"2010-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"HumanMachine Communication Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MVHI.2010.135","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Social Sciences","Score":null,"Total":0}
引用次数: 4

Abstract

The research recently focuses on the integration of peer-to-peer frame as incremental improvements to botnet. In hybrid P2P botnet, it is important to find a mechanism to select neighbor list for every super node, in order to improve stability of communication when some super nodes lose. At the same time, it needs to select high performance and nearest node as a super node, to provide command request and file transport for other ordinary nodes. In this paper, we propose a neighbor list selecting method based on Strongly Connected Graph and analysis a super node selecting mechanism based on AHP. Evaluation shows that this mechanism can increase coverage probability of commands and decrease average connection time (ACT) between super node and ordinary node.
基于p2p的新型僵尸网络研究
最近的研究集中在点对点框架的集成,作为对僵尸网络的增量改进。在混合型P2P僵尸网络中,为了提高某些超级节点丢失时通信的稳定性,必须找到一种机制来选择每个超级节点的邻居列表。同时,需要选择性能最好、距离最近的节点作为超级节点,为其他普通节点提供命令请求和文件传输。本文提出了一种基于强连通图的邻表选择方法,并分析了一种基于层次分析法的超级节点选择机制。评估表明,该机制可以提高命令的覆盖概率,减少超级节点与普通节点之间的平均连接时间(ACT)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
10.00
自引率
0.00%
发文量
10
审稿时长
8 weeks
×
引用
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学术官方微信