# Consensus of the Distributed Varying Scale Wireless Sensor Networks

Authors: Jinping Mou; Wuneng Zhou; Tianbo Wang; Chuan Ji; Dongbing Tong
Journal: Mathematical Problems in Engineering
 (2013)

---

## Abstract

Consensus problems are investigated for a type of the distributed varying scale wireless sensor network (VSWSN), where the scale of the network is increasing or decreasing due to the new nodes joining in or the invalid nodes quitting from WSN, respectively. In order to demonstrate the communicating behaviors more realistic, we offer the node attached component sequence for each valid
node under the general sleep algorithm. Based on the component sequences, several concepts, such as the local limited intersection connection (LLI connection) and the global limited intersection connection
(GLI connection), are provided to display the connectivity of the varying topology. Under certain conditions, the designed protocol ensures that all sensors arrive at the component consensus or the global consensus if the communicating graph is LLI connected or GLI connected, respectively. By the basic theoretical analysis, several consensus criterions are obtained. In the meanwhile, the consensus regions are investigated. The numerical example shows the reliability of the proposed results.


---

## Body

## 1. Introduction

Consensus is of great importance in many applications of wireless sensor networks (WSNs) [1], such as the clock synchronization [2], data fusion [3, 4], and formation control [5]. To achieve the consensus, it requires that all nodes of the networks achieve the special value, while they may begin with the different initial values.In the past few years, consensus problems have been widely investigated, and many exciting results have been obtained. The early work of consensus problems can be found in [6], where the consensus problems are investigated for the fixed scale networks. The most further researches focus on optimizing the algorithms and the communicating topology, such as in [7–10], and the optimal algorithms are taken to solve the consensus. Other researchers devote to optimize the topology, such as Lin and Jia solve the average consensus problems of multiagents with time delay in the jointly connected topology [11]; Atrianfar and Haeri deal with the average consensus problems in the weak connected topology [12]; consensus problems are studied under the sleeping-awaking method [13, 14].In recent years, some consensus results of the scale-free networks, where the scale of the networks may be increasing, are obtained in the exciting literatures [15, 16].And so far, consensus regions of the networks have attracted much attention by some researchers, such as Li et al. who propose an observer-type protocol to solve the consensus problem, and meanwhile an unbounded consensus region was provided [17]. Based on the connected network, consensus regions are investigated in the multiagent dynamical systems [18, 19].It should point out that in the traditional consensus literatures, the scale of the network is fixed or increasing. Namely, the newly joined nodes and the invalid removed nodes have not been considered. In fact, the varying scale wireless sensor network (VSWSN) exists in many applications. For example, after the limited power exhausted, the nodes become invalid, or when the new nodes join the network, the scale of WSN is changed, and the related consensus regions are indefinite. However, up to now, consensus problems of VSWSN with the consensus regions have not caused much attention.The main purpose of this paper is to investigate the consensus problems of VSWSN and its consensus regions. In the traditional literatures, the connected topology, the weak connected topology, or the jointly connected topology is the basic condition for the network communication. Different from the traditional literatures, in VSWSN, while some new nodes join in the network and some nodes quit from the network, VSWSN may neither connected, nor jointly connected, nor weak connected, and the communicating behaviors among those nodes are indefinite and random. The communicating graph of VSWSN which we proposed in this paper is displayed by the node attached component sequence. It turns out that if every two nodes have chance to connect, namely, the topology is the local limited intersection connected (LLI connected) or the global limited intersection connected (GLI connected), and the intersection topology has the enough dwell time, then under the designed protocol, VSWSN achieves the component consensus or the global consensus.Moreover, the consensus regions are different from the traditional literatures. In the traditional literatures, the consensus value is determined by the state of the fixed node set. In VSWSN, the consensus value is varying according to the varying node set. So the considered systems in this paper are more general than that of network with the fixed node set, which the topology is the special case of the global limited intersection connection.The outline of this paper is listed as follows. In Section2, some basic concepts and notations are introduced. In Section 3, we provided the main results. For each certain topology, the consensus criterions and the consensus regions are investigated in detail. For the varying topology in which some nodes may be added while some other nodes may be removed, the consensus criterions and the consensus regions are also provided. In Section 5, a numeral example shows the reliability of the proposed results. In Section 6, several conclusions are obtained.


## 2. Preliminaries

### 2.1. Graph Theory and Notations

Letℵ={0-,1-,2-,…,κ-,κ+1¯,…} be all possible topologies of WSN, where the relations of the elements can be expressed by the partial sequence 0-⪯1-⪯2-⪯⋯⪯κ-⪯⋯, and 0- is the initial topology.Letθ:T→ℵ be the discernible function among the topologies, θ(k)=κ-∈ℵ, where (m~κ-1+1)l≤k≤m~κl, l∈R+, k=zl, z∈N, T={0,l,2l,…,m~0l,(m~0+1)l,…,m~1l,…,m~κl,…}, m~κ=m0+m1+⋯+mκ, {m0,m1,…,mκ,…}⊆Z+, and mκ is called the dwell time.According to the functionθ, the varying scale WSN (VSWSN) can be denoted by a varying graph G(θ(m~κl))=G(κ-)={V(κ-),A(κ-),E(κ-)}, where V(κ-)=V1(κ-)∪V2(κ-), V1(κ-)={1κ-,2κ-,…,iκ-,…,uκ-} is the valid node set that all elements come from the former topology κ-1¯, V2(κ-)={1κ-′,2κ-′,…,vκ-′} is the newly joined node set, and E(κ-)={(iκ-,jκ-)∣iκ-≠jκ-,iκ-,jκ-∈V(κ-)} is the edge set. A(κ-)=(aij(κ-))wκ-∈Rwκ-×wκ- is the weighted symmetric matrix, where wκ-=uκ-+vκ-, if aij(κ-)=1, then there exists information flow between iκ- and jκ-, if aij(κ-)=0, then there is no communication between iκ- and jκ-. Niκ-={jκ-∣iκ-≠jκ-,iκ-,jκ-∈V(κ-)} refers to the neighbor set of node iκ- in the topology κ-.L
(
w
κ
-
)
=
(
l
i
j
(
κ
-
)
)
w
κ
-
×
w
κ
- is a Laplacian matrix, and liκ-jκ- is defined as
(1)lij(κ-)={∑jκ-‍aij(κ-),iκ-=jκ-,jκ-∈Niκ-(k),-aij(κ-),iκ-≠jκ-,jκ-∈Niκ-(k).Similarly, a component which the connected subgraph ofG(κ-) can be denoted by C′(κ-)={V′(κ-),A′(κ-),E′(κ-)}, V′(κ-)⊂V(κ-),E′(κ-)⊂E(κ-). The relation between G(κ-) and C′(κ-) is denoted by C′(κ-)⊂G(κ-).Definition 1.
For alliκ-∈V(κ-), if there exists a component C′(κ-) of G(κ-) such that iκ-∈V′(κ-), then C′(κ-), is said to be the node attached component of iκ-, if there exists the sequence C′(κ-),C′(κ+1¯),…, such that iκ-∈V′(κ-),iκ-∈V′(κ+1¯)…, then the sequence C′(κ-),C′(κ+1¯),… is said to be the node attached component sequence of node iκ-.Definition 2.
For alliκ-,jκ-∈V(κ-), if there exists two related attached component sequences C′(κ-1), C′(κ-2),…,C′(κ-r),…, and C′′(κ-1),C′′(κ-2),…,C′′(κ-r),…, respectively, and if there exist κ-0∈ℵ and ℵ′={κ-r1,κ-r1+1,…,κ-r1+m1,κ-r2+1,…,κ-r2+m2,…,κ-rq+1,κ-rq+mq,…}⊂ℵ, such that
(2)C′(κ-r1+m1)=C′′(κ-r1+m1),C′(κ-r2+m2)=C′′(κ-r2+m2),…,C′(κ-rq+mq)=C′′(κ-rq+mq),…,
where r1,m1,…,rq,mq∈Z+, κ0⪯κ-r1⪯κ-r1+1⪯⋯⪯κ-rq+mq, then the communicating graph is said to be the local limited intersection connected (LLI connected), and κ-r1+m1,κ-r2+m2,…,κ-rq+mq are called the intersection topologies.Definition 3.
For alliκ-,jκ-∈V(κ-), if there exists two related attached component sequences C′(κ-1), C′(κ-1),…,C′(κ-r),… and C′′(κ-1),C′′(κ-1),…,C′′(κ-r),…, respectively, and if there exist κ-0∈ℵ and ℵ′={κ-r,κ-r+1,…}⊂ℵ, such that for all κ-0⪯κ-r, C′(κ-r)=C′′(κ-r), then the communicating graph is said to be the global limited intersection connected (GLI connected).Under LLI connected and GLI connected, we are going to discuss the consensus problems of VSWSN in the following sections.


### 2.2. Problem Statement

In many applications, the communication of VSWSN is based on the multiple components. In this paper, the consensus problems which we considered are the component-based communication.Foriκ-∈V(κ-), let xi(k,κ-) be the state of sensor or node iκ-, where xi(k,κ-)∈Rd,d∈Z+. Suppose the state of iκ- is given by
(3)xi(k+l,κ-)=bxi(k,κ-)+uiκ-(k),
where b is a constant, uiκ-(k) is the consensus protocol and is given by
(4)uiκ-(k)=ϵiκ-∑jκ-∈Niκ-(k)‍[aij(κ-)xj(k,κ-)-a~ij(κ-)xi(k,κ-)],
where a~ij(κ-) is a positive constant.For allC′(κ-)⊂G(κ-), under the dynamic (3) and protocol (4), the state of component C′(κ-) which attaches on node iκ- can be displayed as follows:
(5)Xn^κ-(k+l)=(Bn^κ--ϵn^κ-Ln^κ-)Xn^κ-(k),
where
(6)(m~κ-1+1)l≤k≤m~κl,n^κ-=pκ-+qκ-′≤wκ-,Bn^κ-=diag{b,…,b,…,b},ϵn^κ-=diag{ϵ1κ-,…,ϵiκ-,…,ϵn^κ-}.Ln^κ-=(liκ-jκ-)n^κ-×n^κ-, and liκ-jκ- is defined as
(7)liκ-jκ-={∑jκ-‍a~ij(κ-),iκ-=jκ-,jκ-∈Niκ-(k),-aij(κ-),iκ-≠jκ-,jκ-∈Niκ-(k),Xn^κ-(k)=[Xpκ-(k)T,Xqκ-′(k)T]T,Xpκ-(k) is the vector state of the valid nodes that come from the former topology κ-1¯, Xqκ-′(k) is the vector state of the newly joined nodes, pκ-≤uκ-, qκ-′≤vκ-,
(8)Xpκ-(k)=[x1κ-(k,κ-),…,xi(k,κ-),…,xp(k,κ-)]T,iκ-∈V1(κ-),Xqκ-′(k)=[x1′(k,κ-),…,xi′(k,κ-),…,xq′(k,κ-)]T,iκ-′∈V2(κ-).Remark 4.
Analogously, ifn^κ- is substituted by wκ-, then system (5) expresses the state of the whole VSWSN.
For the node attached componentC′(κ-), sensors 1κ-′,…,qκ-′ are the newly joined nodes, and the state of each newly joined node at time k is equal to the state at time k-l in the topology κ-1¯.Definition 5.
For allC′(κ-)⊂G(κ-), if
(9)∑iκ-,jκ-∈V′(κ-)‍∥xi(m~κl,κ-)-xj(m~κl,κ-)∥2<cmκd~iκ-∑iκ-∈V′(κ-)‍∥xi((m~κ-1+1)l,κ-)∥2,
where 0<c<1, d~iκ- refers to the maximal degree node of C′(κ-), then VSWSN (5) is said to be the component potential consensus. In addition, if C′(κ-)=G(κ-) and (9) holds, then VSWSN (5) is said to be the global potential consensus.Definition 6.
For allC′(κ-)⊂G(κ-) and for all iκ-,qκ-∈V′(κ-), if
(10)limk→∞∥xi(k,κ-)-xq(k,κ-)∥=0,
then VSWSN (5) is said to be achieved the component consensus. In addition, if C′(κ-)=G(κ-) and (10) holds, then VSWSN (5) is said to be achieved the global consensus.
Letxi0(k,κ-)=(1/n^κ-)∑iκ-∈V′(κ-)‍xi(k,κ-), if limk→∞∥xi(k,κ-)-xi0(k,κ-)∥=0, then VSWSN (5) is said to be achieved the component average consensus. In addition, if C′(κ-)=G(κ-) and (10) holds, then VSWSN (5) is said to be achieved the global average consensus.Theorem 7.
For allC′(κ-)⊂G(κ-), if there exists a constant η, such that
(11)[(Bn^κ--ϵn^κ-Ln^κ-)T]mκL(n^κ-)(Bn^κ--ϵn^κ-Ln^κ-)mκ<d~iκ-η2mκIn^κ-,
where 0<η<1, then VSWSN (5) is the component potential consensus. In addition, if C′(κ-)=G(κ-), then VSWSN (5) is the global potential consensus.Proof.
Note that∑iκ-,qκ-′∈V′(κ-)‍∥xi(m~κl,κ-)-xj(m~κl,κ-)∥2=Xn^κ-T(m~κl)L(n^κ-)Xn^κ-(m~κl)=Xn^κ-T((m~κ-1+1)l)[(Bn^κ--ϵn^κ-Ln^κ-)T]mκL(n^κ-)(Bn^κ--ϵn^κ-Ln^κ-)mκXn^κ-((m~κ-1+1)l), if [(Bn^κ--ϵn^κ-Ln^κ-)T]mκL(n^κ-)(Bn^κ--ϵn^κ-Ln^κ-)mκ<d~iκ-η2mκIn^κ-, then
(12)∑iκ-,qκ-′∈V′(κ-)‍∥xi(m~κl,κ-)-xj(m~κl,κ-)∥2<d~iκ-η2mκ∥Xn^κ-((m~κ-1+1)l)∥2.
Similarly, we can get the result whenC′(κ-)=G(κ-).Remark 8.
If VSWSN (5) is the component potential consensus or the global potential consensus, then the errors among the adjacent nodes are decreased, but it does not mean that system achieves consensus, in any case, the consensus is constrained by the dwell time mκ.Assumption 1.
We assume that for each intersection topologyκ-, their exists m>0, such that mκ>m.Remark 9.
If a sensor leaves from its neighbors and becomes an isolated node, and its state may not keep in coordination with other nodes. Note that if the communicating graph is LLI connected or GLI connected, the node has chance to keep in coordinating with other nodes.For alliκ-∈V′(κ-), let eκ-i(k)=xi(k,κ-)-xi0(k,κ-); we get the systematic error of (5) as follows:
(13)eκ-(k)=Xn^κ-(k)-1n^κ-⊗xi0(k,κ-)=ΓXn^κ-(k)=Γ(Bn^κ--Ln^κ-)Xn^κ-(k-l),
where eκ-(k)=(eκ-1(k),eκ-2(k)…,eκ-n^(k))T, Γ=In^κ--(1/n^κ-)×1n^κ-×n^κ-, and 1n^κ-×n^κ- is the n^κ-×n^κ- matrix in which each entry is 1.The primary purpose of this paper is to provide the basic consensus analysis of (5) for the aforementioned scenarios. Because the scale of the network is a variable, different from the traditional literatures which investigate the consensus problems are based on the global structure, to study consensus problems, we depend on the component sequences. In the meanwhile, the consensus regions are gotten in the following sections.


## 2.1. Graph Theory and Notations

Letℵ={0-,1-,2-,…,κ-,κ+1¯,…} be all possible topologies of WSN, where the relations of the elements can be expressed by the partial sequence 0-⪯1-⪯2-⪯⋯⪯κ-⪯⋯, and 0- is the initial topology.Letθ:T→ℵ be the discernible function among the topologies, θ(k)=κ-∈ℵ, where (m~κ-1+1)l≤k≤m~κl, l∈R+, k=zl, z∈N, T={0,l,2l,…,m~0l,(m~0+1)l,…,m~1l,…,m~κl,…}, m~κ=m0+m1+⋯+mκ, {m0,m1,…,mκ,…}⊆Z+, and mκ is called the dwell time.According to the functionθ, the varying scale WSN (VSWSN) can be denoted by a varying graph G(θ(m~κl))=G(κ-)={V(κ-),A(κ-),E(κ-)}, where V(κ-)=V1(κ-)∪V2(κ-), V1(κ-)={1κ-,2κ-,…,iκ-,…,uκ-} is the valid node set that all elements come from the former topology κ-1¯, V2(κ-)={1κ-′,2κ-′,…,vκ-′} is the newly joined node set, and E(κ-)={(iκ-,jκ-)∣iκ-≠jκ-,iκ-,jκ-∈V(κ-)} is the edge set. A(κ-)=(aij(κ-))wκ-∈Rwκ-×wκ- is the weighted symmetric matrix, where wκ-=uκ-+vκ-, if aij(κ-)=1, then there exists information flow between iκ- and jκ-, if aij(κ-)=0, then there is no communication between iκ- and jκ-. Niκ-={jκ-∣iκ-≠jκ-,iκ-,jκ-∈V(κ-)} refers to the neighbor set of node iκ- in the topology κ-.L
(
w
κ
-
)
=
(
l
i
j
(
κ
-
)
)
w
κ
-
×
w
κ
- is a Laplacian matrix, and liκ-jκ- is defined as
(1)lij(κ-)={∑jκ-‍aij(κ-),iκ-=jκ-,jκ-∈Niκ-(k),-aij(κ-),iκ-≠jκ-,jκ-∈Niκ-(k).Similarly, a component which the connected subgraph ofG(κ-) can be denoted by C′(κ-)={V′(κ-),A′(κ-),E′(κ-)}, V′(κ-)⊂V(κ-),E′(κ-)⊂E(κ-). The relation between G(κ-) and C′(κ-) is denoted by C′(κ-)⊂G(κ-).Definition 1.
For alliκ-∈V(κ-), if there exists a component C′(κ-) of G(κ-) such that iκ-∈V′(κ-), then C′(κ-), is said to be the node attached component of iκ-, if there exists the sequence C′(κ-),C′(κ+1¯),…, such that iκ-∈V′(κ-),iκ-∈V′(κ+1¯)…, then the sequence C′(κ-),C′(κ+1¯),… is said to be the node attached component sequence of node iκ-.Definition 2.
For alliκ-,jκ-∈V(κ-), if there exists two related attached component sequences C′(κ-1), C′(κ-2),…,C′(κ-r),…, and C′′(κ-1),C′′(κ-2),…,C′′(κ-r),…, respectively, and if there exist κ-0∈ℵ and ℵ′={κ-r1,κ-r1+1,…,κ-r1+m1,κ-r2+1,…,κ-r2+m2,…,κ-rq+1,κ-rq+mq,…}⊂ℵ, such that
(2)C′(κ-r1+m1)=C′′(κ-r1+m1),C′(κ-r2+m2)=C′′(κ-r2+m2),…,C′(κ-rq+mq)=C′′(κ-rq+mq),…,
where r1,m1,…,rq,mq∈Z+, κ0⪯κ-r1⪯κ-r1+1⪯⋯⪯κ-rq+mq, then the communicating graph is said to be the local limited intersection connected (LLI connected), and κ-r1+m1,κ-r2+m2,…,κ-rq+mq are called the intersection topologies.Definition 3.
For alliκ-,jκ-∈V(κ-), if there exists two related attached component sequences C′(κ-1), C′(κ-1),…,C′(κ-r),… and C′′(κ-1),C′′(κ-1),…,C′′(κ-r),…, respectively, and if there exist κ-0∈ℵ and ℵ′={κ-r,κ-r+1,…}⊂ℵ, such that for all κ-0⪯κ-r, C′(κ-r)=C′′(κ-r), then the communicating graph is said to be the global limited intersection connected (GLI connected).Under LLI connected and GLI connected, we are going to discuss the consensus problems of VSWSN in the following sections.


## 2.2. Problem Statement

In many applications, the communication of VSWSN is based on the multiple components. In this paper, the consensus problems which we considered are the component-based communication.Foriκ-∈V(κ-), let xi(k,κ-) be the state of sensor or node iκ-, where xi(k,κ-)∈Rd,d∈Z+. Suppose the state of iκ- is given by
(3)xi(k+l,κ-)=bxi(k,κ-)+uiκ-(k),
where b is a constant, uiκ-(k) is the consensus protocol and is given by
(4)uiκ-(k)=ϵiκ-∑jκ-∈Niκ-(k)‍[aij(κ-)xj(k,κ-)-a~ij(κ-)xi(k,κ-)],
where a~ij(κ-) is a positive constant.For allC′(κ-)⊂G(κ-), under the dynamic (3) and protocol (4), the state of component C′(κ-) which attaches on node iκ- can be displayed as follows:
(5)Xn^κ-(k+l)=(Bn^κ--ϵn^κ-Ln^κ-)Xn^κ-(k),
where
(6)(m~κ-1+1)l≤k≤m~κl,n^κ-=pκ-+qκ-′≤wκ-,Bn^κ-=diag{b,…,b,…,b},ϵn^κ-=diag{ϵ1κ-,…,ϵiκ-,…,ϵn^κ-}.Ln^κ-=(liκ-jκ-)n^κ-×n^κ-, and liκ-jκ- is defined as
(7)liκ-jκ-={∑jκ-‍a~ij(κ-),iκ-=jκ-,jκ-∈Niκ-(k),-aij(κ-),iκ-≠jκ-,jκ-∈Niκ-(k),Xn^κ-(k)=[Xpκ-(k)T,Xqκ-′(k)T]T,Xpκ-(k) is the vector state of the valid nodes that come from the former topology κ-1¯, Xqκ-′(k) is the vector state of the newly joined nodes, pκ-≤uκ-, qκ-′≤vκ-,
(8)Xpκ-(k)=[x1κ-(k,κ-),…,xi(k,κ-),…,xp(k,κ-)]T,iκ-∈V1(κ-),Xqκ-′(k)=[x1′(k,κ-),…,xi′(k,κ-),…,xq′(k,κ-)]T,iκ-′∈V2(κ-).Remark 4.
Analogously, ifn^κ- is substituted by wκ-, then system (5) expresses the state of the whole VSWSN.
For the node attached componentC′(κ-), sensors 1κ-′,…,qκ-′ are the newly joined nodes, and the state of each newly joined node at time k is equal to the state at time k-l in the topology κ-1¯.Definition 5.
For allC′(κ-)⊂G(κ-), if
(9)∑iκ-,jκ-∈V′(κ-)‍∥xi(m~κl,κ-)-xj(m~κl,κ-)∥2<cmκd~iκ-∑iκ-∈V′(κ-)‍∥xi((m~κ-1+1)l,κ-)∥2,
where 0<c<1, d~iκ- refers to the maximal degree node of C′(κ-), then VSWSN (5) is said to be the component potential consensus. In addition, if C′(κ-)=G(κ-) and (9) holds, then VSWSN (5) is said to be the global potential consensus.Definition 6.
For allC′(κ-)⊂G(κ-) and for all iκ-,qκ-∈V′(κ-), if
(10)limk→∞∥xi(k,κ-)-xq(k,κ-)∥=0,
then VSWSN (5) is said to be achieved the component consensus. In addition, if C′(κ-)=G(κ-) and (10) holds, then VSWSN (5) is said to be achieved the global consensus.
Letxi0(k,κ-)=(1/n^κ-)∑iκ-∈V′(κ-)‍xi(k,κ-), if limk→∞∥xi(k,κ-)-xi0(k,κ-)∥=0, then VSWSN (5) is said to be achieved the component average consensus. In addition, if C′(κ-)=G(κ-) and (10) holds, then VSWSN (5) is said to be achieved the global average consensus.Theorem 7.
For allC′(κ-)⊂G(κ-), if there exists a constant η, such that
(11)[(Bn^κ--ϵn^κ-Ln^κ-)T]mκL(n^κ-)(Bn^κ--ϵn^κ-Ln^κ-)mκ<d~iκ-η2mκIn^κ-,
where 0<η<1, then VSWSN (5) is the component potential consensus. In addition, if C′(κ-)=G(κ-), then VSWSN (5) is the global potential consensus.Proof.
Note that∑iκ-,qκ-′∈V′(κ-)‍∥xi(m~κl,κ-)-xj(m~κl,κ-)∥2=Xn^κ-T(m~κl)L(n^κ-)Xn^κ-(m~κl)=Xn^κ-T((m~κ-1+1)l)[(Bn^κ--ϵn^κ-Ln^κ-)T]mκL(n^κ-)(Bn^κ--ϵn^κ-Ln^κ-)mκXn^κ-((m~κ-1+1)l), if [(Bn^κ--ϵn^κ-Ln^κ-)T]mκL(n^κ-)(Bn^κ--ϵn^κ-Ln^κ-)mκ<d~iκ-η2mκIn^κ-, then
(12)∑iκ-,qκ-′∈V′(κ-)‍∥xi(m~κl,κ-)-xj(m~κl,κ-)∥2<d~iκ-η2mκ∥Xn^κ-((m~κ-1+1)l)∥2.
Similarly, we can get the result whenC′(κ-)=G(κ-).Remark 8.
If VSWSN (5) is the component potential consensus or the global potential consensus, then the errors among the adjacent nodes are decreased, but it does not mean that system achieves consensus, in any case, the consensus is constrained by the dwell time mκ.Assumption 1.
We assume that for each intersection topologyκ-, their exists m>0, such that mκ>m.Remark 9.
If a sensor leaves from its neighbors and becomes an isolated node, and its state may not keep in coordination with other nodes. Note that if the communicating graph is LLI connected or GLI connected, the node has chance to keep in coordinating with other nodes.For alliκ-∈V′(κ-), let eκ-i(k)=xi(k,κ-)-xi0(k,κ-); we get the systematic error of (5) as follows:
(13)eκ-(k)=Xn^κ-(k)-1n^κ-⊗xi0(k,κ-)=ΓXn^κ-(k)=Γ(Bn^κ--Ln^κ-)Xn^κ-(k-l),
where eκ-(k)=(eκ-1(k),eκ-2(k)…,eκ-n^(k))T, Γ=In^κ--(1/n^κ-)×1n^κ-×n^κ-, and 1n^κ-×n^κ- is the n^κ-×n^κ- matrix in which each entry is 1.The primary purpose of this paper is to provide the basic consensus analysis of (5) for the aforementioned scenarios. Because the scale of the network is a variable, different from the traditional literatures which investigate the consensus problems are based on the global structure, to study consensus problems, we depend on the component sequences. In the meanwhile, the consensus regions are gotten in the following sections.


## 3. Main Results

In this section, we are going to discuss the component potential consensus and the global potential consensus firstly. Then the relations between the component potential consensus and the component consensus, the global potential consensus and the global consensus are studied.


### 3.1. Consensus Investigation for WSN in a Certain Topology

In this subsection, we study the potential consensus problems of the certain topology. For convenience, we focus on the componentC′(κ-), its topology index is dropped and denoted by C′, and its state is denoted by Xn^(k). The error of Xn^(k) is denoted by e(k)=Xn^(k)-1n^×1⊗xi0(k). To express the state of e(k), we depend on the eigenvalues. Let eigen(Bn^-ϵLn^) be the eigenvalue set of the matrix (Bn^-ϵLn^), let λi be the ith eigenvalue of Bn^-ϵLn^, and λ=max{|λi|∣i∈V′(κ-)}.To achieve the potential consensus, it requires that the error(14)e(k)=Xn^(k)-1n^×1⊗xi0(k)=ΓXn^(k)=Γ(Bn^-ϵLn^)Xn^(k-l)
is decreasing. To keep the decreasing error, it requires that λ takes in some values, and the following discussion focuses on how to take the value of parameter ϵi to get the needed λ.


#### 3.1.1. Potential Consensus undera~ij=aij

Fora~ij=aij, we get L(n^κ-)=Ln^κ-, and the simplified protocol of (4) can be shown by
(15)ui=ϵi∑j∈Ni(k)‍aij[xj(k)-xi(k)].Theorem 10.
If0≤b<1 and ϵi satisfies
(16)0<ϵi<1+b2di,
where di=∑j∈Ni‍aji, then under (15), each component of VSWSN (5) is the component potential consensus.Proof.
If0≤b<1, and ϵi satisfies (16), based on the Geřsgorin disc theorem, it holds that
(17)-1<b-2diϵi<λi<b<1,
hence |λ|<1. We have [(Bn^-ϵLn^)T]mL(n^κ-)(Bn^-ϵLn^)m<λ2md~iIn^. Following Theorem 7, subsystem (5) is the potential consensus. This completes the proof.Theorem 11.
If-1≤b<0 and ϵi satisfies
(18)-1+b2di<ϵi<0,
then under (15), subsystem (5) is the component potential consensus.The proof is similar to that of Theorem10, and it is omitted.Remark 12.
Ifb=1 and V(κ-) is the fixed node set, then the related consensus problems discussed here are the same as in literatures [6, 20]. However, when |b|>1, the protocol (15) and the protocol listed in the literatures [6, 20] cannot insure subsystem (5) to achieve the consensus, and the following section will solve the problems.
In (15), if ϵi is equal to a certain value and V(κ-) is the fixed node set, then system converges to one equilibrium point. In order to get the wide consensus regions, the value of ϵi takes in (0,(1+b)/2di), and the similarly reasons are taken by the Theorems 13 and 14 as follows.


#### 3.1.2. Potential Consensus undera~ij=bξ/diϵi+aij

When|b|≥1, for each node i, changes its weight appropriately, the related consensus problems can be transformed to the problems of |b|<1. If we choose a~ij=bξ/diϵi+aij, then the protocol (4) can be expressed by
(19)ui=ϵi∑j∈Ni(k)‍aij[xj(k)-xi(k)]-bξxi(k).
In this situation, the dynamic of each component in VSWSN can be shown by
(20)Xn^(k+l)=(B^n^-ϵLn^)Xn^(k),
where B^n^=diag{b(1-ξ),b(1-ξ),…,b(1-ξ)}, ϵ=diag{ϵ1^,ϵ2^,…,ϵn^}.Based on Theorems7 and 10, we get the following theorem.Theorem 13.
Whenb≥1, if ϵi and ξ satisfy
(21)0<ϵi<1+b(1-ξ)2di,1≤ξ<1b+1,
then, under (19), subsystem (20) is the component potential consensus.Proof.
According to Geřsgorin disc theorem, we obtain|λi-ϵidi|≤|ϵi|di. From (21), we get -1<b(1-ξ)-2ϵidi<λκ-<b(1-ξ)<1. Similarly to the proof of Theorem 10, based on Theorem 7, it is known that subsystem (20) is the component potential consensus. This completes the proof.Similarly to Theorem13, we obtain theorem as follows.Theorem 14.
Whenb≤-1, if ϵi and ξ satisfy
(22)-1+b(1-ξ)2di<ϵi<0,1<ξ<-1b+1,
then under protocol (19), subsystem (20) is the component potential consensus.


### 3.2. Consensus Investigation for WSN in the Varying Topology

Based on the discussion of the potential consensus, in this subsection, we investigate the consensus problems of the node attached component in VSWSN.From analog equation (14), we get
(23)eκ-(m~κl)=ΓXn^κ-(m~κl).
Let λκ-=max{|λ~|∣λ~∈eigen(Bn^κ--ϵn^κ-Ln^κ-)}, yκ-(k)=norm2(Xqκ-′(k,κ-)); it holds the following proposition.Proposition 15.
For allC′(κ-)⊂G(κ-), where C′(κ-) attaches on node iκ-, it can be shown that
(24)∑iκ-,jκ-∈V′(κ-)‍||[eκ-i(m~κl)-eκ-j(m~κl)]||2≤λκ-2mκ⋯λ0-′2m0-′d~iκ-||X0-′(0)||2+Λ(κ-),
where 0-′,1-′,2-′,…,κ- are the different topologies that iκ- will appear successively as follows:
(25)Λ(κ-)=d~iκ-[λκ-2mκyκ-(m~κl)+⋯+λκ-2mκ⋯λ3-′2m3-′λ2-′2m2-′y2-′(m~2l)+λκ-2mκ⋯λ1-′2m1-′y1-′(m~1l)λ3-′2m3-′λ2-′2m2-′].Proof.
Noting that(26)∑iκ-,jκ-‍||[eκ-i(m~κl)-eκ-j(m~κl)]||2=[eκ-T(m~κl)L(n^κ-)eκ-(m~κl)],
from (23), it results in
(27)∑iκ-,jκ-‍||[eκ-i(m~κl)-eκ-j(m~κl)]||2=[Xn^κ-(m~κl)TΓTL(n^κ-)ΓXn^κ-(m~κl)]=[Xn^κ-((m~κ-1+1)l)T(Bn^κ--ϵκ-Ln^κ-)mκΓTL(n^κ-)Γ=×(Bn^κ--ϵκ-Ln^κ-)mκXn^κ-((m~κ-1+1)l)].
Since the absolute of each eigenvalue of Γ is no more than 1, the absolute of each eigenvalue of L(n^κ-) is no more than d~iκ-, and the absolute of each eigenvalue of Bn^κ--ϵLn^κ- is no more than λκ-. The following inequality is obtained:
(28)[eκ-T(m~κl)L(n^κ-)eκ-(m~κl)]≤λκ-2mκd~iκ-Xn^κ-((m~κ-1+1)l)TXn^κ-((m~κ-1+1)l).
On the other hand,
(29)Xn^κ-((m~κ-1+1)l)TXn^κ-((m~κ-1+1)l)≤Xpκ-((m~κ-1+1)l)TXpκ-((m~κ-1+1)l)+Xqκ-′((m~κ-1+1)l)TXqκ-′((m~κ-1+1)l)≤Xpκ-((m~κ-1+1)l)TXpκ-((m~κ-1+1)l)+yκ-(m~κ-1)l,
where Xqκ-′(k) refers to the state vector of all newly jointed nodes in component C′(κ-); Xpκ-(k) means the state vector of the component which attaches on node iκ- and all related valid nodes that come from the former topology κ-1¯.
Considering some nodes in topologyκ-1¯ may be invalid at time m~κl, the node attached component of iκ- in the topology κ-1¯ contains 1κ-,…,pκ- and may contain other nodes. In addition, the values of 1κ-,…,pκ- at time k are equal to the 1κ-1¯,…,pκ-1¯ at time k-l, then it holds
(30)Xpκ-(k)TXpκ-(k)≤Xn^κ-1¯(k-l)TXn^pκ-1¯(k-l).
Following (29), (30), it can be shown that
(31)[Xn^κ-(m~κl)TL(n^κ-)Xn^κ-(m~κl)]≤λκ-2mκd~iκ-[Xn^κ-1¯((m~κ-1+1)l)TXn^κ-1¯((m~κ-1+1)l)≤λκ-2mκd~iκ-+yκ-(m~κ-1)l((m~κ-1+1)l)T].
Similaring to (31), we have
(32)Xn^κ-1¯((m~κ-1+1)l)TXn^κ-1¯((m~κ-1+1)l)≤λκ-1¯2(mκ-1)[Xpκ-1¯((m~κ-2+1)l)TXpκ-1¯((m~κ-2+1)l)≤λκ-1¯2(mκ-1)+yκ-1¯(m~κ-2)l((m~κ-2+1)l)T].
Combining (32) and (31), we get
(33)[Xκ-(m~κl)TL(n^κ-)Xn^κ-(m~κl)]≤d~iκ-[λκ-2mκλκ-1¯2mκ-1Xpκ-1¯((m~κ-2+1)l)TXpκ-1¯((m~κ-2+1)l)≤d~iκ-+λκ-2mκλκ-1¯2mκ-1yκ-1¯(mκ-1l)+λκ-2mκyκ-(mκl)((m~κ-2+1)l)T].
Based on (30), (31), (32), and (33), by the limited iterative, we get (24).Theorem 16.
If each component (5) of WSN is LLI connected, then the following statements hold. (i) If 0≤b<1, ϵiκ- satisfies (16), and (34) holds, then under protocol (15), each component (5) achieves the component consensus.
(ii) If-1<b≤0, ϵiκ- satisfies (18), and (34) holds, then under protocol (15), each component (5) achieves the component consensus, where
(34)limm→∞Λ(κ-)=0.
In addition, if subsystem (5) is GLI connected, then under protocol (15), subsystem (5) achieves the global consensus.Proof.
(i) When0≤b<1 and ϵiκ- satisfies (16), if WSN is LLI connected and (34) holds, then for all iκ′,jκ′∈V(κ′), there exist two related node attached components C′ and C′′ of iκ′ and jκ′, respectively, such that in the jointed topology κ0, (κ′⪯κ0) Proposition 15 holds.
Based on Theorem10, Assumption 1, subsystem (5) is the component potential consensus, then
(35)limm→∞(λκ-2mκ⋯λ0-2m0-′d~iκ-∥X0-′(0)∥2)=0.
On the other hand, if (34) holds, then limm→∞(∑iκ-,jκ-∈V′(κ-)‍∥[eκ-i(m~κl)-eκ-j(m~κl)]∥2)=0.
So it holdslimm→∞xi(k,κ-)=xj(k,κ-).
(ii) Similarly, we can get the result when-1<b≤0; we also can show that VSWSN is the global consensus when WSN is GLI connected. This completes the proof.Theorem 17.
If component (5) is LLI connected, then the following statements hold. (i) If b≥1, ϵiκ-,ξ satisfy (21), and if (34) holds, then under (19), subsystem (20) is the component consensus.
(ii) If-1≥b, ϵiκ-,ξ satisfy (22), and if (34) holds, then under (19), subsystem (20) is the component consensus.
In addition, if VSWSN (5) is GLI connected, then under protocol (19), VSWSN (20) is the global consensus.Proof.
Similar to the proof of Theorem16, it is omitted.


## 3.1. Consensus Investigation for WSN in a Certain Topology

In this subsection, we study the potential consensus problems of the certain topology. For convenience, we focus on the componentC′(κ-), its topology index is dropped and denoted by C′, and its state is denoted by Xn^(k). The error of Xn^(k) is denoted by e(k)=Xn^(k)-1n^×1⊗xi0(k). To express the state of e(k), we depend on the eigenvalues. Let eigen(Bn^-ϵLn^) be the eigenvalue set of the matrix (Bn^-ϵLn^), let λi be the ith eigenvalue of Bn^-ϵLn^, and λ=max{|λi|∣i∈V′(κ-)}.To achieve the potential consensus, it requires that the error(14)e(k)=Xn^(k)-1n^×1⊗xi0(k)=ΓXn^(k)=Γ(Bn^-ϵLn^)Xn^(k-l)
is decreasing. To keep the decreasing error, it requires that λ takes in some values, and the following discussion focuses on how to take the value of parameter ϵi to get the needed λ.


### 3.1.1. Potential Consensus undera~ij=aij

Fora~ij=aij, we get L(n^κ-)=Ln^κ-, and the simplified protocol of (4) can be shown by
(15)ui=ϵi∑j∈Ni(k)‍aij[xj(k)-xi(k)].Theorem 10.
If0≤b<1 and ϵi satisfies
(16)0<ϵi<1+b2di,
where di=∑j∈Ni‍aji, then under (15), each component of VSWSN (5) is the component potential consensus.Proof.
If0≤b<1, and ϵi satisfies (16), based on the Geřsgorin disc theorem, it holds that
(17)-1<b-2diϵi<λi<b<1,
hence |λ|<1. We have [(Bn^-ϵLn^)T]mL(n^κ-)(Bn^-ϵLn^)m<λ2md~iIn^. Following Theorem 7, subsystem (5) is the potential consensus. This completes the proof.Theorem 11.
If-1≤b<0 and ϵi satisfies
(18)-1+b2di<ϵi<0,
then under (15), subsystem (5) is the component potential consensus.The proof is similar to that of Theorem10, and it is omitted.Remark 12.
Ifb=1 and V(κ-) is the fixed node set, then the related consensus problems discussed here are the same as in literatures [6, 20]. However, when |b|>1, the protocol (15) and the protocol listed in the literatures [6, 20] cannot insure subsystem (5) to achieve the consensus, and the following section will solve the problems.
In (15), if ϵi is equal to a certain value and V(κ-) is the fixed node set, then system converges to one equilibrium point. In order to get the wide consensus regions, the value of ϵi takes in (0,(1+b)/2di), and the similarly reasons are taken by the Theorems 13 and 14 as follows.


### 3.1.2. Potential Consensus undera~ij=bξ/diϵi+aij

When|b|≥1, for each node i, changes its weight appropriately, the related consensus problems can be transformed to the problems of |b|<1. If we choose a~ij=bξ/diϵi+aij, then the protocol (4) can be expressed by
(19)ui=ϵi∑j∈Ni(k)‍aij[xj(k)-xi(k)]-bξxi(k).
In this situation, the dynamic of each component in VSWSN can be shown by
(20)Xn^(k+l)=(B^n^-ϵLn^)Xn^(k),
where B^n^=diag{b(1-ξ),b(1-ξ),…,b(1-ξ)}, ϵ=diag{ϵ1^,ϵ2^,…,ϵn^}.Based on Theorems7 and 10, we get the following theorem.Theorem 13.
Whenb≥1, if ϵi and ξ satisfy
(21)0<ϵi<1+b(1-ξ)2di,1≤ξ<1b+1,
then, under (19), subsystem (20) is the component potential consensus.Proof.
According to Geřsgorin disc theorem, we obtain|λi-ϵidi|≤|ϵi|di. From (21), we get -1<b(1-ξ)-2ϵidi<λκ-<b(1-ξ)<1. Similarly to the proof of Theorem 10, based on Theorem 7, it is known that subsystem (20) is the component potential consensus. This completes the proof.Similarly to Theorem13, we obtain theorem as follows.Theorem 14.
Whenb≤-1, if ϵi and ξ satisfy
(22)-1+b(1-ξ)2di<ϵi<0,1<ξ<-1b+1,
then under protocol (19), subsystem (20) is the component potential consensus.


## 3.1.1. Potential Consensus undera~ij=aij

Fora~ij=aij, we get L(n^κ-)=Ln^κ-, and the simplified protocol of (4) can be shown by
(15)ui=ϵi∑j∈Ni(k)‍aij[xj(k)-xi(k)].Theorem 10.
If0≤b<1 and ϵi satisfies
(16)0<ϵi<1+b2di,
where di=∑j∈Ni‍aji, then under (15), each component of VSWSN (5) is the component potential consensus.Proof.
If0≤b<1, and ϵi satisfies (16), based on the Geřsgorin disc theorem, it holds that
(17)-1<b-2diϵi<λi<b<1,
hence |λ|<1. We have [(Bn^-ϵLn^)T]mL(n^κ-)(Bn^-ϵLn^)m<λ2md~iIn^. Following Theorem 7, subsystem (5) is the potential consensus. This completes the proof.Theorem 11.
If-1≤b<0 and ϵi satisfies
(18)-1+b2di<ϵi<0,
then under (15), subsystem (5) is the component potential consensus.The proof is similar to that of Theorem10, and it is omitted.Remark 12.
Ifb=1 and V(κ-) is the fixed node set, then the related consensus problems discussed here are the same as in literatures [6, 20]. However, when |b|>1, the protocol (15) and the protocol listed in the literatures [6, 20] cannot insure subsystem (5) to achieve the consensus, and the following section will solve the problems.
In (15), if ϵi is equal to a certain value and V(κ-) is the fixed node set, then system converges to one equilibrium point. In order to get the wide consensus regions, the value of ϵi takes in (0,(1+b)/2di), and the similarly reasons are taken by the Theorems 13 and 14 as follows.


## 3.1.2. Potential Consensus undera~ij=bξ/diϵi+aij

When|b|≥1, for each node i, changes its weight appropriately, the related consensus problems can be transformed to the problems of |b|<1. If we choose a~ij=bξ/diϵi+aij, then the protocol (4) can be expressed by
(19)ui=ϵi∑j∈Ni(k)‍aij[xj(k)-xi(k)]-bξxi(k).
In this situation, the dynamic of each component in VSWSN can be shown by
(20)Xn^(k+l)=(B^n^-ϵLn^)Xn^(k),
where B^n^=diag{b(1-ξ),b(1-ξ),…,b(1-ξ)}, ϵ=diag{ϵ1^,ϵ2^,…,ϵn^}.Based on Theorems7 and 10, we get the following theorem.Theorem 13.
Whenb≥1, if ϵi and ξ satisfy
(21)0<ϵi<1+b(1-ξ)2di,1≤ξ<1b+1,
then, under (19), subsystem (20) is the component potential consensus.Proof.
According to Geřsgorin disc theorem, we obtain|λi-ϵidi|≤|ϵi|di. From (21), we get -1<b(1-ξ)-2ϵidi<λκ-<b(1-ξ)<1. Similarly to the proof of Theorem 10, based on Theorem 7, it is known that subsystem (20) is the component potential consensus. This completes the proof.Similarly to Theorem13, we obtain theorem as follows.Theorem 14.
Whenb≤-1, if ϵi and ξ satisfy
(22)-1+b(1-ξ)2di<ϵi<0,1<ξ<-1b+1,
then under protocol (19), subsystem (20) is the component potential consensus.


## 3.2. Consensus Investigation for WSN in the Varying Topology

Based on the discussion of the potential consensus, in this subsection, we investigate the consensus problems of the node attached component in VSWSN.From analog equation (14), we get
(23)eκ-(m~κl)=ΓXn^κ-(m~κl).
Let λκ-=max{|λ~|∣λ~∈eigen(Bn^κ--ϵn^κ-Ln^κ-)}, yκ-(k)=norm2(Xqκ-′(k,κ-)); it holds the following proposition.Proposition 15.
For allC′(κ-)⊂G(κ-), where C′(κ-) attaches on node iκ-, it can be shown that
(24)∑iκ-,jκ-∈V′(κ-)‍||[eκ-i(m~κl)-eκ-j(m~κl)]||2≤λκ-2mκ⋯λ0-′2m0-′d~iκ-||X0-′(0)||2+Λ(κ-),
where 0-′,1-′,2-′,…,κ- are the different topologies that iκ- will appear successively as follows:
(25)Λ(κ-)=d~iκ-[λκ-2mκyκ-(m~κl)+⋯+λκ-2mκ⋯λ3-′2m3-′λ2-′2m2-′y2-′(m~2l)+λκ-2mκ⋯λ1-′2m1-′y1-′(m~1l)λ3-′2m3-′λ2-′2m2-′].Proof.
Noting that(26)∑iκ-,jκ-‍||[eκ-i(m~κl)-eκ-j(m~κl)]||2=[eκ-T(m~κl)L(n^κ-)eκ-(m~κl)],
from (23), it results in
(27)∑iκ-,jκ-‍||[eκ-i(m~κl)-eκ-j(m~κl)]||2=[Xn^κ-(m~κl)TΓTL(n^κ-)ΓXn^κ-(m~κl)]=[Xn^κ-((m~κ-1+1)l)T(Bn^κ--ϵκ-Ln^κ-)mκΓTL(n^κ-)Γ=×(Bn^κ--ϵκ-Ln^κ-)mκXn^κ-((m~κ-1+1)l)].
Since the absolute of each eigenvalue of Γ is no more than 1, the absolute of each eigenvalue of L(n^κ-) is no more than d~iκ-, and the absolute of each eigenvalue of Bn^κ--ϵLn^κ- is no more than λκ-. The following inequality is obtained:
(28)[eκ-T(m~κl)L(n^κ-)eκ-(m~κl)]≤λκ-2mκd~iκ-Xn^κ-((m~κ-1+1)l)TXn^κ-((m~κ-1+1)l).
On the other hand,
(29)Xn^κ-((m~κ-1+1)l)TXn^κ-((m~κ-1+1)l)≤Xpκ-((m~κ-1+1)l)TXpκ-((m~κ-1+1)l)+Xqκ-′((m~κ-1+1)l)TXqκ-′((m~κ-1+1)l)≤Xpκ-((m~κ-1+1)l)TXpκ-((m~κ-1+1)l)+yκ-(m~κ-1)l,
where Xqκ-′(k) refers to the state vector of all newly jointed nodes in component C′(κ-); Xpκ-(k) means the state vector of the component which attaches on node iκ- and all related valid nodes that come from the former topology κ-1¯.
Considering some nodes in topologyκ-1¯ may be invalid at time m~κl, the node attached component of iκ- in the topology κ-1¯ contains 1κ-,…,pκ- and may contain other nodes. In addition, the values of 1κ-,…,pκ- at time k are equal to the 1κ-1¯,…,pκ-1¯ at time k-l, then it holds
(30)Xpκ-(k)TXpκ-(k)≤Xn^κ-1¯(k-l)TXn^pκ-1¯(k-l).
Following (29), (30), it can be shown that
(31)[Xn^κ-(m~κl)TL(n^κ-)Xn^κ-(m~κl)]≤λκ-2mκd~iκ-[Xn^κ-1¯((m~κ-1+1)l)TXn^κ-1¯((m~κ-1+1)l)≤λκ-2mκd~iκ-+yκ-(m~κ-1)l((m~κ-1+1)l)T].
Similaring to (31), we have
(32)Xn^κ-1¯((m~κ-1+1)l)TXn^κ-1¯((m~κ-1+1)l)≤λκ-1¯2(mκ-1)[Xpκ-1¯((m~κ-2+1)l)TXpκ-1¯((m~κ-2+1)l)≤λκ-1¯2(mκ-1)+yκ-1¯(m~κ-2)l((m~κ-2+1)l)T].
Combining (32) and (31), we get
(33)[Xκ-(m~κl)TL(n^κ-)Xn^κ-(m~κl)]≤d~iκ-[λκ-2mκλκ-1¯2mκ-1Xpκ-1¯((m~κ-2+1)l)TXpκ-1¯((m~κ-2+1)l)≤d~iκ-+λκ-2mκλκ-1¯2mκ-1yκ-1¯(mκ-1l)+λκ-2mκyκ-(mκl)((m~κ-2+1)l)T].
Based on (30), (31), (32), and (33), by the limited iterative, we get (24).Theorem 16.
If each component (5) of WSN is LLI connected, then the following statements hold. (i) If 0≤b<1, ϵiκ- satisfies (16), and (34) holds, then under protocol (15), each component (5) achieves the component consensus.
(ii) If-1<b≤0, ϵiκ- satisfies (18), and (34) holds, then under protocol (15), each component (5) achieves the component consensus, where
(34)limm→∞Λ(κ-)=0.
In addition, if subsystem (5) is GLI connected, then under protocol (15), subsystem (5) achieves the global consensus.Proof.
(i) When0≤b<1 and ϵiκ- satisfies (16), if WSN is LLI connected and (34) holds, then for all iκ′,jκ′∈V(κ′), there exist two related node attached components C′ and C′′ of iκ′ and jκ′, respectively, such that in the jointed topology κ0, (κ′⪯κ0) Proposition 15 holds.
Based on Theorem10, Assumption 1, subsystem (5) is the component potential consensus, then
(35)limm→∞(λκ-2mκ⋯λ0-2m0-′d~iκ-∥X0-′(0)∥2)=0.
On the other hand, if (34) holds, then limm→∞(∑iκ-,jκ-∈V′(κ-)‍∥[eκ-i(m~κl)-eκ-j(m~κl)]∥2)=0.
So it holdslimm→∞xi(k,κ-)=xj(k,κ-).
(ii) Similarly, we can get the result when-1<b≤0; we also can show that VSWSN is the global consensus when WSN is GLI connected. This completes the proof.Theorem 17.
If component (5) is LLI connected, then the following statements hold. (i) If b≥1, ϵiκ-,ξ satisfy (21), and if (34) holds, then under (19), subsystem (20) is the component consensus.
(ii) If-1≥b, ϵiκ-,ξ satisfy (22), and if (34) holds, then under (19), subsystem (20) is the component consensus.
In addition, if VSWSN (5) is GLI connected, then under protocol (19), VSWSN (20) is the global consensus.Proof.
Similar to the proof of Theorem16, it is omitted.


## 4. The Consensus Regions

In fact, the former sections discuss consensus problems that require the state of each node keeps in coordination with the average valuex0(k,κ-), and the value of x0(k,κ-) is decided by the parameters ϵiκ- and ξ. The regions of ϵiκ- and ξ mean that the changeable value of x0(k,κ-) has a widely range. Hence, in this section, we investigate the consensus regions.Definition 18.
Under protocol (4) or (19), the region of ϵiκ- and ξ, such that VSWSN (5) is the component consensus or the global consensus, is called the consensus region.In the varying topology, denotediκ-=∑jκ-∈Niκ-‍aij(κ-),
(36)Ψiκ-1={-1+b2diκ-<ϵiκ-<0},Ψiκ-2={0<ϵiκ-<1+b2diκ-},Υiκ-1={-1+b(1-ξ)2diκ-<ϵiκ-<0},Υiκ-2={0<ϵiκ-<1+b(1-ξ)2diκ-},Ξκ-1={1<ξ<-1b+1},Ξκ-2={1<ξ<1b+1},Ψκ-1=∏i∈V′(κ-)Ψiκ-1,Ψκ-2=∏i∈V′(κ-)Ψiκ-2,Υκ-1=∏i∈V′(κ-)Υiκ-1,Υκ-2=∏i∈V′(κ-)Υiκ-2,
and following Theorems 7, 10, and 13, we get the following corollary.Corollary 19.
Under protocol (4) or (19), if G(κ-) is LLI connected or GLI connected, then the following statements hold.(1)
If0≤b<1, then for all ϵκ-∈Ψκ-2, system (5) achieves the component potential consensus or the global potential consensus, respectively.(2)
If-1<b<0, then for all ϵκ-∈Ψκ-1, system (5) achieves the component potential consensus or the global potential consensus, respectively.(3)
Ifb≥1, then for all ϵκ-×ξ∈Υκ-2×Ξκ-2, system (20) achieves the component potential consensus or the global potential consensus, respectively.(4)
Ifb≤-1, then for all ϵκ-×ξ∈Υκ-1×Ξκ-1, system (20) achieves the component potential consensus or the global potential consensus, respectively.Following Theorem16 and Corollary 19, it holds the following results.Corollary 20.
Under protocol (4) or (19), if G(κ-) is LLI connected or GLI connected and (34) holds, then the following statements hold.(1)
If0≤b<1, then for all ϵκ-∈Ψκ-2, system (5) achieves the component consensus or the global consensus, respectively.(2)
If-1<b<0, then for all ϵκ-∈Ψκ-1, system (5) achieves the component consensus or the global consensus, respectively.(3)
Ifb≥1, then for all ϵκ-×ξ∈Υκ-2×Ξκ-2, system (20) achieves the component consensus or the global consensus, respectively.(4)
Ifb≤-1, then for all ϵκ-×ξ∈Υκ-1×Ξκ-1, system (20) achieves the component consensus or the global consensus, respectively.Proof.
(
1
) If G(κ-) is LLI connected, based on Corollary 19, when 0≤b<1, for all ϵκ-∈Ψiκ-2, under (4), WSN is the potential consensus. Following Theorem 16, if (34) holds, then subsystem (5) is the component consensus. Analogously, we can proof (2), (3), and (4).


## 5. Numerical Example

Example 21.
Consider two node attached componentsC′(κ-) and C′′(κ-) of 1κ-,3κ- (as shown in Figure 1), where 0-,1-, and 2- are the part topologies in sequence, aij(κ-) takes value in 0 or 1, and C′(1-)=C′′(1-) is the intersection topology. For C′(κ-) and C′′(κ-), the related node set sequences are shown as follows:
(37)V′(0-)={10-,20-,60-},V′(1-)={11-,21-,31-,41-,51-},V′(2-)={12-,22-},…,V′′(0-)={30-,40-},V′′(1-)={11-,21-,31-,41-,51-},V′′(2-)={32-,52-},….
Suppose that the state ofiκ- is shown as in (3), and consider the following three questions:(i)
whenb=0.6 or b=-0.6, in topology 0-, under protocol (15), determine whether system (5) achieves the component potential consensus or not;(ii)
whenb=5 or b=-5, in topology 0-, under protocol (19), determine whether system (20) achieves the component potential consensus or not;(iii)
suppose that WSN is LLI connected, the partial node attached components of 1, 3 are in topology sequence0-,1-, and 2- (as shown in Figure 1), and b=0.6, under protocol (15), determine whether system (5) achieves the component consensus or not. When WSN is GLI connected, two node attached components of 1, 3 are in topology sequence 0-,1- (as shown in Figure 1), under protocol (15), determine whether system (5) achieves the global consensus or not.Figure 1
For nodes 1 and 3, there are two related node attached components.For the above questions, under the related protocol, we can get (34) holds firstly. Then we propose the following analysis.For the first question, whenb=0.6, from (16), we get the consensus region of 0- as follows:
(38)Ψ0-2=∏i∈V′(0-)‍Ψi0-2,Ψi0-2={ϵi0-∣0<ϵi0-<0.8di0-},i0-∈{1,2,3,4,6}.
Choosing (0.5,0.3,0.5,0.7,0.6)T∈Ψ0-2, we get ϵ0-=diag{0.5,0.3,0.5,0.7,0.6}; when l=0.2, m0=10, the simulation result is shown in Figure 2.Figure 2
In topology0-, the node attached components of 1 and 3 achieve the potential consensus, respectively.Whenb=-0.6, from (16), we get the consensus region of topology 0- as follows:
(39)Ψ0-1=∏i∈V′(0-)‍Ψi0-1,Ψi0-1={ϵi0-∣-0.8di0-<ϵi0-<0},i0-∈{1,2,3,4,6}.
Choosing (-0.55,-0.3,-0.5,-0.6,-0.4)T∈Ψ0-1, we get ϵ0-=diag{-0.55,-0.3,-0.5,-0.6,-0.4}; when l=0.2, m0=10, the simulation result is shown in Figure 3.Figure 3
In topology0-, node attached components of 1 and 3 keep the component potential consensus, respectively.For the second question, whenb=5, from (21), we get the consensus region Υ0-2=∏i0-∈V′(0-)‍Υi0-2, where
(40)Υ0-2={0<ϵi0-<1+5(1-ξ)2di},Ξ0-2={1<ξ<65},i0-∈{1,2,3,4,6}.
Choosing 0.9×(0.5,0.3,0.5,0.7,0.6)T∈Ξ2×Υ0-2, we get ϵ0-=diag{0.5,0.3,0.6,0.7,0.65}; when l=0.2, m0=10, the simulation result is shown as Figure 4.Figure 4
In topology0-, node attached components of 1 and 3 keep the component potential consensus, respectively.Whenb=-5, from (21), we get the consensus region Υ0-1=∏i0-∈V′(0-)‍Υi0-1, where
(41)Υi0-1={-1+5(1-ξ)2di0-<ϵi0-<0},Ξ0-1={1<ξ<65},i0-∈{1,2,3,4,6}.
Choosing 0.9×(0.5,0.3,0.5,0.7,0.6)T∈Ξ1×Υ0-1, we have ϵ0-=diag{-0.6,-0.2,-0.5,-0.5,-0.3}; when l=0.2, m0=10, the simulation result is shown in Figure 5.Figure 5
In topology0-, node attached components of 1 and 3 keep the component potential consensus, respectively.For the last question, whenb=0.6, from (21) we get the consensus region of κ- below, where κ-∈{0-,1-,2-},
(42)Ψκ-2=∏i∈V′(κ-)‍Ψiκ-2,Ψiκ-2={0<ϵiκ-<1+5(1-ξ)2diκ-}.
Similarly, we choose ϵ0-=diag{0.5,0.3,0.6,0.7,0.65},  ϵi1-=ϵi2-=diag{0.5,0.3,0.6,0.7,0.65}. When l=0.2, if VSWSN is LLI connected, the part simulation results are shown in Figures 2, 6, and 7. And if VSWSN is GLI connected, the simulation results are shown in Figures 2 and 6.Figure 6
In topology1-, node attached components of 1 and 3 keep the component potential consensus, respectively.Figure 7
In topology2-, node attached components of 1 and 3 keep the component potential consensus, respectively.


## 6. Conclusions

This paper has investigated the consensus problems of VSWSN. According to the local limited intersection connected and the global limited intersection connected, it has provided several criterions of the component consensus and the global consensus. All gotten results have been based on the structures of the node attached component sequences. Based on the structure, the results cannot be influenced by the increasing-decreasing node set. In the meanwhile, it has given the consensus regions.



---

*Source: 862518-2013-03-11.xml*