{"title":"基于贪婪算法的自组织协议的图分裂","authors":"Hu Yin, Y. Lv","doi":"10.1109/ISIC.2012.6449715","DOIUrl":null,"url":null,"abstract":"Recently, Self organization protocol has gained great focus from the research area for its efficient to save energy on wireless sensors network. We use a random graph model to compare some of the proposed self organization protocols in this thesis. Results show the impact of the surface on the percentage of the active set Thus, we focus on the graph splitting and the impact for the active set and the topology connectivity. Finally, we analyze the performance resulting for transmitted and received packets.","PeriodicalId":393653,"journal":{"name":"2012 International Conference on Information Security and Intelligent Control","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A graph split on greedy-algorithm-based Self organization protocols\",\"authors\":\"Hu Yin, Y. Lv\",\"doi\":\"10.1109/ISIC.2012.6449715\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recently, Self organization protocol has gained great focus from the research area for its efficient to save energy on wireless sensors network. We use a random graph model to compare some of the proposed self organization protocols in this thesis. Results show the impact of the surface on the percentage of the active set Thus, we focus on the graph splitting and the impact for the active set and the topology connectivity. Finally, we analyze the performance resulting for transmitted and received packets.\",\"PeriodicalId\":393653,\"journal\":{\"name\":\"2012 International Conference on Information Security and Intelligent Control\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 International Conference on Information Security and Intelligent Control\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIC.2012.6449715\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Information Security and Intelligent Control","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIC.2012.6449715","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A graph split on greedy-algorithm-based Self organization protocols
Recently, Self organization protocol has gained great focus from the research area for its efficient to save energy on wireless sensors network. We use a random graph model to compare some of the proposed self organization protocols in this thesis. Results show the impact of the surface on the percentage of the active set Thus, we focus on the graph splitting and the impact for the active set and the topology connectivity. Finally, we analyze the performance resulting for transmitted and received packets.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
