 Research
 Open Access
 Published:
A data fusion method in wireless sensor network based on belief structure
EURASIP Journal on Wireless Communications and Networking volume 2021, Article number: 86 (2021)
Abstract
Considering the issue with respect to the high data redundancy and high cost of information collection in wireless sensor nodes, this paper proposes a data fusion method based on belief structure to reduce attribution in multigranulation rough set. By introducing belief structure, attribute reduction is carried out for multigranulation rough sets. From the view of granular computing, this paper studies the evidential characteristics of incomplete multigranulation ordered information systems. On this basis, the positive region reduction, belief reduction and plausibility reduction are put forward in incomplete multigranulation ordered information system and analyze the consistency in the same level and transitivity in different levels. The positive region reduction and belief reduction are equivalent, and the positive region reduction and belief reduction are unnecessary and sufficient conditional plausibility reduction in the same level, if the cover structure order of different levels are the same the corresponding equivalent positive region reduction. The algorithm proposed in this paper not only performs three reductions, but also reduces the time complexity largely. The above study fuses the node data which reduces the amount of data that needs to be transmitted and effectively improves the information processing efficiency.
Introduction
Wireless sensor network (WSN) is a multihop selforganizing system formed by wireless sensor nodes communicating with each other and connects the logic world with physical world, which have been considered as one of the most potential and influential technologies. However, due to the short communication distance of sensor nodes, limited information processing capabilities and the inability of a single node to provide all information, sensor nodes can only be deployed in an overlapping manner to obtain complete information about the object within the monitoring range. But this will lead to a series of problems such as high circuit complexity, high data redundancy and high node energy consumption. To effectively solve the above problems, this paper studies rough set theory and evidence theory, which can be used for data analysis and provide strong support data fusion technology in the real world of imprecise research [1,2,3,4,5,6] and proposed other two reductions based on the positive reduction. The propose of three reductions will provide novel insights and different angles to information processing in wireless communication and transmission.
The basic structure of rough set theory is an approximation space consisting of a universe of discourse, in which lower and upper approximations are defined to approximate a undefinable set by using equivalence relations [7,8,9]. Research on rough set mainly focuses on attribute reduction [10] to fuse information on sensor nodes. From the perspective of granular computing, three extensions of rough set model have been proposed in terms of the characters of data, respectively, multigranulation rough set based on multiscale, multilevel and multiangle [11,12,13,14,15,16,17,18,19,20]. A general concept of multigranulation rough set based on multiscale describes that an attribute of an object can only take one value in a singlescale information system where the object information is reflected at a fixed scale. We call such a singlescale information system as the classic Pawlak’s information system. However, in practical, an object could take on as many different hierarchical values under the same attribute with respect to different scales. And, there do exist special relationships among these hierarchical levels. One example is that the examination results of English for students can be recorded as natural numbers between 0 and 100, and it can also be graded as “Excellent,” “Good,” “Medium,” “Bad,” “Unacceptable.” Sometimes, if needed, it might be graded into two values, “Passed” and “Failed”. A hierarchy of such obtained information granules can be organized to a system which is called multiscale information system.
The evidence theory represents the uncertainty through the belief and plausibility function derived by the mass function which the core concept is belief structure and evidence structure [21,22,23]. Recently, the combination of evidence theory and rough set model become one of the research hotspots. As introduced in Yao et al. [24], the adequate condition for belief structure exactly exists in the classic rough set. On the above basis, this study was extended to covering rough set by Chen et al. [25, 26], who successfully employ the belief function and the plausibility function to describe the upper and lower approximations of the covering rough set, which means the numerical features of the rough set can be characterized by evidence theory. In particular, from the perspective of information fusion, Lin et al. [27] explore the relationship between evidence theory and classical multigranulation rough sets, which shows that, in general, the classic optimistic multigranulation rough set does not have its corresponding belief structure.
By introducing belief structure, this paper firstly studies the evidential characteristics of multigranulation rough set based on multiscale. On this basis, the positive region reduction, belief reduction and plausibility reduction are put forward in incomplete multigranulation ordered information system and then analyze the consistency in the same level and transitivity in different levels, which can reduce data redundancy and circuit complexity and save node limited resources through data fusion.
Method
This study puts forward the positive region reduction, belief reduction and plausibility reduction in terms of reducing data redundancy of WSN and proposes an algorithm to reduce the time complexity of attribute reduction. This section firstly introduces the basic preliminaries of WSN information processing, multigranulation rough set and belief structure. On this basis, the above three reductions are proposed and will be conducted in Sect. 3.
Preliminaries
WSN information processing
WSN is mainly composed of nodes, sensor network and users, which the core task of nodes is data perceiving and processing [28,29,30]. According to a certain standard, n nodes can form m clusters and the cluster header is selected in each cluster, which can also represent this cluster at a higher level. Meanwhile, the same mechanism is also applied between cluster headers to form a hierarchical structure [1]. In the above model, the real world is regarded as an information system according to the realistic data observed and measured by WSN. Every single node is considered as an object from the world, and the environment is descripted by a group of attributions which also called observation data. The attribute set can be divided into condition attributes and decision attributes for practical requirements, which are the input and output of the real world, respectively [1, 2, 30].
This hierarchical routing structure focuses on data which makes the node only interact with their neighbors within a certain range through localized principle, as Fig. 1 shown. And the cluster header will perform data fusion in the cluster so that the sensor node only automatically obtains and transmits effective information. This is also the key to WSN information fusion. In this case, rough set theory particularly suitable for intelligent information fusion at the global level while data from different cluster headers will be aggregate in the sink node, which means that the multigranulation rough set based on multiscale can fuse data in the cluster, which ensure that a small amount of effective information is transmitted between the cluster header and sink node with respect to effectively balance information processing, energy consumption and system performance.
Multigranulation rough set based on multiscale
Definition 1
[18] Let \(U=\left\{ x_1,x_2,\ldots ,x_n\right\}\) be a nonempty finite set of objects called the universe of discourse, \(AT^k= \left\{ a_1^k,a_2^k,\ldots ,a_m^k \right\}\) be a set of attributions and \(a_j\) be the attribute of multigranulation. For each object in U, the attribute \(a_j\) can take different values on the different levels of granulations. If f is the attribute value surjective function of different levels (that is, for every k representing the number of levels with a value of positive integer, there exists \(x \in U\) such that \(f(x)=k\)) and \(V^k\) is the domain of the attribute \(a^k\), then the quaternary \(MGIS=(U,AT^k,f^k,V^k)\) is called a multigranulation information system.
From the above definition, the multiscale information system will degenerate into the classic Pawlak information system when the number of granular levels is \(k=1\). For convenience of description, the following simplifies the multigranulation information system based on multiscale as a multigranulation information system.
Definition 2
[18] Let \(MGIS=(U,AT^k,f^k,V^k)\) be a multigranulation information system which arbitrary attribute \(a_j\) has I levels of granulations. We further define the attribute of \(a_j\) on the \(k\)th level of granulations \(a_j^k:U \rightarrow V_j^k\) represents a surjective function and \(V_j^k\) is the domain of the \(k\)th scale attribute \(a_j^k\) (that is, for any \(1 \le k \le I\), there exists \(x \in U\) such that \(a_j^k (x)=*\), where \((*)\) means variable quantity). And the surjective function \(g_j^{k,k+1} :V_j^k \rightarrow V_j^{k+1}\) (if there exists \(k+1\)) is called the granular transformation function with variable quantity \((*)\) as defined as follows:
On the basis of Definition 2, clearly, the value of an object between different levels of granulations is not arbitrary and depended on the value of the lower level in a multigranulation information system, which means the value of \(a_j^{k+1}(x)\) is determined by \(a_j^k(x)\).
Definition 3
[18] Let \(MGIS=(U,AT^k,f^k,V^k)\) be a multigranulation information system which arbitrary attribute \(a_j\) has I levels of granulations. For any \(1 \le k \le I\), the multigranulation information system MGOIS can be called multigranulation ordered information system if the attribute value range of any levels of granulations is all partial ordering.
And \(MGOIS^{* \ge }\), a multigranulation ordered information system with variable values \((*)\) and null values, is collectively referred to as an incomplete multigranulation ordered information system.
Definition 4
[18] Let \(MGOIS^{* \ge }=(U,AT^k,f^k,V^k)\) be an incomplete multigranulation information system which has I levels of granulations. For any \(1\le k\le I\), if the attribute set \(A^k\subseteq AT^k\) and two arbitrary elements \(x,y\in U\), then there exists \(R_{AT^k}^{*\ge }=\left\{ (x,y) \in U \times U \mid \forall a^k \in AT^k, (f(x,a^k) \le f(y,a^k)) \vee (f(x,a^k)=*) \vee (f(y,a^k)=*) \right\}\) can be called an incomplete multigranulation ordered information system dominance relationship.
On the above basis, if the pair \((x,y) \in R_{AT^k}^{*\ge }\), then \([X]_{AT^k}^{*\ge }\) means that y is finer than x or x is coarser than y. The relationship \(R_{AT^k}^{*\ge }\) can be considered as a kind of surjection from U to P(U) where P(U) is a power set. \(U/R=\left\{ y \in P(U)\mid x \in U\right\}\) is a covering of universe of discourse.
Definition 5
[18] Let \(MGOIS^{*\ge }=(U,AT^k,f^k,V^k)\) be an incomplete multigranulation ordered information system which has I levels of granulations. For every \(X \subseteq U\)and any \(1 \le k \le I\), the lower and upper approximations of X in the \(k\)th level of granulations are defined as \(\underline{R_{AT^k}^{*\ge }} (X)=\left\{ x \in U \mid [x]_{AT^k}^{*\ge } \subseteq U \right\}\) and \(\overline{R_{AT^k}^{*\ge }}(X)=\left\{ x \in U \mid [x]_{AT^k}^{*\ge }\cap X\ne \varnothing \right\}\), respectively.
From Definition 5, the relationship between the lower and upper approximations in the same levels of granulations has been clearly proved. \(\underline{R_{AT^k}^{*\ge }} (X)\) and \(\overline{R_{AT^k}^{*\ge }}(X)\) satisfy the following properties, which will be the theoretical foundation for the further discussions in this paper.
Proposition 1
[18] Let \(MGOIS^{*\ge }=(U,AT^k,f^k,V^k)\) be an incomplete multigranulation ordered information system which has I levels of granulations. For any \(1 \le k \le I\) and two elements \(X,Y \subseteq U\), we denote the complement of X in U as \(\sim U\), i.e., \(\sim U=UX=\left\{ x \in U \mid x \notin X \right\}\), then,
Theorem 1
Let \(MGOIS^{*\ge }=(U,AT^k,f^k,V^k)\) be an incomplete multigranulation ordered information system which has I levels of granulations. For any \(1 \le k \le I\) and every \(x \in U\), denote attribute subset \(A^k \subseteq AT^k\) then \([x]_{A^k}^{*\ge } \subseteq [x]_{A^{k+1}}^{*\ge }\), where \(1 \le k \le I1\).
Proof
On the basis of granular transformation function from Definition 2, it is easy to see that for any \(a_j^k\), there exists \(g_j^{k,k+1} (a_j^k (y)) \ge g_j^{k,k+1} (a_j^k (x))\) such that \(\left\{ y \in U \mid \forall a_j^k \in A^k \text { , } g_j^{k,k+1} (a_j^k (y)) \ge g_j^{k,k+1} (a_j^k (x)) \right\}\). Thus, we have \([x]_{A^k}^{* \ge } \subseteq [x]_{A^{K+1}}^{* \ge }\).
Theorem 1 represents the relationship of the attribute set AT in different levels of granulations, i.e., \(R_{AT^{k+1}}^{*\ge }\) is subdivided by the relationship \(R_{AT^k}^{*\ge }\) defined on the attribute set AT, and thus obtains the relationship between the upper and lower approximations in different levels of granulations. □
Proposition 2
Let \(MGOIS^{*\ge }=(U,AT^k,f^k,V^k)\) be an incomplete multigranulation ordered information system which has I levels of granulations. For any \(1 \le k \le I\) and every \(x \in U\), denote attribute subset \(A^k \subseteq AT^k\), then,

(1)
\(\underline{R_{AT^{k+1}}^{*\ge }}(X) \subseteq \underline{R_{AT^k}^{*\ge }}(X)\) where \(1 \le k \le I1\)

(2)
\(\overline{R_{AT^k}^{*\ge }}(X) \subseteq \overline{R_{AT^{k+1}}^{*\ge }}(X)\) where \(1 \le k \le I1\)
Proof

(1)
If for every \(x \in U\), there exists \(x \in \underline{R_{AT^{k+1}}^{*\ge }}(X)\) such that \([x]_{AT^{k+1}}^{*\ge } \subseteq X\). With theorem 1, if \([x]_{AT^k}^{*\ge } \subseteq X\), then \(x \in \underline{R_{AT^k}^{*\ge }}(X)\). Thus, we have proved that \(\underline{R_{AT^{k+1}}^{*\ge }}(X) \subseteq \underline{R_{AT^k}^{*\ge }}(X)\).

(2)
If for every \(x \in U\), there exists \(x \in \overline{R_{AT^{k+1}}^{*\ge }}(X)\) such that \([x]_{AT^k}^{*\ge } \cap X \ne \varnothing\). With theorem 1, if \([x]_{AT^{k+1}}^{*\ge } \cap X \ne \varnothing\), then \(x \in \overline{R_{AT^{k+1}}^{*\ge }}(X)\). Thus, we have proved that \(\overline{R_{AT^k}^{*\ge }}(X) \subseteq \overline{R_{AT^{k+1}}^{*\ge }}(X)\).
From Proposition 2, clearly, the lower approximation in the \((k+1)\)th level of granulations of X further subdivides the same in the \(k\)th and the upper approximation in the \((k+1)\)th level of granulation of X further subdivides the same in the \(k\)th. Moreover, we have the corresponding hierarchical sequence of approximations as follows.
In the following, employ Example 1 to illustrate \(\overline{R_{AT^1}^{*\ge }}(X) \subseteq \overline{R_{AT^2}^{*\ge }}(X) \subseteq \cdots \subseteq \overline{R_{AT^k}^{*\ge }}(X) \subseteq \overline{R_{AT^{k+1}}^{*\ge }}(X)\) for understanding the above eqs more conveniently. Example 1 will provide a table of the quantity of rape pests detected by WSN. For facilitating reduction, in the first level of granulation, the quantity will be regarded as 90 when it is between 80 and 100 or 70 when it is between 60 and 80, and it can deduce the rest from this. However, missing values will exist due to perception errors and access limitations in WSN to a certain extent, and unclear pictures or imprecise targets will be regarded as missing values. □
Example 1
Table 1 is an incomplete multigranulation ordered information system table of Rape pests detected by WSN in a certain period of time, where granularity \(I=3\), \(U=\left\{ x_1,x_2,x_3,x_4,x_5,x_6,x_7,x_8,x_9,x_{10},x_{11},x_{12}\right\}\) and \(AT^k=\left\{ a_1^k,a_2^k,a_3^k,a_4^k\right\}\). \(X_i (i=1,2,\ldots ,12)\) represents different clusters which stand for Cabbage butterfly, Aphids, Cabbage bug and Cricket, respectively. And \(AT^k\) is the attribute set where \(k=1,2,3\), which is the different levels of granulations. And \(*\) is the missing value. From a multigranular information system structure, we obtain the hierarchical sequence of attributes in different levels of granulations as follows.

(1)
The sequence of the value in the first level of granulation of the quantity of pests is \(\left\{ 1<2<\ldots <100\right\}\).

(2)
The sequence of the value in the second level of granulation of the grade of the quantity is \(\left\{ r<f<m<l<a \right\}\) where r, f, m, l and a represent rarely, few medium, lot and abundance, respectively.

(3)
The sequence of the value in the third level of granulation of the grade of risk is \(\left\{ S<F\right\}\) where S and F represent Seconds and Firsts, respectively.
For the above levels of granulations, the system is decomposed into three decision tables which are described as Tables 2, 3, 4, respectively.
From Table 2, we can derive that the value of the first level of granulation is as follows.
Suppose \(X=\left\{ x_1,x_6,x_8,x_{10},x_{11}\right\}\), then the reductions of the lower and upper approximation are \(\underline{R_{AT^1}^{*\ge }}(X)=\left\{ x_1,x_8,x_{10}\right\}\) and \(\overline{R_{AT^1}^{*\ge }}(X)=\left\{ U\right\}\), respectively.
From Table 3, we can derive that the value of the second level of granulation is as follows.
Suppose \(X=\left\{ x_1,x_6,x_8,x_{10},x_{11}\right\}\), then the reductions of the lower and upper approximation are \(\underline{R_{AT^2}^{*\ge }}(X)=\left\{ x_1,x_8,x_{10}\right\}\) and \(\overline{R_{AT^2}^{*\ge }}(X)=\left\{ U\right\}\), respectively. And for every \(x \in U\), we can obtain \([x]_{AT^1}^{* \ge } \subseteq [x]_{AT^2}^{* \ge }\).
From Table 4, we can obtain that the value of the third level of granulations is as follows.
Suppose \(X=\left\{ x_1,x_6,x_8,x_10,x_11\right\}\), then the reduction of the lower and upper approximation are \(\underline{R_{AT^3}^{*\ge }}(X)=\varnothing\) and \(\overline{R_{AT^3}^{*\ge }}(X)=\left\{ U\right\}\), respectively. And for every \(x \in U\), we can obtain \([x]_{AT^2}^{*\ge }\subseteq [x]_{AT^3}^{*\ge }\).
Example 1 illustrates that it is not arbitrary for the value of the same attribute of the same object in different levels of granulations and proves that the value of the higher level of granulations is determined by the lower, i.e., the a from the attribute \(a_1\) of \(x_1\) in the second level of granulations is determined by 90 from the value of the first level.
Evidence structure
Definition 6
[20,21,22] Let \(\Theta\) be a finite and nonempty set which is called the frame of discernment, where A is the arbitrary subset of \(\Theta\). If there exists a mapping function \(m:2^\Theta \rightarrow [0,1]\) that satisfies \(m(\varnothing )=0\) and \(\sum _{X \subseteq U} m(X)=1\), then we define that the function m is the basic probability assignment function or the mass function on \(2^\Theta\).
The degree of evidence exactly to A is indicated by m(A) . If there exists \(m(A)>0\), then we suppose that A is called the focal element of m and a family of all focal elements are viewed as the core. A pair of (F, m) is called a belief structure on the core. And we can obtain the other pair of the belief and plausibility functions can be derived as in terms of the mass function as Definition 7.
Definition 7
[20,21,22] Let \(\Theta\) be a finite and nonempty set which is called the frame of discernment, where A is the subset of \(\Theta\) and m is the basic probability assignment function of the frame of discernment \(\Theta\). The belief function is a mapping Bel(X) that satisfies \(Bel(X)=\sum _{A \subseteq U} m(A)\) and the plausibility is a mapping Pl(X) that satisfies \(Pl(X)=\sum _{A \cap X \ne \varnothing } m(A)\) .
The Belief function Bel(X) represents the true degree of trust for X, while the plausibility function Pl(X) indicates that it is no doubt with trust is not true for X. These two functions are based on the same belief structure that are connected by the dual property, i.e., \(Bel(X)=1Pl(\sim X)\), where \(\sim X\) is the complement of X. Also, the belief function can be defined by semiadditive measure as Definition 8.
Definition 8
[20,21,22] For the arbitrary subset \(2^\Theta\) of the frame of discernment, a mapping function \(Bel:2^\Theta \rightarrow [0,1]\) is belief function if it satisfies the following conditions.

(1)
\(Bel(\varnothing )=0\)

(2)
\(Bel(\Theta )=1\)

(3)
\(Bel(\bigcup _{i=1}^m X_i ) \ge \sum _{\varphi \ne J(1,2,\ldots ,m)} (1)^{U+1 } Bel(\bigcap _{i \in J}X_i )\)
Theorem 2
Let \(MGOIS^{*\ge }=(U,AT^k,f^k,V^k)\) be an incomplete multigranulation ordered information system which has I levels of granulations. For any \(1 \le k \le I\), denote the subset \(A^k \subseteq AT^k\). For every \(X \subseteq U\), then, \(Bel_{A^k}^{*\ge }(X)=\dfrac{\underline{R_{A^k}^{*\ge }}(X)}{U }\) and \(Pl_{A^k}^{*\ge }(X)=\dfrac{\overline{R_{A^k}^{*\ge }}(X)}{U }\) are the belief and plausibility function of the kth level of granulations, respectively, and the corresponding mass function is \(m_{A^k}(X)={\left\{ \begin{array}{ll} \dfrac{\left\{ x \in U [x]_{AT^k}^{*\ge }=X\right\} }{U }\\ 0 \text {, where \quad } x \in U \end{array}\right. }\).
Proof
According to Definition 6, we can derive that \(m_{A^k}(X)\) is called mass function and then only need to demonstrate that \(Bel_{A^k}^{*\ge }\) satisfies three conditions of Definition 8. From the basic Definition 7, we take \(Bel_{A^k}^{*\ge } (\varnothing )=0\) and \(Bel_{A^k}^{*\ge }(U)=1\), respectively. Next, prove the condition (3) of Definition 8. Considering a collection \(\left\{ x_1,x_2,\ldots ,x_n\right\} \subseteq U\), then we have
Hence, \(Bel_{A^k}^{*\ge }(X)\) is a belief function. And \(Pl_{A^k}^{*\ge }(X)\) is also a plausibility function due to the duality of the belief and plausibility functions.
With Theorem 3, there exactly exists the corresponding belief structure of multigranulation rough set and the consistency of belief structure in different levels of granulations from Theorem 2 can be derived as follows. □
Proposition 3
Let \(MGOIS^{*\ge }=(U,AT^k,f^k,V^k)\) be an incomplete multigranulation ordered information system which has I levels of granulations. For any \(1 \le k \le I\), denote the subset \(A^k \subseteq AT^k\). For \(x \subseteq U\), \(Bel_{A^k}^{*\ge }(X)\) and \(Pl_{A^k}^{*\ge }(X)\) are the belief and plausibility functions, respectively, and \(P(X)=\frac{X }{U }\). By the above analysis, we have the properties as follows.

(1)
\(Bel_{A^I}^{*\ge }(X) \le Bel_{A^{I1}}^{*\ge }(X) \le \ldots \le Bel_{A^1}^{*\ge }(X) \le P(X)\)

(2)
\(P(X) \le Pl_{A^1}^{*\ge }(X) \le Pl_{A^2}^{*\ge }(X) \le \ldots \le Pl_{A^{I}}^{*\ge }(X)\)
Reduction in incomplete multigranulation ordered information system
First, the positive region reduction, belief reduction and plausibility reduction are put forward in incomplete multigranulation ordered information system.
Definition 9
Let \(MGOIS^{*\ge }=(U,AT^k,f^k,V^k)\) be an incomplete multigranulation ordered information system which has I levels of granulations. For any \(1 \le k \le I\), denote the subset \(A^k \subseteq AT^k\), and the positive region, belief and plausibility reduction are developed in the \(k\)th level of granulations of information system as follows.

(1)
If there exists \(U/{R_{A^k}^{* \ge }}=U/{R_{A^k}^{* \ge }}\), then assume that \(A^k\) is a consistent set. Furthermore, if any true subset of \(A^k\) is not a consistent set, then \(A^k\) can be defined as the positive region reduction.

(2)
If there exists \(Bel_{A^k}^{*\ge }(X)=Bel_{AT^k}^{*\ge }(X)\), where for every \(X \in U/{R_{A^k}^{* \ge }}\), then assume that \(A^k\) is a belief consistent set. Furthermore, if any true subset of \(A^k\) is not a belief consistent set, then \(A^k\) can be defined as belief reduction.

(3)
If there exists \(Pl_{A^k}^{*\ge }(X)=Pl_{AT^k}^{*\ge }(X)\), where for every \(X \in U/{R_{A^k}^{* \ge }}\), then assume that \(A^k\) is a plausibility consistent set. Furthermore, if any true subset of \(A^k\) is not a plausibility consistent set, then \(A^k\) can be defined as plausibility reduction.
Based on Definition 9, belief reduction and plausibility reduction are the minimal attribute set to keep the degree of belief and plausibility. Next, we analyze the consistency of three ways of reduction in the same level of granulations.
Theorem 3
Let \(MGOIS^{*\ge }=(U,AT^k,f^k,V^k)\) be an incomplete multigranulation ordered information system which has I levels of granulations. For any \(1 \le k \le I\), denote the subset \(A^k \subseteq AT^k\), and we have some properties in the kth level of granulations of information system as follows.

(1)
If \(A^k\) is the consistency set if and only if it is the belief consistency set.

(2)
If \(A^k\) is the positive region reduction if and only if it is the belief reduction.

(3)
If \(A^k\) is the consistency set if and only if it is the plausibility consistency set.

(4)
If \(A^k\) is the positive region reduction if and only if it is the plausibility reduction.
Proof

(1)
Suppose that \(A^k\) is the consistency set in the kth level of granulations of information system. Then, we have \(U/{R_{A^k}^{* \ge }}=U/{R_{A^k}^{* \ge }}\). Clearly, \(A^k\) is also the belief consistency set in the same level with Definition 9. If \(A^k\) is the belief reduction in the \(k\)th level of granulations. Then, we have \(Bel_{A^k}^{*\ge }(X) = Bel_{AT^k}^{*\ge }(X) \text {,} X \in U/{R_{A^k}^{* \ge }}\) (i). According to Eqs.(i), one obtains \(Bel_{A^k}^{*\ge }([X]_{AT^k}^{* \ge })=Bel_{AT^k}^{*\ge }([X]_{AT^k}^{* \ge })\) (ii), According to Eqs.(ii), one obtains \(\dfrac{\underline{R_{A^k}^{* \ge }} ([X]_{AT^k}^{* \ge })}{U } = \dfrac{\underline{R_{AT^k}^{* \ge }} ([X]_{AT^k}^{* \ge })}{U }\) (iii). According to the conjunction of Theorem 2 and Eqs(iii), we can obtain \(\underline{R_{A^k}^{* \ge }}([X]_{AT^k}^{* \ge }) = \underline{R_{AT^k}^{* \ge }}([X]_{AT^k}^{* \ge })\). By the definition of the lower approximation from Definition 7 and \(A^k \subseteq AT^k\),we can get the following relationship: \(\left\{ y[y]_{A^k}^{* \ge } \subseteq [X]_{AT^k}^{* \ge } \right\} = \left\{ y[y]_{AT^k}^{* \ge } \subseteq [X]_{AT^k}^{* \ge } \right\} \leftrightarrow [X]_{A^k}^{* \ge } \subseteq [X]_{AT^k}^{* \ge }\), \(x \in U\). Since \([X]_{AT^k}^{* \ge } \subseteq [X]_{A^k}^{* \ge }\), thus \([X]_{AT^k}^{* \ge } = [X]_{A^k}^{* \ge }\) . Consequently, \(A^k\) is the consistency set in the \(k\)th level of granulations of information system.

(2)
Similar to the proof of (1), it can be proved.

(3)
Suppose that \(A^k\) is the consistency set in the \(k\)th level of granulations of information system. Then, we have \(U/{R_{A^k}^{* \ge }}=U/{R_{A^k}^{* \ge }}\). Clearly, \(A^k\) is also the plausibility consistency set in the same level with Definition 9.

(4)
Similar to the proof of (3), it can be proved. As demonstrated above, we obtain the consistency of several reduction in the same level, which means the positive region reduction is equivalent to belief reduction. And it is also proved that the positive region reduction and belief reduction are adequate condition for plausibility reduction. Next, analyze the transitivity of the above three reduction in different levels.
□
Theorem 4
Let \(MGOIS^{*\ge }=(U,AT^k,f^k,V^k)\) be an incomplete multigranulation ordered information system which has I levels of granulations. For any \(1 \le k \le I\), denote the subset \(A^k \subseteq AT^k\) and we have some properties as follows.

(1)
For any \(x \in U\), we can obtain \([X]_{A^k}^{* \ge } = [X]_{A^{k+1}}^{* \ge }\), where \(A^k\) is the positive region reduction in the \(k\)th level of granulations of information system. Then, we define that \(A^{k+1}\) is the positive region reduction in the \(k\)th level of granulations.

(2)
Reversely, if for \(x \in U\),we can obtain \([X]_{A^k}^{* \ge } = [X]_{A^{k+1}}^{* \ge }\), where \(A^{k+1}\) is the positive region reduction in the \((k+1)\)th level of granulations of information system. Then, we define that \(A^k\) is the positive region reduction in the \((k+1)\)th level of granulations.

(3)
Conversely, if for \(x \in U\), we can obtain \([X]_{A^k}^{* \ge } = [X]_{A^{k+1}}^{* \ge }\), where \(A^{k+1}\) is not the positive region reduction in the \((k+1)\)th level of granulations of information system. Then, we define that \(A^k\) is not the positive region reduction in the kth level of granulations.
Proof

(1)
If \(A^k\) is the positive region reduction in the \(k\)th level of granulations of information system, then we get \([X]_{A^k}^{* \ge } = [X]_{AT^k}^{* \ge }\), where \(\forall x \in U\). By \([X]_{A^k}^{* \ge } \subseteq [X]_{AT^k}^{* \ge }\), we can obtain \([X]_{A^{k+1}}^{* \ge } \subseteq [X]_{AT^k}^{* \ge }\). And then, \([X]_{A^{k+1}}^{* \ge } = [X]_{AT^k}^{* \ge }\) can be verified. Hence, we get the result that \(A^{k+1}\) is the positive region reduction in the \(k\)th level of granulations.

(2)
Similar to the proof of (1), it can be proved.

(3)
If \(A^{k+1}\) is not the positive region reduction in the \((k+1)\)th level of granulations, then we get \([X]_{AT^{k+1}}^{* \ge } \subset [X]_{A^{k+1}}^{* \ge }\).
By \([X]_{AT^k}^{* \ge } \subseteq [X]_{AT^{k+1}}^{* \ge }\), we can obtain \([X]_{AT^k}^{* \ge } \subset [X]_{AT^{k+1}}^{* \ge }\).
And then, by \([X]_{A^{k+1}}^{* \ge } = [X]_{A^k}^{* \ge }\), \([X]_{AT^k}^{* \ge } \subset [X]_{A^k}^{* \ge }\) can be verified.
Hence, we can get the result that \(A^k\) is not the positive region reduction in the \(k\)th level of granulations.
It is demonstrated in Theorem 4 that, when the condition \([X]_{A^k}^{* \ge } = [X]_{A^{k+1}}^{* \ge }\) where for every \(x \in U\) is satisfied, reducibility has bidirectional transitivity between different levels of granulations and nonreducibility has only unidirectional transitivity between different levels of granulations, i.e., if the higher level of granulations has nonreducibility, then the lower level has irreducibility, too. Whereas it is impossible to judge whether the higher level can be reduced if the lower level has irreducibility. On the above analysis, the following inference can be put forward.

(1)
Suppose that \(A^i\) is the positive region reduction in the \(i\)th level of granulations and for every \(x \in U\),we have \([X]_{A^k}^{* \ge } = [X]_{A^{k+m}}^{* \ge }\),where \(m>0\),\(k+m \le I\) and for every I, there exists \(k\le i \le k+m\). Then, \(A^k\),\(A^{k+1}\),\(\ldots\),\(A^{k+m}\) are the positive region reductions in the \(k\)th, \((k+1)\)th,\(\ldots\), \((k+m)\)th levels of granulations of information system, respectively. Specially, when \(i=1\), incomplete multigranulation ordered information system completely can be positively reduced.

(2)
Conversely, suppose that \(A^i\) is not the positive region reduction in the \(i\)th level of granulations and for every \(x \in U\), we have \([X]_{A^k}^{* \ge } = [X]_{A^{k+m}}^{* \ge }\), where \(m>0\), \(k+m \le I\) and for every I, there exists \(k \le i \le k+m\). Then, \(A^k\),\(A^{k+1}\),\(\ldots\),\(A^{k+m}\) are not the positive region reductions in the \(k\)th, \((k+1)\)th,\(\ldots\),\((k+m)\)th levels of granulations of information system, respectively. Specially, when \(i=1\), incomplete multigranulation ordered information system completely can’t be positive region reduced.
Proof

(1)
First, prove that \(A^k\) is the positive region reduction in the \(i\)th level of granulations. If \(A^i\) is the positive region reduction in the \(i\)th level of granulations of information system, then we get \([X]_{A^i}^{* \ge } \subseteq [X]_{AT^i}^{* \ge }\), where \(\forall x \in U\). For \(k \le i \le k+m \le I\) and \([X]_{A^k}^{* \ge } = [X]_{A^{k+m}}^{* \ge }\), \([X]_{A^k}^{* \ge } = [X]_{A^{k+m}}^{* \ge } = [X]_{A^i}^{* \ge }\) can be obtained. By \([X]_{A^i}^{* \ge } \subseteq [X]_{AT^i}^{* \ge }\), we can obtain \([X]_{A^k}^{* \ge } \subseteq [X]_{AT^i}^{* \ge }\). And then, \([X]_{A^k}^{* \ge } = [X]_{AT^i}^{* \ge }\) can be verified. Thus, we get that \(A^k\) is the positive region reduction in the \(i\)th level of granulations. Second, similar to proof of (1), we can derive that \(A^i\) is the positive region reduction in the \(k\)th level of granulations,\(A^i\) is the positive region reduction in the \((k+m)\)th level of granulations and \(A^{k+m}\) is the positive region reduction in the \(i\)th level of granulations Hence, we can get the result that \(A^k\),\(A^{k+1}\),\(\ldots\),\(A^{k+m}\) are the positive region reductions in the \(k\)th, \((k+1)\)th,\(\ldots\),\((k+m)\)th levels of granulations of information system, respectively.

(2)
First, prove that \(A^k\) is not the positive region reduction in the kth level of granulations.
If \(A^i\) is the positive region reduction in the \(i\)th level of granulations of information system, then we get \([X]_{AT^i}^{* \ge } = [X]_{A^i}^{* \ge }\), where \(\forall x \in U\).
For \(k \le i \le k+m \le I\) and \([X]_{A^k}^{* \ge } = [X]_{A^{k+m}}^{* \ge }\), \([X]_{A^k}^{* \ge } = [X]_{A^{k+m}}^{* \ge } = [X]_{A^i}^{* \ge }\) can be obtained.
By \([X]_{AT^k}^{* \ge } \subseteq [X]_{AT^i}^{* \ge }\), we can obtain \([X]_{A^k}^{* \ge } \subset [X]_{AT^i}^{* \ge }\).
And then, \([X]_{AT^k}^{* \ge } \subset [X]_{A^k}^{* \ge }\) can be verified.
Thus, we can get that \(A^k\) is not the positive region reduction in the \(k\)th level of granulations.
Second, similar to proof of (1), we can derive that \(A^{k+m}\) is not the positive region reduction in the \((k+m)\)th level of granulations.
Hence, we can get the result that \(A^k\),\(A^{k+1}\),\(\ldots\),\(A^{k+m}\) are not the positive region reductions in the \(k\)th, \((k+1)\)th,\(\ldots\),\((k+m)\)th levels of granulations of information system, respectively.
In order to describe the relationship among the reductions above conveniently, given the relationship figures as follows, clearly, Fig. 2 is the consistency of several reductions in the same level of granulations. In this representation, each of nodes represents a kind of reduction and the unidirectional arrows are granted as a reduction of the end point from the starting point, i.e., the positive region reduction A must be the plausibility reduction at the mean time. The bidirectional arrows mean the equivalent of the ends of the arrow. Figure 3 represents the transitivity of several reductions in the different levels of granulations. When \([X]_{A^k}^{* \ge } \subset [X]_{A^{k+1}}^{* \ge }\) are satisfied, we can get that A is also the positive region reduction of the \(k\)th and \((k+1)\)th levels of granulations.
Results and discussion
In this section, we will simulate numerically the relationship of three reductions of an incomplete multigranulation ordered information system based on belief structure that is defined in Sect. 3 and give the notions of the significance to explain whether the corresponding attribute is dispensable or not. Based on this fact, we proposed an algorithm to find out reductions of an incomplete multigranulation ordered information system.
Algorithm design
Definition 10
Let \(MGOIS^{*\ge }=(U,AT^k,f^k,V^k)\) be an incomplete multigranulation ordered information system. If \(AT^k=\left\{ a_1^k,a_2^k,\ldots ,a_m^k\right\}\), then for every attribute \(a_i^k \in AT^k\), we define the significance degree of the attribute \(AT^k\) as follows.
\(sig_1(a_i^k,AT^k)>0\) explains that the attribute \(a_i^k\) is not dispensable for \(AT^k\) and \(a_i^k\) should be included in the positive region reduction. If \(sig_1(a_i^k,AT^k) \le 0\), it shows the attribute \(a_i^k\) is dispensable for \(AT^k\) and \(a_ i^k\) should not be included in positive region reduction. \(sig_2(a_i^k,AT^k)>0\) explains that the belief function of the attribute \(a_{AT\left\{ a_i^k\right\} }^k\) is equal to \(AT^k\), which means \(a_i^k\) should be included in the belief reduction. If \(sig_2(a_i^k,AT^k) \le 0\), it shows the belief function of the attribute \(a_{AT\left\{ a_ i^k\right\} }^k\) is not equal to \(AT^k\), and \(a_i^k\) should not be included in belief reduction. \(sig_3(a_i^k,AT^k)>0\) explains that the plausibility function of the attribute \(a_{AT\left\{ a_i^k\right\} }^k\) is equal to \(AT^k\) and \(a_i^k\) should be included in the plausibility reduction. If \(sig_3(a_i^k,AT^k) \le 0\), it shows the plausibility function of the attribute \(a_{AT\left\{ a_i^k\right\} }^k\) is equal to \(AT^k\), and \(a_i^k\) should not be included in the plausibility reduction.
The specific steps of the reduction will be given in the following. Since that it is same for reduction steps in different levels of granulations, just given the reduction process of a certain level of granulations as Algorithm 1 shows.
Algorithm 1
Reduction in incomplete multigranulation ordered information system based on belief structure
Input: incomplete information system \(IS^{* \ge } = (U,AT,f,V)\);
Output: let the positive region reduction be Red, belief reduction be \(Red_{Bel}\), plausibility reduction be \(Red_{Pl}\).
Step 1: let \(Red=\varnothing\), \(Red_{Bel}=\varnothing\),\(Red_{Pl}=\varnothing\) and \(AT'=AT\);
Step 2: according to Definition 9, calculate the positive region consistent set \(U/{R_{AT}}\), belief consistent set \(Bel_{AT}\) and plausibility consistent set \(Pl_{AT}\) of the attribute AT;
Step 3: let \(a_i \in AT\), according to Definition 9, calculate the positive region consistent set \(U/{R_{AT\left\{ a_i\right\} }}\), belief consistent set \(Bel_{AT\left\{ a_i\right\} }\) and plausibility consistent set \(Pl_{AT\left\{ a_i\right\} }\) of the attribute \(AT\left\{ a_i\right\}\);
Step 4: Let \(sig_j (a_i,AT)\) be the significance and relative of the attribute \(a_i\) where\(1 \le j \le 3\), \(sig_1 (a_i,AT) = U/{R_{AT^k}}  U/{R_{AT{\left\{ a_i\right\} }}}\), \(sig_2(a_i,AT) =Bel_{AT}Bel_{AT{\left\{ a_i\right\} }}\) and \(sig_3(a_i,AT)=Pl_{AT}Pl_{AT{\left\{ a_i\right\} }}\);
Step 5: If \(sig_1(a_i,AT)>0\), then suppose the attribute \(a_i\) is important, and add it into the positive region reduction set, and obtain \(a_i \in Red\), then go to Step 8, else go to Step 8 directly;
Step 6: If \(sig_2(a_i,AT)>0\), then suppose the attribute \(a_i\) is important, and add it into the belief reduction set, and obtain \(a_i \in Red_{Bel}\), then go to Step 8, else go to Step 8 directly;
Step 7: If \(sig_3(a_i,AT)>0\), then suppose the attribute \(a_i\) is important, and add it into the plausibility reduction set, and obtain \(a_i \in Red_{Pl}\), then go to Step 8, else go to Step 8 directly;
Step 8: Let \(AT'=AT'\left\{ a_i\right\}\), if \(AT'= \varnothing\), then return step 8, else let \(a_i=a_j\), and return Step 3, where \(i \ne j\),;
Step 9: output the positive region reduction Red, belief reduction \(Red_{Bel}\) and plausibility reduction \(Red_{Pl}\) as reduction.
Suppose that the size of U is n and the number of attributions is m, then the time complexity of Algorithm 1 is \(O(m*n)\). Table 5 and Fig. 4 both show the comparison of time complexity among different rough set measures, like covering rough set [25], traditional rough set [7] and multigranulation rough set [18], illustrating that the calculating time can be reduced largely. In Fig. 4, suppose \(m=30\) and \(n=0,500,1000,\ldots ,10000\). For clearly observing, the final result of our idea is divided by 1000, MGRS is divided by 10000, and the rest methods are divided by 100000. This figure shows the great superiority of MGRS based on belief structure with low time complexity clearly and intuitively. And the following analysis of Example 1, which is analyzed briefly in Sect. 3.2, is employed to illustrate our idea.
Algorithm implementation
Example 1.1. It is an incomplete multigranulation ordered information system table of Rape pests detected by WSN in a certain period of time, where granularity \(I=3\), \(U=\left\{ x_1,x_2,x_3,x_4,x_5,x_6,x_7,x_8,x_9,x_10,x_11,x_12\right\}\) and \(AT^k=\left\{ a_1^k,a_2^k,a_3^k,a_4^k\right\}\). \(X_i (i=1,2,\ldots ,12)\) represents different clusters which stand for Cabbage butterfly, Aphids, Cabbage bug and Cricket, respectively. And \(AT^k\) is the attribute set where \(k=1,2,3\), which is the different levels of granulations. Since that, it is same for reduction steps in different levels of granulations, just given the reduction process of the first level of granulations as Algorithm 1 shows.

(1)
Let \(Red=\varnothing\), \(Red_{Bel}=\varnothing\), \(Red_{Pl}=\varnothing\) and \(AT'=AT\);

(2)
According to Definition 9, calculate the positive region consistent set \(U/{R_{AT^1}}\), belief consistent set \(Bel_{AT^1}\) and plausibility consistent set \(Pl_{AT^1}\) of the attribute \(AT^1\).
$$\begin{aligned}{}&U/{R_{AT^1}} =\left\{ a_1^1,a_2^1,a_3^1,a_4^1\right\} , Bel_{AT^1} =\left\{ a_1^1,a_2^1,a_3^1,a_4^1\right\} , Pl_{AT^1}=\left\{ a_1^1,a_2^1,a_3^1,a_4^1\right\} \end{aligned}$$ 
(3)
Calculate the positive region consistent set \(U/{R_{AT^1}}=U/{R_{AT^1\left\{ a_1^1 \right\} }}\), belief consistent set \(Bel_{AT^1\left\{ a_1^1 \right\} }\) and plausibility consistent set \(Pl_{AT^1\left\{ a_1^1 \right\} }\) of the attribute \(AT^1\left\{ a_1^1\right\}\). And we can get \([x]_{AT^1\left\{ a_1^1\right\} }^{*\ge }\) from Table 2 as follows.
$$\begin{aligned} {[}x_1]_{AT^1\left\{ a_1^1\right\} }^{*\ge }&= {[}x_2]_{AT^1\left\{ a_1^1\right\} }^{*\ge } = \left\{ x_1,x_2,x_8,x_{10} \right\} \end{aligned}$$(33)$$\begin{aligned} {[}x_3]_{AT^1\left\{ a_1^1\right\} }^{*\ge }&= {[}x_7]_{AT^1\left\{ a_1^1\right\} }^{*\ge } = {[}x_{12}]_{AT^1\left\{ a_1^1\right\} }^{*\ge } = \left\{ U \right\} \end{aligned}$$(34)$$\begin{aligned} {[}x_4]_{AT^1\left\{ a_1^1\right\} }^{*\ge }&= {[}x_9]_{AT^1\left\{ a_1^1\right\} }^{*\ge } = \left\{ x_1,x_2,x_4,x_6,x_8,x_9,x_{10},x_{11} \right\} \end{aligned}$$(35)$$\begin{aligned} {[}x_5]_{AT^1\left\{ a_1^1\right\} }^{*\ge }&= \left\{ x_1,x_2,x_4,x_5,x_6,x_8,x_9,x_{10},x_{11} \right\} \end{aligned}$$(36)$$\begin{aligned} {[}x_6]_{AT^1\left\{ a_1^1\right\} }^{*\ge }&= \left\{ x_1,x_2,x_6,x_8,x_{10} \right\} \end{aligned}$$(37)$$\begin{aligned} {[}x_8]_{AT^1\left\{ a_1^1\right\} }^{*\ge }&= {[}x_{10}]_{AT^1\left\{ a_1^1\right\} }^{*\ge } = \left\{ x_1,x_8,x_{10} \right\} \end{aligned}$$(38)$$\begin{aligned} {[}x_{11}]_{AT^1\left\{ a_1^1\right\} }^{*\ge }&= \left\{ x_1,x_2,x_6,x_8,x_{10},x_{11} \right\} \end{aligned}$$(39)Thus, \(U/{R_{AT^1\left\{ a_1^1\right\} }} = \left\{ a_1^1,a_2^1,a_3^1,a_4^1\right\}\). For every \(X \in U/{R_{AT^k}^{*\ge }}\), suppose \(X=\left\{ x_1,x_6,x_8,x_{10},x_{11}\right\}\), and the reduction of the lower and upper approximation of \(AT^1\left\{ a_1^1\right\}\) are \(\underline{R_{AT^1\left\{ a_1^1\right\} }^{*\ge }} (X) =\left\{ x_8,x_{10}\right\}\) and \(\overline{R_{AT^1\left\{ a_1^1\right\} }^{*\ge }} (X) =\left\{ U \right\}\), respectively. Additionally, the reduction of the lower and upper approximation of \(\underline{R_{AT^1}^{*\ge }}(X) = \left\{ x_1,x_8,x_{10}\right\}\) and \(\overline{R_{AT^1}^{*\ge }}(X) =\left\{ U \right\}\), respectively. Hence, \(Bel_{AT^1\left\{ a_1^1\right\} }{^*\ge } (X)=\dfrac{\underline{R_{AT^1\left\{ a_1^1\right\} }^{*\ge }}(X) }{U } = \dfrac{2}{12} \ne Bel_{AT^1}^{*\ge }(X)\), \(Pl_{AT^1\left\{ a_1^1 \right\} }^{*\ge }(X) =\dfrac{\overline{R_{AT^1\left\{ a_1^1\right\} }^{*\ge }}(X) }{U } = 1 = Pl_{AT^1}^{*\ge }(X)\). Consequently, \(Bel_{AT^1}=\left\{ a_1^1,a_2^1,a_3^1,a_4^1\right\}\), \(Pl_{AT^1} = \left\{ a_2^1,a_3^1,a_4^1 \right\}\).

(4)
Thus, we get \(sig_1 (a_1^1,AT^1)=U/{R_{AT^1}}  U/{R_{AT^1\left\{ a_1^1\right\} }} =\left\{ \varnothing \right\} = 0\), \(sig_2 (a_1^1,AT^1) = Bel_{AT^1}  Bel_{AT^1\left\{ a_1^1\right\} } = \left\{ \varnothing \right\} = 0\) and \(sig_3 (a_1^1,AT^1) = Pl_{AT^1}  Pl_{AT^1\left\{ a_1^1\right\} }=\left\{ a_1^1 \right\} >0\). Then, add the attribute \(a_1\) into plausibility reduction \(Red_{Pl}\).

(5)
Similarly, \(Bel_{AT^1\left\{ a_2^1\right\} }^{*\ge }(X) = 3/12\), \(Pl_{AT^1\left\{ a_2^1\right\} }^*{\ge } (X)=1\), \(sig_1 (a_2^1,AT^1) = U/R_{AT^1}  U/R_{AT^1\left\{ a_2^1\right\} } = \left\{ a_2^1\right\} >0\), \(sig_2 (a_2^1,AT^1) = Bel_{AT^1}Bel_{AT^1\left\{ a_2^1\right\} } = \left\{ a_2^1\right\} >0\) and \(sig_3 (a_2^1,AT^1)= Pl_{AT^1} Pl_{AT^1\left\{ a_2^1\right\} } = \left\{ a_2^1\right\} >0\), then add \(a_2\) into Red, \(Red_{Bel}\), \(Red_{Pl}\). \(Bel_{AT^1\left\{ a_3^1 \right\} }^{*\ge }(X)=1/12\), \(Pl_{AT^1\left\{ a_3^1\right\} }^{*\ge }(X)=1\), \(sig_1 (a_3^1,AT^1)=U/{R_{AT^1}}U/{R_{AT^1\left\{ a_3^1\right\} }} =\left\{ \varnothing \right\} =0\), \(sig_2 (a_3^1,AT^1)=Bel_{AT^1}Bel_{AT^1\left\{ a_3^1\right\} }=\left\{ \varnothing \right\} =0\) and \(sig_3 (a_3^1,AT^1)= Pl_{AT^1}Pl_{AT^1\left\{ a_3^1\right\} }=\left\{ a_3^1\right\} >0\), then add \(a_3\) into \(Red_{Pl}\). \(Bel_{AT^1\left\{ a_4^1\right\} }^{*\ge }(X)=3/12\), \(Pl_{AT^1\left\{ a_4^1\right\} }^{*\ge }(X)=1\), \(sig_1 (a_4^1,AT^1)=U/{R_{AT^1}}U/{R_{AT^1\left\{ a_4^1\right\} }} =\left\{ a_4^1 \right\} >0\),\(sig_2 (a_4^1,AT^1)=Bel_{AT^1}Bel_{AT^1\left\{ a_4^1\right\} }=\left\{ a_4^1 \right\} >0\) and \(sig_3 (a_4^1,AT^1)= Pl_{AT^1}Pl_{AT^1\left\{ a_4^1\right\} }=\left\{ a_4^1\right\} >0\), then add \(a_4\) into Red, \(Red_{Bel}\), \(Red_{Pl}\).
From the analysis of Table 1 from Example 1, we can obtain that \(A^1=\left\{ a_2^1,a_4^1\right\}\) is the reduction of \(AT^1\) in the first level of granulations and \(A^2=\left\{ a_2^2,a_4^2 \right\}\) is the reduction of \(AT^2\) in the second level of granulations where for every \(x\in U\), there exists \([X]_{A^1}^{*\ge }=[X]_{A^2}^{*\ge }\). However, \(A^3=\left\{ a_2^3,a_4^3\right\}\) is not the reduction of \(AT^3\) in the third level of granulations. This result does prove the idea that the positive and belief reduction are equivalent, and these two reductions are unnecessary and sufficient condition for plausibility reduction in the same level, and if cover structure order of different levels are the same the corresponding equivalent positive region reduction. In this example, data redundancy is reduced by half by attribute reduction based on belief structure, which largely improves the information processing capability of sensor nodes.
Conclusion
Considering the issue with respect to the high data redundancy and high cost of information collection in wireless sensor nodes, this paper proposes a data fusion method based on belief structure to reduce attribution in multigranulation rough set. In this paper, the relationship between multigranulation rough set based on multiscale and evidence theory is explored to analyze that the former has its corresponding belief structure when certain conditions are satisfied. Then, by introducing evidence structure, the positive region, belief and plausibility reduction are put forward and analyze the consistency in the same level and transitivity in the different levels by means of information system. Meanwhile, the algorithm proposed in this paper to perform three reductions reduces the time complexity largely, improving the computing efficiency. In essence, this paper not only successfully solves the problem of sensor node data fusion, but also provides new ideas and methods for the research in incomplete multigranulation ordered rough set theory.
However, one of the drawbacks of the proposed algorithm is that it requires attribute discretization and it will lose efficacy when the reducible attributes are few. And the future work will concentrate on the synthesis of multigranulation ordered information system evidence under the belief space with respect to data fusion in wireless sensor networks.
Availability of data and materials
The datasets used and/or analyzed during the current study are available from the corresponding author on reasonable request.
Abbreviations
 WSN:

Wireless sensor network
 Eqs:

Equally spaced
References
D. Zhifeng, L. Yuanxiang, L. Feng, W. Weiwu, Hierarchical intelligent method of information processing in wireless sensor networks. Comput. Eng. 09, 58–59 (1996)
D. Zhifeng, L. Yuanxiang, Y. Li, X. Baiyi, Research on intelligent information processing in wireless sensor networks using rough set theory. Appl. Res. Comput. 10, 75–78 (2007)
X. Luo, J. Sun, L. Wang, W. Wang, W. Zhao, J. Wu, J. Wang, Z. Zhang, Shortterm wind speed forecasting via stacked extreme learning machine with generalized correntropy. IEEE Trans. Ind. Inf. 14(11), 4963–4971 (2018)
Y. Zeng, C.J. Sreenan, N. Xiong, L.T. Yang, J.H. Park, Connectivity and coverage maintenance in wireless sensor networks. J. Supercomput. 52(1), 23–46 (2010)
W. Guo, N. Xiong, H.C. Chao, S. Hussain, G. Chen, Design and analysis of selfadapted task scheduling strategies in wireless sensor networks. Sensors. 11(7), 6533–6554 (2011)
H. Zheng, W. Guo, N. Xiong, A kernelbased compressive sensing approach for mobile data gathering in wireless sensor network systems. IEEE Trans. Syst. Man Cybernet. 48(12), 2315–2327 (2018)
Z. Pawlak, Rough sets. Int. J. Comput. Inf. Sci. 11(5), 341–354 (1982)
Z.D.Z.I.S.L.A.W. PAWLAK, Rough set theory and its applications to data analysis. Cybernet. Syst. 29(7), 661–688 (1998)
P. Dan, Z. Qilun, Selfoptimization algorithm for attribute reduction. Comput. Res. Dev. 38(8), 904–910 (2001)
F. Ang, W. Guoyin, H. Jun, Attribute reduction algorithm for incomplete information system based on information entropy. J. Chongqing Univ. Posts Telecommun. Nat. Sci. Ed. 20(5), 586–592 (2008)
Parvanov P. Angelov, Handbook on computational intelligence (in 2 volumes) granular computing, pp. 43–66 (2016)https://doi.org/10.1142/9548
H. Liu, A. Gegov, M. Cocea, Rulebased systems: a granular computing perspective. Granular Comput. 1(4), 259–274 (2016)
G. Wilke, E. Portmann, Granular computing as a basis of humandata interaction: a cognitive cities use case. Granular Comput. 1(3), 181–197 (2016)
A. Skowron, A. Jankowski, S. Dutta, Interactive granular computing. Granular Comput. 1(2), 95–113 (2016)
S.S. Kumar, H.H. Inbarani, Optimistic multigranulation rough set based classification for medical diagnosis. Procedia Comput. Sci. 47, 374–382 (2015)
J.M. Ma, Y. Yao, Rough set approximations in multigranulation fuzzy approximation spaces. Fundamenta Informaticae 142(1–4), 145–160 (2015)
Yiyu Yao, A triarchic theory of granular computing. Granular Comput. 1(2), 145–157 (2016)
W.Z. Wu, Y. Leung, Theory and applications of granular labelled partitions in multiscale decision tables. Inf. Sci. 181(18), 3878–3897 (2011)
Y. Qian, J. Liang, Y. Yao, C. Dang, MGRS: a multigranulation rough set. Inf. Sci. Int. J. 180(6), 949–970 (2010)
C. Dang, Y. Qian, J. Liang, MGRS in Incomplete Information Systems, 2013 IEEE International Conference on Granular Computing (GrC), San Jose, California, 2007. https://doi.org/10.1109/GrC.2007.10
P.P. Shenoy, G. Shafer, Axioms for probability and belieffunction propagation. Mach. Intell. Pattern Recognit. 9, 169–198 (1990)
J. Inglis, A mathematical theory of evidence. Technometrics 20, 106 (1978)
S. Glenn, A Mathematical Theory of Evidence (Princeton University Press, Princeton, 1900).
Y. Yao, P. Lingras, Interpretations of belief functions in the theory of rough sets. Inf. Sci. 104(1–2), 81–106 (1998)
D. Chen, X. Zhang, W. Li, On measurements of covering rough sets based on granules and evidence theory. Inf. Sci. 317, 329–348 (2015)
D. Chen, W. Li, X. Zhang, S. Kwong, Evidencetheorybased numerical algorithms of attribute reduction with neighborhoodcovering rough sets. Int. J. Approx. Reason. 55(3), 908–923 (2014)
G. Lin, J. Liang, Y. Qian, An information fusion approach by combining multigranulation rough sets and evidence theory. Inf. Sci. 314, 184–199 (2015)
L. Liu, G. Luo, K. Qin, X. Zhang, An algorithm based on logistic regression with data fusion in wireless sensor networks. Eurasip J. Wirele. Commun. Netw. 2017(1), 10 (2017)
W. Guo, N. Xiong, A.V. Vasilakos, G. Chen, H. Cheng, Multisource temporal data aggregation in wireless sensor networks. Wirel. Pers. Commun. 56(3), 359–370 (2011)
C. Lin, Y. He, N. Xiong, An energyefficient dynamic power management in wireless sensor networks (2006)
Acknowledgements
This research is supported by the China Scholarship Council (CSC, 201508430187) during a visit of Chenfeng Long.
Funding
This research was partially funded by the National Natural Science Foundation of China (Grant No. 61972146, 61672219)
Author information
Authors and Affiliations
Contributions
Chenfeng Long is main author of the current paper. Chenfeng Long contributed to the development of the idea, design of the study, theory, result analysis, and article writing. Xingxin Liu was responsible for the reducing attribute, processing the algorithm and drawing figures. Yakun Yang and Tao Zhang were responsible for collecting data. Siqiao Tan participated in the design of the study. Kui Fang have suggested contributed amendments. Xiaoyong Tang helped to draft the manuscript. Gelan Yang participated in the result analysis. All authors read and approved the final manuscript.
Corresponding authors
Ethics declarations
Ethics approval and consent to participate
This article does not contain any studies with human participants or animals performed by any of the authors.
Consent for publication
All authors agree to submit this version and claim that no part of this manuscript has been published or submitted elsewhere.
Competing interests
The authors declare that they have no competing interests.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Long, C., Liu, X., Yang, Y. et al. A data fusion method in wireless sensor network based on belief structure. J Wireless Com Network 2021, 86 (2021). https://doi.org/10.1186/s13638021019164
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s13638021019164
Keywords
 Wireless sensor network
 Granular computing
 Rough set
 Dempster–Shafer theory
 Reduction