欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
为了降低耗能和减少花费,提出了对无线传感网络设计中的最小连通集合划分的方法。采用对网络进行Voronoi划分成近似覆盖集合,对不满足连通的情况采用一种基于模拟植物生长算法生成Steiner最优树的连通算法来实现网络连通的方法。通过对算法的时间复杂度分析及算例实验,验证了该算法不但可获得最优解,同时精度和性能也有提高,明显优于其它方法。
英文摘要：
To reduce the power consumption and extend the network lifetime,a solution method of dividing the sensor nodes into several minimal connected cover sets is presented.Firstly,a Voronoi tessellation based on approximate algorithm is proposed to construct a near optimal cover set.Then,if the cover set connected condition is not satisfied,a Steiner minimal tree would be constructed based on plant growth simulation algorithm to realise the net’s connectivity.Finally,by analyzing the time complexity of the algorithm and the experi-mental tests of real instances,the minimal result can be got,while the precision and performance of the presented algorithm is demonstrated better than other methods.
同期刊论文项目
同项目期刊论文
期刊信息
位置：