异构Ad hoc网络骨干网络的建立与性能分析

Backbone for Heterogeneous Ad hoc Networks and their Performance Analysis

目前针对虚拟骨干网的研究都是基于最小连通支配集(MCDS)的方式,其目的是最小化骨干网中的节点个数,但没有考虑到骨干节点的实际通讯能力。这样,在异构Adhoc网络中一些低性能骨干网节点可能成为整个网络的性能瓶颈。充分考虑到Adhoc网络的节点异构性问题,提出了基于高性能节点的最小连通支配集算法(MCDS-HNP),同时给出了算法的逼近度证明,并通过仿真试验表明在与MCDS算法相似的骨干节点个数的情况下,MCDS-HNP算法能获得更好的骨干网性能。

Most of existing work are based on the concept of minimum connect dominating set（MCDS）, which is only target for minimizing the number of backbone nodes, but not take the real characteristics of nodes into account when constructing the backbone. In the way, some low performance nodes could be the bottleneck of the backbone. Selecting more capable nodes as candidates to construct a high performance backbone, a minimum connected dominating set with high node performance（MCDS-HNP） algorithm was proposed, and the approximation ratio of the proposed algorithm was also presented. The simulation results demonstrate that the MCDS-HNP algorithm achieves better backbone performance while maintaining approximately the same backbone size.