CN106921681A - Method, network node and the system of point group are realized based on random fashion - Google Patents
Method, network node and the system of point group are realized based on random fashion Download PDFInfo
- Publication number
- CN106921681A CN106921681A CN201510982775.8A CN201510982775A CN106921681A CN 106921681 A CN106921681 A CN 106921681A CN 201510982775 A CN201510982775 A CN 201510982775A CN 106921681 A CN106921681 A CN 106921681A
- Authority
- CN
- China
- Prior art keywords
- node
- mark
- cluster
- identification
- candidate
- 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.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/104—Peer-to-peer [P2P] networks
- H04L67/1044—Group management mechanisms
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L65/00—Network arrangements, protocols or services for supporting real-time applications in data packet communication
- H04L65/60—Network streaming of media packets
- H04L65/61—Network streaming of media packets for supporting one-way streaming services, e.g. Internet radio
- H04L65/611—Network streaming of media packets for supporting one-way streaming services, e.g. Internet radio for multicast or broadcast
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/104—Peer-to-peer [P2P] networks
- H04L67/1044—Group management mechanisms
- H04L67/1051—Group master selection mechanisms
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/52—Network services specially adapted for the location of the user terminal
-
- 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/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Multimedia (AREA)
- Physics & Mathematics (AREA)
- Computing Systems (AREA)
- Mathematical Physics (AREA)
- Theoretical Computer Science (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention discloses a kind of method, network node and system that point group is realized based on random fashion, is related to network control field.Wherein network node specifies the time after the moment to be divided into continuous time interval, it it is N number of time period with predetermined length wherein by the time division in each time interval, N is node identification spatial value, in each time interval, for each time period distributes a random number R, node table according to adjacent node broadcast is received generates both candidate nodes logo collection, the corresponding random number of the time period according to residing for current time, line translation is entered to each node identification in both candidate nodes logo collection, to obtain corresponding conversion mark, node corresponding to the minimum conversion mark of selection is used as cluster-head.By the present invention in that the node identification randomization of candidate's cluster, so that the probability that each node turns into cluster is identical, effectively prevent some nodes because being easy to exhaust the problem of energy as cluster for a long time.
Description
Technical field
It is more particularly to a kind of that a point group is realized based on random fashion the present invention relates to network control field
Method, network node and system.
Background technology
The basic thought for dividing group is by several groups of network node point, to net according to geographical proximity relation
Network provides the less logical organization of scale, is easily managed network.One point of group is by cluster and member
Node is constituted, and cluster is used as regional broadcast node and local coordinator node.Regroup needs very high
Treatment expense and communication overhead.
In the Large-scale Mobile MANET of point group, grouping method mainly has minimum ID clustering algorithms
(MinID), highest connectedness clustering algorithm (MaxDegree) and weighting clustering algorithm (WCA)
Three types.
ID minimum node is used as cluster in MinID algorithms selection adjacent areas.Each node point
A unique ID, one table of node periodic broadcast, the table by itself with can receive
The node composition for arriving.Wherein, (1) is if the ID that node is received is all higher than oneself ID
Node, then be cluster；The minimum ID points that (2) nodes are received are exactly its cluster, are removed
Non- this minimum ID clearly abandons cluster role (deferring to a smaller ID node)；(3) one
It is " gateway " if individual node can receive two or more cluster；(4) otherwise, save
Point is exactly ordinary node.The ID of the adjacent node of cluster is all higher than the ID of cluster.Cluster can be by
Its responsibility is delegated to node next ID minimum in its group.
Minimum ID grouping methods only consider the node of minimum ID, and ID is any distribution, do not have
Consider membership problem of the node as cluster.Because node ID will not be changed over time, so ID
The less node node more larger than ID more likely turns into cluster.Therefore, some nodes are due to length
Time is easy to exhaust its energy as cluster.
Density highest node is used as cluster in highest connectedness clustering algorithm selection adjacent area.Often
One table of individual node broadcasts, node (including this node itself) group that the table can be received by it
Into.Wherein, (1) is if highest connection section of node its all " covering " adjacent node
Point, then be chosen as cluster；If in the presence of multiple this nodes, then selecting the minimum nodes of ID to make
It is cluster.(2) nodes still do not have selector cluster, then be " covering " node；It is no
It is exactly then " covering " node.(3) chosen another nodes of node as cluster,
Cluster role is not undertaken then.The adjacent node of cluster turns into its member node；Cluster and its member save
Point is no longer participate in remaining cluster selection course.It is directly connected to due to not existing between cluster, so
Each point of group can only have a cluster.Cluster directly connects each member node in its group in succession, therefore
The distance at most jumped at a distance of two forwardings between any two node in group.
Highest connectedness clustering algorithm requirement node of the selection with most adjacent nodes is used as cluster.
But, because node resource is limited, the nodes in the transmission coverage of cluster may exceed
The disposal ability of cluster.On the other hand, cluster is more, and system-computed expense is higher, and handling capacity has
May improve, packet has to pass through multi-hop transmission and time delay is bigger.
The shortcoming of highest connectedness clustering algorithm：(1) the cluster change frequency is low is easily caused cluster electricity
Pond exhausts；(2) group members node is more, and handling capacity is lower, and systematic function declines, due to not having
The upper limit of member's nodes is limited, handling capacity can will be zero in theory；(3) increase and decrease of member node
Need to reselect most high-density node.
Above two grouping method is respectively provided with following property：(1) it is not directly connected between cluster；
(2) in a point of group, because cluster is directly connected to each member node in its group, so appointing
At most jumped at a distance of 2 forwardings between two nodes of meaning.
Weighting clustering algorithm be one on demand, MANET points of group distributed, based on weighting calculate
Method, node desired node density, transmission power, mobility, battery are considered when cluster is selected
Energy and its joint effect, the different weighted factor of flexible allocation.Weighting clustering algorithm determines cluster
The required time depends on the diameter of parent map.The method being capable of dynamic self-adapting ad hoc network topology
Be continually changing, to cluster treatment member node quantity limit, it is ensured that MAC performances are not
Can decline.The algorithm is just performed when a node no longer belongs to existing any cluster, to reduce
Computing cost and communication overhead.
Distributed clustering algorithm is weighed according to node as the suitability distributor of cluster, in selection adjacent area
Most authority node is used as cluster.The power size decision of adjacent node is jumped according to one this means node
It is used as cluster or ordinary node, therefore node must substantially receive its all adjacent node
Response after can make this decision.Distributed clustering algorithm does not account for node and receives its phase
Stand-by period required for neighbors response.
In order to overcome drawbacks described above, a kind of stabilizing energy-saving grouping method, group are proposed in the prior art
Head obtains the selection weights of each member node by poll, to decide whether to renew cluster, weights bag
Relative mobility value, relative surplus energy state value containing member node and local node degree value etc. because
Son.Additionally, also proposing a kind of moving target detection wireless sensing device network multiple access in the prior art
Cut-in method, when the dump energy of cluster-head is less than threshold value, it sends election frame in group
Other nodes elect new cluster-head.
Above-mentioned two scheme exist problem be：First, wait more long is required for before making a decision
Time, until that after the response for receiving all adjacent nodes, could be judged by complicated calculating；
Secondly, judge whether to reselect cluster it is related to dump energy, if the setting of dump energy thresholding
Too low, the energy ezpenditure of cluster is excessive；If thresholding sets too high, can cause frequently to change group
Head, especially after member's node energy all consumes a part, so as to reduce systematic function.
The content of the invention
The embodiment of the present invention provide it is a kind of based on random fashion realize the method for point group, network node and
System, by making the node identification randomization of candidate's cluster, so that each node turns into cluster
Probability is identical, effectively prevent some nodes and exhausts asking for energy because being easy to as cluster for a long time
Topic.
According to an aspect of the present invention, there is provided a kind of method that point group is realized based on random fashion,
Including：
Time after the specified moment is divided into continuous time interval, wherein by each time interval
In time division be N number of time period with predetermined length, N is node identification spatial value；
It is each time period to distribute a random number R in each time interval, wherein R is
Natural number, 1≤R≤N is that the random number of each time period distribution is different in same time interval,
And the random number that at the same time section of each node in same time interval is distributed is identical；
Node table according to adjacent node broadcast is received generates both candidate nodes logo collection, wherein respectively
Node includes the node identification that itself can be received with predetermined period broadcast node table, node table
Identified with own node；
The corresponding random number of the time period according to residing for current time, in both candidate nodes logo collection
Each node identification enters line translation, to obtain corresponding conversion mark；
Node corresponding to the minimum conversion mark of selection is used as cluster-head.
In one embodiment, N=IDmax-IDmin+1, IDmax are in node identification space
The maximum node mark of setting, IDmin is the minimum node mark of setting in node identification space.
In one embodiment, the corresponding random number of the time period according to residing for current time, to candidate
The step of each node identification in node identification set enters line translation includes：
By i-th node identification in both candidate nodes logo collection, with the time period residing for current time
Corresponding random number is added, to obtain i-th mark conversion value of node, wherein 1≤i≤M, M
It is the mark sum in both candidate nodes logo collection；
Judge i-th mark conversion value of node whether more than IDmax；
If i-th mark conversion value of node is more than IDmax, i-th mark of node is turned
Change value to subtract each other with N, identified with obtaining i-th conversion of node.
In one embodiment, if the mark conversion value of i-th node is not more than IDmax, will
I-th mark conversion value of node is identified as i-th conversion of node.
In one embodiment, both candidate nodes are generated according to the node table for receiving adjacent node broadcast
The step of logo collection, includes：
It is non-merely with being not labeled as in node table after the node table for receiving adjacent node broadcast
The node identification generation both candidate nodes logo collection of candidate's cluster-head.
In one embodiment, when with predetermined period broadcast node table, itself current property is judged
Whether cluster-head requirement can be met；
If itself current performance is unsatisfactory for cluster-head requirement, will be from the node table of broadcast
Body node label is non-candidate cluster-head.
According to another aspect of the present invention, there is provided a kind of network section that point group is realized based on random fashion
Point, including time period management module, random pair module, receiver module, candidate identification generation mould
Block, mark conversion module and cluster selecting module, wherein：
Time period management module, for the time after the specified moment to be divided into continuous time zone
Between, wherein be N number of time period with predetermined length by the time division in each time interval,
N is node identification spatial value；
Random pair module, in each time interval, be each time period distribute one with
Machine number R, wherein R are natural number, and 1≤R≤N is each time period point in same time interval
The random number matched somebody with somebody is different, and at the same time section institute of each node in same time interval
The random number of distribution is identical；
Receiver module, the node table for receiving adjacent node broadcast, wherein each node is with predetermined week
Phase broadcast node table, node table includes the node identification that itself can be received and own node mark
Know；
Candidate identification generation module, for the node table generation candidate's section received according to receiver module
Point identification set；
Mark conversion module, for the corresponding random number of the time period according to residing for current time, to waiting
Each node identification in node identification set is selected to enter line translation, to obtain corresponding conversion mark；
Cluster selecting module, for selecting the node corresponding to minimum conversion mark as cluster section
Point.
In one embodiment, N=IDmax-IDmin+1, IDmax are in node identification space
The maximum node mark of setting, IDmin is the minimum node mark of setting in node identification space.
In one embodiment, mark conversion module is specifically by i-th in both candidate nodes logo collection
Individual node identification, random number corresponding with the time period residing for current time is added, to obtain i-th
The mark conversion value of node, wherein 1≤i≤M, M are total for the mark in both candidate nodes logo collection
Whether number, judge i-th mark conversion value of node more than IDmax, if i-th mark of node
Know conversion value and be more than IDmax, then subtract each other the mark conversion value of i-th node with N, to obtain
I-th conversion mark of node.
In one embodiment, mark conversion module is additionally operable in i-th mark conversion value of node
During no more than IDmax, using i-th mark conversion value of node as i-th change dehorn of node
Know.
In one embodiment, candidate identification generation module specifically receives adjacent segments in receiver module
After the node table of point broadcast, merely with the node that non-candidate cluster-head is not labeled as in node table
Mark generation both candidate nodes logo collection.
In one embodiment, network node also includes broadcast module, wherein：
Broadcast module, for predetermined period broadcast node table, wherein in broadcast node table, sentencing
Whether itself current performance of breaking meets cluster-head requirement, if itself current performance is unsatisfactory for group
First node requirement, then be labeled as non-candidate cluster-head in the node table of broadcast by own node.
According to another aspect of the present invention, there is provided a kind of system that point group is realized based on random fashion,
Including the network node that any of the above-described embodiment is related to.
By referring to the drawings to the detailed description of exemplary embodiment of the invention, the present invention
Further feature and its advantage will be made apparent from.
Brief description of the drawings
In order to illustrate more clearly about the embodiment of the present invention or technical scheme of the prior art, below will
The accompanying drawing to be used needed for embodiment or description of the prior art is briefly described, it is clear that
Ground, drawings in the following description are only some embodiments of the present invention, for the common skill in this area
For art personnel, without having to pay creative labor, can also be obtained according to these accompanying drawings
Obtain other accompanying drawings.
Fig. 1 is the schematic diagram of method one embodiment that the present invention realizes point group based on random fashion.
Fig. 2 is showing for network node one embodiment that the present invention realizes point group based on random fashion
It is intended to.
Fig. 3 is showing for another embodiment of network node that the present invention realizes point group based on random fashion
It is intended to.
Fig. 4 is the schematic diagram of system one embodiment that the present invention realizes point group based on random fashion.
Fig. 5 is the schematic diagram of random point of group network framework one embodiment of the invention.
Specific embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, to the technical scheme in the embodiment of the present invention
It is clearly and completely described, it is clear that described embodiment is only a real part of the invention
Example is applied, rather than whole embodiments.Below to the description reality of at least one exemplary embodiment
It is merely illustrative on border, never as to the present invention and its application or any limit for using
System.Based on the embodiment in the present invention, those of ordinary skill in the art are not making creative labor
The every other embodiment obtained under the premise of dynamic, belongs to the scope of protection of the invention.
Unless specifically stated otherwise, the part and the phase of step for otherwise illustrating in these embodiments
Arrangement, numerical expression and numerical value are not limited the scope of the invention.
Simultaneously, it should be appreciated that for the ease of description, the chi of the various pieces shown in accompanying drawing
Very little is not to be drawn according to actual proportionate relationship.
May not make in detail for technology, method and apparatus known to person of ordinary skill in the relevant
It is thin to discuss, but in the appropriate case, the technology, method and apparatus should be considered as authorizing to be said
A part for bright book.
In all examples shown here and discussion, any occurrence should be construed as merely
Exemplary, not as limitation.Therefore, the other examples of exemplary embodiment can have
There are different values.
It should be noted that：Similar label and letter represents similar terms in following accompanying drawing, therefore,
Once being defined in a certain Xiang Yi accompanying drawing, then it need not be carried out in subsequent accompanying drawing
It is discussed further.
It is that dynamic is collected by database with the development and the raising of computing capability of database technology
Data come do load balancing calculate create feasible condition.By the calculating of database, realize using
Family access service dynamically increases the treatment with reduction, realizes can dynamically extending for system, real real
The smooth extension of existing platform.Data are accessed to platform management and monitor supervision platform user simultaneously to provide more
Interface for convenience.
Fig. 1 is the schematic diagram of method one embodiment that the present invention realizes point group based on random fashion.
Wherein：
Step 101, continuous time interval is divided into by the time after the specified moment, wherein will be every
Time division in individual time interval is N number of time period with predetermined length, and N is node mark
Know spatial value.
Preferably, N=IDmax-IDmin+1, IDmax be node identification space in setting most
Big node identification, IDmin is the minimum node mark of setting in node identification space.
Step 102, is each time period to distribute a random number R in each time interval,
Wherein R is natural number, and 1≤R≤N is the random of each time period distribution in same time interval
Number it is different, and at the same time section of each node in same time interval distributed with
Machine number is identical.
Step 103, both candidate nodes identification sets are generated according to the node table for receiving adjacent node broadcast
Close, wherein each node is with predetermined period broadcast node table, node table includes that itself can be received
Node identification and own node mark.
Preferably, receive adjacent node broadcast node table after, merely with node table not by
It is labeled as the node identification generation both candidate nodes logo collection of non-candidate cluster-head.
Wherein, each node judges that itself current performance is when with predetermined period broadcast node table
It is no to meet cluster-head requirement, if itself current performance is unsatisfactory for cluster-head requirement, wide
Own node is labeled as non-candidate cluster-head in the node table broadcast.
It is that candidate's cluster sets for example, being chosen as cluster in order to avoid being not suitable for serving as the node of cluster
Minimum threshold, such as energy threshold, transmission power threshold value, mobility threshold value are determined, if section
Certain parameter of point is less than threshold value, in broadcast node table, oneself will be labeled as non-candidate cluster,
Other nodes ignore that the node when cluster is selected.
Step 104, the corresponding random number of the time period according to residing for current time, to both candidate nodes mark
Each node identification known in set enters line translation, to obtain corresponding conversion mark.
Wherein, the corresponding random number of the time period according to residing for current time, to both candidate nodes identification sets
The step of each node identification in conjunction enters line translation can be specially：
By i-th node identification in both candidate nodes logo collection, with the time period residing for current time
Corresponding random number is added, to obtain i-th mark conversion value of node, wherein 1≤i≤M, M
It is the mark sum in both candidate nodes logo collection.Judge whether is i-th mark conversion value of node
More than IDmax, if i-th mark conversion value of node is more than IDmax, by i-th node
Mark conversion value subtract each other with N, identified with the conversion for obtaining i-th node.That is, keeping away
That exempts from i-th node identifies more than IDmax.If the mark conversion value of i-th node is not more than
IDmax, then using i-th mark conversion value of node as i-th conversion mark of node.
That is, if the mark of i-th node is not more than IDmax, line translation need not be entered.
Step 105, the node corresponding to the minimum conversion mark of selection is used as cluster-head.
Based on the method that point group is realized based on random fashion that the above embodiment of the present invention is provided, pass through
Make the node identification randomization of candidate's cluster, so that the probability that each node turns into cluster is identical,
Some nodes be effectively prevent because being easy to exhaust the problem of energy as cluster for a long time.
Below by a specific example, the present invention will be described.
If node identification space is as shown in table 1, wherein IDmax=259, IDmin=230, then save
Point identification spatial value N is：
259-230+1=30
| Former ID | 230 | 232 | 235 | 238 | 240 | 250 | 252 | 255 | 257 | 259 |
Table 1
Time after the specified moment is divided into continuous time interval, wherein by each time interval
In time division be 30 have predetermined length time periods.In each time interval, it is
Each time period distributes a random number R, and wherein R is natural number, 1≤R≤N, with for the moment
Between be that each time period random number of distribution is different in interval, and each node is in same time zone
Between in the random number distributed of section at the same time it is identical.
That is, 1-30 this 30 natural numbers are carried out it is randomly ordered, then respectively with it is each when
Between 30 time periods in interval match one by one, wherein in each time interval, each time period
Sequence number ascending order arrangement.In certain time interval, pairing result is as shown in table 2：
Table 2
With predetermined period broadcast node table, node table includes what itself can be received to each node
Node identification and own node are identified.Wherein, if node self-condition is not suitable for doing cluster, meeting
Non-candidate cluster oneself will be labeled as, so that other nodes ignore the node.
According to the node table generation both candidate nodes logo collection for receiving adjacent node broadcast, and according to
The corresponding random number of time period residing for current time, to each node in both candidate nodes logo collection
Identify into line translation, to obtain corresponding conversion mark.
For example, 5 adjacent nodes that a node is received, its former ID is as shown in table 3.It is false
If, the time period serial number 15 residing for present system time, according to table 2, time period serial number
Random pair value corresponding to 15 is 27, then the new ID values after converting are：
New ID=originals ID+27
Due to it is possible that situations of the new ID more than IDmax, therefore need in this case
New ID is subtracted 30.Concrete condition is as shown in table 3：
| Former ID | 235 | 244 | 252 | 258 | |
| New ID | 259 | 271 | 279 | 285 | |
| Amendment ID | 259 | 241 | 249 | 255 |
Table 3
From table 3 it is observed that according to former minimum ID grouping methods, former ID is 232 section
Point is selected as cluster, and minimum ID clustering algorithms, former ID are performed according to new ID after stochastic transformation
Node for 235 is selected as cluster.In different time sections, because paired value is from 1-30
Randomly select, change the relative size of former ID at random while its uniqueness is kept, from
And avoid the small nodes of ID and be more likely chosen as cluster, cause energy to be easier the problem for exhausting.
Fig. 2 is showing for network node one embodiment that the present invention realizes point group based on random fashion
It is intended to.As shown in Fig. 2 network node includes time period management module 201, random pair module
202nd, receiver module 203, candidate identification generation module 204, mark conversion module 205 and cluster
Selecting module 206, wherein：
Time period management module 201 is used to for the time after the specified moment to be divided into the continuous time
Interval, wherein being N number of time with predetermined length by the time division in each time interval
Section, N is node identification spatial value.
Preferably, N=IDmax-IDmin+1, IDmax be node identification space in setting most
Big node identification, IDmin is the minimum node mark of setting in node identification space.
Random pair module 202 is used in each time interval, is each time period to distribute one
Random number R, wherein R are natural number, and 1≤R≤N is each time period in same time interval
The random number of distribution is different, and at the same time section of each node in same time interval
The random number distributed is identical.
Receiver module 203 is used to receive the node table of adjacent node broadcast, wherein each node is with predetermined
Periodic broadcasting node table, node table includes the node identification and own node that itself can receive
Mark.
Candidate identification generation module 204 is used for the node table generation received according to receiver module 203
Both candidate nodes logo collection.
Preferably, candidate identification generation module 204 specifically receives adjacent segments in receiver module 203
After the node table of point broadcast, merely with the node that non-candidate cluster-head is not labeled as in node table
Mark generation both candidate nodes logo collection.
Mark conversion module 205 is used for the corresponding random number of the time period according to residing for current time, right
Each node identification in both candidate nodes logo collection enters line translation, to be become dehorn accordingly
Know.
Cluster selecting module 206 is used to select the node corresponding to minimum conversion mark as cluster
Node.
Based on the network node that point group is realized based on random fashion that the above embodiment of the present invention is provided,
By making the node identification randomization of candidate's cluster, so that each node turns into the probability phase of cluster
Together, some nodes be effectively prevent because being easy to exhaust the problem of energy as cluster for a long time.
Preferably, mark conversion module 205 is specifically by i-th section in both candidate nodes logo collection
Point identification, random number corresponding with the time period residing for current time is added, to obtain i-th node
Mark conversion value, wherein 1≤i≤M, M be both candidate nodes logo collection in mark sum,
Whether i-th mark conversion value of node is judged more than IDmax, if i-th mark of node turns
Value is changed more than IDmax, is then subtracted each other the mark conversion value of i-th node with N, to obtain i-th
The conversion mark of individual node.If the mark conversion value of i-th node is not more than IDmax, by
The i mark conversion value of node is identified as i-th conversion of node.
Fig. 3 is showing for another embodiment of network node that the present invention realizes point group based on random fashion
It is intended to.In the embodiment shown in fig. 3, time period management module 301, random pair module 302,
Receiver module 303, candidate identification generation module 304, mark conversion module 305 and cluster selection
The time period management module 201 that is related in module 306 and Fig. 2, random pair module 202, connect
Receive module 203, candidate identification generation module 204, mark conversion module 205 and cluster selection mould
Block 206 is identical, additionally, also include broadcast module 307 in figure 3, wherein：
Broadcast module 307 is used for predetermined period broadcast node table, wherein in broadcast node table,
Judge whether itself current performance meets cluster-head requirement, if itself current performance is unsatisfactory for
Cluster-head requirement, then be labeled as non-candidate cluster section in the node table of broadcast by own node
Point.
Fig. 4 is the schematic diagram of system one embodiment that the present invention realizes point group based on random fashion.
Wherein, system includes member node 401,402,403 ..., 40n be Fig. 2 and Tu
The network node that any embodiment is related in 3.
Fig. 5 is the schematic diagram of random point of group network framework one embodiment of the invention.Wherein, black
Square represents the cluster selected, and black is circular to represent gateway, and circle represents rank and file's node.
By implementing the present invention, each node is only needed to just can be with according to the adjacent node table for receiving
Voluntarily judge which ID is cluster, thus calculating is simple, operand is few, the traffic is few, nothing
Need the extra stand-by period.The probability that each node is chosen as cluster is identical, few so as to avoid
Number node energy is easier the problem for exhausting.
One of ordinary skill in the art will appreciate that realizing all or part of step of above-described embodiment
Suddenly can be completed by hardware, it is also possible to instruct the hardware of correlation to complete by program, institute
The program stated can be stored in a kind of computer-readable recording medium, and storage mentioned above is situated between
Matter can be read-only storage, disk or CD etc..
Description of the invention is given for the sake of example and description, and is not exhaustively
Or limit the invention to disclosed form.Common skill of many modifications and variations for this area
It is obvious for art personnel.Selection and description embodiment are to more preferably illustrate principle of the invention
And practical application, and make one of ordinary skill in the art it will be appreciated that the present invention is suitable so as to design
In the various embodiments with various modifications of special-purpose.
Claims (13)
1. a kind of method that point group is realized based on random fashion, it is characterised in that including：
Time after the specified moment is divided into continuous time interval, wherein by each time interval
In time division be N number of time period with predetermined length, N is node identification spatial value；
It is each time period to distribute a random number R in each time interval, wherein R is
Natural number, 1≤R≤N is that the random number of each time period distribution is different in same time interval,
And the random number that at the same time section of each node in same time interval is distributed is identical；
Node table according to adjacent node broadcast is received generates both candidate nodes logo collection, wherein respectively
Node includes the node identification that itself can be received with predetermined period broadcast node table, node table
Identified with own node；
The corresponding random number of the time period according to residing for current time, in both candidate nodes logo collection
Each node identification enters line translation, to obtain corresponding conversion mark；
Node corresponding to the minimum conversion mark of selection is used as cluster-head.
2. method according to claim 1, it is characterised in that
N=IDmax-IDmin+1, IDmax are the maximum node mark of setting in node identification space
Know, IDmin is the minimum node mark of setting in node identification space.
3. method according to claim 2, it is characterised in that
The corresponding random number of the time period according to residing for current time, in both candidate nodes logo collection
The step of each node identification enters line translation includes：
By i-th node identification in both candidate nodes logo collection, with the time period residing for current time
Corresponding random number is added, to obtain i-th mark conversion value of node, wherein 1≤i≤M, M
It is the mark sum in both candidate nodes logo collection；
Judge i-th mark conversion value of node whether more than IDmax；
If i-th mark conversion value of node is more than IDmax, i-th mark of node is turned
Change value to subtract each other with N, identified with obtaining i-th conversion of node.
4. method according to claim 3, it is characterised in that
If the mark conversion value of i-th node is not more than IDmax, by i-th mark of node
Conversion value is identified as i-th conversion of node.
5. the method according to any one of claim 1-4, it is characterised in that
The step of node table according to adjacent node broadcast is received generates both candidate nodes logo collection
Including：
It is non-merely with being not labeled as in node table after the node table for receiving adjacent node broadcast
The node identification generation both candidate nodes logo collection of candidate's cluster-head.
6. method according to claim 5, it is characterised in that
When with predetermined period broadcast node table, judge whether itself current performance meets cluster section
Point is required；
If itself current performance is unsatisfactory for cluster-head requirement, will be from the node table of broadcast
Body node label is non-candidate cluster-head.
7. a kind of network node that point group is realized based on random fashion, it is characterised in that including when
Between segment management module, random pair module, receiver module, candidate identification generation module, mark become
Mold changing block and cluster selecting module, wherein：
Time period management module, for the time after the specified moment to be divided into continuous time zone
Between, wherein be N number of time period with predetermined length by the time division in each time interval,
N is node identification spatial value；
Random pair module, in each time interval, be each time period distribute one with
Machine number R, wherein R are natural number, and 1≤R≤N is each time period point in same time interval
The random number matched somebody with somebody is different, and at the same time section institute of each node in same time interval
The random number of distribution is identical；
Receiver module, the node table for receiving adjacent node broadcast, wherein each node is with predetermined week
Phase broadcast node table, node table includes the node identification that itself can be received and own node mark
Know；
Candidate identification generation module, for the node table generation candidate's section received according to receiver module
Point identification set；
Mark conversion module, for the corresponding random number of the time period according to residing for current time, to waiting
Each node identification in node identification set is selected to enter line translation, to obtain corresponding conversion mark；
Cluster selecting module, for selecting the node corresponding to minimum conversion mark as cluster section
Point.
8. network node according to claim 7, it is characterised in that
N=IDmax-IDmin+1, IDmax are the maximum node mark of setting in node identification space
Know, IDmin is the minimum node mark of setting in node identification space.
9. network node according to claim 8, it is characterised in that
Mark conversion module and is worked as specifically by i-th node identification in both candidate nodes logo collection
Time period residing for the preceding time, corresponding random number was added, to obtain i-th mark conversion value of node,
Wherein 1≤i≤M, M are the mark sum in both candidate nodes logo collection, judge i-th node
Whether mark conversion value is more than IDmax, if i-th mark conversion value of node is more than IDmax,
Then the mark conversion value of i-th node is subtracted each other with N, is identified with obtaining i-th conversion of node.
10. network node according to claim 9, it is characterised in that
Mark conversion module is additionally operable in the mark conversion value no more than IDmax of i-th node,
Using i-th mark conversion value of node as i-th conversion mark of node.
11. network node according to any one of claim 7-10, it is characterised in that
Candidate identification generation module specifically receives the node table of adjacent node broadcast in receiver module
Afterwards, candidate is generated merely with the node identification for being not labeled as non-candidate cluster-head in node table to save
Point identification set.
12. network nodes according to claim 11, it is characterised in that also including broadcast
Module, wherein：
Broadcast module, for predetermined period broadcast node table, wherein in broadcast node table, sentencing
Whether itself current performance of breaking meets cluster-head requirement, if itself current performance is unsatisfactory for group
First node requirement, then be labeled as non-candidate cluster-head in the node table of broadcast by own node.
13. a kind of systems that point group is realized based on random fashion, it is characterised in that including such as right
It is required that the network node any one of 7-12.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510982775.8A CN106921681B (en) | 2015-12-24 | 2015-12-24 | Method, network node and the system for dividing group are realized based on random fashion |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510982775.8A CN106921681B (en) | 2015-12-24 | 2015-12-24 | Method, network node and the system for dividing group are realized based on random fashion |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106921681A true CN106921681A (en) | 2017-07-04 |
| CN106921681B CN106921681B (en) | 2019-08-13 |
Family
ID=59456423
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510982775.8A Active CN106921681B (en) | 2015-12-24 | 2015-12-24 | Method, network node and the system for dividing group are realized based on random fashion |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106921681B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110166184A (en) * | 2019-04-03 | 2019-08-23 | 特斯联（北京）科技有限公司 | A kind of distributed communication confirmation request management method and system |
| CN110661867A (en) * | 2019-09-25 | 2020-01-07 | 东北大学 | Block chain consensus method based on improved workload certification and equity certification |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050132154A1 (en) * | 2003-10-03 | 2005-06-16 | International Business Machines Corporation | Reliable leader election in storage area network |
| US20090172179A1 (en) * | 2007-12-31 | 2009-07-02 | Yu-Ben Miao | Networked Transmission System And Method For Stream Data |
| US20090285126A1 (en) * | 2006-03-31 | 2009-11-19 | France Telecom | Method for organizing a network of communicating objects and communicating object for the implementation of the method |
| CN101909330A (en) * | 2010-07-27 | 2010-12-08 | 杭州电子科技大学 | Sensor network data compression method based on near-optimal clustering and local virtual coordinates |
| CN102595314A (en) * | 2012-02-14 | 2012-07-18 | 北京邮电大学 | Position-information-based device-to-device (D2D) clustering multicast method |
| CN102833160A (en) * | 2012-08-17 | 2012-12-19 | 北京航空航天大学 | Contact predication based large-scale mobile delay tolerant network cluster-based routing method and system thereof |
| CN104780532A (en) * | 2015-05-08 | 2015-07-15 | 淮海工学院 | Cluster key management method capable of being used for wireless sensor network |
-
2015
- 2015-12-24 CN CN201510982775.8A patent/CN106921681B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20050132154A1 (en) * | 2003-10-03 | 2005-06-16 | International Business Machines Corporation | Reliable leader election in storage area network |
| US20090285126A1 (en) * | 2006-03-31 | 2009-11-19 | France Telecom | Method for organizing a network of communicating objects and communicating object for the implementation of the method |
| US20090172179A1 (en) * | 2007-12-31 | 2009-07-02 | Yu-Ben Miao | Networked Transmission System And Method For Stream Data |
| CN101909330A (en) * | 2010-07-27 | 2010-12-08 | 杭州电子科技大学 | Sensor network data compression method based on near-optimal clustering and local virtual coordinates |
| CN102595314A (en) * | 2012-02-14 | 2012-07-18 | 北京邮电大学 | Position-information-based device-to-device (D2D) clustering multicast method |
| CN102833160A (en) * | 2012-08-17 | 2012-12-19 | 北京航空航天大学 | Contact predication based large-scale mobile delay tolerant network cluster-based routing method and system thereof |
| CN104780532A (en) * | 2015-05-08 | 2015-07-15 | 淮海工学院 | Cluster key management method capable of being used for wireless sensor network |
Non-Patent Citations (2)
| Title |
|---|
| PENGGUO等: "Clustering algorithm in initialization of multi-hop wireless sensor networks", 《IEEE TRANSACTION ON WIRELESS COMMUNICATIONS》 * |
| 王力等: "移动Ad Hoc网络中的自适应转发分群路由协议", 《北京航空航天大学学报》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110166184A (en) * | 2019-04-03 | 2019-08-23 | 特斯联（北京）科技有限公司 | A kind of distributed communication confirmation request management method and system |
| CN110661867A (en) * | 2019-09-25 | 2020-01-07 | 东北大学 | Block chain consensus method based on improved workload certification and equity certification |
| CN110661867B (en) * | 2019-09-25 | 2021-07-23 | 东北大学 | Block chain consensus method based on improved workload certification and equity certification |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106921681B (en) | 2019-08-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Bandyopadhyay et al. | Minimizing communication costs in hierarchically-clustered networks of wireless sensors | |
| Kochhal et al. | Role-based hierarchical self organization for wireless ad hoc sensor networks | |
| CN105813096B (en) | The method for carrying out adjacent section planning optimization based on topological structure | |
| Wu et al. | Efficient task scheduling for servers with dynamic states in vehicular edge computing | |
| CN106792764B (en) | Wireless base station planning method for power distribution terminal communication access network | |
| CN104243056A (en) | Spectrum sensing method and device in cognitive radio system | |
| Abdulsalam et al. | Usage of mobile elements in internet of things environment for data aggregation in wireless sensor networks | |
| Javed et al. | RL-Budget: A learning-based cluster size adjustment scheme for cognitive radio networks | |
| CN107690167A (en) | A kind of expansible network clustering method of wireless sensor | |
| CN104135752A (en) | Cluster head node selection method and clustering method of wireless sensor network | |
| CN109511150B (en) | Mobile charging vehicle path planning method based on single-pair multi-charging technology | |
| CN103874158A (en) | Novel clustering routing algorithm | |
| CN106921681A (en) | Method, network node and the system of point group are realized based on random fashion | |
| CN101917777A (en) | Wireless sensor network node sleep qualification judging method based on cooperation between neighboring nodes | |
| Liao et al. | MMQT: Maximizing the monitoring quality for targets based on probabilistic sensing model in rechargeable wireless sensor networks | |
| CN110461006A (en) | Reduce WLAN interference method, device and terminal device | |
| CN101483935A (en) | Topology drawing algorithm for wireless Ad-Hoc network | |
| TV et al. | Extending the Network Lifetime of Wireless Sensor Networks Using Residual Energy Extraction—Hybrid Scheduling Algorithm | |
| CN104640177A (en) | Energy-efficiency-based cell selection method for multilevel heterogeneous network | |
| CN102572810B (en) | Method for automatically configuring addresses of large-scale wireless sensor network based on multi-token | |
| Zhu et al. | Spectrum allocation algorithm based on improved ant colony in cognitive radio networks | |
| CN108040338B (en) | deployment method of wireless sensor network in environment with irregular distribution of monitored targets | |
| CN104333875B (en) | A kind of frequency method of adjustment and device | |
| CN106550485A (en) | A kind of method and relevant device for obtaining user equipment information | |
| CN106921948B (en) | Method, network node and the system for dividing group are realized based on mark extreme value |
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 |