稀疏无线传感器网络的路由算法研究

Research on Routing Algorithm of Sparse Wireless Sensor Networks

中文关键词:  无线传感器网络  移动代理节点  旅行商问题  路由算法

英文关键词:wireless sensor network  mobile agent node  traveling salesman problem  routing algorithm

中文摘要:

      为保证移动代理节点在能量受限条件下总路由最短，给出一种基于能量受限移动代理节点的稀疏无线传感器网络路由算法。通过建立移动代理节点路由数学模型，首先根据移动代理节点能量限制条件将整个无线传感器网络划分为不同子集，然后利用旅行商问题的解决方法计算每个子集最短路径，最后所获得的子路径之和即为最优路由。实验仿真结果分析表明：随着网络节点数目增多和移动代理节点能量增加，所给方案的总路由比较接近于理想情况，在实际应用中比较有效且适于推广。

英文摘要:

      In order to make the energy-constrained mobile agent node obtain the minimum total route,a routing algorithm based on energy-constrained mobile agent node for sparse wireless sensor networks is proposed.The mathematical model of the route of mobile agent node is built firstly,and the whole wireless sensor network is split into different subsets according to the energy of the mobile agent node.Then the shortest routes are computed by adopting simulated annealing of traveling salesman problem.Finally,the obtained total route of sub-routes is the optimal route.The analysis of simulation experiment results show that the total route of the proposed scheme is close to the ideal situation along with the increase of the number of nodes and the raise of the energy of mobile agent node.Thus the proposed scheme is very effective in the practice and is propitious to popularize.