IEEE SENSORS JOURNAL, VOL. 21, NO.

22, NOVEMBER 15, 2021 24967

Smart Agriculture Wireless Sensor Routing

Protocol and Node Location Algorithm Based
on Internet of Things Technology
Dingzhu Xue and Wei Huang

Abstract —With the increase of the world’s population, peo-

ple’s demand for food is also increasing. However, due to
various reasons, traditional agriculture cannot make full use
of the land. Therefore, to ensure the food supply of the
global population and promote the development of agricul-
ture, the implementation of smart agriculture has become
essential. The purpose of this research work is to study the
smart agricultural wireless sensor routing protocols and node
positioning algorithms based on the Internet of Things (IoT)
technology. The present study first analyzes the classification
of wireless sensor routing protocols. Based on the analysis
and research of the Low Energy Adaptive Clustering Hierarchy
protocol, the influence of factors such as node energy and
distance are considered, and the network’s Low Energy Adaptive Clustering Hierarchy routing protocol is improved and
extended its life. It introduced the classification of positioning algorithm, and then analyzed the DV-HOP positioning
algorithm. Aiming at the problem of low positioning accuracy and large error of DV-HOP algorithm, an improved method
of DV-HOP algorithm based on average HOP distance was proposed to make positioning more precise. Experimental
results prove that the improved algorithm proposed in this paper has better performance. By testing the algorithm
proposed in this paper, the improved DV-HOP algorithm reduces the positioning error by 30% compared with the original
DV-HOP algorithm.
Index Terms — Internet of Things, smart agriculture, wireless sensors, routing protocols, node positioning.

I. I NTRODUCTION especially modern agriculture, will be the main growth point

A GRICULTURE is the foundation of the national econ-
omy and harmonious society. For many years, the central
government’s main focus has been closely related to raising
the level of agricultural production. After thousands of years
of development, China’s agricultural level has gradually tran-
sitioned from manual agriculture to mechanized agriculture,
and has steadily realized the industrialization of agriculture.
Sensor, signal processing technology, information technology
has emerged in the field of agricultural production. The
close combination of information technology and agriculture,
Manuscript received July 18, 2020; revised September 8, 2020,
September 26, 2020, and October 21, 2020; accepted October 22, 2020.
Date of publication November 18, 2020; date of current version Novem-
ber 12, 2021. This work was supported by the Guangxi Science and
Technology Program Project of China under Grant GuiKe-AA17202037,
Grant GuiKe-AD19245169, and Grant GuiKe-AD18281072. The asso-
ciate editor coordinating the review of this article and approving it for
publication was Dr. Sumarga K. Sah Tyagi. (Corresponding author:
Wei Huang.)
Dingzhu Xue is with the College of Information and Technol-
ogy, Jilin Agricultural University, Changchun 130118, China (e-mail:
xuedingzhu@jlau.edu.cn).
Wei Huang is with the College of Agriculture, Yulin Normal University,
Yulin 537000, China (e-mail: huangwei@ylu.edu.cn).
Digital Object Identifier 10.1109/JSEN.2020.3035651
of modern agriculture.
A Wireless Sensor Network (WSN) is a multi-hop self-
organizing network composed of a large number of miniature
Sensor Nodes (SN) with limited sensing, computing, commu-
nication, and energy. Resource limitation is a crucial constraint
affecting the widespread use of WSNs. As the foundation of
the Internet of Things (IoT), in the history of the development
of WSNs, energy-efficient data collection routing protocols
have been the focus of research. This is due to the efficient col-
lection of perception data which is prerequisite for intelligent
processing and decision-making. At the same time, when the
WSN senses the environmental change, it is often necessary
to obtain the specific location of the event. Node localization
in the WSN is also an important research direction.
Lin et al. believed that real-time data is usually required
in practical applications; thus, data collection for a spe-
cific trajectory of agricultural product circulation is usually
extensive.Therefore, the authors proposed a spatiotemporal
visualization technique based on clustering raw data points.
The space-time proposed visualization method is applied to
the data analysis and visualization project of location-based
agricultural information technology based on geographic infor-
mation system. This system effectively realized the intuitive
visualization of the entire trajectory during the circulation

1558-1748 © 2020 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission.
See https://www.ieee.org/publications/rights/index.html for more information.

Authorized licensed use limited to: SRM Institute of Science and Technology. Downloaded on August 28,2023 at 05:58:08 UTC from IEEE Xplore. Restrictions apply.
24968
of agricultural products [1]. Ahmed et al. considered that
traditional data collection techniques for WSNs have limited
resources. The authors proposed an adaptive method that can
find the best routing path from source to the receiver when
SN are randomly deployed in a restricted service area with
a single receiver. The authors also found that their proposed
method reduced message communication to find the best
routing path. Therefore, the network consumes less energy
and increases the life of the network [2]. In another study,
Ahmed et al. demonstrated that in most applications of WSNs
(WSN), nodes operate in an unattended environment and are
therefore vulnerable to various attacks. Energy-aware Routing
Protocol (TERP) was proposed that uses a distributed trust
model to detect and isolate nodes that behave abnormally
and fail. The authors noted that compared with existing work,
TERP reduced energy consumption, improved its overall life,
and extended its network life [3].
This paper first analyzes the classification of WSN routing
protocols. Based on the analysis and research of the LEACH
protocol, the influence of factors such as node energy and
distance are considered, and the network’s LEACH routing
protocol is improved. Then, it introduces the classification of
positioning algorithms. The present study also analyzes and
researches the DV-HOP positioning algorithm based on non-
ranging. It analyzes the average hop distance of beacon nodes
and the whole network. The improved method of average
jump distance makes positioning more accurate. Experimental
results prove that the improved algorithm proposed in this
paper has better performance.
Proposed Method
A. Internet of Things
The key technologies of the Internet of Things are as
follows:
1) RFID: Radio Frequency Identification (RFID) is one of
the most promising technologies to realize new intelligent
applications in the IoT framework [4]. RFID is a wireless
communication technology that uses wireless radio frequency
signals to perform non-contact automatic identification and
information read and write operations. Applications of RFID
technology can be seen everywhere in life, such as in bus
management, student management, library management, and
logistics management systems. The identity of the other party
must first be clarified to realize the communication between
people and things, and the RFID technology plays the role of
providing identity for people and objects.
2) Sensor Technology: The concept of the IoT used the
concept of a sensor network as early as it was proposed,
which mainly refers to the interconnection of multiple sensors.
It can be seen that sensor technology occupies an important
position in the IoT [5], [6]. The sensor technology aims to
solve the problem of data acquisition, and converts physical,
chemical and biological analogue signals into digital signals.
It is an intermediary for the connection between things and
the Internet. The sensors mainly include sensors such as
temperature, humidity, pressure, light sensitivity, voltage, and
current. It is equivalent to the tactile system of the IoT,
Authorized licensed use limited to: SRM Institute of Science and Technology. Downloaded on August 28,2023 at 05:58:08 UTC from IEEE Xplore. Restrictions apply.
IEEE SENSORS JOURNAL, VOL. 21, NO. 22, NOVEMBER 15, 2021
Fig. 1. Smart agriculture relationship.
and will sense electrical changes in the object itself and the
environment.
3) Wireless Network Technology: Wireless networks are
networks implemented using wireless communication tech-
nologies, including global voice and data networks with long-
range wireless connections, and networks with short-range
connections [7], [8]. Wireless network technology mainly
plays a bridge between objects and objects in the IoT.
A high-speed and stable network system is essential for data
transmission [9].
B. Smart Agriculture
Smart agriculture is based on the concept of industrial
development and uses information and knowledge as factors
of production. It combines modern agricultural technologies
such as the Internet, the IoT, cloud computing, and BD with
agriculture [10], [11]. New agricultural production method
with intelligent control, precise input and personalized service.
With the application of the Internet of Things, traditional
agriculture is gradually changing to smart agriculture. In the
agricultural management process, real-time monitoring of crop
growth and environmental changes, and the realization of auto-
matic remote control of environmental information are of great
significance for promoting agricultural development [12], [13].
Smart agriculture is a collective term for precision agriculture,
digital agriculture, agricultural Internet of Things, and intelli-
gent agriculture. The relationship is shown in Figure 1.
C. Routing Protocols
1) Classification of Routing Protocols:
a) Plane routing protocol: Planar structures are also called
peer-to-peer structures. The flat routing protocol refers to that
from the perspective of the network structure, all nodes have
the same status in the network routing and have the same
role [14]. The advantage of a flat network structure is that all
nodes have the same status, and the network structure is more
stable. If some nodes are failed or captured by attacks, the
impact on the network is small.
b) Hierarchical routing protocol: Due to the excessive
energy consumption of the traditional planar network, the over-
head of network control will also become very large, which
will cause the various performances of the network to sig-
nificantly decrease [15]. If the network structure is classified,
the resources can be used reasonably and effectively, and the
XUE AND HUANG: SMART AGRICULTURE WIRELESS SENSOR ROUTING PROTOCOL AND NODE LOCATION ALGORITHM 24969

flexibility and extensibility of the network can be improved. network is E, and the average remaining energy of the network
By letting a few nodes assume more functions, such as data is E a , as shown in Equation (3):
collection and forwarding, data fusion, the remaining nodes
E ∗ (1 − r/rmax )
are assigned data collection tasks in turn. It can go to sleep Ea = (3)
during idle periods, which can make propoer use of energy and n
network bandwidth, effectively allocate resources [16], [17]. The probability that each sensor node becomes the CHN
Hierarchical routing generally uses clustering to divide the is also different. Let the residual energy of the i-th node be
network. Each cluster selects one or more cluster heads to E cur and become the CHN probability is P  , as shown in
assume the main communication role. The functions of the Equation (4).
CHN are mainly to collect data of members in the cluster, allo-
P ∗ n ∗ E cur
cate members and resources in the cluster, route calculation, P = (4)
and data fusion. The more classic clustered routing protocols E ∗ Ea
include the LEACH protocol, and the PEGASIS protocol. The Conducive to extending the life of the network. Set the
TEEN protocol, and the APTEEN is developed based on them. distance Ri between the sensor node i and the base station,
c) Geo-location routing protocol: In the practical application as in Equation (5):
of WSNs, it is often necessary to know the location informa- 
tion of the nodes, because the data with location information Ri = (x i − X)2 + (yi − Y )2 (5)
is more of the reference value, and many applications need to
know where and what data is generated [18], [19]. In addi- where (x i , yi ) is the node coordinates and (X, Y) is the base
tion, when managing the network, if you know the location station coordinates.
information, you can plan the network structure well. Let the initial value of the node be E o , and the average
2) Design of Routing Algorithm: The LEACH algorithm can distance between the node and the base station be D ava . The
balance the energy consumption of the WSN to each node, new Ti (n) is as follows (6):
which is beneficial to reducing the energy consumption gen- ⎧
⎪ P E cur 2 Davar 0.2
erated during the entire network operation and improving its ⎪
⎨ 1 − P  × (r mod (1/P  )) ∗ ( E ) ∗ ( R )
o
survival time [20], [21]. Ti (n) =
⎪
⎪ i∈N
It is assumed that the number of nodes in the monitoring ⎩
area is n, the number of clusters in the network is m, i.e., m 0 other wi se
CHNs, and the number of nodes contained in each cluster is (6)
n / m. In the r-th round, let node i be the cluster head. The
value of node is Ti (n). When selecting the CHN, each node New thresholds show that the greater the remaining energy
in the network randomly generates a random number ranging of a sensor node, the greater the probability of being selected
from 0 to 1. If the random number is less than Ti (n), then this as the CHN; the smaller the remaining energy of the sensor
sensor node is elected as the CHN. node, the less the probability of being selected as the CHN.
In each round, each node is elected as the CHN the same The greater the distance between a node and the base station,
number of times. The formula for the threshold Ti (n) of node the new threshold will become smaller, making it less likely
i being elected: to become a CHN, otherwise, the probability will become
⎧ larger.
⎨ m
i∈N
Ti (n) = n − m × (r mod (n/m)) (1)
⎩0 other wi se D. Node Localization Algorithm
1) Classification of Positioning Technology: Range-based
Let P = m / n. Equation (1) becomes Equation (2):
positioning technology is divided into three stages: ranging,
⎧
⎨ P positioning and correction. Ranging is the most important
i∈N
Ti (n) = 1 − P × (r mod (1/P)) (2) stage, which has a great impact on the accuracy of positioning.
⎩
0 other wi se With the distance, the position of the node can be deter-
mined according to the three-sided or multilateral positioning
In formulas (1) and (2), N represents a set of nodes that method [23]. Here are some important ranging methods based
have not been elected as the CHN in the recent 1 / P round. on ranging:
After n / m rounds, the set N is cleared, and the network starts a) Signal strength (RSSI): RSSI method determines the
to establish a new cluster. All nodes compete to become the distance by using the relationship between signal attenuation
CHN, and complete the establishment of the cluster. and distance during signal propagation. The receiver estimates
When applying the LEACH algorithm, each sensor node the distance from the receiver to the transmitter based on the
in a WSN has the same configuration and has the same received signal strength [24], [25]. The mathematical model
initial energy [22]. The improved algorithm is described in of the relationship between signal attenuation and distance is
detail as follows: When the sink node receives information, as follows:
it estimates the information of the sensor nodes. Assume that
the maximum number of rounds performed by the network is d
P L(d) = P L(d0 ) − 10n lg( ) − Xσ (7)
rmax . In the r-th round, the total energy of the nodes in the d0

Authorized licensed use limited to: SRM Institute of Science and Technology. Downloaded on August 28,2023 at 05:58:08 UTC from IEEE Xplore. Restrictions apply.
24970
b) Signal propagation time / time difference round trip time
(TOA/TDOA/RFOF): This method requires strict time synchro-
nization between the transmitter and receiver, otherwise, it will
bring great errors. Calculated as follows:
d = (T1 − T0 ) × V
where T1 is the time when the transmitter sends the signal; T0
is the time when the receiver receives the signal.
RTOF. The distance calculation formula is:
[(T3 − T2 ) + (T1 − T0 )] × V
d =
2 k polygon vertices; (X est , Yest ) is the coordinates of the
[(T3 − T0 ) + (T2 − T1 )] × V
= (9)
2 2) Improvement of DV-HOP Positioning Algorithm:
TDOA method uses two signals with different propagation
speeds, such as ultrasound and radio frequency signals. The
transmitter sends radio frequency signals at T0 , the receiver
receives at T1 , the transmitter sends ultrasonic signals at T2 ,
and the receiver receives at T3 . The calculation formula of
TDOA is:
Vr f − Vus
d = [(T3 − T1 ) + (T2 − T0 )] × (10)
Vr f Vus
c) Received Signal Phase Difference (PDOA): The received
signal phase difference PDOA (phase difference of arrival)
method is to obtain the round-trip propagation time of a signal
by measuring the phase difference of the signal.
ψ c ψ ψ value cannot be obtained, it will affect the size of the posi-
d =c = =λ
2π f c f c 2π 2π
where f c is the frequency of the signal; λ is the wavelength of
the signal; ψ is the phase difference between the transmitted
signal and the received signal; and the range of d is [0, λ].
If the distance between the transmitter and the receiver is n
times the λ, the following formula is used:
ψ
d=λ + nλ (12)
2π
Using this method requires knowing the range of d to
determine the value of n, and finally to determine the value
of d.
d) Positioning technology without ranging: The typical
ranging-free positioning algorithms are DV-hop positioning
algorithm, centroid positioning algorithm, etc. The following
describes their working principles.
The DV-hop positioning algorithm is divided into three
steps:
When an anchor node receives the hop count and position
information of all other anchor nodes, it can estimate the
average distance of each hop. The average distance per hop
formula is as follows:

(X i − X j )2 + (Yi − Y j )2
j  =i
di =  (13)
hi j
j  =i
In the formula, di is the estimated average distance per
hop of anchor node i; (X i , Yi ), (X j , Y j ) is the coordinates
Authorized licensed use limited to: SRM Institute of Science and Technology. Downloaded on August 28,2023 at 05:58:08 UTC from IEEE Xplore. Restrictions apply.
IEEE SENSORS JOURNAL, VOL. 21, NO. 22, NOVEMBER 15, 2021
of anchor nodes i and j; h i j is the number of hops between
two anchor nodes.
The centroid positioning algorithm means that the anchor
node periodically broadcasts its own position information, and
the position information includes the anchor node’s own ID
(8) number and coordinate information. The centroid formula is
as follows:
x 1 +x 2 + ... + x k y1 + y2 + ... + yk
(X est , Yest ) = ( , ) (14)
k k
where (x 1 , y1 ), (x 2 , y2 ), . . . , (x k , yk ) is the coordinates of the
polygon centroid.
a) Pros and cons of DV-HOP positioning algorithm: Advan-
tages of the DV-HOP algorithm: First, the DV-HOP algorithm
uses connectivity to run positioning calculations, and does not
have high requirements for the network hardware equipment.
Second, the DV-HOP algorithm is a relatively simple position-
ing algorithm. If there is no great need for positioning accuracy
in the application, and the error caused by the measurement
distance can meet the positioning requirements, this algorithm
can be applied. Third, the DV-HOP algorithm can improve
the positioning accuracy of the algorithm under the premise
that the anchor nodes are relatively evenly distributed in some
special scenarios.
Disadvantage of DV-HOP algorithm: if the minimum hop
(11)
tioning error. The path between each node in the network is
mostly a broken line segment, but the hop distance obtained
by this algorithm replaces the actual distance, it adds one to
the hop value, and the hop between nodes The more you will
count. When the minimum jump value is not obtained, an error
will occur in the calculated correction value, and the error will
continue to accumulate.
b) Modify DV-HOP algorithm: The calculation of the anchor
node’s correction value uses other anchor nodes except itself,
which can not truly reflect the density distribution around
itself. When the sensor nodes in the network communicate,
there may be some unknown nodes in the shortest path
between the anchor nodes, which makes the unknown nodes
become intermediate nodes between the beacon nodes.. How-
ever,most sensor nodes are on a polyline. The existence of
this method results in the phenomenon that some paths overlap
between nodes. The anchor nodes first calculate the correction
value, and then calculate the hop distance of each anchor node,
Equation (15):

(x i − x j )2 + (yi − y j )2
D= (15)
hi j
where i and j are different beacon nodes, the coordinates of
(x i , yi ), (x j , y j ) are the coordinates of nodes i and j, and h i j
is the hop value between beacon nodes i and j. The anchor
node correction value is modified to an average of the original
correction value calculated by the formula (13) and the jump
distance calculated by the formula (15). The average value Z
XUE AND HUANG: SMART AGRICULTURE WIRELESS SENSOR ROUTING PROTOCOL AND NODE LOCATION ALGORITHM
is the new correction value. Equation (16):
L+D
Z= (16)
2
After the new correction value of the anchor node is
obtained, the average hop distance of the entire network is
calculated, that is, the value of formula (16) is averaged. Then
analyze the error of the anchor node’s correction value. Let
the relative error of the average hop distance of the anchor
node i be e, as shown in Equation (17):
 |di j −destimate |
|di j |×hopij
i = j
ei =
n
Among them, di j is the distance between anchor nodes, n is
the number of anchor nodes in the network, a is the average
hop distance of the entire network, hopi j is the hop number
between anchor nodes, and destimate is the estimated distance
between anchor nodes. Equation (17) is calculated according
to the idea of finding the distance of unknown nodes. After
the error e of the beacon node correction value is obtained,
e is averaged to obtain the average hop distance error of the
entire network. The average hop distance error of the entire
network is shown in Equation (18):
 anchor nodes.
e Cost. The time cost refers to the time required for net-
eavg = (18)
n work implementation; the space cost refers to the algorithm’s
After obtaining the average hop distance error of the entire
network, it is improved again to obtain the new average hop
distance aa of the network, as shown in Equation (19):
aa = a + x × eavg
where x is a parameter, its size depends on the actual sit-
uation. This article sets the parameter size to 0.3. At this
time, the unknown nodes in the network multiply according
to the average hop distance and hop number obtained by
equation (19) to find their own coordinate position.
II. E XPERIMENTS
A. Data Collection
One hundred sensor nodes are randomly arranged in a
100m × 100m sensing area. When the energy of a node is
less than zero, it is in a dead state. When the death of the
nodes begins in the network, the network begins to die.
B. Experimental Environment
The experiments in this article were carried out on a note-
book with Windows 10 and 16G, 256G SSD memory. Present
study uses MATLAB software for algorithm simulation.
C. Evaluation Index
Evaluation index of node localization algorithm:
Positioning accuracy. Only positioning that meets the
requirements of the event can be accepted by personnel.
The accuracy is generally related to the error value of the
positioning result. The smaller the error value, the greater
the positioning accuracy. On the contrary, the larger the error
value, the smaller the positioning accuracy.
Authorized licensed use limited to: SRM Institute of Science and Technology. Downloaded on August 28,2023 at 05:58:08 UTC from IEEE Xplore. Restrictions apply.
24971
Fig. 2. Comparative analysis of life cycle test results.
(17)
Node density. It is generally expressed by the average
connectivity of the network. When the node density is high,
unknown nodes can collect more information, which can make
the calculation results more accurate.
Beacon node density. The higher the density of the beacon
nodes, the higher the accuracy of the calculation results.
However, because the beacon nodes use some methods to
obtain the geographic location, the hardware requirements are
higher and the cost is higher than that of ordinary nodes.
Therefore, there must be a certain limit on the number of
requirements for the number of nodes and hardware condi-
tions; the capital cost refers to the implementation cost of the
algorithm.
Power consumption. Node energy and hardware conditions
(19)
are limited, so the calculation, communication and storage of
the positioning algorithm should not be too much under the
condition of ensuring the accuracy of the calculation results.
III. D ISCUSSION
A. Analysis of Routing Protocols in WSNs
1) Comparative Analysis of Life Cycle Test Results: The
so-called dead node is the node that is exhausted. The com-
parative analysis of the life cycle test results of the algorithm
proposed in this paper and the LEACH algorithm is shown in
Figure 2.
The number of rounds of death was 2,500. The algorithm
in this article starts to show that the number of dead nodes
is 2500, the number of rounds when the dead node reaches
10% is 3000, the number of rounds when the death of the
node reaches 90% is 4,500, and the number of rounds where
the nodes are dead It was 5000 rounds. So, the algorithm in
this paper has improved the network survival time a lot, and it
can increase the network service life better than the LEACH
algorithm.
2) Comparative Analysis of the Remaining Energy Test
Results: Node energy and hardware conditions are limited,
so the calculation, communication and storage of the posi-
tioning algorithm should not be too much under the condition
of ensuring the accuracy of the calculation results. The com-
parison and analysis of the remaining energy test results of the
algorithm proposed in this paper and the LEACH algorithm
are shown in Table I and Figure 3.
24972
TABLE I
C OMPARATIVE A NALYSIS OF R ESIDUAL E NERGY T EST R ESULTS
Fig. 3. Comparative analysis of residual energy test results.
TABLE II
C OMPARATIVE A NALYSIS OF P OSITIONING
E RRORS OF U NKNOWN N ODES
Fig. 4. Comparative analysis of positioning errors of unknown nodes.
As can be seen from Table I and Figure 3, when the initial
energy value of the set nodes is the same, the trend of the
energy reduction of the LEACH algorithm is greater than the
trend of the algorithm in this paper, and the energy is quickly
consumed.
B. Test Results Analysis of WSN Positioning Algorithm
1) Unknown Node Error Analysis: When the communication
radius of the nodes in the network is 30m and the number of
beacon nodes is 10, the comparative analysis of the positioning
errors of unknown nodes is shown in Table II and Figure 4.
It can be known from Table II and FIG. 4 that FIG. 4 shows
a positioning error (PE) graph of each unknown node obtained
in a simulation experiment of the DV-HOP algorithm and the
DV-HOP algorithm with improved average hop distance under
certain conditions. In the figure, the ordinate represents the
distance deviation from the actual coordinates, and the abscissa
represents the node number.
Authorized licensed use limited to: SRM Institute of Science and Technology. Downloaded on August 28,2023 at 05:58:08 UTC from IEEE Xplore. Restrictions apply.
IEEE SENSORS JOURNAL, VOL. 21, NO. 22, NOVEMBER 15, 2021
TABLE III
C OMPARATIVE A NALYSIS OF P OSITIONING E RRORS
B ETWEENTWO A LGORITHMS
Fig. 5. Comparative analysis of positioning errors between two
algorithms.
The distance between the node and the abscissa is in linear
proportion with PE of the node. It can be seen from the
simulation diagram that the DV-HOP algorithm with improved
average hop distance has smaller positioning error than the
DV-HOP algorithm with the same background.
2) Analysis of Comparison Results of Positioning Errors: To
study how the total number of sensor nodes stays the same
and the anchor nodes occupy different proportions of the total
SN in the network, what is the result of the positioning error
between the improved DV-HOP and DV-HOP? This article sets
the total number of sensor nodes to 100. The communication
radius is R = 30m. The comparative analysis of the positioning
error between the improved DV-HOP and the DV-HOP is
shown in Table III and Figure 5.
From Table III and Figure 5, when the total number of sen-
sor nodes and communication radius is constant, the number
of beacon nodes continues to increase, the error generated by
the improved algorithm in this paper is also slightly reduced.
In addition, the improved DV -HOP produces a positioning
error smaller than the original DV-HOP algorithm when the
communication radius is constant. Compared with the original
DV-HOP, the improved DV-HOP reduces the positioning error
by about 30%.
IV. C ONCLUSION
(1) This article gives a detailed description of the DV-
HOP algorithm, describes its implementation steps in detail
and studies the shortcomings of the DV-HOP algorithm, and
studies the improvement of the DV-HOP algorithm from two
aspects. The present study also analyzes the positioning results
XUE AND HUANG: SMART AGRICULTURE WIRELESS SENSOR ROUTING PROTOCOL AND NODE LOCATION ALGORITHM
of modified hop distances, specifically the source of the
error of the average distance of anchor nodes. Based on this
modification, the average hop distance of the entire network
is obtained, which is closer to the actual average hop distance
between nodes. The error of the average hop distance of the
whole network is obtain.. According to the above information
and using the new formula, the new correction value of the
anchor node is obtained.
(2) Present work proposes improvements for the short-
comings of typical LEACH routing protocols. Specifically,
it optimizes its cluster head selection mechanism during its
cluster establishment stage, and it takes into account the node’s
energy and its radius.It avoids sensor nodes with too low
energy from acting as CHNs to disable and making CHNs
to not focus on one area. It also affect the life of the network,
extend the life cycle, and finally use MATLAB software to
make simulations and analyze the results.
(3) There are still some shortcomings in the proposed study,
and further research can be conducted on these issues: the
research content of the chapter is only for the basic knowledge
of the entire WSN. There are still other related technologies
that need to be studied in subsequent work. When analyzing
the LEACH routing protocol, lack of energy and location of
the nodes in the selection of cluster heads are considered.
finally, it studies how to provide energy and how to arrange
the nodes to increase the coverage..
R EFERENCES
[1] L. Lin, P. Yu, and Z. Li, “Using clustering algorithm to visualize spatial-
temporal Internet of Things data in process of agricultural product
circulation,” Nongye Gongcheng Xuebao/Trans. Chin. Soc. Agricult.
Eng., vol. 31, no. 3, pp. 228–235, 2015.
[2] M. B. Ahmed, S. Gonnade, and D. Xaxa, “Energy-efficient protocols
for WSNs,” Int. J. Comput. Appl., vol. 44, no. 3, pp. 9–11, 2016.
[3] A. Ahmed, K. Bakar, and M. Channa, “TERP: A trust and energy aware
routing protocol for wireless sensor network,” IEEE Sensors J., vol. 15,
no. 12, pp. 6962–6972, Dec. 2015.
[4] Y. Chen, S. Zhao, and Y. Zhou, “Research on intelligent agricultural
planting system based on Internet of Things technology,” J. Comput.
Commun., vol. 06, no. 06, pp. 54–60, 2018.
[5] Z. Hongbo and G. Wei, “Seasonal agricultural products distribution and
traceability system based on the RFID Internet of Things,” Int. J. Smart
Home, vol. 10, no. 11, pp. 1–14, Nov. 2016.
[6] J. Li, “Design and realization of greenhouse sensor intelligent manage-
ment system based on Internet of Things,” Int. J. Online Eng., vol. 13,
no. 05, p. 80, May 2017.
[7] C. Chen and X. Xu, “Design and application of traceability and
supervision platform for broiler based on Internet of Things,” Trans.
Chin. Soc. Agricult. Eng., vol. 33, no. 5, pp. 224–231, 2017.
[8] R. U. Onyeneke, C. O. Igberi, C. O. Uwadoka, and J. O. Aligbe, “Status
of climate-smart agriculture in Southeast Nigeria,” GeoJournal, vol. 83,
no. 2, pp. 333–346, Apr. 2018.
[9] I. Cardei and M. Cardei, “Energy-efficient connected-coverage in
WSNs,” IEEE Trans. Wireless Commun., vol. 15, no. 12, pp. 8449–8462,
Jan. 2016.
[10] Z.-T. Li, Q. Chen, and G. M. Zhu, “A low latency, energy efficient
MAC protocol for WSNs,” Int. J. Distrib. Sensor Netw., vol. 2015, no. 6,
pp. 1–9, 2015
[11] S. Bebortta, D. Senapati, and N. Rajput, “Evidence of power-law
behavior in cognitive IoT applications,” Neural Comput. Appl., vol. 32,
pp. 16043–16055, May 2020.
[12] Z. Chen, A. Liu, and Z. Li, “Distributed duty cycle control for delay
improvement in WSNs,” Peer Peer Netw. Appl., vol. 10, no. 3, pp. 1–20,
2016.
[13] Z. Xu, C. Cheng, and V. Sugumaran, “Big data analytics of crime pre-
vention and control based on image processing upon cloud computing,”
J. Surveill. Secur. Saf., vol. 1, pp. 16–33, May 2020.
Authorized licensed use limited to: SRM Institute of Science and Technology. Downloaded on August 28,2023 at 05:58:08 UTC from IEEE Xplore. Restrictions apply.
24973
[14] S. Chelbi, M. Abdouli, and M. Kaddes, “An unequal cluster-based
routing protocol based on data controlling for WSN,” Int. J. Elect.
Comput. Eng., vol. 6, no. 5, pp. 2403–2414, 2016.
[15] R. Kumar and D. Kumar, “Multi-objective fractional artificial bee colony
algorithm to energy aware routing protocol in wireless sensor network,”
Wireless Netw., vol. 22, no. 5, pp. 1461–1474, Jul. 2016.
[16] A. Pannu and D. Kumar, “Clustering and general self-organized tree-
based energy-balance routing protocol for wireless sensor network
(CGSTEB),” Int. J. Comput. Appl., vol. 118, no. 19, pp. 45–49,
May 2015.
[17] N. Chandra, A. Kumar, and R. Yadav, “A survey: Wireless sensor
network and its routing protocol,” Int. J. Comput. Appl., vol. 130, no. 11,
pp. 41–45, Nov. 2015.
[18] J. Wu, X. Feng, H. Zhang, and W. Lv, “Design and analysis of clus-
tering routing protocol in wireless sensor network of frozen food,” Int.
J. Online Eng., vol. 13, no. 12, p. 37, Dec. 2017.
[19] L. Kong, J.-S. Pan, V. Snáel, P.-W. Tsai, and T.-W. Sung, “An energy-
aware routing protocol for wireless sensor network based on genetic
algorithm,” Telecommun. Syst., vol. 67, no. 3, pp. 451–463, Mar. 2018.
[20] B. Patel and J. Munjani, “Chain based routing protocol for wireless
sensor network,” Int. J. Comput. Appl., vol. 134, no. 4, pp. 21–24,
Jan. 2016.
[21] Y. Chen, S. Lu, and J. Chen, “Node localization algorithm of wireless
sensor networks with mobile beacon node,” Peer Peer Netw. Appl.,
vol. 10, no. 3, pp. 1–13, 2016.
[22] L. Yun-Ting, Z. Si-Ying, and J. Yuan-Wei, “Non-line of sight node
localization algorithm based on particle swarm optimization for wireless
sensor networks,” Control Decis., vol. 30, no. 6, pp. 1106–1110, 2015.
[23] S. Jia and C. Yang, “Received signal strength indicator node localization
algorithm based on constraint particle swarm optimization,” Telkomnika,
vol. 13, no. 1, p. 221, Mar. 2015.
[24] X. Wu, “A range-free node localization algorithm based on potential
space self-definition and local neighbor selection in WSN,” J. Inf.
Comput. Sci., vol. 12, no. 3, pp. 1113–1123, Feb. 2015.
[25] S. K. Rout, A. K. Rath, and C. Bhagabati, “Energy efficient dynamic
node localization technique in wireless sensor networks,” Indian J. Sci.
Technol., vol. 10, no. 15, pp. 1–8, 2017.
Dingzhu Xue was born in Nongan, Jilin, China,
in 1981. He received the master’s degree from
Jilin University, China. Now, he works at the
College of Information and Technology, Jilin Agri-
cultural University. His research interests include
computational intelligence and intelligent image
processing.
Wei Huang was born in Yunmeng, Hubei, China,
in 1990. She received the master’s degree from
Guangxi University, China. Now, she works at the
College of Agriculture, Yulin Normal University,
as an Associate Research Fellow. Her research
interests include function agriculture and intelli-
gent agriculture.