摘要
在基于多移动代理的无线传感器网络中,源节点的编组方法是区别于单移动代理系统的核心研究问题。基于跳数的最小生成树原理,提出一种基于最小生成树算法的规划编组方式,通过对无向全连通图中边权值的测量和选取,简单而有效地控制网络中能量消耗与任务延迟间的平衡,从而获得高效的综合性能。最后通过大量的OPNET仿真实验验证了算法的可靠性。
In contrary to the single mobile agent system,the grouping methodology for source nodes is the key issue in multi-agent itinerary planning for wireless sensor networks.A novel approach was proposed based on hop-oriented minimum spanning tree.The scheme achieves flexible trade-off control between energy cost and task duration by dynamically selecting edge weights in the total connected graph.Extensive simulations have shown that the approach outperforms the existing works.
出处
《系统仿真学报》
CAS
CSCD
北大核心
2010年第12期2890-2894,共5页
Journal of System Simulation
基金
国家自然科学基金(10901131)
关键词
移动代理
行程规划
最小生成树
无线传感器网络
mobile agent
itinerary planning
minimum spanning tree
wireless sensor networks