Event-Based Communication and Finite-Time Consensus Control of Mobile Sensor Networks for Environmental Monitoring

This paper deals with the problem of environmental monitoring by designing a cooperative control scheme for mobile sensor networks. The proposed cooperative control scheme includes three main modules: a wireless communication module, a direction decision module, and a motion control module. In the wireless communication module, an event-based communication rule is proposed, which means that mobile sensor nodes do not send their positions, velocities, and the data of environmental attributes to the other sensor nodes in real-time for the coordination and control of mobile sensor networks. Due to using the event-based communication rule, the communication bandwidth can be saved. In the direction decision module, a radial basis function network is used to model the monitored environment and is updated in terms of the sampled environmental data and the environmental data from the other sensor nodes by the wireless communication module. The updated environment model is used to guide the mobile sensor network to move towards the region of interest in order to efficiently model the distribution map of environmental attributes, such as temperature, salinity, and pH values for the monitored environment. In the motion control module, a finite-time consensus control approach is proposed to enable the sensor nodes to quickly change their movement directions in light of the gradient information from the environment model. As a result of using the event-based communication rule in the wireless communication module, the proposed control approach can also lower the updating times of the control signal. In particular, the proposed cooperative control scheme is still efficient under the directed wireless communication situation. Finally, the effectiveness of the proposed cooperative control scheme is illustrated for the problem of environmental monitoring.


Introduction
In order to gain a better understanding of the environmental states including physical, chemical, and biological parameters, environmental monitoring has obtained much attention from scientists [1][2][3]. In particular, environmental monitoring involves a process of collecting data related to environmental attributes, such as temperature, salinity, pH values, odor concentration, and so on [1,[3][4][5], and the goal is to build a data map to describe the environmental states. Figure 1 shows the contour map of environmental attributes where the red circle denotes the mobile sensor node and the surface color refers to concentration of an environmental attribute. The mobile sensor nodes need to communicate with each other by wireless networks in order to exchange the collected data on environmental attributes, positions, and velocities of sensor nodes such that sensor nodes hold the cooperative fashion control scheme is still efficient under the directed wireless communication situation, which means that the networked control system of sensors with the proposed cooperative control scheme is stable.
The following is a brief introduction to the content of this paper. In Section 2, we describe the related work for event-triggered approaches and finite-time control approaches. In Section 3, we propose a cooperative control scheme and introduce three main modules. Then, we give an example to show the performance capabilities of the proposed cooperative control scheme. In Section 4, based on the proposed cooperative control scheme, we apply mobile sensor networks to deal with the problem of environment monitoring. The final remarks are given in Section 5.

Related Work
Consensus control approaches as a class of fundamental methods for mobile sensor networks have also been well studied [6,7,13,14]. In the face of some applications that require a fast convergence rate and high control accuracy [15][16][17], how to establish exponential convergence consensus approaches with finite settling times is necessary and has resulted in the appearance of finite-time consensus approaches. It is worth mentioning that finite-time stable systems show better performance capabilities with disturbance rejection [15,18,19]. As a result, finite-time consensus protocols have been proposed for mobile sensor networks [20][21][22]. For example, Cao et al. (2010) [20] used a control scheme with two levels-a finite-time estimating level and a finite-time tracking level-to hold the formation tracking of sensor nodes with single-integrator dynamics where the sliding mode approach is given to realize the finite-time control. Cortés et al. (2006) [21] proposed a finite-time convergent gradient control approach in order to control the network consensus in finite time where the states of sensors evolve based on single-integrator dynamics. Hui et al. (2008) [22] designed a finite-time consensus algorithm for nonlinear dynamical networks.
It should be noted that the above finite-time control approaches were developed for sensor nodes with single-integrator dynamics [20][21][22]. Then, these finite-time control approaches were further extended for sensor nodes with double-integrator dynamics [23]. For example, Hui et al. (2011) [23] designed a finite-time rendezvous algorithm using sign functions for nonlinear dynamical networks where sensor nodes evolve in terms of double-integrator dynamics. An important characteristic of the aforementioned finite-time control approaches is that they directly use sign functions to obtain discontinuous control inputs. However, chattering issues may be produced due to discontinuous control inputs [20,21,23] which leads to the appearance of continuous finite-time consensus control approaches [3,15,17,[24][25][26][27]. For example, Wang and Hong (2008) [26] proposed several continuous finite-time consensus control approaches and gave the corresponding stability of double-integrator dynamics. Li et al. (2011) [15] developed a continuous finite-time consensus control approach by using a power function on the position and velocity of sensors. Lu et al. (2014) [3] designed a two-level control scheme where the function of the first level is to realize the finite-time cooperative control, and the function of the second level is to realize the finite-time tracking control. The designed control scheme is applied to the problem of odor source localization.
It should be pointed out that reducing the number of actuator updates may be preferable for some practical applications where some embedded processors with limited resources are employed [28][29][30][31][32][33][34]. Clearly, the above finite-time consensus control schemes need to continuously update control signals and cannot provide any support for this case. One possible method to tackle the issue is to use event-triggered consensus control schemes [35][36][37][38][39][40]. By adjudging an event triggering condition on state-dependent errors, whether or not control signals should be updated can be determined. For example, Dimarogonas et al. (2012) [35] designed an event-triggered consensus control approach and showed a smaller updating number while reaching consensus for the states of sensor nodes. Yi et al. (2017) [40] further developed a distributed event-triggered control approach for a directed communication situation. On the basis of the research results, references [40], Lu et al. (2017) [11] proposed an event-triggered finite-time consensus control approach for mobile sensor networks in order to deal with the problem of environmental monitoring.
However, the event-triggered consensus control schemes still need continuous-time communication between sensor nodes which may result in greater requirements for communication bandwidths. However, not all transmitted signals from neighboring nodes help to ensure the required control performance [10,41,42]. In order to release limited network resources to other communication tasks, some redundant signals can be avoided. Thus, several event-triggered communication schemes have also been proposed, where the states of sensors are broadcasted only when events are triggered [10,41,42]. Using this kind of event-triggered communication, schemes can not only reduce the updating times of control signals, but can also save network resources. For example, Zhu and Jiang (2015) [42] presented an event-based leader-follower consensus approach for sensor nodes with input time delay where data are transmitted only when the event occurs.   [10] developed an event-triggering sampling based consensus control approach for sensor nodes with second-order dynamics, where the communication bandwidth can be saved. A recent survey report shows more results about the event-triggered control schemes [43]. However, it is worth mentioning that the aforementioned consensus control approaches with event-triggered communication schemes cannot maintain the finite-time convergence of sensors' states. Moreover, these consensus control approaches are also inefficient under directed communication situations, which means that the networked control system with the aforementioned consensus control approaches is not stable under directed communication situations.

Cooperative Control Scheme
In the following text, we propose a cooperative control scheme (shown in Figure 2), which includes three main modules: a wireless communication module, a direction decision module, and a motion control module.  From Figure 2, one can see that the mobile sensor nodes, such as autonomous surface vehicles, can exchange information with each other through wireless networks. Specifically, in the wireless communication module, the positions and velocities of sensor nodes and environmental data can be sent to other sensor nodes based on wireless communication. Correspondingly, these data can be received from other sensor nodes and be given to the direction decision module and motion control module. In the direction decision module, based on the environmental data and states of sensor nodes, sensor nodes can make a decision on their movement direction and transmit the corresponding decision data to the motion control module and the wireless communication module. In the motion control module, based on the direction decision of the sensor node, the sensor node is controlled to move towards the region with the greatest amount of information.

Wireless Communication Module and Event-Based Communication Rule
Due to the possible failure and data loss in the transmitter and receiver of the wireless communication module of sensor nodes, a directed communication situation may exist among sensor nodes, which means that communication topologies among sensor nodes may be directed. From Figure 3a, one can see that, due to disturbance and time-delay, the data from the mobile sensor 3 are not received by the mobile sensor 1. Hence, a directed communication link exists between the mobile sensor 1 and mobile sensor 3. With the similar reason, directed communication link occurs between mobile sensor 2 and mobile sensor 3.  In order to model the directed communication topology, we used the directed graph G n (W, E , P), where W = {w 1 , w 2 , · · · , w n } denotes a set formed by mobile sensor nodes; E ⊆ W × W represents the set of communication links; P = [p ij ] is a weighted adjacency matrix; and p ij ≥ 0 describes the communication quality. For the adjacency matrix, P, if the ith sensor node obtains the information from the jth sensor node, then p ij > 0; otherwise, p ij = 0. Figure 3b, shows a virtual leader that communicates with the other sensor nodes and can be put in any sensor node. The virtual leader does not exist in real applications, and is introduced to help sensor nodes reach consensus, and one can also control the final convergence velocity of mobile sensor network so as to obtain a leader-follower formation. For the directed graph, if the ith node can transmit the data to the jth node, the ith node is called the parent node and the jth node is called the child node. In addition, the root node has no parent and has a directed path to every other node. In Figure 3b, the virtual leader is a root node since directed paths to other nodes exist. A directed path is a directed graph in which every node has one parent node except for the root node. For example, the four nodes, including the virtual leader, mobile sensor 1, mobile sensor 2, and mobile sensor 4 form a directed path where the virtual leader is a root node.
A directed tree has the following characteristics: (i) the root node has no parent node; (ii) each node has only one parent node; and (iii) the root node has a directed path to every other node. Let the directed spanning tree G s (W s , E s , P s ) be a subgraph of G n (W, E , P) such that G s (W s , E s , P s ) is a directed tree and W s = W. Moreover, G n+1 = G n ∪ {w 0 } is an expansion of G n (W, E , P), where w 0 represents the virtual leader. If the virtual leader can communicate with the ith sensor node, p i0 > 0; otherwise, p i0 = 0 (i = 1, . . . , n). L G n = [s ij ] ∈ R n×n is a Laplacian matrix, which can be calculated by The event-based time sequence t i 0 , t i 1 , · · · , t i s , · · · (s is an index number, and i is the index number of the ith mobile sensor node. ) defined iteratively by where inf is the greatest lower bound; {t − t j l } denotes time with the newest data from the jth sensor node; x i (t) and x i (t i s ) are the positions of the ith sensor node at time t and triggering time t i s , respectively; v i (t) and v i (t i s ) are the velocities of the ith sensor node at time t and triggering time t i s , respectively; x 0 (t) and x 0 (t i s ) are the positions of the virtual leader at time t and triggering time t i s , respectively; v 0 (t) and v 0 (t i s ) are the velocities of the virtual leader at time t and triggering time t i s , respectively; p ij is the communication weight between the ith sensor node and the jth sensor node; v j (t j s (t) ) and x j (t j s (t) ) are the velocity and position of the jth sensor node at the latest triggering time t j s (t) , respectively; Z + 0 is a positive integer set; t j 1 , t j 2 , . . . , t j l is a time sequence for the jth sensor node; · denotes 2-norms and | · | refers to the absolute value symbol. Note that t 0 s (t) = t i s and at least one sensor node that can communicate with the virtual leader exists. M = L G n + diag{p 10 , . . . , p n0 }. L G n denotes the non-symmetrical Laplacian matrix of directed graph G n (W, E , P), and p i0 represents the communication link between the ith (i = 1, . . . , n) sensor node and the virtual leader. In addition, the proposed event-based rule (2) can reduce communication burdens between sensor nodes since the information of the jth (j = 1, . . . , n, j = i) sensor node is required only at t = t j s (t) . From (2), one can see that when M |βe ix (t) + γe iv (t)| + p i0 |βe i0x (t) + γe i0v (t)| > h(|βy i (t i s )| + |γz i (t i s )|), the event-triggered condition is satisfied. Correspondingly, the new state of the ith sensor node is broadcasted into its neighbors based on wireless communication networks. Moreover, one can also see that when the event-triggered condition is not satisfied, the item h(|βy i (t i s )| + |γz i (t i s )|) stays constant which means that the ith sensor node does not need to send its state into its neighbors. It should be pointed out that the use of the event-based communication rule means that the mobile sensor nodes are not required to continually send data to communication networks such that the energy consumption of sensor nodes can be decreased [44][45][46]. [10,42], proposed event-based communication rule (2) has the following characteristics: (i) The expression form of proposed event-based communication rule (2) is simple and concise. (ii) The parameters from proposed event-based communication rule (2) can be easily set while the parameters from references [10,42] are hard to calculate. (iii) Under proposed event-based communication rule (2), we can design a finite-time consensus controller that is also efficient for directed communication situations. For the event-based communication rules in references [10,42], the given consensus controller cannot enable the states of sensor nodes to reach consensus in finite time.

Remark 2.
Note that event-based condition (2) is estimated in real-time. When the event-triggered condition is satisfied, the new state of the ith sensor node is broadcasted into its neighbors based on wireless communication networks. The event-triggered time is recorded and put into the event-triggered time sequence t i 0 , t i 1 , · · · , t i s , · · · .

Direction Decision Module and Environmental Model
In order to model the monitored environment and obtain the data map of environmental attributes, a radial basis function network [11] is employed as where m is the number of radial basis functions; θ j is the weight of the jth radial basis function; q i (x) is the estimated value based on the radial basis function network; x is the position of sensor nodes; ω j is the center of the jth radial basis function; and σ j is the width of the jth radial basis function. The latest data obtained from the sensor node is used to update the weights of the radial basis function network shown in (4).
where r l (x l ) is the actual value obtained from the lth sensor node at position x l , and q i (x l ) is the estimated value calculated from the environmental model (3). If the ith sensor node cannot get the information sent by the lth sensor node, then p il = 0; otherwise, p il = 1. In terms of the environmental model (3), the reference velocity is given by where λ = 20 in the following applications. The reference velocity, v ir , can guide the ith sensor node to move towards the region with the greatest amount of information.

Motion Control Module and Finite-Time Control
A mobile sensor network is composed of n identical sensor nodes. The dynamics of the sensor node are described as where x i (t) and v i (t) i = 1, 2, ..., n are the position and velocity of the ith sensor node, respectively; u i (t) is the corresponding control signal; and n is the number of the sensor node. x 0 (t) represents the virtual leader's position and v 0 (t) represents the virtual leader's velocity. The kinematics of the virtual leader are obtained byẋ where v 0 is a constant. The corresponding finite-time consensus controller is where sig(c) α = sign(c)|c| α , sign(·) is a sign function, and 0 < α < 1. Now, the following theorem is set up for the mobile sensor network which can show the parameters' conditions such that the states' consensus of mobile sensor nodes can be obtained.

Theorem 1.
Consider mobile sensor network (6) and virtual leader (7) with the finite-time consensus protocol (8) and the event-triggered communication rule (2). Let µ min represent the minimum eigenvalue of 10 , . . . , p n0 }. If G n+1 has a directed spanning tree with the virtual leader as the root, k is a positive Then, the consensus controller (8) and the event-based communication rule (2) guarantees that where V(0) and k 2 can be calculated. Moreover, Zeno-behaviors are avoided before reaching consensus.
Proof. The proof of Theorem 1 can be found in Appendix D.
It is worth mentioning that one can compute the upper bound of the convergence time according to Theorem 1, from which the initial states of mobile sensor networks have important impacts on the convergence time [3,15,17,26,27]. Moreover, the parameter α also affects the setting time and should be carefully chosen in (0,1). In addition, as a result of constructing the Lyapunov function, the obtained upper bound of the convergence time may be conservative.
Notice that the velocity (v 0 ) of the virtual leader shows the movement direction of the mobile sensor network. By setting the velocity (v 0 ) of the virtual leader, the velocities of sensor nodes can reach consensus in finite time through the directed communication structure. On the other hand, the movement direction of the virtual leader is required to guide the mobile sensor network to move towards the region with the greatest information. Hence, the velocity (v 0 ) of the virtual leader is set based on the reference velocity. If the virtual leader is put in the ith sensor node, then v 0 = v ir (9) where v ir is the reference velocity of the ith sensor node. In addition, in order to obtain a reasonable formation, we improved the proposed finite-time consensus control approach (10), as follows: where d i is a random vector in which i = 1, 2, . . . , n, and d 0 = 0. Theorem 1 can guarantee that the proposed finite-time consensus control approach (10) with event-based communication rule (2) can enable can hold the reasonable formation of sensor nodes. v i (t) → v 0 can guide the mobile sensor network to track the velocity (v 0 ) of the virtual leader, and the velocity (v 0 ) is determined by (5) and (9).

Remark 3.
Due to the use of the event-based communication rule, when the event-triggered condition is not satisfied, the control input in (10) is not calculated and keeps the last time input which implies that the number of actuator updates is reduced and the energy consumption of the sensor nodes is saved [47,48]. If the event-triggered condition is satisfied, the new control input in (10) needs to be calculated. Since the dynamics of sensor nodes are continuous-time double-integrator dynamics, we used a continuous-time event detector in theory which can be found in the proof process of Theorem 1 in Appendix D. However, in the following simulation and applications, we use a sampling time of 0.01 s to program the proposed cooperative scheme [49].
The proposed cooperative control scheme is presented with the following Algorithm 1, and then we use an example to show the effectiveness of Algorithm 1.

Algorithm 1 Cooperative Control Scheme
/*Initialization*/ Initialize parameters h, β and γ, M of the event-based rule (2). Initialize the velocity (v 0 ) of the virtual leader and the adjusting parameter (λ). Initialize the parameters α and n for the finite-time consensus control in (8).
Detect the newest information from wireless communication networks. Sample the environmental information and the states' information.
Compute the event-triggered rule in (2). if g i (t) > 0 then Send the environmental information and states' information to their neighbors. Update the control input in (8).
Hold the lasted control input; end if Apply the control input to mobile sensor nodes. until The termination condition is satisfied.
Example 1. Figure 4 shows a fixed communication topology (G 1 ) for four sensor nodes. We can clearly see that a directed spanning tree exists and the virtual leader (L) is the root node. The corresponding weights have also been labeled in and v 4 (0) = −0.9. Hence, the total run time is 7 s and its sampling time is 0.01 s which implies 700 iterations. Let l i1 = h(|βy i (t i s )| + |γz i (t i s )|) and l i2 = M |βe ix + γe iv | + a i0 |βe i0x + γe i0v |, i = 1, . . . , 4. Figure 5a shows the velocity state curves of the four sensor nodes, and Figure 5b shows the state curves on velocity inconsistency for four sensor nodes. Figure 5c shows the position state curves of the four sensor nodes, and Figure 5d shows the state curves on position inconsistency for four sensor nodes. Note that when an event is triggered, the states of the sensor nodes are broadcasted and the control signals of sensor nodes are updated. From Figure 5, one can see that the velocities and positions of sensor nodes can reach consensus. Figure 6 shows the evolution of l i1 and l i2 for four sensor nodes. From this figure, one can see that when an event is triggered, h(|βy i (t i s )| + |γz i (t i s )|) is updated. The communication frequencies of sensor node 1, sensor node 2, sensor node 3, and sensor node 4 are 14.42%, 12.28%, 18.57%, and 14.28%, respectively. Note that the data sent by sensor node 2, sensor node 3, and sensor node 4 cannot be received by other sensor nodes. Similarly, the updating frequencies of control input for sensor node 1, sensor node 2, sensor node 3, and sensor node 4 are 14.42%, 12.28%, 18.57%, and 14.28%, respectively.

Environmental Monitoring
In this section, the proposed cooperative control scheme (CCS) is applied to complete the environment monitoring.

Simulation Environment
Contour maps have been used for the simulation of the monitoring environment in recent references [2,[50][51][52]. As can be seen from these references, the simulation environment is a static, scalar field. The environmental attributes include odor concentration, temperature, salinity, pH values, and so on. Its distribution can be generated according to some complex functions. We used the shifted Schwefel's function in reference [11] to simulate the monitored environment known as Region A, the shifted sphere function in reference [11] to simulate Region B, and Schwefel's function 2.6 from reference [11] to simulate Region C. The three regions are shown in Figure 7, from which one can see that, as the function value increases, the color gradually becomes lighter. It should be noted that the purpose of environmental monitoring is to establish an environmental model to show the data distributions of attributes in order to provide services for environmental protection. Therefore, in order for the established model to reflect the actual distribution of the environmental attributes, we needed to use the proposed cooperative control scheme to coordinate the mobile sensor network such that it could locate the scalar field with the greatest amount of information. Therefore, from the above description, it can be seen that, in the following study, our objective was to coordinate the mobile sensor network to find the regions where color is lighter, as shown in Figure 7.
The parameters for the environmental model (3) are shown in Table 1. The mobile sensor network's parameters are shown in Table 2. The parameters of the proposed CCS approach were β = 0.2, γ = 1.76, α = 0.9, and h = 0.1. These are different from the parameters used in the example since the chosen parameters enabled the proposed CCS approach to obtain better results for environmental monitoring. Moreover, we carefully adjusted the parameters through many simulations and then obtained the above chosen parameters. The communication topology is shown in Figure 4.
Moreover, the event-triggered finite-time (ETFT) approach described in reference [11], which is a typical comparison approach, has been used in mobile sensor networks for environmental monitoring. The corresponding parameters can be found in reference [11]. Notice that the parameters β, γ, α of the proposed CCS approach are the same with the ones for the ETFE approach.  (3).

Parameters Values
The number of radial basis functions, m 20 The The initial weight, θ j [1,5] The initial covariance matrix, P(0) 3I m

Performance Metrics
Two performance metrics were used to evaluate the proposed cooperative control scheme. The first performance metric was the communication frequency, defined by where f re i represents the communication frequency for the ith sensor node. The "Total Sampling Number" represents the total number of sampling times during a run. The "Communication Number" is the real communication time for the ith sensor node. Therefore, f re i could be used to evaluate the sensor node's communication and computational burden.
The root-mean-square (RMS i ) error was used to evaluate the modeling accuracy.
where r l (x l ) is the actual detected value for the lth sensor node at position x l ; q i (x l ) is the estimated value calculated from the environmental model for position x l . Based on RMS i , another performance metric is the modeling error (ME) given by where x j is the position of the jth sampling point in the search regions, and Π is the number of total sampling points in the search regions for each environmental model. The performance metric ME was used to evaluate the accuracy of the model given by mobile sensor networks. Figure 8 shows the contour maps built by sensor nodes 1, 2, 3, and 4 for Region A in one run. From Figure 8, one can see that the mobile sensor network can locate the maximum values of environmental attributes where the red circles represent the start positions, the red stars represent the end positions, and the blue lines refer to the movement trajectories of sensor nodes. The contour maps provided by four sensor nodes are similar due to the directed communication topology and orderly movement. Correspondingly, the RMS errors are shown in Figure 9, from which one can clearly see that, with the movement of sensor nodes, the RMS errors become smaller.  The communication frequencies of sensor node 1, sensor node 2, sensor node 3, and sensor node 4 are shown in Table 3 for a total run time of 140 s and a sampling time of 0.01 s. From this table, one can see that, since the comparison algorithm ETFT [11] uses the continuous-time communication mechanism, the communication frequency is 100% for all sensor nodes. However, the ETFT algorithm obtains a better updating frequency, except for sensor node 1, compared with the proposed CCS approach shown in Table 4. Note that the updating frequency of the proposed CCS approach is the same as its communication frequency due to the design fashion of the proposed CCS approach. The modeling errors (ME) are shown in Table 5, from which one can see that the modeling errors for the CCS are smaller than the ones for ETFT approach [11].

Environmental Monitoring for Region B
The trajectories of the mobile sensor network for Region B are shown in Figure 10. As we can see from the figure, the mobile sensor network can accurately locate the brighter area in the monitored environment, and the contour color map constructed by the sensor nodes can represent the data distribution of environmental attributes. Also, it can be seen that the RMS errors are small in Figure 11.  The communication frequencies of sensor nodes are shown in Table 6 for the total run time of 140 s and the sampling time of 0.01 s. Similar to Region A, communication frequencies are also smaller compared with the ones from the ETFT approach since the ETFT approach uses the continuous-time communication mechanism. Table 7 shows the updating frequency of the control input for the two approaches where the updating frequencies of control input for the CCS approach are bigger than the ones for the ETFT approach. In addition, the modeling errors are shown in Table 8, from which one can see that the proposed CCS approach has less errors compared with the ETFT approach.

Environmental Monitoring for Region C
Similarly, for Region C, based on the proposed CCS approach, the sensor nodes trace the maximum values of environmental attributes and produce the brighter region shown in Figure 12. In addition, the RMS errors become small with the movement of sensor nodes, as shown in Figure 13.
The communication frequencies of controllers of sensor nodes are shown in Table 9 for the total run time of 140 s and sampling time of 0.01 s, which means that the communication burden can be relaxed. On the other hand, the updating frequencies of control input for the proposed CCS approach are higher than the ones for the ETFT approach from Table 10. Moreover, Table 11 shows the modeling errors for the proposed CCS approach compared with the ETFT approach.

Discussion
When using finite-time consensus control, from the aforementioned results, one can see that the mobile sensor network can quickly adjust movement trajectories to track the gradient direction provided by environmental models. Compared with the original contour maps, the established environment maps with small RMS errors can better reflect the data distribution of environmental attributes. Moreover, compared with the ETFT approach, the proposed CCS approach obtains smaller modeling errors, which implies that the proposed CCS approach is efficient for building the environmental model. Furthermore, since the event-based communication rule is used, the proposed CCS approach not only obtains a low communication frequency, but also has a lower updating frequency of control input, which implies that energy consumption of sensor nodes is saved. Even though the ETFT approach obtains a lower updating frequency of control input compared with the proposed CCS approach, the approach still needs continuous-time communication. Hence, from the aforementioned results, one can see that the proposed CCS approach shows good performance capabilities for the energy consumption and communication bandwidth of sensor nodes. It should be pointed out that one main reason for obtaining the smaller updating frequencies of control input for both the proposed CCS approach and the ETFT approach is that the gradient information from the environmental model can better guide the movement of sensor nodes toward the regions with the greatest amount of information for Region A, Region B, and Region C.

Conclusions
We designed a cooperative control scheme for the problem of environmental monitoring which includes three modules: a wireless communication module, a direction decision module, and a motion control module. In the wireless communication module, we proposed an event-based communication rule that can adjudge whether or not the data need to be transmitted. The use of the proposed event-based communication rule can save the communication bandwidth and energy consumption of sensor nodes. In the direction decision module, we used a radial basis function network to model the environmental attributes and showed the data distribution for environmental protection. In the motion control module, we designed a finite-time consensus controller that can enable the sensor nodes to quickly adjust the movement direction based on the information from the environmental model. In particular, the proposed cooperative control scheme is still efficient under the directed communication situation. Finally, we showed the effectiveness of the proposed cooperative control scheme for the problem of environmental monitoring.

Appendix A. Model Transformation
In order to prove Theorem 1, we assumedv to transform the mathematical model of the mobile sensor network. Thus, the mobile sensor network (6) with finite-time controller (8) was be changed to the following form: Furthermore, in order to simplify the model presentation, we set

Appendix B. Some Lemmas from References
We present Lemma 1 from reference [53], which shows the conditions of finite-time convergence. Lemma 1 can be used to prove the finite-time consensus of sensors' state under the proposed event-based communication and finite-time consensus control approach.

Lemma 1.
For the systemẋ(t) = f (x(t)) where x ∈ N ⊆ R n and N is the origin's open neighborhood. If there is a continuously differentiable function V : N → R which satisfies where k is a positive constant and α ∈ (0, 1) , the systemẋ(t) = f (x(t)) is finite-time stable. T : N \ {0} → (0, ∞) is the map where N \ {0} is an open neighborhood which does not contain the origin. The settling time, T(x(0)), satisfies Lemma 2 and Lemma 3 are from reference [15] and provide some inequalities that can be used to simply the proof process of Theorem 1.

Lemma 2.
For p i , i = 1, . . . , n and Lemma 3. Consider p ∈ R, q ∈ R. When the conditions c > 0 and d > 0 are satisfied, we have |p| c |q| d ≤ c c+d |p| c+d + d c+d |q| c+d .

Appendix C. Some Proposed Lemmas
The inequality T Msig( ) α ≥ k ∑ n i=1 | i | α+1 ≥ 0 is important to simplify the proof of Theorem 1. Lemma 4 shows the structure conditions of communication topology such that the above the inequality is satisfied.
Lemma 4. Let = [ 1 , . . . , n ] T ∈ R n . I n represent the n × n identity matrix. 0 < α ≤ 1 and M = L G n + diag{p 10 , . . . , p n0 }. If a positive constant k = min i=1,...,n { α α+1 (∑ n j=1 p ij − ∑ n j=1 p ji ) + p i0 } exists, where p ij is the non-negative adjacency elements for weighted adjacency matrix P From Lemma 3, we obtain Then, we can derive Lemma 5 and Lemma 6 describe the relationship of the given variables φ i (t), y i (t i s ) and z i (t i s ) in (A2) and are used to simplify the proof of Theorem 1.
It is clear to see that ∆ is a semi-positive definite matrix.
Consider the set U = {σ ∈ R 2n : σ T σ = 1} and this set is bounded and closed. For ζ(t) ||ζ(t)|| 2 ∈ U , we set which exists and is larger than zero. Therefore, we obtain The proof of this lemma is completed.
Under the proposed event-based rule (2) for the mobile sensor network (A2), we show an inequality condition that is used to simplify the proof of Theorem 1.

Lemma 7.
Consider the mobile sensor network (A2) using the event-based rule (2). The following inequality holds: M n 1−α 2 and k 1 is a positive constant.

Proof. We can obtain
(βe Further, we have where e Lemma 8 shows the conditions of the parameters from the proposed event-based rule (2) which is used to simplify the proof of Theorem 1.

Lemma 8.
For the mobile sensor network (A2) using the event-based rule (2), if positive constants k 1 and k 1 > 2h 2 exist, the following inequality is established: Proof. We consider the event-triggered rule (2) and have M 2 βe Clearly, one can derive

Appendix D. Proof of Theorem 1
The following proof is divided into four parts. In Part I, we prove the given Lyapunov candidate function, V(t) ≥ 0. In Part II, we prove that mobile sensor network (2) asymptotically reaches consensus. In Part III, we prove that mobile sensor network (2) reaches consensus in finite time. In Part IV, Zeno-behaviors are excluded from mobile sensor network (2) before consensus is achieved.
Part I: We prove the given Lyapunov candidate function, V(t) ≥ 0. The following Lyapunov candidate function is given as where I n is a n-dimensional unit matrix and ξ(t) = [y(t) T , z(t) T ] T . From Lemma 4, we obtain that for any vector ∈ R n , T M ≥ 0, which means M + M T is a positive definite matrix.
The following matrix variable is set as Ω = βγ(M + M T ) βI n βI n γI n .
As M + M T is a positive definite matrix, it can be rewritten as Γ −1 ΛΓ where Λ = diag{µ 1 , µ 2 , . . . , µ n } is a diagonal matrix consisting of the eigenvalues of M + M T . Then, we derive The below matrix variable is derived as Ω = βγΛ βI n βI n γI n .
Further, the eigenvalues of matrixΩ are solved as The eigenvalues ofΩ are calculated by where c = 4(βγ 2 µ i − β 2 ). λ i+ and λ i− are called the eigenvalues ofΩ. When c > 0, i.e., γ > β µ min where µ min is the minimum eigenvalue of M + M T , andΩ has positive eigenvalues. As a result, the matrix Ω is a positive definite matrix. Thus, V(t) ≥ 0.
Part II: We prove that mobile sensor network (2) asymptotically reaches consensus.
Part III: We prove that mobile sensor network (2) reaches consensus in finite time.
Part IV: Zeno-behaviors are excluded from mobile sensor network (2) before consensus is achieved.
Note that e ix (t i s ) = 0 and x i (t i s ) is a constant for t ∈ [t i s , t i s+1 ). Hence, we derive the following inequality as where s v is the maximum value of the velocity's absolute value. Similarly, we can derive where s a is the maximum value of the acceleration'absolute value. Moreover, we have M |βe ix + γe iv | + p i0 |βe i0x + γe i0v | ≤ (( M + 1)βs v + ( M + 1)γs a )(t − t i s ). In terms of the event-based rule (2), the next event is triggered at t = t i s+1 , which means M |βe ix + γe iv | + p i0 |βe i0x + γe i0v | > h(|βy i (t i s )| + |γz i (t i s )|) at t = t i s+1 . Hence, we have (( M + 1)βs v + ( M + 1)γs a )(t i s+1 − t i s ) > h(|βy i (t i s )| + |γz i (t i s )|). Before consensus is achieved, t i s+1 − t i s >