摘要
提出了一种基于局部最大度数与节点标识号相结合的支配点选择方式,并基于该方式给出了一种计算移动AdHoc网络最小连通支配集的分布式近似算法CDSA,实验显示,CDSA算法生成的连通支配集比文献[3～5]所提出的WL、CBBA及MCDS算法更小。另外,CDSA是一种动态的和基于分布式的算法,因此它不但适用于移动AdHoc网络,也适用于一般网络中的最小连通支配集的近似计算问题。
A distributed algorithm (connected dominating set algorithm CDSA) based on maximal local degree and node ID for finding theminimal connected dominating set in mobile ad-hoc network is proposed in this paper. The analysis and experimental results show that a smallerconnected dominating set can be achieved using CDSA than the algorithms proposed in literatures [3~5] (WL, CBBA and MCDS). In addition, as aresult of its dynamic and distributed features, CDSA is not only suitable for mobile Ad Hoc network but also suitable for the minimal connecteddominating set problem in generic network.
出处
《计算机工程》
CAS
CSCD
北大核心
2005年第14期37-38,41,共3页
Computer Engineering
基金
国家自然科学基金资助项目(60272051)
湖南省自然科学基金资助项目(03JJY3098)
