Loading…

A Clustering Routing Algorithm for Wireless Sensor Monitoring Network in Irrigation Area

It is the basis for the implementation and scientific management decision of precision irrigation to accurately and comprehensively sense water and rainfall regime, soil moisture content and engineering conditions in irrigation areas and various environmental factors closely related to crop growth....

Full description

Saved in:
Bibliographic Details
Published in:Journal of physics. Conference series 2021-11, Vol.2095 (1), p.12033
Main Authors: Li, Lianguo, Ren, Kang, Fan, Tanghuai, Shen, Keyong, Hu, Rongqun
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:It is the basis for the implementation and scientific management decision of precision irrigation to accurately and comprehensively sense water and rainfall regime, soil moisture content and engineering conditions in irrigation areas and various environmental factors closely related to crop growth. In view of the characteristics of large monitoring range and scattered distribution of measuring points in the irrigation area, based on the analysis of the characteristics of the strip shape layout of the wireless sensor network at the water demand side of the irrigation area, and the limited battery energy and transmission distance under the condition of battery power supply, a clustering routing algorithm based on wireless sensor network for monitoring irrigation area is proposed (known simply as CRAIM algorithm). The formation of clusters, the selection of cluster heads, the routing process between clusters and the sink nodes are studied, and the CRAIM algorithm, EE-LEACH (energy-efficient LEACH) and MMH-LEACH (modified multi-hop LEACH) algorithm are simulated and compared respectively. Experimental results showed that, the new algorithm, CRAIM, has some advantages in the energy consumption of the network.
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/2095/1/012033