随着人们对水环境的日益关注以及无线传感器网络技术的成熟,如何使用无线传感网络对水环境进行监控成为一项重大课题。该文在动态水环境中,基于正方体网格剖分思想提出了一种以熵为尺度来衡量路径稳定性的QoS路由算法(EWSQoS),该算法使用正方体网格对信息收集区域进行剖分,再在此基础上寻找到达Sink节点的最短网格,最后利用“熵”来选择路由,减少了重建路由(或路由修复)的次数,在网络拓扑频繁变化的环境中尽可能地提供QoS保证。经仿真实验与性能分析表明,EWSQOS算法与Long-term、DBR、DTN等算法比较,在路由重建次数、路由成功率、网络能耗、网络延时方面具有更优性能。
How to apply wireless sensor network to monitor the water environment has become an important subject. Based on the theory of square grid partition, this paper proposes a routing algorithm with the yardstick of entropy to evaluate the stability of route in the dynamic water environment. In this algorithm, the information collecting area is subdivided by means of cube grid, the shortest route to sink node in the grid is searched, and the router is chosen by means of entropy to reduce the number of reconstructing routers or repairing routers and possibly provide QoS guarantee in the environment in which network topology ration changes frequently. The stimulated experiment and performance analysis prove that EWSQoS algorithm takes more advantage than Long-term, DBR, and DTN algorithms in the fields of the number of reconstructing routers, success rates of routers, energy consumption of network, and network latency.