摘要
无线传感器网络中,基于极小连通支配集的虚拟骨干网的构建使得路由搜索空间集中在支配节点之间,能够有效节省网络资源,减少冗余转发节点。首先提出连通支配集的数学模型。基于WL算法,提出改进的极小连通支配集分布式算法。仿真结果表明,改进算法求得的连通支配集较小,可为无线传感器网络中的路由协议提供通讯基础。
Efficient routing using virtual backbone network among a set of mobile hosts is one of the most important application in wireless sensor network（WSN）. Routing based on a minimum connected dominating set（MCDS）is a promised approach,where the searching space for a route is reduced to nodes in the set. Based on WL algorithm, an improved minimum connected dominating set is proposed in this paper. The simulation results show that the size of the resultant connected dominating set is small and the proposed algorithm outperforms two previous distributed algorithms. It can be potentially used in designing efficient routing in WSN.
出处
《传感技术学报》
CAS
CSCD
北大核心
2012年第6期842-846,共5页
Chinese Journal of Sensors and Actuators
基金
国家自然科学基金项目(61172014
60702037)
天津市自然科学基金项目(09JCYBJC00800)
天津市应用基础与前沿技术研究计划项目(12JCZDJC21300)
关键词
无线传感器网络
分布式算法
连通支配集
虚拟骨干网
wireless network
distributed algorithm
connected dominating set
virtual backbone network
