在动态水环境中基于熵的无线传感器网络路由算法  

Routing Algorithm of Wireless Sensor Network Based on Entropy Standard in Dynamic Water Environment

作　　者：邹赛[1,2] 汪文勇[2] 唐勇[1] 张骏[1] 

机构地区：[1]电子科技大学计算机科学与工程学院,成都611731 [2]重庆电子工程职业学院软件学院,重庆沙坪坝区401331

出　　处：《电子科技大学学报》2014年第1期82-87,共6页Journal of University of Electronic Science and Technology of China

基　　金：国家发改委CNGI二期项目(CNGI-09-01-07);国家863项目(2008AA01A303);国家973项目(2009CB320505);2014年重庆市教委科学技术研究项目;重庆市"十二五"教育规划课题(2013-ZJ-077);教育部中国移动科研基金(MCM20123041;MCM20122011);重庆市科技计划(CSTC2013yykfA40003)

摘　　要：随着人们对水环境的日益关注以及无线传感器网络技术的成熟,如何使用无线传感网络对水环境进行监控成为一项重大课题。该文在动态水环境中,基于正方体网格剖分思想提出了一种以熵为尺度来衡量路径稳定性的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.

关 键 词：熵 网格剖分 QOS 传感器网络 

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