论文部分内容阅读
无线传感器网络中,相对于传统上广泛使用的C/S计算范式,基于Mobile Agent的计算范式展示出强有力的生存优势.因此,Mobile Agent作为一种分布式中间件技术,已经成为无线传感器网络中高效地自主性数据融合和能量均衡研究领域的热点.由于Mobile Agent的访问路径很大程度上影响数据融合的性能和系统能量开销,所以,确定一个有效的Mobile Agent访问路径是一件颇有意义的研究.本文提出一种新的路径规划方法,采用迭代局部搜索的算法获取Mobile Agent对节点区域的访问路径;同时考虑了Mobile Agent迁移时数据负载,中间节点转发数据时实际的能量开销以及对相邻路径节点的利用.通过仿真实验分析表明本文提出的方法在能量消耗、服务时间方面优于现有的一些多路径规划方法.
Compared with the widely used C / S paradigm in wireless sensor networks, the Mobile Agent-based paradigm shows a strong survival advantage.Therefore, as a distributed middleware technology, Mobile Agent has become a wireless sensor network Efficient and autonomous data fusion and energy balance research.As the access path of Mobile Agent greatly affects the performance of data fusion and system energy overhead, so to determine an effective Mobile Agent access path is quite a This paper proposes a new path planning method, which uses iterative local search algorithm to get the access path of Mobile Agent to the node area. At the same time, it takes into account the data load when the Mobile Agent migrates, the actual energy overhead when the intermediate node forwards the data, The use of adjacent path nodes.Experimental results show that the proposed method is superior to existing multi-path planning methods in energy consumption and service time.