摘要
针对现有数据收集方法的不足,提出一种优化的网络拓扑构造算法来实现数据收集。该算法首先从给定的网络全连通图中找到符合条件的k个顶点的子图,使得k个顶点间的距离平方和最小化,然后采用Hungarian算法来实现边的约简,直到得到一颗生成树。另外,为了降低控制开销,还提出一种分布式的网络拓扑构造算法,提高算法的适应性。理论分析和仿真实验结果表明,该方法是有效的,在数据收集延迟以及网络生命周期等方面要优于传统的方法。
Aiming at the disadvantage of existing data collection methods, we propose an optimised network topology construction algorithm to realise data collection. Firstly, the algorithm finds from the given fully connected graph of network the qualified subgraph with k vertices, which minimise the distance squares sum between the vertices, and then it uses Hungarian algorithm to achieve the reduction of edges until to procure a spanning tree. Besides, in order to reduce the control overhead, we also propose a distributed network topology construction algorithm which improves the adaptability of the algorithm. Theoretical analysis and simulation experimental results all show that this method is effective, and is superior to traditional methods in terms of the data collection delay and lifecycle of network.
出处
《计算机应用与软件》
CSCD
北大核心
2014年第3期250-255,共6页
Computer Applications and Software
基金
国家自然科学基金项目(30900358/C100701)
浙江省教育厅项目(Y201330183)
绍兴市教学改革项目(SGJ12078)
关键词
无线传感网
数据收集
网络拓扑
生成树
延迟
网络生命周期
Wireless sensor networks Data collection Network topology Spanning tree Delay Lifecycle of network
