【摘要】 研究了无线传感器网络中移动代理的路由选择问题.根据相邻节点所产生的数据具有强相关性的特点,将多跳网络环境下的路由问题建模成为一个顶点加权的游客问题,并且证明了这是一个NP完全问题.在此基础之上,提出了一种降低能耗的近似算法.仿真结果表明,该算法在节省能耗方面具有更好的性能.更多还原

【Abstract】 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.更多还原