|国家预印本平台
首页|一种用于Ad Hoc网络的新型分簇算法

一种用于Ad Hoc网络的新型分簇算法

New Clustering Algorithm for Mobile Ad Hoc Networks

中文摘要英文摘要

移动自组织网络(Mobile Ad Hoc Networks)具有动态变化的拓扑结构、无中心和自组织等特点,如何对它进行有效的管理至今没有得到很好的解决,经过查阅大量有关分簇算法的资料,本文提出了一种新型分簇算法NAOW(a New Adaptive On-demand Weighting)。该算法在AOW(Adaptive On-demand Weighting)算法的基础上提出了一些改进,从而提高了网络管理的灵活性和可扩展性,使之更适合于管理大规模、多环境的Ad Hoc无线网络。

he Mobile Ad Hoc Networks is a self-organizing and rapidly developable network in which has neither a backbone nor a centralized controlling,so it’s very difficult to control. I propose a new algorithm by looking up many papers which introduce the merits and disadvantages of the kind of network.The algorithm has some developments base on the Weighted Clustering Algorithm,so it enhances the flexibility and extensibility of networks.Therefore it is a better method to manage a large scale Ad Hoc networks under different kinds of conditions.

袁俊春、李腊元

无线通信通信

移动自组织网络分簇簇头NAOW算法

d Hoc networksclusteringclusterheada New Adaptive On-demand Weighting

袁俊春,李腊元.一种用于Ad Hoc网络的新型分簇算法[EB/OL].(2007-09-20)[2025-08-11].http://www.paper.edu.cn/releasepaper/content/200709-405.点此复制

评论