一种有效的稀疏无线传感器网络路由方案

An effective routing scheme of sparse wireless sensor networks

稀疏无线传感器网络中节点之间距离过远,使得移动代理节点成为最有效的数据收集方式,然而移动代理节点由于能量限制无法在一次数据收集中到达网络所有节点进行数据收集。为保证在能量受限的移动代理节点总路由路径最短,给出了一种稀疏无线传感器网络能量受限移动代理节点的路由方案。首先构建移动代理节点的路由数学模型,然后根据移动代理节点初始能量将无线传感器网络划分成不同的子集,最后采用旅行商人问题的模拟退火算法计算出每个子集最短路由,全部子路由的集合即最优路由。仿真及其分析结果表明:随着网络节点个数增多和移动代理节点能量增大,所给方案的总路由能够比较接近于理想情况,在实际应用中比较有效且适于推广。

Mobile agent node has become the most efficiency way of data collection in sparse wireless sensor networks, because the distance of the nodes is too far. However, the mobile agent node could not access all the nodes to gather the data in a routing travel because of energy-constrained. In order to make the energy-constrained mobile agent node obtain the minimum total route, an effective routing scheme of energy-constrained mobile agent node in sparse wireless sensor networks was presented. The mathematic model of the route of mobile agent node was built firstly, and then the whole wireless sensor network was split into different subsets according to the energy of the mobile agent node. Then the shortest routes were computed by adopting simulated annealing of traveling salesman problem. Finally, the obtained total route of sub-routes was the optimal route. The analysis results of simulation and performance show that the total route of the presented 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. So the presented scheme is very effective in the practice and is propitious to popularize.