| 基于节点度和通信代价的双簇首交替算法 |
| |
| 引用本文： | 许晓天,李德敏,紫罗,周凡.基于节点度和通信代价的双簇首交替算法[J].通信技术,2015,48(2):171-174. |
| |
| 作者姓名： | 许晓天 李德敏 紫罗 周凡 |
| |
| 作者单位： | 1.东华大学信息科学与技术学院,上海 201620;2.数字化纺织服装技术教育部工程研究中心, 上海 201620 |
| |
| 基金项目： | 国家自然科学基金(No.71171045)~~ |
| |
| 摘 要： | 本文提出一种基于节点度和通信代价的双簇首交替算法——NDCC算法。该算法用于解决语音导游系统中靠近导游机的节点过度利用的问题,算法在移动自组织网络中引入双簇首轮换制度。该制度以优先级为考查标准,综合多种因素:以节点度的变化作为簇首交替的参考标准;计算双簇首与簇内某个随机节点的通信代价。最后,本文将NDCC算法在Matlab平台进行多方面仿真,证明算法的优势,也提出本算法值得改进的方向。
|
| 关 键 词： | 双簇首交替 节点度 通信代价 |
An Alternate Algorithm of Double Cluster Head based on Node Degree and Communication Costs |
| |
| XU Xiao-tian;LI De-min;Zolomaya;ZHOU Fan.An Alternate Algorithm of Double Cluster Head based on Node Degree and Communication Costs[J].Communications Technology,2015,48(2):171-174. |
| |
| Authors: | XU Xiao-tian;LI De-min;Zolomaya;ZHOU Fan |
| |
| Affiliation: | (1.Department of Information Science and Technology, Donghua University,Shanghai 201620,China;2.Engineering Research Center of Digitized Textile & Fashion Technology,Ministry of Education,Shanghai 201620,China); |
| |
| Abstract: | 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. |
| |
| Keywords: | double cluster head node degree communication costs |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《通信技术》浏览原始摘要信息 |
|
点击此处可从《通信技术》下载全文 |
|
