CN106921948B - Method, network node and the system for dividing group are realized based on mark extreme value - Google Patents
Method, network node and the system for dividing group are realized based on mark extreme value Download PDFInfo
- Publication number
- CN106921948B CN106921948B CN201510982745.7A CN201510982745A CN106921948B CN 106921948 B CN106921948 B CN 106921948B CN 201510982745 A CN201510982745 A CN 201510982745A CN 106921948 B CN106921948 B CN 106921948B
- Authority
- CN
- China
- Prior art keywords
- node
- cluster
- period
- mark
- head
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/06—Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services
- H04W4/08—User group management
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/32—Connectivity information management, e.g. connectivity discovery or connectivity update for defining a routing cluster membership
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Multimedia (AREA)
- Computer And Data Communications (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention discloses a kind of method, network node and system realized based on mark extreme value and divide group, is related to network-control field.Wherein the time after network node given time is divided into continuous time interval, the time in each time interval is wherein divided into N number of period with predetermined length, rule is selected based on the cluster of mark extreme value for the distribution of each period, wherein the cluster selection rule of each period is different in each time interval, the cluster selection rule that at the same time section of each node in same time interval is distributed is identical, both candidate nodes logo collection is generated according to the node table for receiving adjacent node broadcast, according to the corresponding cluster selection rule of current time, select corresponding node as cluster-head in both candidate nodes logo collection.The present invention, which passes through, utilizes various types of mark extreme value, so that the probability for making each node become cluster is close, effectively avoids the problem that certain nodes are easy to exhaust energy because being used as cluster for a long time.
Description
Technical field
It is the present invention relates to network-control field, in particular to a kind of that method, the network section for dividing group are realized based on mark extreme value
Point and system.
Background technique
The basic thought of point group is according to geographical proximity relationship by several groups of network node point, to network provide scale compared with
Small logical organization, is easily managed network.One point of group is made of cluster and member node, and cluster is as regional broadcast node
With local coordinator node.It regroups and needs very high processing expense and communication overhead.
In the Large-scale Mobile ad hoc network for dividing group, grouping method mainly have minimum mark (ID) clustering algorithm (MinID),
Highest connectivity clustering algorithm (MaxDegree) and weighting clustering algorithm (WCA) three types.
The smallest node of mark is as cluster in MinID algorithms selection adjacent area.Each node gets one uniquely
Mark, node periodic broadcast one open table, which is made of itself with the node that can be received.Wherein, (1) node
It is then cluster if the mark received is all larger than the node of oneself mark；The minimum identification point that (2) nodes receive is just
It is its cluster, unless this minimum mark clearly abandons cluster role (deferring to a smaller mark node)；(3) nodes
It is " gateway " if two or more cluster can be received；(4) otherwise, node is exactly ordinary node.The adjacent segments of cluster
The mark of point is all larger than the mark of cluster.Its responsibility can be delegated to next the smallest node of mark in its group by cluster.
Minimum mark grouping method only considers the node of minimum mark, and identifying is any distribution, does not account for node work
For the membership problem of cluster.Since node identification will not change over time, so identifying lesser node than identifying biggish section
Point is more likely to become cluster.Therefore, some nodes as cluster due to being easy to exhaust its energy for a long time.
Highest connectivity clustering algorithm selects in corresponding region the highest node of density as cluster.Each node broadcasts one
Table is opened, the node (including this node itself) which can be received by it forms.Wherein, (1) is if it is all for node
The highest of " not covering " adjacent node is connected to node, then is chosen as cluster；If then selecting mark most there are multiple this nodes
Small node is as cluster.(2) nodes still do not have selector cluster, then are " not covering " nodes；It otherwise is exactly " to have covered
Lid " node.Another node has been selected as cluster in (3) nodes, then does not undertake cluster role.The adjacent node of cluster
As its member node；Cluster and its member node are no longer participate in remaining cluster selection course.Due to being not present between cluster
It is directly connected to, so each dividing group that can only have a cluster.Cluster directly connects each member node in its group in succession, therefore in group
The distance at most jumped at a distance of two forwardings between any two node.
Highest connectivity clustering algorithm requires to select the node with most adjacent nodes as cluster.But due to section
Point resource is limited, and the number of nodes in the transmission coverage area of cluster may exceed the processing capacity of cluster.On the other hand, cluster
More, system-computed expense is higher, and handling capacity is possible to improve, and data grouping has to pass through multi-hop transmission and time delay is bigger.
The shortcomings that highest connectivity clustering algorithm: (1) frequency is low that cluster battery is easy to cause to exhaust for cluster variation；(2) group
Member node is more, and handling capacity is lower, system performance decline, due to theoretically handling up there is no limit the upper limit of member node number
Amount can will be zero；(3) increase and decrease of member node needs to reselect most high-density node.
Above two grouping method all has following property: (1) not being directly connected between cluster；(2) in a point of group
It is interior, since cluster is directly connected to each member node in its group, so at most being jumped at a distance of 2 forwardings between any two node.
Weighting clustering algorithm is on-demand, distributed, the MANET clustering algorithm based on weighting, is examined when selecting cluster
Node desired node density, transmission power, mobility, the energy content of battery and its joint effect, the different weighting of flexible allocation are considered
Factor.Weighting clustering algorithm determines that the time required for cluster depends on the diameter of parent map.This method being capable of dynamic self-adapting
The continuous variation of ad hoc network topology limits the member node quantity of cluster processing, it is ensured that MAC performance will not decline.When
One node just executes the algorithm when no longer belonging to existing any cluster, to reduce computing cost and communication overhead.
Suitability distributor of the distributed clustering algorithm according to node as cluster is weighed, and most authority node in adjacent area is selected to make
For cluster.This means that node according to one jump adjacent node power size determine its as cluster or ordinary node, therefore
Node can make this decision after must substantially receiving the response of its all adjacent node.Distributed clustering algorithm does not have
Have and considers that node receives the waiting time required for its adjacent node responds.
In order to overcome drawbacks described above, propose that a kind of stabilizing energy-saving grouping method, cluster are obtained by poll in the prior art
Each member node selection weight, to decide whether to renew cluster, weight includes the relative mobility value, opposite of member node
The factors such as dump energy condition and local node degree value.In addition, also proposing a kind of moving target detection nothing in the prior art
Line sensor network multiple access method sends election frame in group when the dump energy of cluster-head is lower than threshold value
Other nodes elect new cluster-head.
Above-mentioned two scheme the problem is that: firstly, require the longer waiting time before making a decision, until receiving
To after the response of all adjacent nodes, could be judged by complicated calculating；Secondly, judging whether to reselect cluster and residue
Energy is related, if the setting of dump energy thresholding is too low, the energy consumption of cluster is excessive；If thresholding setting is excessively high, can lead
Frequently replacement cluster is caused, especially after member's node energy all consumes a part, to reduce system performance.
Summary of the invention
The embodiment of the present invention provides a kind of method, network node and system realized based on mark extreme value and divide group, passes through benefit
Certain nodes are effectively prevented so that the probability for making each node become cluster is close with various types of mark extreme value
It is easy to the problem of exhausting energy because being used as cluster for a long time.
According to an aspect of the present invention, a kind of method realized based on mark extreme value and divide group is provided, comprising:
Time after given time is divided into continuous time interval, wherein the time in each time interval is divided
For N number of period with predetermined length；
In each time interval, rule is selected based on the cluster of mark extreme value for the distribution of each period, wherein each
The cluster of each period selects regular different, at the same time section of each node in same time interval in time interval
The cluster selection rule distributed is identical；
Both candidate nodes logo collection is generated according to the node table for receiving adjacent node broadcast, wherein each node is with predetermined week
Phase broadcast node table includes the node identification that itself can be received and own node mark in node table；
The corresponding cluster selection rule of the period according to locating for current time, selects corresponding in both candidate nodes logo collection
Node as cluster-head.
In one embodiment, N=4；
It is that step of each period distribution based on the cluster selection rule for identifying extreme value includes: in each time interval
In each time interval, there will be the node of minimum odd node mark as cluster for first time period distribution
The selection rule of node will have the node of maximum odd node mark as the selection of cluster-head for second time period distribution
Rule will have the node of minimum even-numbered nodes mark as the selection of cluster-head rule for the distribution of third period, be the
The distribution of four periods will have the node of maximum even-numbered nodes mark as the selection of cluster-head rule.
In one embodiment, the corresponding cluster selection rule of the period according to locating for current time, in both candidate nodes mark
Knowing in set selects the corresponding node to include: as the step of cluster-head
If the period locating for current time is first time period, judge in both candidate nodes logo collection with the presence or absence of odd number
Mark；
If there are odd number marks in both candidate nodes logo collection, there will be the node of minimum odd number mark as cluster section
Point；
If there is no odd numbers to identify in both candidate nodes logo collection, there will be the node of minimum even number mark as cluster
Node.
In one embodiment, the corresponding cluster selection rule of the period according to locating for current time, in both candidate nodes mark
Knowing in set selects the corresponding node to include: as the step of cluster-head
If the period locating for current time is second time period, judge in both candidate nodes logo collection with the presence or absence of odd number
Mark；
If there are odd number marks in both candidate nodes logo collection, there will be the node of maximum odd number mark as cluster section
Point；
If there is no odd numbers to identify in both candidate nodes logo collection, there will be the node of maximum even number mark as cluster
Node.
In one embodiment, the corresponding cluster selection rule of the period according to locating for current time, in both candidate nodes mark
Knowing in set selects the corresponding node to include: as the step of cluster-head
If the period locating for current time is the third period, judge in both candidate nodes logo collection with the presence or absence of even number
Mark；
If there are even number marks in both candidate nodes logo collection, there will be the node of minimum even number mark as cluster section
Point；
If there is no even numbers to identify in both candidate nodes logo collection, there will be the node of minimum odd number mark as cluster
Node.
In one embodiment, the corresponding cluster selection rule of the period according to locating for current time, in both candidate nodes mark
Knowing in set selects the corresponding node to include: as the step of cluster-head
If the period locating for current time was the 4th period, judge in both candidate nodes logo collection with the presence or absence of even number
Mark；
If there are even number marks in both candidate nodes logo collection, there will be the node of maximum even number mark as cluster section
Point；
If there is no even numbers to identify in both candidate nodes logo collection, there will be the node of maximum odd number mark as cluster
Node.
In one embodiment, the step of both candidate nodes logo collection is generated according to the node table for receiving adjacent node broadcast
Suddenly include:
After the node table for receiving adjacent node broadcast, merely with being not labeled as non-candidate cluster-head in node table
Node identification generate both candidate nodes logo collection.
In one embodiment, when with predetermined period broadcast node table, judge whether itself current performance meets group
First node requirement；
If itself current performance is unsatisfactory for cluster-head requirement, own node is labeled as in the node table of broadcast
Non-candidate cluster-head.
According to another aspect of the present invention, a kind of network node realized based on mark extreme value and divide group, including time are provided
Segment management module, regular distribution module, receiving module, candidate identification generation module and cluster selecting module, in which:
Period management module, for the time after given time to be divided into continuous time interval, wherein by each
Time in time interval is divided into N number of period with predetermined length；
Regular distribution module, for being the distribution of each period based on the cluster for identifying extreme value in each time interval
Selection rule, wherein the cluster selection rule of each period is different in each time interval, each node is in same time zone
Between in section at the same time distributed cluster selection rule it is identical；
Receiving module, for receiving the node table of adjacent node broadcast, wherein each node is with predetermined period broadcast node table,
It include the node identification that itself can be received and own node mark in node table；
Candidate identification generation module, the node table for receiving adjacent node broadcast according to receiving module generate candidate section
Point identification set；
Cluster selecting module, for the corresponding cluster selection rule of the period according to locating for current time, in both candidate nodes
Select corresponding node as cluster-head in logo collection.
In one embodiment, N=4；
Regular distribution module specifically in each time interval, will have minimum odd node mark for first time period distribution
Selection rule of the node of knowledge as cluster-head for second time period distribution will there is the node of maximum odd node mark to make
For the selection rule of cluster-head, there will be the node of minimum even-numbered nodes mark as cluster-head for the distribution of third period
Selection rule, will have the node of maximum even-numbered nodes mark as the selection of cluster-head rule for the distribution of the 4th period
Then.
In one embodiment, cluster selecting module specifically the period locating for current time be first time period when, sentence
It is identified in disconnected both candidate nodes logo collection with the presence or absence of odd number, it, will tool if there are odd number marks in both candidate nodes logo collection
There is the node of minimum odd number mark as cluster-head；If there is no odd numbers to identify in both candidate nodes logo collection, will have
The node of minimum even number mark is as cluster-head.
In one embodiment, cluster selecting module specifically the period locating for current time be second time period when, sentence
It is identified in disconnected both candidate nodes logo collection with the presence or absence of odd number, it, will tool if there are odd number marks in both candidate nodes logo collection
There is the node of maximum odd number mark as cluster-head；If there is no odd numbers to identify in both candidate nodes logo collection, will have
The node of maximum even number mark is as cluster-head.
In one embodiment, cluster selecting module specifically the period locating for current time be the third period when, sentence
It is identified in disconnected both candidate nodes logo collection with the presence or absence of even number, it, will tool if there are even number marks in both candidate nodes logo collection
There is the node of minimum even number mark as cluster-head；If there is no even numbers to identify in both candidate nodes logo collection, will have
The node of minimum odd number mark is as cluster-head.
In one embodiment, cluster selecting module specifically the period locating for current time be four periods when, sentence
It is identified in disconnected both candidate nodes logo collection with the presence or absence of even number, it, will tool if there are even number marks in both candidate nodes logo collection
There is the node of maximum even number mark as cluster-head；If there is no even numbers to identify in both candidate nodes logo collection, will have
The node of maximum odd number mark is as cluster-head.
In one embodiment, candidate identification generation module specifically receives the node of adjacent node broadcast in receiving module
After table, both candidate nodes logo collection is generated merely with the node identification for being not labeled as non-candidate cluster-head in node table.
In one embodiment, network node further includes broadcast module, in which:
Broadcast module, for judging whether itself current performance meets cluster when with predetermined period broadcast node table
Node requirements mark own node in the node table of broadcast if itself current performance is unsatisfactory for cluster-head requirement
For non-candidate cluster-head.
According to another aspect of the present invention, a kind of system realized based on mark extreme value and divide group is provided, including any of the above-described
The network node that embodiment is related to.
By referring to the drawings to the detailed description of exemplary embodiment of the present invention, other feature of the invention and its
Advantage will become apparent.
Detailed description of the invention
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
Some embodiments of invention without any creative labor, may be used also for those of ordinary skill in the art
To obtain other drawings based on these drawings.
Fig. 1 is that the schematic diagram for dividing method one embodiment of group is realized the present invention is based on mark extreme value.
Fig. 2 is that the schematic diagram for dividing network node one embodiment of group is realized the present invention is based on mark extreme value.
Fig. 3 is that the schematic diagram for dividing another embodiment of network node of group is realized the present invention is based on mark extreme value.
Fig. 4 is that the schematic diagram for dividing system one embodiment of group is realized the present invention is based on mark extreme value.
Fig. 5 is that the schematic diagram for dividing network architecture one embodiment of group is realized the present invention is based on mark extreme value.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation description, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.Below
Description only actually at least one exemplary embodiment be it is illustrative, never as to the present invention and its application or make
Any restrictions.Based on the embodiments of the present invention, those of ordinary skill in the art are not making creative work premise
Under every other embodiment obtained, shall fall within the protection scope of the present invention.
Unless specifically stated otherwise, positioned opposite, the digital table of the component and step that otherwise illustrate in these embodiments
It is not limited the scope of the invention up to formula and numerical value.
Simultaneously, it should be appreciated that for ease of description, the size of various pieces shown in attached drawing is not according to reality
Proportionate relationship draw.
Technology, method and apparatus known to person of ordinary skill in the relevant may be not discussed in detail, but suitable
In the case of, the technology, method and apparatus should be considered as authorizing part of specification.
It is shown here and discuss all examples in, any occurrence should be construed as merely illustratively, without
It is as limitation.Therefore, the other examples of exemplary embodiment can have different values.
It should also be noted that similar label and letter indicate similar terms in following attached drawing, therefore, once a certain Xiang Yi
It is defined in a attached drawing, then in subsequent attached drawing does not need that it is further discussed.
With the development of database technology and the raising of computing capability, to be loaded by database collection dynamic data
Equilibrium calculation creates feasible condition.By the calculating of database, realize that user's access service dynamic increases the place with reduction
Reason, realizes can dynamically extending for system, really realizes the smooth extension of platform.Simultaneously to platform management and monitor supervision platform user
Access data provide more convenient interface.
Fig. 1 is that the schematic diagram for dividing method one embodiment of group is realized the present invention is based on mark extreme value.Wherein:
Step 101, the time after given time is divided into continuous time interval, wherein by each time interval
Time is divided into N number of period with predetermined length.
Step 102, in each time interval, rule is selected based on the cluster of mark extreme value for the distribution of each period,
Wherein the cluster selection rule of each period is different in each time interval, and each node is same in same time interval
The cluster selection rule that a period is distributed is identical.
Preferably, N=4 includes 4 continuously equal long periods that is, in each time interval.Wherein, in each time
In section, there will be the node of minimum odd node mark as the selection of cluster-head rule for first time period distribution, be
Second time period distribution will have the node of maximum odd node mark as the selection of cluster-head rule, be the third period
Distribution will have the node of minimum even-numbered nodes mark as the selection of cluster-head rule, will have for the distribution of the 4th period
Selection rule of the node of maximum even-numbered nodes mark as cluster-head.
Step 103, both candidate nodes logo collection is generated according to the node table for receiving adjacent node broadcast, wherein each node
It include the node identification that itself can be received and own node mark with predetermined period broadcast node table, in node table.
Preferably, include: according to the step of node table generation both candidate nodes logo collection for receiving adjacent node broadcast
After the node table for receiving adjacent node broadcast, merely with being not labeled as non-candidate cluster-head in node table
Node identification generate both candidate nodes logo collection.
Wherein, each node judges whether itself current performance meets cluster section when with predetermined period broadcast node table
Point requires, if itself current performance is unsatisfactory for cluster-head requirement, is labeled as own node in the node table of broadcast
Non-candidate cluster-head.
For example, being chosen as cluster in order to avoid being not suitable for serving as the node of cluster, minimum threshold is set for candidate cluster, such as
Energy threshold, transmission power threshold value, mobility threshold value save if some parameter of node is lower than threshold value in broadcast
When point table, it oneself will be labeled as non-candidate cluster, other nodes ignore that the node when selecting cluster.
Step 104, the corresponding cluster selection rule of the period according to locating for current time, in both candidate nodes logo collection
Select corresponding node as cluster-head.
Based on the method for dividing group based on mark extreme value realization that the above embodiment of the present invention provides, by utilizing various differences
The mark extreme value of type effectively prevents certain nodes because of long-term conduct so that the probability for making each node become cluster is close
Cluster and be easy to the problem of exhausting energy.
Preferably, first time period corresponding cluster-head selection rule are as follows: judge in both candidate nodes logo collection whether
There are odd number marks, if there are odd number mark in both candidate nodes logo collection, will have the node of minimum odd number mark as
Cluster-head；If there is no odd numbers to identify in both candidate nodes logo collection, there will be the node of minimum even number mark as group
First node.
Preferably, second time period corresponding cluster-head selection rule are as follows: judge in both candidate nodes logo collection whether
There are odd number marks, if there are odd number mark in both candidate nodes logo collection, will have the node of maximum odd number mark as
Cluster-head will have the node of maximum even number mark as group if there is no odd numbers to identify in both candidate nodes logo collection
First node.
Preferably, third period corresponding cluster-head selection rule are as follows: judge in both candidate nodes logo collection whether
There are even number marks, if there are even number mark in both candidate nodes logo collection, will have the node of minimum even number mark as
Cluster-head；If there is no even numbers to identify in both candidate nodes logo collection, there will be the node of minimum odd number mark as group
First node.
Preferably, the 4th period corresponding cluster-head selection rule are as follows: judge in both candidate nodes logo collection whether
There are even number marks, if there are even number mark in both candidate nodes logo collection, will have the node of maximum even number mark as
Cluster-head；If there is no even numbers to identify in both candidate nodes logo collection, there will be the node of maximum odd number mark as group
First node.
The present invention is by being expanded to minimum odd number mark, maximum odd number from single minimum mark for the mark of candidate cluster
Mark, minimum even number mark, maximum even number mark, so that the number of nodes that may be chosen as cluster expands 4 times, at small point
In the case where group, the probability that whole nodes are chosen as cluster is very close.To solve identified in minimum mark grouping method it is small
Node be more likely to become cluster, therefore energy be easier the problem of exhausting.
Below by specific example, the present invention will be described.
Time after given time is divided into continuous time interval, wherein the time in each time interval is divided
For 4 period A, B, C and D with predetermined length, thus by the time after given time be divided into A, B, C, D, A, B, C,
D,…….Wherein there will be the node of minimum odd node mark as the selection of cluster-head rule for period A distribution, is
The distribution of period B will have the node of maximum odd node mark as the selection of cluster-head rule, will for period C distribution
Selection rule of the node with minimum even-numbered nodes mark as cluster-head, will have maximum even number for period D distribution
Selection rule of the node of node identification as cluster-head.
Each node receives the node table of adjacent node broadcast, and is generated according to the node table for receiving adjacent node broadcast
Both candidate nodes logo collection, the corresponding cluster selection rule of the period according to locating for current time, in both candidate nodes logo collection
It is middle to select corresponding node as cluster-head.Wherein each node includes itself in node table with predetermined period broadcast node table
Node identification and the own node mark that can be received.If some node judges itself to be not suitable for doing cluster, saved in broadcast
When point table, it oneself will be labeled as non-candidate cluster, so that other nodes ignore the node when selecting cluster.
1, period A
For a node for being identified as odd number, if the adjacent node mark in both candidate nodes logo collection is idol
Number, then the node is cluster；If there are also odd numbers for the adjacent node mark in both candidate nodes logo collection, there will be minimum odd number
The node of mark is as cluster-head.
And for a node for being identified as even number, if the adjacent node mark in both candidate nodes logo collection is
Even number then will have the node of minimum even number mark as cluster-head；If the adjacent node mark in both candidate nodes logo collection
Know also odd number, then there will be the node of minimum odd number mark as cluster-head.
If being " gateway " in addition, a node can receive two or more cluster.Meanwhile if cluster phase
The odd number mark of neighbors is all larger than the odd number mark of cluster, its responsibility can be delegated to next odd number mark in its group by cluster
Know the smallest node.If group's internal segment point identification is even number, and the even number mark of the adjacent node of cluster is all larger than the idol of cluster
Its responsibility can be delegated in its group and newly be added in next even number the smallest node of mark or its group by number mark, cluster
Odd number identify node.
2, period B
For a node for being identified as odd number, if the adjacent node mark in both candidate nodes logo collection is idol
Number, then the node is cluster；If there are also odd numbers for the adjacent node mark in both candidate nodes logo collection, there will be maximum odd number
The node of mark is as cluster-head.
And for a node for being identified as even number, if the adjacent node mark in both candidate nodes logo collection is
Even number then will have the node of maximum even number mark as cluster-head；If the adjacent node mark in both candidate nodes logo collection
Know also odd number, then there will be the node of maximum odd number mark as cluster-head.
If being " gateway " in addition, a node can receive two or more cluster.Meanwhile if cluster phase
The odd number mark of neighbors is respectively less than the odd number mark of cluster, its responsibility can be delegated to next odd number mark in its group by cluster
Know maximum node.If group's internal segment point identification is even number, the even number mark of the adjacent node of cluster is respectively less than the idol of cluster
Its responsibility can be delegated in its group and newly be added in next even number maximum node of mark or its group by number mark, cluster
Odd number identify node.
3, period C
For a node for being identified as even number, if the adjacent node mark in both candidate nodes logo collection is surprise
Number, then the node is cluster；If there are also even numbers for the adjacent node mark in both candidate nodes logo collection, there will be minimum even number
The node of mark is as cluster-head.
And for a node for being identified as odd number, if the adjacent node mark in both candidate nodes logo collection is
Odd number then will have the node of minimum odd number mark as cluster-head；If the adjacent node mark in both candidate nodes logo collection
Know also even number, then there will be the node of minimum even number mark as cluster-head.
If being " gateway " in addition, a node can receive two or more cluster.Meanwhile if cluster phase
The even number mark of neighbors is all larger than the even number mark of cluster.Its responsibility can be delegated to next even number mark in its group by cluster
Know the smallest node.If group's internal segment point identification is odd number, the odd number mark of the adjacent node of cluster is all larger than the surprise of cluster
Its responsibility can be delegated in its group and newly be added in next odd number the smallest node of mark or its group by number mark, cluster
Even number identify node.
4, period D
For a node for being identified as even number, if the adjacent node mark in both candidate nodes logo collection is surprise
Number, then the node is cluster；If there are also even numbers for the adjacent node mark in both candidate nodes logo collection, there will be maximum even number
The node of mark is as cluster-head.
And for a node for being identified as odd number, if the adjacent node mark in both candidate nodes logo collection is
Odd number then will have the node of maximum odd number mark as cluster-head；If the adjacent node mark in both candidate nodes logo collection
Know also even number, then there will be the node of maximum even number mark as cluster-head.
If being " gateway " in addition, a node can receive two or more cluster.Meanwhile if cluster phase
The even number mark of neighbors is respectively less than the even number mark of cluster.Its responsibility can be delegated to next even number mark in its group by cluster
Know maximum node.If group's internal segment point identification is odd number, the odd number mark of the adjacent node of cluster is respectively less than the surprise of cluster
Its responsibility can be delegated in its group and newly be added in next odd number maximum node of mark or its group by number mark, cluster
Even number identify node.
Fig. 2 is that the schematic diagram for dividing network node one embodiment of group is realized the present invention is based on mark extreme value.Such as Fig. 2 institute
Show, network node includes period management module 201, regular distribution module 202, receiving module 203, candidate identification generation module
204 and cluster selecting module 205, in which:
Period management module 201 is used to the time after given time being divided into continuous time interval, wherein by every
Time in a time interval is divided into N number of period with predetermined length.
Regular distribution module 202 is used in each time interval, for group of the distribution of each period based on mark extreme value
First choice selects rule, wherein the cluster selection rule of each period is different in each time interval, each node is in the same time
The cluster selection rule that section at the same time in section is distributed is identical.
Preferably, N=4.Regular distribution module 202 in each time interval, will specifically have for first time period distribution
There is selection rule of the node of minimum odd node mark as cluster-head, there will be maximum odd number for second time period distribution
Selection rule of the node of node identification as cluster-head will have minimum even-numbered nodes mark for the distribution of third period
Selection rule of the node as cluster-head will have the node of maximum even-numbered nodes mark as group for the distribution of the 4th period
The selection rule of first node.
Receiving module 203 is used to receive the node table of adjacent node broadcast, wherein each node is with predetermined period broadcast node
Table includes the node identification that itself can be received and own node mark in node table.
The node table that candidate identification generation module 204 is used to receive adjacent node broadcast according to receiving module generates candidate
Node identification set.
Preferably, candidate identification generation module 204 specifically receiving module receive adjacent node broadcast node table after,
Both candidate nodes logo collection is generated merely with the node identification for being not labeled as non-candidate cluster-head in node table.
Cluster selecting module 205 is saved for the corresponding cluster selection rule of the period according to locating for current time in candidate
Select corresponding node as cluster-head in point identification set.
It is various by utilizing based on the network node for dividing group based on mark extreme value realization that the above embodiment of the present invention provides
Different types of mark extreme value effectively prevents certain nodes because long-term so that the probability for making each node become cluster is close
It is easy to the problem of exhausting energy as cluster.
Preferably, cluster selecting module 205 specifically the period locating for current time be first time period when, judge candidate
It is identified in node identification set with the presence or absence of odd number, if there are odd number marks in both candidate nodes logo collection, will have minimum
The node of odd number mark is as cluster-head；If there is no odd numbers to identify in both candidate nodes logo collection, will have minimum even
The node of number mark is as cluster-head.
Cluster selecting module 205 specifically the period locating for current time be second time period when, judge both candidate nodes mark
Know in set and identified with the presence or absence of odd number, if there are odd number marks in both candidate nodes logo collection, there will be maximum odd number mark
The node of knowledge is as cluster-head；If there is no odd numbers to identify in both candidate nodes logo collection, there will be maximum even number to identify
Node as cluster-head.
Cluster selecting module 205 specifically the period locating for current time be the third period when, judge both candidate nodes mark
Know in set and identified with the presence or absence of even number, if there are even number marks in both candidate nodes logo collection, there will be minimum even number mark
The node of knowledge is as cluster-head；If there is no even numbers to identify in both candidate nodes logo collection, there will be minimum odd number to identify
Node as cluster-head.
Cluster selecting module 205 specifically the period locating for current time be four periods when, judge both candidate nodes mark
Know in set and identified with the presence or absence of even number, if there are even number marks in both candidate nodes logo collection, there will be maximum even number mark
The node of knowledge is as cluster-head；If there is no even numbers to identify in both candidate nodes logo collection, there will be maximum odd number to identify
Node as cluster-head.
Fig. 3 is that the schematic diagram for dividing another embodiment of network node of group is realized the present invention is based on mark extreme value.In Fig. 3,
Period management module 301, regular distribution module 302, receiving module 303, candidate identification generation module 304 and cluster select mould
Period management module 201, regular distribution module 202, receiving module 203, candidate identification generation module in block 305 and Fig. 2
204 and cluster selecting module 205 it is identical.In addition, further including broadcast module 306 in Fig. 3, in which:
Broadcast module 306 is used for when with predetermined period broadcast node table, judges whether itself current performance meets group
First node requirement, if itself current performance is unsatisfactory for cluster-head requirement, by own node mark in the node table of broadcast
Note is non-candidate cluster-head.
Fig. 4 is that the schematic diagram for dividing system one embodiment of group is realized the present invention is based on mark extreme value.Wherein, it is wrapped in system
The member node 401 that includes, 402,403 ..., 40n be any embodiment is related in Fig. 2 and Fig. 3 network node.
Fig. 5 is that the schematic diagram for dividing network architecture one embodiment of group is realized the present invention is based on mark extreme value.Wherein, black
Square indicates the cluster selected, and black circle indicates that gateway, circle indicate rank and file's node.
By applying the present invention, each node only need based on the received adjacent node table can voluntarily judge which mark
Knowledge is cluster, thus calculating is simple, operand is few, the traffic is few, without the additional waiting time.Each node is chosen as cluster
Probability it is close, be easier the problem of exhausting so as to avoid a small number of node energies.
Those of ordinary skill in the art will appreciate that realizing that all or part of the steps of above-described embodiment can pass through hardware
It completes, relevant hardware can also be instructed to complete by program, the program can store in a kind of computer-readable
In storage medium, storage medium mentioned above can be read-only memory, disk or CD etc..
Description of the invention is given for the purpose of illustration and description, and is not exhaustively or will be of the invention
It is limited to disclosed form.Many modifications and variations are obvious for the ordinary skill in the art.It selects and retouches
It states embodiment and is to more preferably illustrate the principle of the present invention and practical application, and those skilled in the art is enable to manage
The solution present invention is to design various embodiments suitable for specific applications with various modifications.
Claims (13)
1. a kind of realize the method for dividing group based on mark extreme value characterized by comprising
Time after given time is divided into continuous time interval, wherein the time in each time interval is divided into N
A period with predetermined length；
In each time interval, rule is selected based on the cluster of mark extreme value for the distribution of each period, wherein each time
The cluster of each period selects different, at the same time Duan Suofen of each node in same time interval of rule in section
The cluster selection rule matched is identical；
Both candidate nodes logo collection is generated according to the node table for receiving adjacent node broadcast, wherein each node is wide with predetermined period
Node table is broadcast, includes the node identification that itself can be received and own node mark in node table；
The corresponding cluster selection rule of the period according to locating for current time, selects corresponding section in both candidate nodes logo collection
Point is used as cluster-head；
Wherein, include: according to the step of node table generation both candidate nodes logo collection for receiving adjacent node broadcast
After the node table for receiving adjacent node broadcast, merely with the section for being not labeled as non-candidate cluster-head in node table
Point identification generates both candidate nodes logo collection；
When with predetermined period broadcast node table, judge whether itself current performance meets cluster-head requirement；
If itself current performance is unsatisfactory for cluster-head requirement, own node is labeled as non-time in the node table of broadcast
Select cluster-head.
2. the method according to claim 1, wherein
N=4；
It is that step of each period distribution based on the cluster selection rule for identifying extreme value includes: in each time interval
In each time interval, there will be the node of minimum odd node mark as cluster-head for first time period distribution
Selection rule, will have the node of maximum odd node mark as the selection of cluster-head rule for second time period distribution
Then, there will be the node of minimum even-numbered nodes mark as the selection of cluster-head rule for the distribution of third period, be the 4th
Period distribution will have the node of maximum even-numbered nodes mark as the selection of cluster-head rule.
3. the method according to claim 1, wherein
The corresponding cluster selection rule of the period according to locating for current time, selects corresponding section in both candidate nodes logo collection
It puts and includes: as the step of cluster-head
If the period locating for current time is first time period, judge in both candidate nodes logo collection with the presence or absence of odd number mark
Know；
If there are odd number marks in both candidate nodes logo collection, there will be the node of minimum odd number mark as cluster-head；
If there is no odd numbers to identify in both candidate nodes logo collection, there will be the node of minimum even number mark as cluster section
Point.
4. the method according to claim 1, wherein
The corresponding cluster selection rule of the period according to locating for current time, selects corresponding section in both candidate nodes logo collection
It puts and includes: as the step of cluster-head
If the period locating for current time is second time period, judge in both candidate nodes logo collection with the presence or absence of odd number mark
Know；
If there are odd number marks in both candidate nodes logo collection, there will be the node of maximum odd number mark as cluster-head；
If there is no odd numbers to identify in both candidate nodes logo collection, there will be the node of maximum even number mark as cluster section
Point.
5. the method according to claim 1, wherein
The corresponding cluster selection rule of the period according to locating for current time, selects corresponding section in both candidate nodes logo collection
It puts and includes: as the step of cluster-head
If the period locating for current time is the third period, judge in both candidate nodes logo collection with the presence or absence of even number mark
Know；
If there are even number marks in both candidate nodes logo collection, there will be the node of minimum even number mark as cluster-head；
If there is no even numbers to identify in both candidate nodes logo collection, there will be the node of minimum odd number mark as cluster section
Point.
6. the method according to claim 1, wherein
The corresponding cluster selection rule of the period according to locating for current time, selects corresponding section in both candidate nodes logo collection
It puts and includes: as the step of cluster-head
If the period locating for current time was the 4th period, judge in both candidate nodes logo collection with the presence or absence of even number mark
Know；
If there are even number marks in both candidate nodes logo collection, there will be the node of maximum even number mark as cluster-head；
If there is no even numbers to identify in both candidate nodes logo collection, there will be the node of maximum odd number mark as cluster section
Point.
7. a kind of realize the network node for dividing group based on mark extreme value, which is characterized in that including period management module, rule point
With module, receiving module, candidate identification generation module, cluster selecting module and broadcast module, in which:
Period management module, for the time after given time to be divided into continuous time interval, wherein by each time
Time in section is divided into N number of period with predetermined length；
Regular distribution module, for the cluster selection in each time interval, for the distribution of each period based on mark extreme value
Rule, wherein the cluster selection rule of each period is different in each time interval, each node is in same time interval
Section at the same time distributed cluster selection rule it is identical；
Receiving module, for receiving the node table of adjacent node broadcast, wherein each node is with predetermined period broadcast node table, node
It include the node identification that itself can be received and own node mark in table；
Candidate identification generation module, the node table for receiving adjacent node broadcast according to receiving module generate both candidate nodes mark
Know set, wherein after the node table that receiving module receives adjacent node broadcast, it is non-merely with being not labeled as in node table
The node identification of candidate cluster-head generates both candidate nodes logo collection；
Cluster selecting module is identified for the corresponding cluster selection rule of the period according to locating for current time in both candidate nodes
Select corresponding node as cluster-head in set；
Broadcast module, for judging whether itself current performance meets cluster-head when with predetermined period broadcast node table
It is required that if itself current performance is unsatisfactory for cluster-head requirement, own node is labeled as in the node table of broadcast non-
Candidate cluster-head.
8. network node according to claim 7, which is characterized in that
N=4；
Regular distribution module specifically in each time interval, will have minimum odd node mark for first time period distribution
Selection rule of the node as cluster-head will have the node of maximum odd node mark as group for second time period distribution
The selection rule of first node will have the node of minimum even-numbered nodes mark as the choosing of cluster-head for the distribution of third period
Rule is selected, there will be the node of maximum even-numbered nodes mark as the selection of cluster-head rule for the distribution of the 4th period.
9. network node according to claim 7, which is characterized in that
Cluster selecting module specifically the period locating for current time be first time period when, judge in both candidate nodes logo collection
It is identified with the presence or absence of odd number, if there are odd number marks in both candidate nodes logo collection, will there is the node of minimum odd number mark
As cluster-head；If there is no odd numbers to identify in both candidate nodes logo collection, will there is the node of minimum even number mark to make
For cluster-head.
10. network node according to claim 7, which is characterized in that
Cluster selecting module specifically the period locating for current time be second time period when, judge in both candidate nodes logo collection
It is identified with the presence or absence of odd number, if there are odd number marks in both candidate nodes logo collection, will there is the node of maximum odd number mark
As cluster-head；If there is no odd numbers to identify in both candidate nodes logo collection, will there is the node of maximum even number mark to make
For cluster-head.
11. network node according to claim 7, which is characterized in that
Cluster selecting module specifically the period locating for current time be the third period when, judge in both candidate nodes logo collection
It is identified with the presence or absence of even number, if there are even number marks in both candidate nodes logo collection, will there is the node of minimum even number mark
As cluster-head；If there is no even numbers to identify in both candidate nodes logo collection, will there is the node of minimum odd number mark to make
For cluster-head.
12. network node according to claim 7, which is characterized in that
Cluster selecting module specifically the period locating for current time be four periods when, judge in both candidate nodes logo collection
It is identified with the presence or absence of even number, if there are even number marks in both candidate nodes logo collection, will there is the node of maximum even number mark
As cluster-head；If there is no even numbers to identify in both candidate nodes logo collection, will there is the node of maximum odd number mark to make
For cluster-head.
13. a kind of realize the system for dividing group based on mark extreme value, which is characterized in that including any one of such as claim 7-12 institute
The network node stated.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510982745.7A CN106921948B (en) | 2015-12-24 | 2015-12-24 | Method, network node and the system for dividing group are realized based on mark extreme value |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510982745.7A CN106921948B (en) | 2015-12-24 | 2015-12-24 | Method, network node and the system for dividing group are realized based on mark extreme value |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106921948A CN106921948A (en) | 2017-07-04 |
| CN106921948B true CN106921948B (en) | 2019-07-05 |
Family
ID=59457039
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510982745.7A Active CN106921948B (en) | 2015-12-24 | 2015-12-24 | Method, network node and the system for dividing group are realized based on mark extreme value |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106921948B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1917460A (en) * | 2006-09-07 | 2007-02-21 | 上海交通大学 | Distribution type structuring method for virtual backbone network in network of wireless sensor |
| CN101267404A (en) * | 2008-05-13 | 2008-09-17 | 北京科技大学 | An assister-based clustering method in Ad Hoc network |
| CN101568076A (en) * | 2009-06-05 | 2009-10-28 | 北京邮电大学 | Method for grouping and device |
| CN102625404A (en) * | 2012-03-02 | 2012-08-01 | 东南大学 | Distributed routing protocol method for three-dimensional underwater acoustic sensor networks |
| CN103347101A (en) * | 2013-06-25 | 2013-10-09 | 常熟理工学院 | 6LoWPAN wireless sensor network address configuration method based on cluster |
-
2015
- 2015-12-24 CN CN201510982745.7A patent/CN106921948B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1917460A (en) * | 2006-09-07 | 2007-02-21 | 上海交通大学 | Distribution type structuring method for virtual backbone network in network of wireless sensor |
| CN101267404A (en) * | 2008-05-13 | 2008-09-17 | 北京科技大学 | An assister-based clustering method in Ad Hoc network |
| CN101568076A (en) * | 2009-06-05 | 2009-10-28 | 北京邮电大学 | Method for grouping and device |
| CN102625404A (en) * | 2012-03-02 | 2012-08-01 | 东南大学 | Distributed routing protocol method for three-dimensional underwater acoustic sensor networks |
| CN103347101A (en) * | 2013-06-25 | 2013-10-09 | 常熟理工学院 | 6LoWPAN wireless sensor network address configuration method based on cluster |
Non-Patent Citations (2)
| Title |
|---|
| 分层分布式网络管理中群首委任机制的研究与实现;白冬林;《万方》;20090921;全文 |
| 移动Ad Hoc网络中的自适应转发分群路由协议;王力;《北京航空航天大学学报》;20090831;全文 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106921948A (en) | 2017-07-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Song et al. | Maximizing network lifetime based on transmission range adjustment in wireless sensor networks | |
| Barati et al. | EACHP: Energy aware clustering hierarchy protocol for large scale wireless sensor networks | |
| Tabatabaei et al. | Reliable routing algorithm based on clustering and mobile sink in wireless sensor networks | |
| CN115604778B (en) | Node access method, device, equipment and storage medium | |
| Wang et al. | Exploring load-balance to dispatch mobile sensors in wireless sensor networks | |
| Aissa et al. | A node quality based clustering algorithm in wireless mobile Ad Hoc networks | |
| Punriboon et al. | Fuzzy logic-based path planning for data gathering mobile sinks in WSNs | |
| Kim et al. | Reconfiguration of clusterheads for load balancing in wireless sensor networks | |
| CN101483935A (en) | Topology drawing algorithm for wireless Ad-Hoc network | |
| CN106921681B (en) | Method, network node and the system for dividing group are realized based on random fashion | |
| Wei et al. | A neighbor discovery method based on probabilistic neighborship model for IoT | |
| Salem et al. | ICSSSS: An intelligent channel selection scheme for cognitive radio ad hoc networks using a self organized map followed by simple segregation | |
| CN106921948B (en) | Method, network node and the system for dividing group are realized based on mark extreme value | |
| CN103220683B (en) | A kind of frequency point setting method and apparatus | |
| Singh et al. | Analysis of lifetime of wireless sensor network with base station moving on different paths | |
| CN104065737A (en) | Method and system for determining deployment scheme of service nodes | |
| Raj et al. | Multi-hop in clustering with mobility protocol to save the energy utilization in wireless sensor networks | |
| CN103347101A (en) | 6LoWPAN wireless sensor network address configuration method based on cluster | |
| Park et al. | An efficient data-centric storage method using time parameter for sensor networks | |
| Soni et al. | An investigation on energy efficient routing protocol for wireless sensor network | |
| CN104768163A (en) | Cell state update method and device | |
| CN102833864A (en) | Radio resource allocation method for multi-cell mobile communication system | |
| Zhou et al. | Sleep Scheduling for Enhancing the Lifetime of Three-Dimensional Heterogeneous Wireless Sensor Networks | |
| Alsarhan et al. | Load balancing for spectrum management in a cluster-based cognitive network | |
| Salman et al. | An Efficient Clustering of Wireless Sensor Network by Spectral Graph Partitioning |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |