...
首页> 外文期刊>International Journal of Network Management >Size-restricted cluster formation and cluster maintenance technique for mobile ad hoc networks
【24h】

Size-restricted cluster formation and cluster maintenance technique for mobile ad hoc networks

机译:移动自组织网络的大小受限的集群形成和集群维护技术

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

摘要

Mobile ad hoc networks may be composed of a large number of nodes and hence a hierarchical cluster-based structure can be employed to address the scalability issues of the large network. In this paper we propose a size-restricted, distributed clustering strategy (cluster formation and cluster maintenance) for mobile ad hoc networks. A distributed approach where every node is responsible for the clustering decisions would avoid single-point bottleneck failures. We use a size restriction S, for the cluster formation and cluster maintenance. In addition, while forming the cluster we also use a diameter restriction K. The simulations show that our strategy gives rise to a lesser number of clusters when compared to other clustering algorithms proposed by Gerla et al., Fernadess et al. and Lin et al. This is attributed to the size restriction and cluster merging that we have incorporated. The size restriction helps in better management of resources inside the cluster. Our clustering technique uses a weight-based cluster head election strategy which results in less change in cluster head and higher cluster head lifetime when compared to the Least Cluster Head Changes (LCC) with lowest ID algorithm. The low change in cluster head and higher cluster head lifetime make our proposed algorithm suitable for high-mobility situations. The proposed clustering strategy could be used for building the clusters required in a hierarchical structure of the ad hoc network.
机译:移动自组织网络可能由大量节点组成,因此可以采用基于层次集群的结构来解决大型网络的可伸缩性问题。在本文中,我们提出了一种针对移动自组织网络的大小受限的分布式集群策略(集群形成和集群维护)。每个节点负责群集决策的分布式方法可以避免单点瓶颈故障。我们将大小限制S用于集群的形成和集群的维护。此外,在形成集群时,我们还使用了直径限制K。模拟显示,与Gerla等人,Fernadess等人提出的其他聚类算法相比,我们的策略产生的集群数更少。和林等。这归因于我们引入的大小限制和群集合并。大小限制有助于更好地管理群集内的资源。与具有最低ID算法的最小簇头变化(LCC)相比,我们的聚类技术使用基于权重的簇头选举策略,该策略导致簇头变化更少,簇头寿命更长。簇头的低变化和更长的簇头寿命使我们提出的算法适合于高机动性的情况。所提出的群集策略可用于构建ad hoc网络的分层结构中所需的群集。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号