用于Ad Hoc网络的分簇算法

doi:10.13190/jbupt.200905.61.yangwd

北京邮电大学学报 ›› 2009, Vol. 32 ›› Issue (5): 61-65.doi: 10.13190/jbupt.200905.61.yangwd

用于Ad Hoc网络的分簇算法

杨卫东

(南方医科大学网络中心，广州 510515)

收稿日期:2009-01-08 修回日期:2009-08-04 出版日期:2009-10-28 发布日期:2009-10-28
通讯作者: 杨卫东

A Novel Clustering Algorithm for Ad Hoc Network

YANG Wei-Dong

(Network Center, Southern Medical University, Guangzhou 510515, China)

Received:2009-01-08 Revised:2009-08-04 Online:2009-10-28 Published:2009-10-28
Contact: YANG Wei-Dong

摘要/Abstract

摘要：

簇结构是Ad Hoc网络中应用最为广泛的层次结构，而这种层次的形成和维护依赖于某种算法
. 在分析现有分簇算法的基础上，提出一种新的按需加权的分簇算法（NWBCA）. 算法综合
考虑了移动节点的最佳连接度和能量状态因素，并采用按需策略作为簇结构的维护策略，提高
了网络体系结构的稳定性，减少了计算和通信开销. 通过性能比较，NWBCA的各项仿真指标
均优于其他分簇算法，且仿真结果也证明了该算法的有效性.

关键词: Ad Hoc网络, 分簇算法, 簇和簇头, 最佳连接度, 能量状态, 权值

Abstract:

Clustering is the most popular method to impose a hierarchical structure in the mobile Ad Hoc networks. However, the formation and maintenance of a hierarchical structure depends on certain clustering algorithm. By studying existing clustering algorithm, a new on-demand weighted clustering algorithm (NWBCA) is proposed. The optimized connectivity degree and energy status of mobile nodes are taken into consideration. The adoption of the on-demand strategy improves the stability of the network architecture and lowers the computing and communication cost. By investigating the performance of the proposed algorithm with that of others, the simulation indicates all the specifics of NWBCA are superior to those of the other and the validity of NWBCA has been proved.

Key words: Ad Hoc network, clustering algorithm, cluster and cluster header, optimized connectivity degree, state of energy, weight

杨卫东. 用于Ad Hoc网络的分簇算法[J]. 北京邮电大学学报, 2009, 32(5): 61-65.

YANG Wei-Dong. A Novel Clustering Algorithm for Ad Hoc Network[J]. JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM, 2009, 32(5): 61-65.

参考文献

[1] Wei Dali, Chan H A. Clustering Ad Hoc networks: schemes and classifications//SECON 2006. Reston: IEEE Press, 2006: 920-926.
[2] 高悦, 唐碧华. Ad Hoc网络中的源宿双备份多路由协议[J]. 北京邮电大学学报, 2008, 31(1): 30-34. Gao Yue, Tang Bihua. Double-backup multipath routing for mobile Ad Hoc networks[J]. Journal of Beijing University of Posts and Telecommunications, 2008, 31(1): 30-34.
[3] Yang Weidong, Zhang Guangzhao. A weight-based clustering algorithm for mobile Ad Hoc network//ICWMC 2007. Guadeloupe: IEEE Press, 2007: 3.
[4] Cupta P, Kumar P. The capacity of wireless networks[J]. IEEE Transaction on Information Theory, 2000, 46(2): 388-404.
[5] 王海涛. 移动Ad Hoc网络的分簇算法及性能比较[J]. 北京邮电大学学报, 2004, 27(1): 93-97. Wang Haitao. Clustering algorithms of MANET and performance comparisons[J]. Journal of Beijing University of Posts and Telecommunications, 2004, 27(1): 93-97.
[6] Hwang Y C, Jeong Y S, Lee S H, et al. Advanced efficiency and stability combined weight based distributed clustering algorithm in MANET//FGCN 2007. Jeju-Island: IEEE Press, 2007: 478-483.
[7] Tolba F D, Magoni D, Lorenz P. Connectivity, energy and mobility driven clustering algorithm for mobile Ad Hoc networks//GLOBECOM 2007. Washington: IEEE Press, 2007: 2786-2790.
[8] Tolba F D, Magoni D, Lorenz P. A stable clustering algorithm for highly mobile Ad Hoc networks//ICSNC 2007. Cap Esterel: IEEE Press, 2007: 11.
[9] Lin C R, Gerla M. Adaptive clustering for mobile wireless networks. IEEE Journal on Selected Areas in Communications, 1997, 15(7): 1265-1275.
[10] Parekh A K. Selecting routers in Ad-Hoc wireless networks//SBT/IEEE International Telecommunications Symposium. : IEEE Press, 1994: 420-424.
[11] Bassagni S. Distributed clustering for Ad Hoc networks//I-SPAN99. Perth: IEEE Press, 1999: 310-315.
[12] Chatterjee M, Das S K, Turgut D. WCA: a weighted clustering algorithm for mobile Ad Hoc networks[J]. Journal of Clustering Computing, 2002, 5(2): 193-204.

[1]	白媛, 安杰, 张会兵. 预测辅助的Ad hoc网络路由协议[J]. 北京邮电大学学报, 2017, 40(s1): 29-33.
[2]	李东海, 杨小军, 杨云, 范中磊. 多项式数据通路的高层次综合方法[J]. 北京邮电大学学报, 2017, 40(1): 130-136.
[3]	蔚承英, 周邦陶, 刘焕淋, 刘洋, 陈勇. 业务持续时间的带宽可变节能调度算法[J]. 北京邮电大学学报, 2016, 39(1): 83-86.
[4]	温景容武穆清吕博汪东洋. 非均匀多信道Ad Hoc网络信道选择方法[J]. 北京邮电大学学报, 2013, 36(2): 10-14.
[5]	王英赫宋梅陈浩张英海. Ad Hoc网络中采用功率调整的单向链路通告策略[J]. 北京邮电大学学报, 2012, 35(5): 102-106.
[6]	刘洺辛于倩. Ad Hoc网络中基于传输状态的自适应退避算法[J]. 北京邮电大学学报, 2012, 35(4): 68-71.
[7]	李德建,周正,翟世俊,李斌. 大型客车车厢环境下的超宽带信道模型 [J]. 北京邮电大学学报, 2012, 35(1): 5-9.
[8]	刘期烈李云潘英俊赵晓娜. 运用HTC解决延迟容忍网络路由问题[J]. 北京邮电大学学报, 2010, 33(5): 28-32.
[9]	余旺科马文平严亚俊杨元原. 利用信任模型构建安全路由协议[J]. 北京邮电大学学报, 2010, 33(3): 48-51.
[10]	舒挺;孙守迁;王海宁;徐伟强;李文书. 启发式探索的协议测试序列生成[J]. 北京邮电大学学报, 2009, 32(6): 120-124.
[11]	扈鹏;刘元安;马晓雷;高松. Ad Hoc网络中按需路由协议的动态广播算法[J]. 北京邮电大学学报, 2009, 32(6): 53-56.
[12]	许小丰万江文冯仁剑. 传感器网络中基于置信区间的数据聚合策略[J]. 北京邮电大学学报, 2009, 32(1): 29-33.
[13]	翟立东，刘元安，马晓雷，高锦春. 发布/订阅通信机制在移动Ad Hoc网络中的应用[J]. 北京邮电大学学报, 2008, 31(2): 30-33.
[14]	苗建松，丁炜，孙丹丹. 移动Ad Hoc网络中基于能量的自适应广播策略（增刊）[J]. 北京邮电大学学报, 2007, 29(s1): 1-4.
[15]	徐伟强1, 2，汪亚明1，包晓安1, 陈积明2. MPCC: 一种用于Ad Hoc网络多径路由的优化拥塞控制算法[J]. 北京邮电大学学报, 2007, 30(5): 41-45.

用于Ad Hoc网络的分簇算法

A Novel Clustering Algorithm for Ad Hoc Network

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 15

编辑推荐

Metrics

本文评价