信息与控制2017，Vol.46Issue(3)：296-303,8.DOI:10.13976/j.cnki.xk.2017.0296
WSN中基于迭代局部搜索的Mobile Agent路径规划方法
Itinerary Planning of Mobile Agent Based on Iterated Local Search in Wireless Sensor Network
摘要
Abstract
Compared with the client/server computing paradigm, which is traditionally widely used, the computing paradigm based on mobile agent provides many powerful advantages in wireless sensor networks.Therefore, the mobile agent as a distributed middleware technology is the subject of this research for efficient automatic data aggregation and energy balance in wireless sensor networks.As the mobile agent′s itinerary greatly influences the performance of data aggregation and the overall energy consumption, creating an efficient mobile agent′s itinerary is meaningful.Thus, a novel itinerary planning is proposed in this paper.This approach uses iterated local search algorithm to plan a visited itinerary for every mobile agent.This schedule not only takes into account the data loading and actual energy consumption when the mobile agent traverses some intermediate nodes and forwards data by these nodes, but it also makes full use of some nodes from a disjoint itinerary to minimize the overall itinerary cost.Simulation experiments show that this proposed approach performs better than other existing multi-itinerary approaches in terms of energy consumption and service time.关键词
无线传感器网络/数据融合/移动代理/多路径规划/迭代局部搜索Key words
wireless sensor network (WSN)/data aggregation/Mobile Agent/multi-itinerary planning/iterated local search分类
信息技术与安全科学引用本文复制引用
屈应照,胡晓辉..WSN中基于迭代局部搜索的Mobile Agent路径规划方法[J].信息与控制,2017,46(3):296-303,8.基金项目
国家自然科学基金资助项目(61163009) （61163009）
甘肃省科技计划资助项目(144NKCA040) （144NKCA040）
