【24h】

A PROBABILITY COLLECTIVES APPROACH TO WEIGHTED CLUSTERING ALGORITHMS FOR AD HOC NETWORKS

机译:AD HOC网络的加权聚类算法的概率集合方法

获取原文
获取原文并翻译 | 示例

摘要

The Weighted Clustering Algorithm has been proposed for mobile ad hoc wireless networks to select a subset of the nodes to be local purveyors of media access control services to the rest of the nodes. The nodes selected are called clusterheads, and each clusterhead services the other nodes within its radio range. The underlying optimal assignment problem is NP-hard. We introduce a new metaheuristic known as probability collectives to the problem of assigning clusterheads. This is an agent-based approach, with each node in the network acting in a quasi-autonomous way. This new approach shows improved clustering results, particularly with regard to the distribution and balance of cluster sizes.
机译:已经提出了用于移动自组织无线网络的加权聚类算法,以选择节点的子集作为向其余节点的媒体访问控制服务的本地提供者。所选的节点称为簇头,每个簇头服务于其无线电范围内的其他节点。潜在的最佳分配问题是NP-hard。我们在分配簇首的问题中引入了一种新的元启发式方法,称为概率集合。这是一种基于代理的方法,网络中的每个节点都以准自治方式运行。这种新方法显示出改进的聚类结果,尤其是在聚类大小的分布和平衡方面。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号