Routing Algorithm of Wireless Sensor Network Based on Entropy Standard in Dynamic Water Environment
doi: 10.3969/j.issn.1001-0548.2014.01.014
- Received Date: 2012-10-30
- Rev Recd Date: 2013-09-10
- Publish Date: 2014-02-15
-
Key words:
- entropy /
- grid partition /
- quality of service /
- sensor network
Abstract: 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.
Citation: | ZOU Sai, WANG Wen-yong, TANG Yong, ZHANG Jun. Routing Algorithm of Wireless Sensor Network Based on Entropy Standard in Dynamic Water Environment[J]. Journal of University of Electronic Science and Technology of China, 2014, 43(1): 82-87. doi: 10.3969/j.issn.1001-0548.2014.01.014 |