CR-MDC: A Method of Constrained Route for Avoiding Congestion of the Satellite Sensor Network for Agriculture

Abstract

In recent years, wireless sensor networks have been widely employed in monitoring agriculture. With social development, large-scale agriculture monitoring by satellite sensor network attracts increasing concerns as well as the transmission problem of plentiful agriculture data. In this paper, we propose a new method of constrained route based on the metric of delay and capacity (CR-MDC) to find route path in satellite sensor network, with the aim of achieving congestion avoidance of network for transferring a large amount of data while monitoring large-scale agriculture. We model the rosette constellation network according to network characteristics through a discrete-time figure and formulate the scheme as a binary integer programming problem in consideration of time-variant parameters, for example, link capacity and link delay. The performance of the constrained route algorithm is compared with the Dijkstra-based routing protocols proposed in existing literature. Moreover, an improved CR-MDC under a route similarity constraint is developed to reduce the handoff times in adjacent slots. Simulation results show that the proposed scheme exhibits lower blocking probability and maximum link utilization but higher average network delay than Dijkstra-based routing while the improved CR-MDC has a higher route similarity than CR-MDC.

1. Introduction

Agriculture is the foundation of human life. Roughly 37% of earth's land is today employed for agricultural purposes, with about 11% used for growing crops and the reminder for pasture. However, with increasing population throughout the world and the need for increased agricultural production, the improved management of the world's agricultural resources is required. So reliable and timely information about not only the types, but also the quality, quantity, and location of agricultural resources is quite necessary for the countries which take agriculture as main financial source, which can assist in making timely management decisions that affect the outcome of the current crops. Wireless sensor networks (WSN) have been applied to agriculture for collecting those agricultural data for a long time, such as agricultural irrigation, fertilization, pest control, greenhouse cultivation, and livestock breeding, due to the small size and facile deployment with no need for manual intervention. However, it is quite hard to obtain information of large-scale agriculture for traditional WSN due to the limited energy and deployment area. But it is necessary to monitor and regulate large-scale agriculture for production increase. Satellite sensor network provides information collection and supply in large-scale time and space and enhances future WSN-based applications with various requirements of quality of service (QoS) [1]. But enormous amounts of data transferred on satellite sensor network for the large-scale monitoring may result in link block and network congestion that affects the data reliability with the change of the link capacity and delay over time because of the fast-movement of the satellites. Therefore it is greatly significant to study how to avoid congestion of the satellite sensor network in agricultural application.

In this paper, we modeled the satellite sensor network through a discrete-time figure in agriculture and proposed a new method of constraint route to avoid congestion. The remainder of the paper is organized as follows: in next section, we review the applications on agriculture of wireless sensor network, including the ground wireless sensor network and the satellite sensor network. Low orbit sensor-equipped satellites can provide high resolution image of agriculture and satellite constellations achieve a quasi-instantaneous global coverage [2]. Thus, a low orbit rosette constellation is chosen for large-scale agriculture monitoring. And in Section 3, the characteristics of the LEO (Low Earth Orbit) rosette constellation have been discussed. The CR-MDC aimed at avoiding congestion is proposed in Section 4, according to the change of the distance and propagation loss of the satellite link. Section 5 presents the performance evaluation of the route and the improved CR-MDC followed by the conclusion in the last section.

2. Related Work

2.1. Ground Wireless Sensor Network for Agriculture

Ground wireless sensor network has been applied to obtain agricultural information in real-time in agriculture since 1990s [3], such as precision agriculture, smart agriculture, and information-intensive agriculture [4]. The information of weather, soil moisture, and crops growth is accumulated from sensor nodes arranged in the monitored area, which is used to help regulators find existing problems timely and position problematic area precisely. These data, in turn, influence management and policy decision-making. So, agricultural services like irrigation, fertilization, pest control, greenhouses planting, and animal and pastures monitoring are all taken into consideration in application domain of ground wireless network.

Lots of literatures reported how to utilize the WSN to improve irrigation in agriculture. Those studies in [5–9] constructed different agricultural irrigation systems to control irrigation valves and adjust the irrigation frequency and intensity with the information collected by wireless sensor network. The wireless network also has been widely used in fertilization, pest control, and greenhouses cultivation. For instance, in [10], an automated fertilizer applicator was built using the information of plants collected and analyzed by GPS technology, real-time sensors, and Bluetooth technology. The applications of real-time sensors in pest control were introduced in literatures [11, 12]. As for greenhouses cultivation, the project was designed to improve the production and reduce energy consumption in [13, 14] using wireless sensor network. Furthermore, in order to build a smart cattle monitoring system especially at large scale, various projects were developed with sensor nodes like the project based on mobile ad hoc wireless sensor network presented in literature [15].

In spite of wide applications, there are still many limitations for traditional wireless sensor network, such as the limited capacity, vulnerable nodes. And in many cases agriculture is widely scattered, and it is quite hard to deploy ground wireless sensor network to monitor crops in such a huge range. Not only will a huge amount of human and material resources be wasted but also the reliability of data cannot be guaranteed. The limited monitoring range of the ground wireless sensor network has been the most significant restriction.

2.2. Satellite Sensor Network for Agriculture

The necessity of using the satellite sensor network on agriculture comes from the applications’ requirements and the characteristics of the available satellite technology. A variety of military and civilian satellites have been launched since 1950s before remote sensing technology appeared. And some of them have been applied to monitor large area agriculture. For example, the Large Area Crop Inventory and Experiment project to evaluate the planting area and yield of wheat was implemented from 1974 to 1977 [16] and it was the first time that remote sensing satellites were used in agricultural monitoring. Then several useful projects were published covering the Global Monitoring for Environment and Security project whose responsibility was monitoring the global agriculture started by European Union in 2003 [17], the use of remote sensing satellite for obtaining the temporal and spatial distribution of paddy in Mekong Delta [18], satellite applications to estimate crop losses affected by floods [19], and so forth. Recently, GaoFen1 satellite was used to monitor pastures productivity in Qinghai province providing important data for grassland ecological construction and protection [20]. At present, many countries have undertaken various projects of monitoring spatial patterns of crops with remote sensing satellites and the researches have expanded from a single crop acreage monitoring to multiple cropping pattern.

Remote sensing satellites used for agricultural monitoring in the past usually forward pictures taken by the sensors to the earth when the earth station and the satellite are in sight. With the development of precision agriculture, however, many big traffic and real-time multimedia services are appearing in agriculture, which make it not enough to monitor agriculture just by single remote sensing satellite. Satellite constellation network which is composed of a series of satellites with similar types and functions can solve the problem very well. Such a constellation can be considered to be a number of satellites operating together under coordinated control, so that they could provide global continuous coverage. So it is much more suitable to transfer real-time business like video and audio than single sensor satellite. Moreover, a LEO satellite constellation also can provide more system capacity by frequency reuse across its coverage [21]. Rosette constellations are described to exhibit better worldwide coverage properties [22]. Besides, low transmission delay and high capacity are also benefit for large-scale agriculture monitoring.

But congestion is still needed to be considered in LEO satellite network. Firstly, the large-scale agriculture monitoring will generate huge amounts of data, such as the Global Observing System which is used for global monitoring [23]. And then although satellite sensor network has high capacity, it changes over time with the movement of satellite. And it may block data transmission when the capacity reaches the minimum value. Finally, in LEO satellite mobile communication systems, frequent handover requests exist because of the fast moving of the satellites. The problem of frequent switching has a great influence on real-time and TCP operations, especially in real-time precision agriculture, because it requires retransmission of lost packets, which substantially increases the risk of congestion.

3. The Characteristics of LEO Rosette Constellation

The rosette constellation has developed extensively because of its continuous worldwide coverage. It is used for tilted orbit constellations such as Globalstar, SpaceWay NGSO, and Celestri [24]. Compared with polar-orbiting constellation, rosette constellation has very symmetric orbits and needs fewer satellites in providing equivalent coverage performance. This rosette constellation has always been described as $(N, P, m) : β$ , where β is the inclination, N is the total number of satellites, p is the number of equally spaced planes, and m is the relative spacing between satellites in adjacent layers. The change in true anomaly (in degrees) for equivalent satellites in neighboring planes is equal to $m * 360 / N$ . Satellites in the same layer are connected to each other via Intersatellite Links (ISLs), whereas different layers communicate over Interorbital Links (IOLs). Each satellite can contain two ISLs between two satellites in the same layer and at least two IOLs between satellites in different orbital layers when we determine the appropriate parameters for constellation construction [25].

Let W be the rosette constellation created with the notation $(30,5, 1)$ : $β = 60$ ° [26] and the orbital altitude of 1680 km through Satellite Tool Kit (STK), which is an astrodynamics computer program from Analytical Graphics. $W i j$ represents the satellite j in orbital plane i, $i = {1,2, 3,4, 5}$ , $j = \{1,2, 3,4, 5,6\}$ . Figure 1 presents the view of the rosette constellation in STK.

Figure 1

$(30,5, 1)$ : $β = 60$ ° rosette constellation.

The rosette constellation presented in Figure 1 provides continual global coverage, and each satellite is continuously linked to other four satellites via two ISLs with satellites in the same layer and two IOLs with satellites in adjacent layers. As shown in Figure 2, for example, satellite $W 11$ communicates with its two neighbors in the same layer through ISLs, whereas satellites in the adjacent layers communicate over IOLs. Several IOLs and ISLs have been illustrated to highlight the link features in Figure 3. Furthermore, ISLs length remains unchanged, whereas IOLs change periodically over time. In addition, propagation loss, capacity, and delay vary with the periodically changing links.

Figure 2

Continuous connection links of satellite $W 11$ .

Figure 3

The change of IOLs and ISLs versus time.

As per a thorough analysis, the topological relation among satellites is stable but the capacity and delay change continuously as IOL distance changes in time with satellite movement. In Figure 3, the shortest IOL is 1299 km. At this time, the link capacity is also minimized and may block the transmission of a large amount of agricultural data. As a consequence, congestion must be avoided and link blocking rate lowered during routing computation.

4. CR-MDC: A Method of Constrained Route Based on the Metric of Delay and Capacity

According to the analysis presented above, the LEO rosette constellation sensor network exhibits a stable connection relationship, periodic orbit movement, and time-variable link capacity and delay. On the basis of these characteristics, a method of constrained route based on the metric of time-varying delay and capacity (CR-MDC) is proposed to avoid congestion of satellite sensor network for LEO constellation. In the CR-MDC, the satellite network period is divided into several time slots, and the topology can be considered fixed in each time slot [27]. Routing aims to minimize maximum link utilization to avoid congestion through delay and capacity constraints. In each slot, a route is calculated based on the link state of the current state to satisfy these constraints.

A nonbranched multicommodity flow model [28] is built in to calculate route with the aim of minimizing maximum link utilization. The algorithm we proposed is offline. As for the time and monitored region that can be known in advance, it is possible to schedule the traffic from the beginning. So it is reasonable to use the offline algorithm for route in agriculture monitoring.

4.1. Time Slots

Network topology is not fixed because of satellite movement, thus complicating the route for an extended period of traffic time. We can divide satellite network system period T into M time slices and treat the topology in each slice as invariant based on the observation that the orbit movement, as well as the change in the capacity and delay of the rosette constellation sensor network, is periodic. The intervals of adjacent slots are unchanged and can be denoted as $[T_{1}, T_{2} \dots T_{m}]$ , $T_{1} = 0, T_{m} = T, T_{i + 1} - T_{i} = Δ T (i = 1,2 \dots m - 1)$ . Thus, the link assignment problem in LEO satellite networks can be simplified into a set of link assignment problems in fixed topology networks. CR-MDC calculates the route in each slot, and the route framework is displayed in Figure 4.

Figure 4

Routing framework of low orbit satellite constellation sensor network.

As shown in Figure 4, the input of the route method includes two parts: (1)

physical topology: including source and destination node of traffic, the distance, and capacity of each link;

(2)

traffic demand: including egress node, ingress node, and the corresponding traffic requested.

And the output is the route path calculated which is composed of a series of links through this path for each traffic demand with the constraint of link delay and capacity.

4.2. Notations

Some variables needed are defined as follows: (1)

D: the total amount of traffic in the network: for each $d \in D$ , let $h_{d}$ be the traffic requirement from node $a (d)$ to node $b (d)$ .

(2)

$G (N, E)$ : network topology: N is the set of satellite nodes while E is the set of unidirectional links and for each $e \in E, a (e)$ and $b (e)$ are source and destination nodes for each link, respectively.

(3)

$δ^{+} (n), δ^{-} (n)$ : for each $n \in N, δ^{+} (n)$ and $δ^{-} (n)$ are the outgoing and incoming traffic, respectively. We denote that the outgoing and incoming traffic are all unit 1.

(4)

M: it stands for the total number of sampling time slices over a period of time.

(5)

U: the $E \times M$ link capacity matrix: $u_{e m}$ is the capacity of link e at mth slice for each $m \in M$ .

(6)

L: $E \times M$ link distance matrix: for each $m \in M$ , $l_{e m}$ is the distance of link e at mth slice.

(7)

X: $D \times E$ path matrix: we define a binary variable $x_{d e}$ ; that is, for each $d \in D, e \in E$ ,

\begin{matrix} x_{d e} = \{\begin{cases} 1, & d \in D, e \in E \\ 0, & d \in D, e \in E . \end{cases} \end{matrix}

(1)

The state “1” for $x_{d e}$ indicates that link e is selected to transfer traffic d while “0” means link e is not selected to transfer traffic d.

(8)

$T_{\max}$ : it stands for maximum delay that traffic could tolerate.

(9)

c: it stands for velocity of light.

4.3. Unbranched Multicommodity Flow Model

The unbranched multicommodity flow model can be formulated as follows:

\begin{matrix} \min (ρ) \end{matrix}

(2)

subject to

\begin{matrix} \sum_{e \in δ^{+} (n)}^{} x_{d e} - \sum_{e \in δ^{-} (n)}^{} x_{d e} = \{\begin{cases} 1, & if n = a (d) \\ - 1, & if n = b (d), \forall n \in N, d \in D \\ 0, & otherwise, \end{cases} \end{matrix}

(3)

\begin{matrix} \sum_{d}^{} h_{d} x_{d e} \leq ρ \cdot u_{e m}, \forall e \in E, 0 \leq m \leq M, \end{matrix}

(4)

\begin{matrix} \frac{\sum (x_{d e} (i, :) \cdot l_{e m})}{c} \leq T_{\max}, \end{matrix}

(5)

where

x_{d e} (i, :)

is the ith row vector of

x_{d e}

\begin{matrix} x_{d e} \in \{0,1\}, \forall d \in D, e \in E . \end{matrix}

(6)

The objective of Function (2) is to minimize the maximum link utilization. The flow conservation constraint (3) specifies, for each source-destination pair $[a (d), b (d)]$ , the traffic entering a node and the traffic exiting the node balance for relay nodes. If the node is the source, there is no incoming traffic. Similarly, if the node is the destination, then there is no outgoing traffic. The constraint of link capacity utilization is shown in (4), which requires that the sum of capacity occupancies for all traffic in one link be less than or equal to the product of maximum utilization and link capacity. The link delay constraint (5) states that for each type of traffic propagation delay should not exceed $T_{\max}$ . Constraint (6) indicates that the calculated path is unbranched.

5. Performance Evaluation

Many methods were proposed to calculate satellite network route. These techniques were usually based on the shortest path route and calculated with the Dijkstra algorithm. For example, Werner proposed the DT-DVTR routing scheme [29] and adopted the Dijkstra shortest path algorithm to compute the optimal path for any pair of satellites. Mohorcic et al. established a centralized routing protocol based on the Dijkstra algorithm [30]. A classic algorithm, the LAOR route scheme [31], utilized the Dijkstra algorithm as a route algorithm to calculate routes with the goal of minimizing end-to-end delay and signaling overhead simultaneously. However, these schemes are not designed or supposed to take enough QoS metrics into account. Moreover, these methods adapt poorly to link congestion. Considering the defects mentioned above and the characteristic of the satellite sensor network established in this study, the proposed algorithm aims at avoiding congestion based on time-variable metric of capacity and delay. To evaluate the proposed method, we conduct relevant comparisons through Dijkstra-based routing. In addition, parameters such as the average blocking probability, average network delay, and maximum link utilization of a network are determined to compare CR-MDC with Dijkstra-based routing.

5.1. Performance Metrics

5.1.1. Blocking Probabilities

Blocking probability represents rejection probability of the connection, which is an important indicator of the degree of network congestion. Assume link capacity $u_{e}$ is an integer number and the traffic offered to a link e is equal to the sum of the traffics offered to all the paths that traverse the link. We denote $P_{d e}$ as the set of paths that carry traffic of demand $d (\in P_{d})$ and traverse link e. Then, we denote $y_{d e}$ as the traffic of demand d that traverses link e. And $y_{d e}$ can be calculated by

\begin{matrix} y_{d e} = \sum_{p \in P_{d e}}^{} x_{d p} . \end{matrix}

(7)

The total amount of traffic offered to a link is given by

\begin{matrix} y_{e} = \sum_{d} y_{d e} = \sum_{d} \sum_{p \in P_{d e}} x_{d p} . \end{matrix}

(8)

Assume that model of connection requests arrival to each link is a Poisson process. As the traffic is monoclass, the blocking rate of each link is formulated as

\begin{matrix} B_{e} = B_{e} (y_{e}, u_{e}) = \frac{y_{e}^{u_{e}} / u_{e}!}{\sum_{k = 0}^{u_{e}} y_{e}^{k} / k!} . \end{matrix}

(9)

For the calculation of the path blocking probabilities, we assume that all the arrival processes to the links are statistically independent. Then, given a path p carrying traffic of demand d, the path blocking probability

B_{p} (d)

is given by

\begin{matrix} B_{p} (d) = 1 - \prod_{e \in p} (1 - B_{e} (d)) . \end{matrix}

(10)

As to average network blocking probability B, it is computed according to the expression that

\begin{matrix} B = \frac{1}{\sum_{d} h_{d}} \sum_{d} \sum_{p \in P_{d}} h_{d} B_{p} (d) . \end{matrix}

(11)

5.1.2. Network Delay

The delay of the packets traversing a link e is composed of three parts: queuing delay ( $T_{e}^{q}$ ), transmission delay ( $T_{e}^{t}$ ), and propagation delay ( $T_{e}^{p}$ ), which can be expressed as $T_{e} = \sum T_{e}^{q} + T_{e}^{t} + T_{e}^{p}$ . It is possible to obtain an average network delay, defined as the average end-to-end delay suffered by a random packet chosen in the network. Considered as an important design and performance characteristic, the average network delay $(T)$ is given by

\begin{matrix} T = \frac{1}{\sum_{d} h_{d}} \sum_{e \in E} y_{e} T_{e}, \end{matrix}

(12)

where

y_{e}

is the total amount of traffic carried in a link e and

h_{d}

is the traffic carried of each demand. As the queuing delay and transmission delay are quite tiny compared to propagation delay in satellite network, they are considered neglectable in the calculations.

5.1.3. Link Utilization

Link utilization [32] is the ratio of current carried link traffic to the maximum traffic that the link can accommodate, which is often used as one of the important characteristics to evaluate the network congestion. When network utilization exceeds the threshold under normal condition, it will cause low transmission speed, intermittence, request delay, and so on. We derive the link utilization $ρ_{e}$ , assuming that the link capacity is $C_{e}$ , by the following equation:

\begin{matrix} ρ_{e} = \frac{y_{e}}{C_{e}}, \end{matrix}

(13)

where

y_{e}

is the total amount of traffic carried in a link e.

5.2. Simulation Results of CR-MDC

In this section, we present the simulation results for the proposed CR-MDC. The satellite sensor network of rosette constellation with advantages in global coverage is considered. Ten source-destination pairs shown in Table 1 are randomly selected, and the requested bandwidth between each node pair changes from 1 Mbps to 9 Mbps to evaluate CR-MDC performance. Figure 5 shows that the network blocking probability changes with bandwidth. The blocking rate of Dijkstra-based routing varies with an increase in the requested bandwidth. During simulation, the Intersatellite Link (ISL) capacity of the network changes. The minimum link capacity throughout the entire process is slightly over 7 Mbps, whereas the maximum link capacity is almost 22 Mbps. Dijkstra-based routing is a routing method that considers only the shortest data transmission path regardless of whether the link is congested or not. When the traffic demand is less than 5 Mbps, the blocking rate is almost zero. As traffic continues to increase, the network experiences a severe overcrowding problem which will lead to large amounts of data loss and it is a quite serious problem in agriculture monitoring, whereas in such condition the CR-MDC still keeps the low network blocking probability. The remarkable result for this approach is ascribed to its capability to balance traffic flow. When a link loads considerable flow, the algorithm chooses an alternative link, which also satisfies delay restriction and reaches the destination node. This design facilitates congestion avoidance and balances network flow. The proposed CR-MDC can avoid network congestion effectively because it considers both the delay and link capacity constraints as indicators to determine a reasonable data transfer path; by contrast, the Dijkstra-based routing takes only link delay into account. As a result, the outcome is prone to network congestion.

Table 1

Ten source-destination pairs.

Number	Source satellite node	Destination satellite node
1	$W 11$	$W 31$
2	$W 12$	$W 52$
3	$W 21$	$W 42$
4	$W 22$	$W 11$
5	$W 31$	$W 21$
6	$W 34$	$W 45$
7	$W 42$	$W 52$
8	$W 45$	$W 12$
9	$W 52$	$W 22$
10	$W 56$	$W 34$

Figure 5

Average network blocking probability versus traffic requested.

We also simulate the average network delay in comparison with Dijkstra-based routing in different time slots. We retain the 10 paired source-destination nodes shown in Table 1, and the request traffic is 1 Mbps in each pair for each slot. ISL length changes with satellite movement; hence, capacity and propagation delay vary in each slot. As a result, different routes are generated with various algorithms in dissimilar slots in addition to the values of performance metrics. Thirty time slots were simulated, and the results are depicted in Figure 6. As expected, the delay of CR-MDC is higher than that of Dijkstra-based routing. Because the latter considers only the shortest distance this distance exhibits low latency but a high block probability when traffic requests increase. But in large-scale agriculture monitoring, we care more about the mass of data that need to be transmitted reliably to supervision department compared with low delay. Figure 7 presents the mean number of hops per time slot; the number of hops produced by Dijkstra-based routing decreases when a link-cost metric is used that consists of propagation delay computation paths. In addition, the proposed algorithm passes additional hops, in each time slot; thus, the CR-MDC routes traffic through long (in terms of hops) but little-congested paths.

Figure 6

Average network delay versus time slices.

Figure 7

Average hops versus time slices.

Figure 8 illustrates CR-MDC performance in terms of maximum link utilization; as expected, the proposed algorithm outperforms Dijkstra-based routing. The maximum link utilization of the links reaches almost 30% when the network uses the Dijkstra algorithm to calculate the route; by contrast, the maximum link utilization is approximately 13% when the proposed CR-MDC is employed. The higher the maximum link utilization, the higher the probability that the congestion occurs. The Dijkstra-based routing considers only data transmission path regardless of whether the link is congested or not, whereas the CR-MDC could minimize the maximum link utilization which enables it to balance traffic flow. This result indicates that CR-MDC effectively transmits data with the guarantee of congestion avoidance.

Figure 8

The maximum link utilization versus time slices.

5.3. Improvement of CR-MDC

In order to have a thorough study of CR-MDC, we also present the route path in each slot of the ten pairs in Table 2. We take the pair ( $W 11$ , $W 31$ ), for example, and the results are similar and the conclusion is applicable to other pairs as well. The traffic of the pair will last during the thirty slots. Figure 9 illustrates the route paths of each slot. As shown in the figure, there are only six paths although we divided 30 slots. Therefore, some time slots follow the same path, even the continuous time slot. The detailed satellite nodes through which each slot path travels are present in Table 2. It is evident from this table that the route path of slot 3 is quite different from the path of slot 4, for example. That means the switch will occur to transmit traffic from slot 3 to slot 4. In slot 3, a path travels through satellite nodes ( $W 11$ , $W 12$ , $W 21$ , $W 22$ , and $W 31$ ) whereas another path passes through satellite node ( $W 11$ , $W 51$ , $W 42$ , $W 41$ , $W 32$ , and $W 31$ ) in next slot. These paths are completely dissimilar; hence, this switch must occur five times. As a result, different slots transition frequently if the path in question differs from the previous one. According to literature [33], the route similarity was defined as the overlap of two end-to-end routes between two nodes and an arbitrary third node. Herein, we use the route diversity to quantify the difference of route path of the same source-destination node between different slots. The route diversity is expressed as $R_{d i v e r s i t y} = \sum (x_{d e} \oplus x_{d e}^{'})$ , where $x_{d e}$ is the current slot path that needs to be calculated while $x_{d e}^{'}$ is the former one.

Table 2

Detailed satellite nodes of each slot path.

Time slot	Satellite node	Figure
1, 2, 8	W11 W26 W35 W36 W31	Figure 9(a)
3, 9, 10	W11 W12 W21 W22 W31	Figure 9(b)
4, 6, 7, 11, 12, 13, 14, 16, 17	W11 W51 W42 W41 W32 W31	Figure 9(c)
5	W11 W26 W21 W22 W31	Figure 9(d)
15, 18, 19, 20, 21, 22, 23, 24	W11 W16 W56 W41 W46 W31	Figure 9(e)
25, 26, 27, 28, 29, 30	W11 W12 W13 W22 W31	Figure 9(f)

Figure 9

Route of the pair ( $W 11$ , $W 31$ ) of different slots.

Based on that, improvement of CR-MDC can be made to reduce the handoff times by adding another optimization objective of minimizing the route diversity $R_{d i v e r s i t y}$ and the constraint of route path diversity on original basis.

The improved CR-MDC model can be formulated as follows:

\begin{matrix} \min (ρ) \\ \min (R_{diversity}) \end{matrix}

(14)

subject to

\begin{matrix} \sum_{e \in δ^{+} (n)} x_{d e} - \sum_{e \in δ^{-} (n)} x_{d e} = \{\begin{cases} 1, & if n = a (d) \\ - 1, & if n = b (d), \forall n \in N, d \in D \\ 0, & otherwise, \end{cases} \\ \sum_{d} h_{d} x_{d e} \leq ρ \cdot u_{e m}, \forall e \in E, 0 \leq m \leq M, \\ \frac{\sum (x_{d e} (i, :) \cdot l_{e m})}{c} \leq T_{\max}, \\ where x_{d e} (i, :) is  the i th  row  vector  of x_{d e} \\ R_{diversity} = \sum (x_{d e} \oplus x_{d e}^{'}), \\ x_{d e} \in \{0,1\}, \forall d \in D, e \in E . \end{matrix}

(15)

Constraint (15) is the constraint of route similarity, which can be denoted as follows:

\begin{matrix} R_{diversity} = x_{d e} \oplus x_{d e}^{'}, \\ R_{diversity} \leq x_{d e} + x_{d e}^{'}, \\ R_{diversity} \geq x_{d e} - x_{d e}^{'}, \\ R_{diversity} = - x_{d e} + x_{d e}^{'}, \\ R_{diversity} \geq 2 \cdot ones (D, E) - x_{d e} - x_{d e}^{'}, \end{matrix}

(16)

where

o n e s (D, E)

is a

D \times E

matrix, and all the elements in the matrix are 1.

Figure 10 depicts route diversity versus time slots. The numerical value in the figure is a ratio expressed as a percentage which can be formulated as

\begin{matrix} 1 - \frac{\sum_{d \in SET} 2 * similarity (x_{d e}, x_{d e}^{'})}{\sum_{d \in SET} Total (x_{d e}, x_{d e}^{'})}, \end{matrix}

(17)

where

s i m i l a r i t y (x_{d e}, x_{d e}^{'})

is the number of same links of the two route paths. It is clearly shown in Figure 10 that the route diversity of different slots of the optimal method with similarity constraint is relatively low, compared with the method without similarity constraint. The bigger the difference in path is, the more likely the switch occurs, which may result in data loss during agriculture monitoring. When reducing diversity of the path, we also reduce the risk of data loss. And from the figure, when the similarity constraint is added to calculate route, it can provide superior performance in reducing handoff times.

Figure 10

Route diversity versus time slot.

The performance of the method with similarity constraint in terms of maximum link utilization is illustrated in Figure 11. The result shows the method with similarity constraint has a higher link utilization than the method without similarity constraint. As is shown in Figure 11, the maximum value of the CR-MDC is almost 0.137 while the maximum value of the optimized CR-MDC is almost 0.142. And the two methods have the same minimum value that is close to 0.136. And in Figure 12 the maximum link utilization of three routing methods is presented. Just as we expect the Dijkstra has the maximum link utilization, whereas the CR-MDC has the minimum link utilization. Therefore, all these values explain that compared with the CR-MDC the optimized CR-MDC not only has a lower route diversity which is beneficial to reduce switch times, but also greatly influences link utilization which is an essential measure of network congestion.

Figure 11

Maximum link utilization of CR-MDC and improved CR-MDC.

Figure 12

Maximum link utilization of three routing methods.

6. Conclusion

In this study, we have designed a novel constrained route method that models a network through a discrete-time figure to avoid satellite sensor network congestion for agricultural monitoring. We have formulated the problem as a multicommodity model with time-varying parameters, and the simulation results demonstrate that the proposed scheme reports a lower average network blocking probability than other algorithms do. Even as traffic increases, the blocking probability remains low; this outcome confirms that the method influences congestion avoidance by the satellite network when this network is used to transfer much data. And in order to reduce handoff times, an optimized CR-MDC with similarity constraint is presented in this paper which is beneficial to reduce switch times but also has a great result on network congestion.

Footnotes

Conflict of Interests

The authors declare that there is no conflict in interests regarding the publication of this paper.

Acknowledgments

This work was partly supported by the National Natural Science Foundation of China (NSFC) under Grant no. 61371126, the Fundamental Research Funds for the Central Universities under Grant no. 2042014kf0256 and no. 2042014gf020, the National High Technology Research and Development Program of China (863 Program) under Grant no. 2014AA01A707, National Basic Research Program of China (973 Program) under Grant no. 2011CB707106, the Natural Science Foundation of Hubei Province under Grant no. 2011CDA042 and no. 2014CFB716, and Innovation Foundation of Satellite Application Institute of China Aerospace & Technology Corp. (CASC) under Grant no. 2014_CXJJ-TX_15.

References

Celandroni

Ferro

Gotta

Oligeri

Roseti

Luglio

Bisio

Cello

Davoli

Panagopoulos

A. D.

Poulakis

Vassaki

De Cola

Marchitti

M. A.

Y. F.

Pillai

Verma

Acar

A survey of architectures and scenarios in satellite‐based wireless sensor networks: system design aspects

International Journal of Satellite Communications and Networking 2013 31 1 1 38

10.1002/sat.1019

2-s2.0-84872902667

Colitti

Steenhaut

Descouvemont

Dunkels

Satellite based wireless sensor networks: global scale sensing with nano-and pico-satellites

Proceedings of the 6th ACM Conference on Embedded Network Sensor Systems

2008

Raleigh, NC, USA

445 446

Zhou

Research on Data Acquisition and Management Technology for Crop Information Monitoring 2012

Chinese Academy of Agricultural Sciences

Abbasi

A. Z.

Islam

Shaikh

Z. A.

A review of wireless sensors and networks' applications in agriculture

Computer Standards & Interfaces 2014 36 2 263 270

10.1016/j.csi.2011.03.004

2-s2.0-84890119176

Mafuta

Zennaro

Bagula

Ault

Gombachika

Chadza

Successful deployment of a wireless sensor network for precision agriculture in Malawi

International Journal of Distributed Sensor Networks 2013 2013 13

150703

10.1155/2013/150703

2-s2.0-84878661531

Basu

Thool

M. V. R.

Thool

R. C.

Birajdar

A. C.

Computer based drip irrigation control system with Remote data acquisition system

Proceedings of the 4th World Congress on Computers in Agriculture and Natural Resources

July 2006

Orlando, Fla, USA

104 109

2-s2.0-58249098485

Morais

Valente

Serôdio

A wireless sensor network for smart irrigation and environmental monitoring

Proceedings of the EFITA/WCCA Joint Congress on IT in Agriculture

July 2005

Vila Real, Portugal

845 850

Kim

Evans

R. G.

Iversen

W. M.

Remote sensing and control of an irrigation system using a distributed wireless sensor network

IEEE Transactions on Instrumentation and Measurement 2008 57 7 1379 1387

10.1109/tim.2008.917198

2-s2.0-59949097218

Kim

Evans

R. G.

Software design for wireless sensor-based site-specific irrigation

Computers and Electronics in Agriculture 2009 66 2 159 165

10.1016/j.compag.2009.01.007

2-s2.0-63149188524

10.

Cugati

Miller

Schueller

Automation concepts for the variable rate fertilizer applicator for tree farming

Proceedings of the 4th European Conference in Precision Agriculture

June 2003

Berlin, Germany

14 19

11.

Dammer

K. H.

Variable rate application of fungicides

Precision Crop Protection—the Challenge and Use of Heterogeneity 2010

Springer

351 365

10.1007/978-90-481-9277-9_22

12.

Baggio

Wireless sensor networks in precision agriculture

Proceedings of the ACM Workshop Real-World Wireless Sensor Networks (REALWSN ′05)

2005

Stockholm, Sweden

13.

Beckwith

Teibel

Bowen

Report from the field: results from an agricultural wireless sensor network

Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks (LCN ′04)

November 2004

Tampa, Fla, USA

471 478

10.1109/lcn.2004.105

2-s2.0-20544446817

14.

Chen

An agricultural intelligent lighting system based on ZigBee sensor network

Hubei Agricultural Sciences 2014 53 23 5858 5860

15.

Radenkovic

Wietrzyk

Wireless mobile ad-hoc sensor networks for very large scale cattle monitoring

Proceedings of the 6th International Workshop Applications and Services in Wireless Networks (ASWN ′06)

2006

Berlin, Germany

47 58

16.

Tang

H.-J.

W.-B.

Peng

Recent progresses in monitoring crop spatial patterns by using remote sensing technologies

Sciatica Agricultural Sinica 2010 43 14 2879 2888

17.

Donlon

Berruti

Buongiorno

Ferreira

M.-H.

Féménias

Frerick

Goryl

Klein

Laur

Mavrocordatos

Nieke

Rebhan

Seitz

Stroede

Sciarra

The global monitoring for environment and security (GMES) sentinel-3 mission

Remote Sensing of Environment 2012 120 37 57

10.1016/j.rse.2011.07.024

2-s2.0-84859429155

18.

Sakamoto

Nguyen

N. V.

Ohno

Ishitsuka

Yokozawa

Spatio-temporal distribution of rice phenology and cropping systems in the Mekong Delta with special reference to the seasonal water flow of the Mekong and Bassac rivers

Remote Sensing of Environment 2006 100 1 1 16

10.1016/j.rse.2005.09.007

2-s2.0-29244449072

19.

Tapia-Silva

F.-O.

Itzerott

Foerster

Kuhlmann

Kreibich

Estimation of flood losses to agricultural crops using remote sensing

Physics and Chemistry of the Earth 2011 36 7-8 253 265

10.1016/j.pce.2011.03.005

2-s2.0-79955164123

20.

Liu

The agricultural application of the data collected by GaoFen1 satellite

Satellite Application 2015 3 31 33, 36

21.

Wood

Satellite constellation networks

Internetworking and Computing over Satellite Networks 2003

New York, NY, USA

Springer

13 34

10.1007/978-1-4615-0431-3_2

22.

Ballard

A. H.

Rosette constellations of earth satellites

IEEE Transactions on Aerospace and Electronic Systems 1980 16 5 656 673

2-s2.0-0019057077

23.

Sivakumar

M. V. K.

Roy

P. S.

Harmsen

Saha

S. K.

Satellite remote sensing and GIS applications in agricultural meteorology

Proceedings of the Training Workshop

July 2003

Dehradun, India

AGM-8, WMO/TD-No. 1182

24.

Gang

Dingyong

Shiqi

Tingyong

The study of routing and handover in NGSO rosette constellation

Journal of Electronics & Information Technology 2004 11 1792 1798

25.

Ren

Qian

Liu

Design and analysis of the satellite laser communications

9449

The International Conference on Photonics and Optical Engineering (icPOE ′14)

February 2015

Xi'an, China

Proceedings of SPIE International Society for Optics and Photonics

10.1117/12.2075826

26.

Hefeng

Xuan

The optimal design method for rosette constellations

Journal of Astronautics 1999 20 4 77 82

27.

Wang

Zhang

Jiang

Huang

Wang

Men

Yang

A novel routing algorithm design of time evolving graph based on pairing heap for MEO satellite network

Proceedings of the 80th IEEE Vehicular Technology Conference (VTC ′14)

September 2014

Vancouver, Canada

IEEE

1 5

10.1109/vtcfall.2014.6965831

2-s2.0-84919431057

28.

Bertsekas

D. P.

Gallager

R. G.

Humblet

Data Networks 1992

Upper Saddle River, NJ, USA

Prentice-Hall International

29.

Werner

A dynamic routing concept for ATM-based satellite personal communication networks

IEEE Journal on Selected Areas in Communications 1997 15 8 1636 1648

10.1109/49.634801

2-s2.0-0031259023

30.

Mohorcic

Svigelj

Kandus

Werner

Performance evaluation of adaptive routing algorithms in packet switched inter-satellite link networks

International Journal of Satellite Communications 2002 20 2 97 120

10.1002/sat.714

2-s2.0-0036496303

31.

Papapetrou

Karapantazis

Pavlidou

F.-N.

Distributed on-demand routing for LEO satellite systems

Computer Networks 2007 51 15 4356 4376

10.1016/j.comnet.2007.05.008

2-s2.0-34548048364

32.

Jasem

H. N.

Zukarnain

Z. A.

Othman

Subramaniam

Evaluation study for delay and link utilization with the new-additive increase multiplicative decrease congestion avoidance and control algorithm

http://arxiv.org/abs/1001.2848

33.

Steenkiste

Quantifying internet end-to-end route similarity

Passive and Active Measurement Conference (PAM ′06)

2006

Adelaide, Australia