基于移动保持时间的无线自组网分簇算法  

Clustering Algorithms for Wireless Self-Organized Networks Based on Mobile Holding Time

作　　者：黄卫红[1,2] 李仁发[1] 彭献武[1,2] 

机构地区：[1]湖南大学计算机与通信学院 [2]411201湖南湘潭湖南科技大学计算机科学与工程学院

出　　处：《微计算机信息》2007年第03X期95-96,119,共3页Control & Automation

基　　金：湖南省教育厅科技项目(03C538)

摘　　要：无线自组网不依赖固定的基础设施,其最主要的特点是无中心结构和高度的动态变化。本文提出一种新的节点移动保持时间计算方法,并在此基础上开发了最大稳定性加权分簇算法MSWCA,在稳定性、能耗、负载平衡等因素权衡中,侧重考虑簇结构的稳定性,从而进一步提高网络可靠性,有利于更大规模网络的组建。最后探讨了进一步的需要进行研究和改进的问题。Ad hoe network does not depend on any fixed installation; the main features of it are no centralized control and rapidly dynamic change. This paper proposes a new approach to calculate the hold time of mobile node. Upon it we develop the Maximum Stability Weighted Clustering Algorithm （MSWCA）. The scheme takes into many factors consideration, such as the stability of cluster- ing, the battery power drain of mobile nodes, the load balance and network throughout, etc. We mainly think about the stability of the networks to improve its reliability, This helps the construction of larger scale ad hoe networks, Finally, we discuss the concerning problem to be researched later.

关 键 词：无线自组网 分簇算法 稳定性 移动保持时间 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]