Cluster-dividing method based on power demand in a kind of wireless sensor network
阅读说明：本技术 一种无线传感器网络中基于功率需求的分簇方法 (Cluster-dividing method based on power demand in a kind of wireless sensor network ) 是由 杨利霞 阿姆里特 闫紫薇 福迪克 王洪金 于 2019-08-13 设计创作，主要内容包括：本发明公开了一种无线传感器网络中基于功率需求的分簇方法,所采用的技术方案为：主传感器节点根据每个节点的路径复杂度形成相应的节点对；设置功率需求最大阈值和最小的阈值,将节点对中的节点对应的功率需求与所设置的阈值进行对比,根据比较的结果得到每组节点对相应的逻辑值；对每组节点对中节点的逻辑值进行二元假设,通过“或”门生成节点对的逻辑值,并将具有相同逻辑值的节点对形成簇；本发明的分簇方法无需计算节点的位置信息,进而简化了计算的复杂度,减少了计算时间和计算开销。(The invention discloses the cluster-dividing method based on power demand in a kind of wireless sensor network, used technical solutions are as follows: master reference node forms corresponding node pair according to the Path complexity of each node；Power demand max-thresholds and the smallest threshold value are set, the corresponding power demand of the node of node centering is compared with set threshold value, obtains every group node according to the result of the comparison to corresponding logical value；Dualism hypothesis is carried out to logical value of every group node to interior joint, the logical value of node pair is generated by OR-gate, and by the node with identical logical values to formation cluster；Cluster-dividing method of the invention is not necessarily to the location information of calculate node, and then simplifies the complexity of calculating, reduces and calculates time and computing cost.)
1. based on the cluster-dividing method of power demand in a kind of wireless sensor network, which is characterized in that
S1, master reference node form corresponding node pair according to the Path complexity of each node；
Power demand max-thresholds and the smallest threshold value is arranged in S2, by node to the corresponding power demand of interior joint with it is set Threshold value compare, obtain every group node according to the result of the comparison to corresponding logical value；
S3 carries out dualism hypothesis to logical value of every group node to interior joint, the logical value of node pair is generated by OR-gate, and By the node with identical logical values to formation cluster.
2. the cluster-dividing method based on power demand in a kind of wireless sensor network according to claim 1, feature exist In the method for formation node pair in the S1 are as follows:
S1.1 is randomly assigned n node S={ S in specific region1,S2,...,Sn, master reference node is according to each section The path that communication distance in the energy of point and region between each node and master reference node obtains each node is complicated Spend C={ C1,C2,...,Cn}；
S1.2, by the Path complexity C={ C of each node1,C2,...,CnArranged according to the sequence successively decreased, by path complexity The corresponding node of the maxima and minima of degree forms node pair, successively obtains several group nodes pair.
3. the cluster-dividing method based on power demand in a kind of wireless sensor network according to claim 1, feature exist In, if node number n be odd number, will comeThe node addition of position is formed by theA node centering.
4. the cluster-dividing method based on power demand in a kind of wireless sensor network according to claim 2, feature exist In obtaining the corresponding power demand P={ P of each node according to Path complexity C1,P2,...,Pn, the value of the complexity with Power demand is positively correlated, and the value of complexity is bigger, and power demand is then bigger, and the value of complexity is smaller, and power demand is then smaller.
5. the cluster-dividing method based on power demand in a kind of wireless sensor network according to claim 1 or 2, feature It is, the process of the S2 are as follows:
S2.1, the threshold value for setting power demand is respectively the maximum value P of power demandmaxWith minimum value Pmin；
S2.2, by the max-thresholds P of every group node centering maximum power demand and settingmaxCompare, if being higher than max-thresholds Pmax, then its logical value is 0, if being lower than max-thresholds Pmax, then its logical value is 1；The smallest power of every group node centering is needed Seek the minimum threshold P with settingminCompare, if being higher than minimum threshold Pmin, then its logical value is 1, if being lower than minimum threshold Pmin, Then its logical value is 0；
S2.3, the logical value of each node finally obtained；And so on obtain all group nodes and patrol corresponding to interior joint Collect value.
6. the cluster-dividing method based on power demand in a kind of wireless sensor network according to claim 1, feature exist In OR-gate generates node to the process of logical value in the S3 are as follows:
S3.1, the node logical value of each group node centering have one or 2 for 1 when, the logical value of node pair is 1；Node When the logical value of centering is all 0, the logical value of node pair is 0；And then obtain the logical value of all nodes pair；
S3.2 realizes the sub-clustering to node by the identical node of logical value to being divided into the same cluster.
Technical field
The invention belongs to fields of communication technology, and in particular to the sub-clustering based on power demand in a kind of wireless sensor network Method.
Background technique
Wireless sensor network (WSNS) is that have the sensor calculated with wireless communication ability by a large amount of spatial distributions The multihop network that Nodes Self-organized is constituted.Since sensor node self-energy and computing capability are limited, in WSNS In any agreement in, energy efficiency and real-time are all overriding concern factors.Sensor node is divided into cluster, it can be effective Raising network overall performance.Therefore, the division of cluster is the critical issue in WSNS.
Whole network is divided into the cluster of different scales by the basic thought of cluster algorithm according to different needs, and each cluster is logical Cross the mode fused data processing task of cooperation.Current cluster algorithm include LEACH algorithm, Hausdorff cluster algorithm, PEGASIS algorithm, GAF algorithm etc..Wherein, LEACH algorithm is typical distributed clustering algorithm, the structure including periodic cluster It builds and two stages of data communication.Each round requires to carry out cluster reconstruct, this will increase computation complexity.PEGASIS algorithm is more The energy consumption of network is laid particular emphasis on, but data delay is quite big and real-time is also poor.Hausdorff cluster algorithm and GAF algorithm It is the cluster algorithm based on node location information, due to needing the position of calculate node before sub-clustering, the calculating that will increase network is opened Pin.Therefore, the cluster-dividing method that a kind of computation complexity is low, real-time is high is designed to be very important.
Summary of the invention
In order to solve deficiency in the prior art, the sub-clustering based on power demand in a kind of wireless sensor network is proposed Method, the present invention is by designing a kind of power need according to inter-node communication applied for general real-time wireless sensor networks The cluster-dividing method asked simplifies the computation complexity of network, reduces computing cost and time, and in equalising network each cluster power Demand.
The technical solution adopted in the present invention is as follows:
S1, master reference node form corresponding node pair according to the Path complexity of each node；
Power demand max-thresholds and the smallest threshold value is arranged in S2, by the corresponding power demand of the node of node centering with Set threshold value compares, and obtains every group node according to the result of the comparison to corresponding logical value；
S3 carries out dualism hypothesis to logical value of every group node to interior joint, the logic of node pair is generated by OR-gate Value, and by the node with identical logical values to formation cluster；
Further, the method for node pair is formed in the S1 are as follows:
S1.1 is randomly assigned n node S={ S in specific region1,S2,...,Sn, master reference node is according to every Communication distance in the energy of a node and region between each node and master reference node obtains the path of each node Complexity C={ C1,C2,...,Cn, the corresponding power demand P={ P of each node is obtained according to Path complexity C1,P2,..., Pn}；The value of complexity is positively correlated with power demand, and the value of complexity is bigger, and power demand is then bigger；The value of complexity is got over Small, power demand is then smaller
S1.2, by the Path complexity C={ C of each node1,C2,...,CnArranged according to the sequence successively decreased, by path The corresponding node of the maxima and minima of complexity forms node pair, successively obtains several group nodes pair.
Further, it if node number n is odd number, will comeThe node addition of position is formed by theA node Centering；
Further, the process of the S2 are as follows:
S2.1, the threshold value for setting power demand is respectively the maximum value P of power demandmaxWith minimum value Pmin；
S2.2, by the max-thresholds P of every group node centering maximum power demand and settingmaxCompare, if being higher than maximum threshold Value Pmax, then its logical value is 0, if being lower than max-thresholds Pmax, then its logical value is 1；By every the smallest power of group node centering The minimum threshold P of demand and settingminCompare, if being higher than minimum threshold Pmin, then its logical value is 1, if being lower than minimum threshold Pmin, then its logical value is 0；
S2.3, the logical value of each node finally obtained；And so on obtain all group nodes to corresponding to interior joint Logical value.
Further, the S3 generates node to the process of logical value using OR-gate are as follows:
S3.1, the node logical value of each group node centering have one or 2 for 1 when, the logical value of node pair is 1； When the logical value of node centering is all 0, the logical value of node pair is 0；And then obtain the logical value of all nodes pair；
S3.2 realizes the sub-clustering to node by the identical node of logical value to being divided into the same cluster.
Beneficial effects of the present invention:
Compared with prior art, technical solution of the present invention has the advantages that
Cluster-dividing method proposed by the invention is not necessarily to calculate node during carrying out sub-clustering to wireless sensor network Location information, and then simplify the complexity of calculating, reduce and calculate time and computing cost.
In addition, cluster-dividing method proposed by the invention is to carry out sub-clustering according to the power demand of communication process interior joint, Weighed the power demand of cluster.Cluster-dividing method of the invention simultaneously can be used for real-time wireless sensor networks, improve real-time.
Detailed description of the invention
Fig. 1 is the implementation flow chart of cluster-dividing method of the present invention；
Fig. 2 is the topology controlment figure in the embodiment of the present invention.
Specific embodiment
In order to make the objectives, technical solutions, and advantages of the present invention clearer, with reference to the accompanying drawings and embodiments, right The present invention is further elaborated.It should be appreciated that described herein, the specific embodiments are only for explaining the present invention, not For limiting the present invention.
In conjunction with the process of the cluster-dividing method based on power demand in a kind of wireless sensor network of the present invention as shown in Figure 1 Figure, method of the invention are as follows:
S1, master reference node form corresponding node pair according to the Path complexity of each node.
S1.1 is randomly assigned the node of fixed quantity in specific region, in the present embodiment such as Fig. 2, node is arranged Quantity is 100, that is, has node S={ S1,S2,...,S100, then being 100 from each node to the number of path of main receiver.In t =0 moment, master reference node (MS) according to each node in the energy of each node and region and master reference node it Between communication distance obtain the Path complexity C={ C of each node1,C2,...,C100, it is obtained according to the Path complexity of node To the corresponding power demand P={ P of each node out1,P2,...,P100, value and the power demand of complexity are positively correlated, complicated The value of degree is bigger, and power demand is then bigger；The value of complexity is smaller, and power demand is then smaller.
S1.2, by the Path complexity C={ C of each node1,C2,...,C100Arranged according to the sequence successively decreased, i.e. C= {Cn,Ca,...,Cb,Cm, Path complexity maxima and minima is successively formed node pair by 1 < a, b, m, n < 100, It is exactly CnAnd CmCorresponding node Sn、SmA group node pair, i.e. { S will be becomen,Sm}；CaAnd CbCorresponding node Sa、SbIt is another Group node pair, i.e. { Sa,Sb, and so on, 50 group nodes pair will be formed here.It similarly, will if having chosen 101 nodes Ranking constitutes the node pair with 3 nodes in the 51st node and the node of its left and right two.
2 minimum and maximum threshold values of power demand are arranged in S2, by the way that the corresponding path of the node of node centering is complicated Degree is compared with set threshold value, and then obtains every group node to corresponding logical value；
S2.1 sets two threshold values to determine each group node to the logical value of interior joint, respectively power demand most Big value PmaxWith minimum value Pmin。
S2.2, by the max-thresholds P of the power demand of above-mentioned 50 group node centering Path complexity maximum value and settingmax Compare, if being higher than max-thresholds Pmax, then its logical value is 0, if being lower than max-thresholds Pmax, then its logical value is 1；It will be by node The power demand of centering Path complexity minimum value and the minimum threshold P of settingminCompare, if being higher than minimum threshold Pmin, then its Logical value is 1, if being lower than minimum threshold Pmin, then its logical value is 0.
If with the { S in S1.2n,SmFor this group node pair, wherein the C in this group node pairnFor Path complexity maximum Value, CmFor Path complexity minimum value, their corresponding power demands are respectively as follows: { Pn, Pm}.Below by power demand and threshold value It is compared, obtains the corresponding logical value of node of node centering, be written as:
In the case where number of nodes n=101, in 3 nodes of the last one node centering, remain power demand most It is big with max-thresholds PmaxCompare, power demand is the smallest with minimum threshold PminCompare, and the 51st node is then because of function The intermediate solid that rate demand is located at 3 nodes, which does not need to take out, to be compared.
S2.3, the node finally obtained is to { Sn,SmInterior joint Sn、SmCorresponding logical value；And so on obtain 50 groups of sections Point is to the corresponding logical value of interior joint；
S3 carries out dualism hypothesis based on each pair of node to the corresponding logical value of interior joint, is generated by OR-gate (OR) The logical value of node pair, and by the node with identical logical values to cluster is formed, detailed process is as follows:
S3.1 executes OR-gate operation to the logical value of each group node pair, i.e., when the node logical value of node centering has One or 2 when being 1, the logical value of node pair is 1；When the logical value of node centering is all 0, the logical value of node pair is 0.
Herein still with the { S in above-mentioned S1.2n,SmFor this group node pair, wherein the C in this group node pairnFor path Complexity maximum value, CmFor Path complexity minimum value, their corresponding power demands are respectively as follows: { Pn, Pm}。
Table 1. is based on the node of OR-gate to logical value
According to the rule in table, the logical value of 50 group nodes pair is generated.
S3.2, by the identical node of logical value to being divided into the same cluster.It is " 0 " to split the network into logical value Two clusters of " 1 ".
As shown in Fig. 2, being the topology controlment figure of the present embodiment, the section of fixed quantity is randomly assigned in specific region Point, moment, the number of path communicated from each node to master reference node are identical as the number of nodes in network at a certain moment. Master reference node determines the complexity of each path.Complexity represents the power that node is communicated with master reference node and needs It asks.
Above embodiments are merely to illustrate design philosophy and feature of the invention, and its object is to make technology in the art Personnel can understand the content of the present invention and implement it accordingly, and protection scope of the present invention is not limited to the above embodiments.So it is all according to It is within the scope of the present invention according to equivalent variations made by disclosed principle, mentality of designing or modification.