{"title":"基于p2p的新型僵尸网络研究","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":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2010-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"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\":null,\"pages\":null},\"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}","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}
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.