Improved Schemes for Node Clustering in Decentralized Peer-to-Peer Networks

Yanxiang He, Haowen Liu, Fubao Zhu
{"title":"Improved Schemes for Node Clustering in Decentralized Peer-to-Peer Networks","authors":"Yanxiang He, Haowen Liu, Fubao Zhu","doi":"10.1109/SITIS.2007.13","DOIUrl":null,"url":null,"abstract":"Node Clustering has wide ranging applications in decentralized Peer-to-Peer (P2P) networks such as P2P file sharing systems, mobile ad-hoc networks, P2P sensor networks and so forth. In this work, We propose two distributed approaches for node clustering that based on the scaled coverage measure (SCM), a measure of the accuracy of the partition of the network into clusters. The novelty of our approaches is to process nodes in local vicinity in special orders. Simulation study shows that our approach derives a more accurate partition with less orphan nodes, and converges faster than previously proposed methods, for both random topologies and power law topologies.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SITIS.2007.13","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Node Clustering has wide ranging applications in decentralized Peer-to-Peer (P2P) networks such as P2P file sharing systems, mobile ad-hoc networks, P2P sensor networks and so forth. In this work, We propose two distributed approaches for node clustering that based on the scaled coverage measure (SCM), a measure of the accuracy of the partition of the network into clusters. The novelty of our approaches is to process nodes in local vicinity in special orders. Simulation study shows that our approach derives a more accurate partition with less orphan nodes, and converges faster than previously proposed methods, for both random topologies and power law topologies.
分布式点对点网络中节点聚类的改进方案
节点集群在分散的P2P网络中有着广泛的应用,如P2P文件共享系统、移动自组织网络、P2P传感器网络等。在这项工作中,我们提出了两种基于按比例覆盖度量(SCM)的节点聚类的分布式方法,SCM是一种度量网络划分为集群的准确性的方法。该方法的新颖之处在于以特殊顺序处理局部附近的节点。仿真研究表明,无论对于随机拓扑还是幂律拓扑,我们的方法都能以更少的孤立节点获得更精确的划分,并且收敛速度快于先前提出的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信