基于网络分层的连通支配集算法
Layer Based CDS Construction Alogrithm
在无线传感器网络中,构造一个虚拟骨干网是优化网络性能的重要手段。虚拟骨干网的构造在数学上等同于求图的最小连通支配集,最小连通支配集的求取问题已经被证明是NP完全问题,因此采用启发式的方法求取一个最优解。本文提出了LCDS算法(A Layer Based CDS Construction Algorithm),首先选取一个源节点(sink或簇头节点),然后以此节点将网络按跳数划分成若干层。分层完成后,各层分布式的计算本层的支配节点集,所有层的支配节点集的并即为网络的连通支配集。LCDS算法的时间复杂度为 ,其中 表示节点的平均度。仿真结果表明,LCDS算法获得了一个比MTCDS[6]和MISB[10]等算法小的CDS,并且随着网络密度快速增加,LCDS算法获得的CDS尺寸增加很小,在密度很大的无线传感器网络中,LCDS算法仍然能得到一个较小的CDS.
In Wireless Sensor Networks, Virtual Backbone is an important method to optimize network performance. In mathematics,the construction of Virtual Backbone equivalent to seeking the Minimum Connected Dominating Set(MCDS) which has been to proved to be NP-complete problem. A heuristic approach is an approximate solution. This paper presents LCDS algorithm (A Layer Based CDS Construction Algorithm) proposes a layer model. First, this algorithm selects a source node (sink or cluster head), then it starts a broadcast from this node to divide networks into several layers according to hops. After layer is divided, each layer performing CDS construction algorithm computes dominating set separately, and the union of dominating set of all layers acts CDS of networks. The time complexity of LCDS is where represent average degree of nodes. Simulation results show that, LCDS algorithm gets a smaller CDS than other algorithms which include MTCDS[6] and MISB[10] algorithm and with the rapid increase of network density, the increase of CDS is very slow. When nodes of WSN have a very large density, LCDS algorithm is still able to get a smaller CDS.
汪文勇、张骏、唐勇、张军、向渝、杨挺
无线通信通信电子技术应用
无线传感器网络连通支配集分层
wireless sensor networksCDSLayer
汪文勇,张骏,唐勇,张军,向渝,杨挺.基于网络分层的连通支配集算法[EB/OL].(2011-09-29)[2025-08-16].http://www.paper.edu.cn/releasepaper/content/201109-371.点此复制
评论