GSM-R应急自组网中的分簇路由算法研究

在采用分簇结构的GSM-R应急自组织网络中,簇头的选择将直接影响整个网络的性能,因此必须设计合理的分簇算法,综合考虑网络环境中的各种因素,使得形成的分簇结构具有很好的系统环境和应用需求的适应性。通过对Ad Hoc自组网中的加权分簇算法WCA（Weighted Clustering Algorithm）简单介绍,从算法的复杂度、负载均衡性和适用环境等方面对其性能进行比较和分析。本文改进一种基于组合加权思想的分簇算法,即基于簇稳定性的加权分簇算法,以下简称CSBWCA（Cluster-Stability Based Weighted Clustering Algorithm）。同时,介绍了此算法的设计思想,并仿真了加权分簇算法和基于稳定性的加权分簇算法的节点簇间转移次数R随GSM-R应急网络中参与应急通信的终端数目N和最大转移速度的变化情况以及两种分簇算法的簇头更新次数U随终端数目以及终端最大移动速度的变化情况。仿真结果表明,基于簇稳定性的加权分簇算法的性能明显优于加权分簇算法。

GSM-R emergency in Ad Hoc networks routing algorithms

In the cluster structure of the GSM-R emergency self-organizing networks,cluster head selection will directly affect the performance of the whole network,so we must design the reasonable clustering algorithm,considering the network environment in a variety of factors,so as to form a cluster structure has good system environment and application demands.Through the Ad Hoc ad hoc weighted clustering algorithm WCA(Weighted Clustering Algorithm) briefly,from the complexity of the algorithm,load balance and environment and other aspects of its performance comparison and analysis.This paper presents a method based on combination weighting idea of clustering algorithm based on cluster stability,i.e.the weighted clustering algorithm,hereinafter referred to as the CSBWCA(Cluster-Stability Based Weighted Clustering Algorithm).At the same time,introduced this algorithm design,and Simulation of weighted clustering algorithm and stability of the weighted clustering algorithm based on node cluster transfer number R with GSM-R emergency network involved in emergency communication terminal number N and the maximum transfer speed change and two kinds of clustering algorithm to cluster head updates U with number of terminals and terminal maximum moving speed change.The simulation results show that,based on the cluster stability weighted clustering algorithm has better performance than the weighted clustering algorithm.