一种适用于无线传感器网络的低能耗移动代理路由算法  

An Energy-Efficient Routing Algorithm for Mobile Agents in Wireless Sensor Networks

作　　者：曹涌涛[1] 何晨[1] 王珺[2] 武文权[3] 

机构地区：[1]上海交通大学电子工程系,上海200240 [2]南京邮电大学通信工程系,南京210003 [3]中科院上海微系统与信息技术研究所,上海200050

出　　处：《上海交通大学学报》2006年第3期520-523,共4页Journal of Shanghai Jiaotong University

基　　金：国家自然科学基金资助项目(60272082);上海市科委重大科技攻关项目(05dz15004)

摘　　要：研究了无线传感器网络中移动代理的路由选择问题.根据相邻节点所产生的数据具有强相关性的特点,将多跳网络环境下的路由问题建模成为一个顶点加权的游客问题,并且证明了这是一个NP完全问题.在此基础之上,提出了一种降低能耗的近似算法.仿真结果表明,该算法在节省能耗方面具有更好的性能.The routing problem for mobile agents in wireless sensor networks was investigated, Based on the fact that in densely-deployed sensor networks, the data measurements achieved by one sensor node are highly correlated with its neighbors＇ ones, the routing problem in a multi-hop cluster can be modeled as a vertex-weighted traveling tourist problem （TTP）. A proof that the problem is NP-complete was provided. A new approximation algorithm to solve the problem was presented, The simulation experiments demonstrate that the proposed algorithm is more energy-efficient than two earlier ones.

关 键 词：无线传感器网络 移动代理 路由问题 NP完全问题 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]