CN102857990A - Three-level tree structure token double-cluster head clustering method oriented to high-speed node ad hoc network - Google Patents
Three-level tree structure token double-cluster head clustering method oriented to high-speed node ad hoc network Download PDFInfo
- Publication number
- CN102857990A CN102857990A CN2012103744372A CN201210374437A CN102857990A CN 102857990 A CN102857990 A CN 102857990A CN 2012103744372 A CN2012103744372 A CN 2012103744372A CN 201210374437 A CN201210374437 A CN 201210374437A CN 102857990 A CN102857990 A CN 102857990A
- Authority
- CN
- China
- Prior art keywords
- node
- clustering
- sub
- cluster head
- centroid
- 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
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention relates to a three-level tree structure token double-cluster head clustering method oriented to a high-speed node ad hoc network. The method comprises the following steps of: initiating clusters; selecting the cluster head of each cluster and establishing a high-altitude node and a low-altitude node; performing secondary clustering on the high-altitude node, and establishing a central node; and establishing a standby central node. The clustering method provided by the invention can be used for realizing the characteristics of fast convergence, stable clustering, strong destroy resisting capability, and the like of the high-speed node ad hoc network, improving high-speed node survivability and anti-attack performance, giving full play to the communication capacity of each node, and saving resources so as to better accomplish communication tasks.
Description
Technical field
The present invention relates to the mobile ad hoc network field, especially towards the cluster-dividing method of high speed node MANET, specifically towards the two cluster head cluster-dividing methods of three grades of tree structure tokens of high speed node MANET.
Background technology
Along with the mobile ad hoc network theory application is more and more, developed many communication for coordination products both at home and abroad, domestic high speed node communication for coordination research starting still is in the starting stage than external late.
There is the scholar to divide into planar structure and two kinds of topological structures of hierarchy according to node status in the mobile ad hoc network and the difference of undertaking function, for planar structure, because wherein each node is equal, so be called again equation structures, the network that this structure forms is relatively more healthy and stronger, because coverage is smaller, nodes is relatively safe, but it also has its shortcoming, for example aspect the network control expense, if node is more and most being in the mobile situation, expense can be very large, because when the transmission of data, node motion causes route often to be interrupted, need to ceaselessly rebulid route and lead, cause the transmission of data less stable, so plane mechanism does not have preferably extensibility.
Relative hierarchy is multiplex in large-scale network, hierarchical network is divided into several bunches (Cluster) according to different standards, bunch with bunch network consisting, member node forms in bunch being called bunch by a node that is called cluster head and several, cluster head is elected by cluster algorithm mostly, the main communication of being responsible for member node in this bunch, if bunch interior nodes will be communicated by letter with a bunch exterior node, cluster head is responsible for forwarding data, and can be by gateway or direct communication between the cluster head, the member adds one bunch of cluster head formation in the sub-clustering, and cluster head and gateway form the network that higher one-level is called virtual backbone network (VBN).
In the mobile ad hoc network of hierarchy, member's fairly simple can directly the communicating of function in the sub-clustering, do not need to safeguard complicated routing iinformation between the member, virtually just reduce a lot of routing costs in the network, therefore when network size need to enlarge, have preferably autgmentability, can elect at any time as required the cluster head node simultaneously, have stronger survivability.But the structure of classification also has its defective, at first, cluster head election needs the cluster head election algorithm that is fit to and sets up a bunch maintenance mechanism for the structure needs of safeguarding stability, secondly, because between the cluster head node is undertaken bunch and bunch in member's communication, load is relatively heavier because energy loss comparatively fast probably becomes the bottleneck of network, and is last, inter-node communication is undertaken by cluster head, and the route of selection is best route not necessarily.
Cluster algorithm considers that mainly emphasis is that the stable and network performance of structure is whether reliable etc., namely how to obtain stable clustering architecture in mobile network environment, and realizes effective reliable routing, strengthens network management, improves network performance etc.At present for different applied environments and networking requirement some cluster algorithms have been proposed, for example: the highest connection degree cluster algorithm, minimum ID cluster algorithm, tuftlet change algorithm, mobile tolerance MOBIC algorithm, and the cluster algorithm after the improvement has adaptive on-demand weighted clustering algorithm, gives the cluster algorithm of tree-like backbone network and the cluster algorithm of two cluster heads.But consider that network architecture and environment for use will reach the different of target and performance, do not have a kind of general, at any time networking, universally applicable cluster algorithm, but generally acknowledge and adopt cluster structured having many good qualities such as reducing routing cost, effectively utilize the finite element network bandwidth, be beneficial to solve avoid bunch in access conflict, be convenient to network management and strengthen network useful life etc.
Summary of the invention
The object of the present invention is to provide the two cluster head cluster-dividing methods of a kind of three grades of tree structure tokens towards high speed node MANET, thereby realize the Fast Convergent of high speed node MANET, sub-clustering is stable, the characteristics such as anti-lethality is strong, improve high speed node survival ability and attack performance, give full play to each node communication ability, saving resource is better to finish communication task.
Technical scheme of the present invention is:
The two cluster head cluster-dividing methods of a kind of three grades of tree structure tokens towards high speed node MANET, it comprises: the step of initialization sub-clustering; Select the cluster head of each bunch and set up the step of low latitude, high-altitude node; The step that the high-altitude node is carried out the secondary sub-clustering and sets up the step of Centroid and set up Centroid for subsequent use.
The present invention specifically may further comprise the steps:
(A), the step of initialization sub-clustering; At first, for each node in the network distributes unique ID, use minimum ID cluster algorithm that network is carried out the initialization sub-clustering, form the one-level sub-clustering;
(B), select the cluster head of each one-level sub-clustering and set up the step of low latitude, high-altitude node; In each sub-clustering, tentatively elect the cluster head node of one-level sub-clustering according to minimum ID cluster algorithm, and in the one-level sub-clustering, broadcast, after other nodes are received broadcasting in bunch, according to own communication capacity competition cluster head, compete the successfully cluster head of rear change one-level sub-clustering, the cluster head node of the final one-level sub-clustering that produces is called the high-altitude node, other nodes become a bunch member in the sub-clustering of broadcast announcement one-level, i.e. the low latitude node;
(C), the high-altitude node is carried out the secondary sub-clustering and sets up the step of Centroid: adopt minimum ID cluster algorithm that all high-altitude nodes in the network are carried out the secondary sub-clustering, form the secondary sub-clustering; In each secondary sub-clustering, tentatively elect the cluster head node of secondary sub-clustering according to minimum ID cluster algorithm, and in the secondary sub-clustering, broadcast, after other nodes are received broadcasting in bunch, according to own communication capacity competition cluster head, the cluster head of change secondary sub-clustering after competing successfully, the cluster head node of the final secondary sub-clustering that produces is called Centroid, and is broadcast to all the other high-altitude nodes in the secondary sub-clustering;
(D), set up the step of Centroid for subsequent use: after the secondary sub-clustering, in each secondary sub-clustering, select time strong node of communication capacity as the inferior cluster head of the secondary sub-clustering of each bunch, each time cluster head is the high-altitude node in all the other secondary sub-clusterings as Centroid for subsequent use and in being broadcast to bunch, sets up three grades of tree structures.
In the step of the present invention (B), in each one-level sub-clustering and secondary sub-clustering, bunch interior nodes according to the method for own communication capacity competition cluster head is:
Step 1, the set of setting up each sub-clustering node: note A={x
1, x
2... x
nFor after initialization and the secondary sub-clustering, and the set of all nodes in arbitrary one-level sub-clustering and the secondary sub-clustering, n is the number of node in arbitrary sub-clustering;
Step 2, in arbitrary sub-clustering, adopt following formula to calculate the communication capacity F (x of each node
i),
F(x
i)=F(af
1(x
i),bf
2(x
i),cf
3(x
i))；
Wherein, 1≤i≤n, f
1(x
i) be illustrated in t
0-t
1Constantly, node x
iWith the average of the utilance of the communication link of all the other each nodes foundation in the sub-clustering, t
0-t
1Be the arbitrary time period after the initialization sub-clustering; f
2(x
i) representation node x
iWith bunch in the average of all the other each node transmission delays; f
3(x
i) expression node x
iWith bunch in the average of all the other each node communication error rates; A, b, c are weight coefficient corresponding to each parameter in the communication network.
In the step 1 of the present invention, establish A={x
1, x
2... x
nBe the set of all nodes in arbitrary sub-clustering, the number NUM (A) of node=n in utilization the NUM () set of computations.
In the step of the present invention (C), set up Centroid after, each Centroid is circulated a notice of network condition to control centre, control centre produces a token, and to give Centroid be root node, token uses in communication process.
Among the present invention, behind the Centroid that elects in each node, give token by control centre, node disappears then, and token regenerates, token circulates between the token ring of Centroid and high-altitude node composition in each bunch, node ID centered by its address, all the other nodes need to use channel transmission information in the ring, use channel after taking token, the channel release token of finishing using, each node application uses the token time to fix, and does not transmit complete information and again applies for, the every wheel of token turns once, Information Number adds one, if Centroid is applying for that service time, complete not receiving returned token, assert that then token lost efficacy, and regenerated new token.
Beneficial effect of the present invention:
The present invention forms three grades of tree structures by setting up low latitude node, high-altitude node and Centroid, is convenient to management, is conducive to stability and the reliability of network.
Cluster algorithm of the present invention can Fast Convergent, and sub-clustering stability is high, and anti-lethality is strong.
It is smooth and easy that the token that the present invention uses can be guaranteed to communicate by letter, and takes full advantage of bandwidth; Guarantee that acute variation does not occur network configuration.
Description of drawings
Fig. 1 is high speed node network model schematic diagram.
Fig. 2 is the cluster algorithm implementation procedure.
Fig. 3 is high-altitude node election process.
Fig. 4 is the Centroid election process.
Fig. 5 is Centroid election process for subsequent use.
Fig. 6 re-elects the Centroid process.
Fig. 7 is the tree generation algorithm flow chart.
Fig. 8 is a bunch maintenance algorithm flow chart.
Embodiment
The present invention is further illustrated below in conjunction with drawings and Examples.
As shown in Figure 1, the present invention is divided into three grades tree structure with the network that the high speed node forms.First order node center node, i.e. root node is responsible for and the communicating by letter of control centre such as satellite etc., and takes into account simultaneously and manages other high-altitude nodes; Node high-altitude, second level node, namely the child node of root node is responsible for communicating by letter with Centroid, management low latitude node; The 3rd utmost point node low latitude node is leaf node and high-altitude node communication.
As shown in Figure 2, the main thought of cluster algorithm is as follows:
A: give each high speed node unique ID when launching in advance, use minimum ID cluster algorithm to the netinit sub-clustering, adopt communication for coordination priority to adjust sub-clustering and produce the high-altitude node, and then elect Centroid, produce again at last a Centroid for subsequent use.
B: the Centroid that elects is after control centre circular network condition, and control centre produces a token and gives Centroid, i.e. root node, and token uses in communication process.
C: whether foundation Centroid for subsequent use is survived and is taked Different Strategies in the time of need to re-electing Centroid.
D: produce according to cluster algorithm in the time of need to re-electing the high-altitude node.
During communication, the Centroid that elects in each node is given token by control centre, node disappearance token regenerates, token circulates between the token ring of Centroid and high-altitude node composition, node ID centered by its address, other nodes need to use channel transmission information, use channel after taking token, the channel release token of finishing using, each node application uses token time to fix, not transmitting complete information applies for again, the every wheel of token turns once, and Information Number adds one, if Centroid is applying for that service time, complete not receiving returned token, assert that then token lost efficacy, and regenerated new token.
When electing each cluster head node, 1) produces the high-altitude node as shown in Figure 3, tentatively elect the cluster head node and in sub-clustering, broadcast according to ID, other nodes are competed cluster head according to own communication capacity after receiving broadcasting, the final cluster head node that produces is called the high-altitude node, and other nodes of broadcast announcement become a bunch member; 2) produce Centroid as shown in Figure 4, other high-altitude nodes were corresponding after Centroid produced becomes the sub-clustering member; 3) produce Centroid for subsequent use as shown in Figure 5, after Centroid was elected, the comprehensive bunch member's communication priority of weighing was specified Centroid for subsequent use, and other nodes in being broadcast to bunch.The election detailed process is as follows:
Step1: during beginning, unique ID number of distribution node, information list between self and the neighbor node is set up and kept to node periodically broadcast transmission Hello message.
Step2: each node contrasts the ID value of oneself after obtaining neighbor node hello packet broadcast message, if less then send Join information to the other side and announce oneself to become the cluster head node, broadcasts own cluster head information to its neighbours simultaneously.
Step3: each node compares self ID value and its after obtaining own neighbor node Join information, if less then comprise that Join information announces oneself to become the cluster head node and to its neighbours' broadcasting to its transmission, add bunch if not then sending Accept information to the node that sends Join information, no longer participate in the cluster head election.
Step4: add the sub-clustering with minimum ID value node formation if a node is found to receive a plurality of Join information then contrasted the ID value.
Step5: the Accept information that node is received the neighbor node transmission adds the sub-clustering member tabulation of oneself with it.
Step6: if node is not received any Join information then sent the Join information request to neighbor node and becomes then jump procedure 4 of bunch member within the given time.
Step7: if within preset time, declaration becomes the node of sub-clustering cluster head and does not receive that any Join information shows that then initial sub-clustering election finishes again, the node that becomes cluster head calculates self communication capacity, and the member sends nodal information and the communication capacity of Hello information oneself in the sub-clustering.
Step8: after the member receives information in the sub-clustering, calculate self communication capacity, both contrasts if own communication capacity is strong, then sends Change message to cluster head, otherwise do not respond.
Step9: cluster head selects a strong node of communication capacity to send Accept information after receiving one or more Change message, and broadcast its nodal information to bunch in other members, upgrade new cluster head message.If cluster head is not received response within preset time, or after new cluster head elects out, then announce own for the high-altitude node and comprise self information about firms to the whole network transmission and broadcast in interior Hello information, other sub-clusterings high-altitude node that conducts an election out synchronously.
Step10: each high-altitude node compares the ID of oneself after getting access to Hello information with it, if find that own ID value is less then to send Join information than the other side node, announce oneself to become the cluster head node.
Step11: each high-altitude node compares the ID of oneself after getting access to Join information with it, if find that own ID value is less then to send Join information than the other side node, announce oneself to become the cluster head node, add bunch otherwise send Accept information, no longer participate in the cluster head election.
Step12 a: if node is received other nodes Accept information, it is added the sub-clustering member tabulation of oneself.
Step13: if within preset time, declaration becomes the high-altitude node of cluster head and does not receive any Join information again, show that then election finishes, this node becomes the high-altitude node of cluster head, calculates self communication capacity and sends Hello information to other high-altitude nodes and broadcast.
Step14: after the member receives information in the sub-clustering, calculate self communication capacity, compare, if own communication capacity is strong, then sends Change message to cluster head, otherwise do not respond.Cluster head selects a highest node of communication priority to send Accept information after receiving one or more Change message, and broadcast its nodal information to bunch in other members, upgrade new cluster head message.If cluster head is not received response within preset time, or after new cluster head elects out, then announce own centered by node and send to the whole network and to comprise self information about firms and broadcast in interior Hello information.
Step15: after Centroid produces, send each sub-clustering of Hello message asks member communication for coordination priority to its sub-clustering member, inquire a strongest node of communication capacity, and broadcast its nodal information and announce it as Centroid for subsequent use, other bunches member adds Centroid information for subsequent use after receiving Hello message in own cluster head messaging list.
Step16: after Centroid is selected, send Control information broadcasting mobile ad hoc network information to control centre, after Control information is received by control centre, produce token and send to Centroid with Sure information, center and high-altitude node use the Token Control communication channel, coordinate other nodes of control.
Damaged when center node or high-altitude node, lose and the contacting of control centre, at this moment just need to re-elect center and high-altitude node.When 1) electing Centroid, if Centroid for subsequent use is not destroyed, control centre determines that through inquiry Centroid for subsequent use is not destroyed, then Centroid for subsequent use directly becomes Centroid, then become Centroid to whole network issue Hello message, control centre produces new token and gives Centroid; If Centroid for subsequent use is destroyed, then in the sub-clustering that each high-altitude node forms, re-elect Centroid, elect schematic diagram as shown in Figure 6, process is as follows:
Step1: each high-altitude node sends the hello packet that broadcasting comprises own ID number nodal information such as grade to whole network.
Step2: each high-altitude node more own ID after getting access to Hello message, announce oneself to become the cluster head node if find that own ID is less then send Join message to it.
Step3: each high-altitude node contrasts ID after getting access to Join message, sends Join message if own ID is less to the other side and announces oneself to become the cluster head node, adds this node and forms bunch otherwise send the Accept message broadcasting, no longer participates in the cluster head election.
Step4: it is added the sub-clustering member tabulation of oneself if a node is received Accept message.
Step5: if the node of announcing to become cluster head within preset time is not being received any Join message then show that the cluster head election finishes that the node that becomes cluster head sends hello packet to other high-altitude nodes and broadcasts this node communication capacity and nodal information.
Step6: after the member receives information in the sub-clustering, contrast self communication capacity, if own communication capacity is strong, then sends Change message to cluster head, otherwise do not respond.Cluster head selects a strongest node of communication capacity to send Accept information after receiving one or more Change message, and broadcast its nodal information to bunch in other members, upgrade new cluster head message.If cluster head is not received response within preset time, or after new cluster head elects out, then announce own centered by node, and send to the whole network and to comprise self information about firms and broadcast in interior Hello information.Elect simultaneously Centroid for subsequent use.
Step7: after Centroid is selected, send Control information broadcast MANET information to control centre, after Control information is received by control centre, produce token and send to Centroid with Sure information.
When 2) re-electing Centroid, if the sub-clustering member at node place, high-altitude is more, then direct election goes out the high-altitude node, its election process is consistent with initial high-altitude node election process, just after new high-altitude node produces, send hello packet to whole network and broadcast the nodal information of oneself, request adds the sub-clustering of Centroid, Centroid sends Join message with its adding oneself bunch member's messaging list to it after receiving Hello message; If the sub-clustering member at node place, high-altitude is less than two, then the sub-clustering member directly adds contiguous sub-clustering becomes the sub-clustering member.Process is as follows:
Step1: each low latitude node sends the nodal information of Hello information broadcast oneself to neighbor node.
Step2: contiguous high-altitude node sends Join message to the low latitude node after getting access to Hello message.
Step3: after the low latitude node received Join message, selecting wherein, the transmission Accept message adding of ID minimum wherein became a bunch member.
Step4: the high-altitude node adds own sub-clustering member with the low latitude node and tabulates after getting access to Accept message.
The tree structure generating algorithm as shown in Figure 7, concrete steps are as follows:
Step1: the designated centers node is the source of tree generation algorithm, produces the kernel tree that a node is only arranged.
Step2: Centroid comprises the Hello message of own ID to Web broadcast, and after the high-altitude node cluster head that does not add kernel tree was received message, clean culture was sent and added kernel tree request Want-Join message.
Step3: receive that in kernel tree the Centroid that joins request sends Sure-Join message.
Step4: the high-altitude node is selected the sub-clustering of Centroid as own cluster head, and is broadcast out Member message according to replying of receiving, comprised in the Member message oneself bunch in the information of all low latitude nodes.
Step5: the Centroid of receiving Member message adds the submanifold that the sub-clustering member tabulates and is set to oneself with the sub-clustering internal information.
Step6: do not add network other high-altitudes node repeating step 2-5 until the high-altitude node all join on the kernel tree.
In bunch maintenance algorithm, add the ingress timer, judge by the running of timer whether whether bunch member low latitude node or high-altitude node and Centroid also exist, perhaps destroyed.Its algorithm flow chart as shown in Figure 8.
Wherein, the message that is applied in the algorithm, Hello information are that all nodes are outwards broadcasted Hello information announcement self node situation on each hello time gap periods ground, and the Hello information of each node comprises its neighbor table and the adjacent table of cluster head.Accept message is used for recovery of node and adds the sub-clustering application, Change message is used for upgrading cluster head, Control message is used for control centre and exchanges with Centroid, Hello message is used between broadcast node self information and transferring command node information interchange etc., Join message is used for application and adds sub-clustering, and Sure message is used for acknowledge message.
The part that the present invention does not relate to all prior art that maybe can adopt same as the prior art is realized.
Claims (6)
1. the two cluster head cluster-dividing methods of three grades of tree structure tokens towards high speed node MANET is characterized in that it comprises: the step of initialization sub-clustering; Select the cluster head of each bunch and set up the step of low latitude, high-altitude node; The step that the high-altitude node is carried out the secondary sub-clustering and sets up the step of Centroid and set up Centroid for subsequent use.
2. two cluster head cluster-dividing methods of three grades of tree structure tokens towards high speed node MANET according to claim 1 is characterized in that it specifically may further comprise the steps:
(A), the step of initialization sub-clustering; At first, for each node in the network distributes unique ID, use minimum ID cluster algorithm that network is carried out the initialization sub-clustering, form the one-level sub-clustering;
(B), select the cluster head of each one-level sub-clustering and set up the step of low latitude, high-altitude node; In each sub-clustering, tentatively elect the cluster head node of one-level sub-clustering according to minimum ID cluster algorithm, and in the one-level sub-clustering, broadcast, after other nodes are received broadcasting in bunch, according to own communication capacity competition cluster head, compete the successfully cluster head of rear change one-level sub-clustering, the cluster head node of the final one-level sub-clustering that produces is called the high-altitude node, other nodes become a bunch member in the sub-clustering of broadcast announcement one-level, i.e. the low latitude node;
(C), the high-altitude node is carried out the secondary sub-clustering and sets up the step of Centroid: adopt minimum ID cluster algorithm that all high-altitude nodes in the network are carried out the secondary sub-clustering, form the secondary sub-clustering; In each secondary sub-clustering, tentatively elect the cluster head node of secondary sub-clustering according to minimum ID cluster algorithm, and in the secondary sub-clustering, broadcast, after other nodes are received broadcasting in bunch, according to own communication capacity competition cluster head, the cluster head of change secondary sub-clustering after competing successfully, the cluster head node of the final secondary sub-clustering that produces is called Centroid, and is broadcast to all the other high-altitude nodes in the secondary sub-clustering;
(D), set up the step of Centroid for subsequent use: after the secondary sub-clustering, in each secondary sub-clustering, select time strong node of communication capacity as the inferior cluster head of the secondary sub-clustering of each bunch, each time cluster head is the high-altitude node in all the other secondary sub-clusterings as Centroid for subsequent use and in being broadcast to bunch, sets up three grades of tree structures.
3. two cluster head cluster-dividing methods of three grades of tree structure tokens towards high speed node MANET according to claim 2, it is characterized in that in the described step (B), in each one-level sub-clustering and secondary sub-clustering, bunch interior nodes according to the method for own communication capacity competition cluster head is:
Step 1, the set of setting up each sub-clustering node: note A={x
1, x
2... x
nFor after initialization and the secondary sub-clustering, and the set of all nodes in arbitrary one-level sub-clustering and the secondary sub-clustering, n is the number of node in arbitrary sub-clustering;
Step 2, in arbitrary sub-clustering, adopt following formula to calculate the communication capacity F (x of each node
i),
F(x
i)=F(af
1(x
i),bf
2(x
i),cf
3(x
i))；
Wherein, 1≤i≤n, f
1(x
i) be illustrated in t
0-t
1Constantly, node x
iWith the average of the utilance of the communication link of all the other each nodes foundation in the sub-clustering, t
0-t
1Be the arbitrary time period after the initialization sub-clustering; f
2(x
i) representation node x
iWith bunch in the average of all the other each node transmission delays; f
3(x
i) expression node x
iWith bunch in the average of all the other each node communication error rates; A, b, c are weight coefficient corresponding to each parameter in the communication network.
4. the two cluster head cluster-dividing methods of three grades of tree structure tokens towards high speed node MANET according to claim 3 is characterized in that establishing A={x in the described step 1
1, x
2... x
nBe the set of all nodes in arbitrary sub-clustering, the number NUM (A) of node=n in utilization the NUM () set of computations.
5. two cluster head cluster-dividing methods of three grades of tree structure tokens towards high speed node MANET according to claim 2, it is characterized in that in the described step (C), after setting up Centroid, each Centroid is circulated a notice of network condition to control centre, it is root node that control centre's token of generation is given Centroid, and token uses in communication process.
6. two cluster head cluster-dividing methods of three grades of tree structure tokens towards high speed node MANET according to claim 2, behind the Centroid that it is characterized in that in each node, electing, give token by control centre, node disappears then, and token regenerates, token circulates between the token ring of Centroid and high-altitude node composition in each bunch, node ID centered by its address, all the other nodes need to use channel transmission information in the ring, use channel after taking token, the channel release token of finishing using, each node application uses the token time to fix, and does not transmit complete information and again applies for, the every wheel of token turns once, Information Number adds one, if Centroid is applying for that service time, complete not receiving returned token, assert that then token lost efficacy, and regenerated new token.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210374437.2A CN102857990B (en) | 2012-09-29 | 2012-09-29 | The two cluster head cluster-dividing method of three grades of tree structure tokens towards high speed node Ad Hoc network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210374437.2A CN102857990B (en) | 2012-09-29 | 2012-09-29 | The two cluster head cluster-dividing method of three grades of tree structure tokens towards high speed node Ad Hoc network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102857990A true CN102857990A (en) | 2013-01-02 |
| CN102857990B CN102857990B (en) | 2015-08-12 |
Family
ID=47404096
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210374437.2A Active CN102857990B (en) | 2012-09-29 | 2012-09-29 | The two cluster head cluster-dividing method of three grades of tree structure tokens towards high speed node Ad Hoc network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102857990B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106900025A (en) * | 2017-03-15 | 2017-06-27 | 重庆邮电大学 | A kind of wireless sensor network clustering routing based on double cluster heads |
| CN115866070A (en) * | 2023-01-28 | 2023-03-28 | 北京蓝色星际科技股份有限公司 | Data processing system and data processing method |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101207572A (en) * | 2007-12-14 | 2008-06-25 | 北京科技大学 | Method for clustering vehicle mounted Ad hoc network based on signal strength |
| CN101848529A (en) * | 2010-03-31 | 2010-09-29 | 中国地质大学（武汉） | Method for compressing multiple principle component analysis data of wireless sensor network |
| CN102149160A (en) * | 2011-04-20 | 2011-08-10 | 宁波职业技术学院 | Energy perception routing algorithm used for wireless sensing network |
| CN102625403A (en) * | 2012-05-04 | 2012-08-01 | 北京邮电大学 | Method for generating and maintaining virtual backbone network in mobile adhoe networking |
-
2012
- 2012-09-29 CN CN201210374437.2A patent/CN102857990B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101207572A (en) * | 2007-12-14 | 2008-06-25 | 北京科技大学 | Method for clustering vehicle mounted Ad hoc network based on signal strength |
| CN101848529A (en) * | 2010-03-31 | 2010-09-29 | 中国地质大学（武汉） | Method for compressing multiple principle component analysis data of wireless sensor network |
| CN102149160A (en) * | 2011-04-20 | 2011-08-10 | 宁波职业技术学院 | Energy perception routing algorithm used for wireless sensing network |
| CN102625403A (en) * | 2012-05-04 | 2012-08-01 | 北京邮电大学 | Method for generating and maintaining virtual backbone network in mobile adhoe networking |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106900025A (en) * | 2017-03-15 | 2017-06-27 | 重庆邮电大学 | A kind of wireless sensor network clustering routing based on double cluster heads |
| CN106900025B (en) * | 2017-03-15 | 2020-11-06 | 重庆邮电大学 | Wireless sensor network clustering routing method based on double cluster heads |
| CN115866070A (en) * | 2023-01-28 | 2023-03-28 | 北京蓝色星际科技股份有限公司 | Data processing system and data processing method |
| CN115866070B (en) * | 2023-01-28 | 2023-05-02 | 北京蓝色星际科技股份有限公司 | Data processing system and data processing method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102857990B (en) | 2015-08-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102036308B (en) | Energy balancing wireless sensor network clustering method | |
| CN104853398B (en) | The routing optimization method of tree-shaped wireless sensor network | |
| Singh | WSN LEACH based protocols: A structural analysis | |
| CN108495353A (en) | Wireless light sensor network topology control method based on sub-clustering | |
| CN100488145C (en) | Distributed type clustering method in use for constructing cluster type peer-to-peer network | |
| WO2018121201A1 (en) | Distributed cluster service structure, node cooperation method and device, terminal and medium | |
| CN103402234B (en) | A kind of collecting network data of wireless sensor method | |
| CN103228022A (en) | Probability type wireless sensor network routing method based on energy harvesting | |
| CN107690167B (en) | Extensible wireless sensor network clustering method | |
| CN107690168B (en) | Extensible networking method for wireless sensor network | |
| CN105050095B (en) | A kind of topological construction method of the heterogeneous wireless sensor net based on energy predicting | |
| CN103297342A (en) | Energy-saving ZigBee network tree topology formation method | |
| CN111372296B (en) | Method for optimizing election threshold of wireless sensor network routing protocol | |
| Chen et al. | A grid-based energy efficient routing protocol in Wireless Sensor Networks | |
| CN102857990A (en) | Three-level tree structure token double-cluster head clustering method oriented to high-speed node ad hoc network | |
| Thaskani et al. | Mobility tolerant TDMA based MAC protocol for WSN | |
| CN101867988A (en) | Centralized self-adaptation network manager node selection algorithm in Ad Hoc network | |
| Haneef et al. | Comparative analysis of classical routing protocol LEACH and its updated variants that improved network life time by addressing shortcomings in Wireless Sensor Network | |
| CN111031506B (en) | Wireless sensor network clustering method based on Voronoi domain processing | |
| CN102905392A (en) | Safe quitting method for nodes in high-speed node ad hoc network | |
| CN108811024B (en) | Cluster splitting method in cluster network structure, module and microcontroller thereof | |
| Zhao et al. | An improved zone-based routing protocol for heterogeneous wireless sensor networks | |
| Gobriel et al. | Adaptations of TDMA scheduling for wireless sensor networks | |
| CN113099508B (en) | Random centralized self-organizing clustering method and system for wireless mobile node | |
| Wu | A novel cluster-based routing protocol in wireless multimedia sensor network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| ASS | Succession or assignment of patent right |
Owner name: SUZHOU BEIERTA DATA TECHNOLOGY CO., LTD. Free format text: FORMER OWNER: WUXI NJUST TECHNOLOGY DEVELOPMENT CO., LTD. Effective date: 20140929 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| C53 | Correction of patent of invention or patent application | ||
| CB03 | Change of inventor or designer information |
Inventor after: Zhou Honghai Inventor before: Li Qianmu Inventor before: Wang Huan Inventor before: Qi Yong Inventor before: Hou Jun Inventor before: Zhang Lanping Inventor before: Hu Wenbin Inventor before: Liu Gang Inventor before: Xie Xin Inventor before: Zhan Guosheng |
|
| COR | Change of bibliographic data |
Free format text: CORRECT: INVENTOR; FROM: LI QIANMU WANG HUAN QI YONG HOU JUN ZHANG LANPING HU WENBIN LIU GANG XIE XIN ZHAN GUOSHENG TO: ZHOU HONGHAI Free format text: CORRECT: ADDRESS; FROM: 214192 WUXI, JIANGSU PROVINCE TO: 215123 SUZHOU, JIANGSU PROVINCE |
|
| TA01 | Transfer of patent application right |
Effective date of registration: 20140929 Address after: Linquan Street Industrial Park of Suzhou city in Jiangsu province 215123 No. 399 National University Science Park of Southeast University Wenchang hospital Room 408 Applicant after: WUXI NANLIGONG TECHNOLOGY DEVELOPMENT CO., LTD. Address before: 214192 Xishan Economic Development Zone, Wuxi, Furong Road No. 99, No., No. three Applicant before: Wuxi Nanligong Technology Development Co., Ltd. |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |