中文摘要：

本文提出一种基于节点度和通信代价的双簇首交替算法——NDCC算法。该算法用于解决语音导游系统中靠近导游机的节点过度利用的问题,算法在移动自组织网络中引入双簇首轮换制度。该制度以优先级为考查标准,综合多种因素：以节点度的变化作为簇首交替的参考标准;计算双簇首与簇内某个随机节点的通信代价。最后,本文将NDCC算法在Matlab平台进行多方面仿真,证明算法的优势,也提出本算法值得改进的方向。

英文摘要：

Based on node degree and communication costs,NDCC—an alternative algorithm of double cluster head is propsoed in this paper.This algorithm is applied to solve the problem of nodes excessive-use near electronic guide machine.The proposed NDCC incorporates double cluster head alternation system into mobile ad-hoc networks.This system chooses priority as testing standard and integrates various factors,such as taking node-degree change as the reference standard of cluster head alternation,calculating the communication costs between double-cluster head and a random node within its radio range.Finally,multi-aspect simulations on NDCC algorithm with Matlab indicate the superiority of this algorithm,and some direction worthy of modification is also suggested in this paper.