CN102857990B - The two cluster head cluster-dividing method of three grades of tree structure tokens towards high speed node Ad Hoc network - Google Patents
The two cluster head cluster-dividing method of three grades of tree structure tokens towards high speed node Ad Hoc network Download PDFInfo
- Publication number
- CN102857990B CN102857990B CN201210374437.2A CN201210374437A CN102857990B CN 102857990 B CN102857990 B CN 102857990B CN 201210374437 A CN201210374437 A CN 201210374437A CN 102857990 B CN102857990 B CN 102857990B
- Authority
- CN
- China
- Prior art keywords
- node
- clustering
- sub
- cluster head
- cluster
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The two cluster head cluster-dividing method of three grades of tree structure tokens towards high speed node Ad Hoc network, 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; Secondary sub-clustering is carried out to high-altitude node and sets up the step of Centroid and set up the step of Centroid for subsequent use.The present invention can realize the Fast Convergent of high speed node Ad Hoc network, and sub-clustering is stablized, the characteristics such as anti-lethality is strong, improves high speed node survival ability and attack performance, gives full play to each node communication ability, saving resource, better to complete communication task.
Description
Technical field
The present invention relates to mobile ad hoc network field, especially towards the cluster-dividing method of high speed node Ad Hoc network, specifically towards the two cluster head cluster-dividing method of three grades of tree structure tokens of high speed node Ad Hoc network.
Background technology
Along with the application of mobile ad hoc network theory gets more and more, develop many communication for coordination products both at home and abroad, domestic high speed node communication for coordination research starting, than external late, is still in the starting stage.
Scholar is had to divide into planar structure and hierarchy two kinds of topological structures according to mobile ad hoc network interior joint status and the difference of undertaking function, for planar structure, because wherein each node is equal, therefore be also called peer-to-peer structure, the network that this structure is formed is more healthy and stronger, because coverage is smaller, nodes is relatively safe, but it also has its shortcoming, such as in network control expense, if node is more and majority is in movement when, expense can be very large, because when transmitting data, node motion causes route often to be interrupted, need ceaselessly to re-establish route to lead, cause transmission data stability poor, therefore plane mechanism does not have good extensibility.
Relative hierarchy is used for large-scale network, hierarchical network is divided into several bunches (Cluster) according to different standards, bunch with bunch network consisting, in bunch being called bunch by a node being called cluster head and several, member node forms, cluster head is elected by cluster algorithm mostly, the communication of member node in this bunch of primary responsibility, if bunch interior nodes will communicate with a bunch exterior node, cluster head is responsible for forwarding data, and can by gateway or direct communication between cluster head, in sub-clustering, member adds cluster head and forms one bunch, 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, in sub-clustering, the function of member is fairly simple can directly communicate, do not need between member to safeguard complicated routing iinformation, virtually just reduce a lot of routing cost in network, therefore when network size needs to expand, there is good autgmentability, cluster head node can be elected at any time as required simultaneously, there is stronger survivability.But the structure of classification also has its defect, first, cluster head election needs applicable cluster head election algorithm and the structure needs foundation bunch maintenance mechanism in order to safeguard stability, secondly, because between cluster head node is undertaken bunch and bunch in the communication of member, load is relatively heavier because energy loss comparatively fast probably becomes the bottleneck of network, finally, inter-node communication is undertaken by cluster head, the route not necessarily Optimization route of selection.
Whether cluster algorithm to be the stable of structure with network performance reliable if mainly considering emphasis, in mobile network environment, namely how to obtain stable clustering architecture, and realize effective reliable routing, strengthen network management, improve network performance etc.Some cluster algorithms have been proposed at present for different applied environments and networking requirement, such as: the highest Connected degree cluster algorithm, minimum ID cluster algorithm, most tuftlet change algorithm, Mobility metrics MOBIC algorithm, and the cluster algorithm after improvement has adaptive on-demand weighted clustering algorithm, gives the cluster algorithm of the cluster algorithm of tree-like backbone network and two cluster head.But consider that network architecture and environment for use will reach the difference of target and performance, not a kind of general, can networking at any time, universally applicable cluster algorithm, but generally acknowledge and adopt cluster structured having many good qualities such as to reduce routing cost, effectively utilize limited network bandwidth, be beneficial to solution to avoid bunch in access conflict, be convenient to network management and strengthen the Web vector graphic life-span etc.
Summary of the invention
The object of the present invention is to provide the two cluster head cluster-dividing method of a kind of three grades of tree structure tokens towards high speed node Ad Hoc network, thus realize the Fast Convergent of high speed node Ad Hoc network, sub-clustering is stablized, 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, better to complete communication task.
Technical scheme of the present invention is:
The two cluster head cluster-dividing method of three grades of tree structure tokens towards high speed node Ad Hoc network, 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; Secondary sub-clustering is carried out to high-altitude node and sets up the step of Centroid and set up the step of Centroid for subsequent use.
The present invention specifically comprises the following steps:
(A), the step of initialization sub-clustering; First, be the unique ID of peer distribution each in network, use minimum ID cluster algorithm to carry out initialization sub-clustering to network, form 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, the cluster head node of one-level sub-clustering is tentatively elected according to minimum ID cluster algorithm, and broadcast in one-level sub-clustering, after in bunch, other nodes receive broadcast, according to oneself communication capacity competition cluster head, compete the cluster head of change one-level sub-clustering successfully, the cluster head node of the final one-level sub-clustering produced is called high-altitude node, in the sub-clustering of broadcast announcement one-level, other nodes become a bunch member, i.e. low latitude node;
(C), to high-altitude node carry out secondary sub-clustering and set up the step of Centroid: adopting minimum ID cluster algorithm to carry out secondary sub-clustering to all high-altitudes node in network, forming secondary sub-clustering; In each secondary sub-clustering, the cluster head node of secondary sub-clustering is tentatively elected according to minimum ID cluster algorithm, and broadcast in secondary sub-clustering, after in bunch, other nodes receive broadcast, according to oneself communication capacity competition cluster head, compete the cluster head of change secondary sub-clustering successfully, the cluster head node of the final secondary sub-clustering produced is called Centroid, and is broadcast to all the other high-altitude nodes in secondary sub-clustering;
(D) step of Centroid for subsequent use, is set up: after secondary sub-clustering, in each secondary sub-clustering, select the secondary strong node of communication capacity as the secondary cluster head of the secondary sub-clustering of each bunch, each cluster head high-altitude node as Centroid for subsequent use and in being broadcast to bunch in all the other secondary sub-clusterings, sets up three grades of tree structures.
In step of the present invention (B), in each one-level sub-clustering and secondary sub-clustering, bunch interior nodes according to the method for oneself communication capacity competition cluster head is:
Step one, set up the set of each point of cluster node: note A={x
1, x
2... x
nfor after initialization and secondary sub-clustering, and the set of all nodes in arbitrary one-level sub-clustering and secondary sub-clustering, n is the number of arbitrary sub-clustering interior joint;
Step 2, in arbitrary sub-clustering, adopt the communication capacity F (x of each node of following formulae discovery
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) represent at t
0-t
1moment, node x
ithe average of the utilance of the communication link set up with all the other each nodes in sub-clustering, t
0-t
1for any time period after initialization sub-clustering; f
2(x
i) representation node x
iwith bunch in the average of all the other each node transmission delay; f
3(x
i) represent node x
iwith bunch in the average of all the other each node communication error rates; A, b, c are the weight coefficient that in communication network, each parameter is corresponding.
In step one of the present invention, if A={x
1, x
2... x
nbe the set of nodes all in arbitrary sub-clustering, use number NUM (the A)=n of NUM () set of computations interior joint.
In step of the present invention (C), after setting up Centroid, each Centroid circulates a notice of network condition to control centre, and control centre produces a token and gives Centroid and root node, and token uses in communication process.
In the present invention, after the Centroid elected in each node, token is given by control centre, node disappears, and token regenerates, circulate between the token ring that in each bunch, token forms at Centroid and high-altitude node, node ID centered by its address, in ring, all the other nodes need to use channel transmission information, channel is used after taking token, channel is finished using release token, each node application uses token time to fix, do not transmit complete information again to apply for, token is often taken turns and is turned once, Information Number adds one, if Centroid is applying for that service time, complete not receiving returned token, then assert that token lost efficacy, regenerate 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.
The token that the present invention uses can guarantee the smooth and easy of communication, makes full use of bandwidth; Guarantee that network configuration acute variation does not occur.
Accompanying drawing explanation
Fig. 1 is high speed node network model schematic diagram.
Fig. 2 is cluster algorithm implementation procedure.
Fig. 3 is high-altitude node election process.
Fig. 4 is Centroid election process.
Fig. 5 is Centroid election process for subsequent use.
Fig. 6 re-elects Centroid process.
Fig. 7 is tree generation algorithm flow chart.
Fig. 8 is a bunch maintenance algorithm flow chart.
Embodiment
Below in conjunction with drawings and Examples, the present invention is further illustrated.
As shown in Figure 1, the network that high speed node forms is divided into the tree structure of three grades by the present invention.First order node center node, i.e. root node, is responsible for the communication with control centre's such as satellite etc., takes into account other high-altitude nodes of management simultaneously; Node high-altitude, second level node, i.e. the child node of root node, is responsible for communicating with Centroid, management low latitude node; 3rd pole node low latitude node and 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 netinit sub-clustering, adopts communication for coordination priority adjustment sub-clustering to produce high-altitude node, and then elects Centroid, finally produce a Centroid for subsequent use again.
B: the Centroid elected is after control centre's circular network condition, and control centre produces a token and gives Centroid, i.e. root node, token uses in communication process.
C: whether survive according to Centroid for subsequent use when needing to re-elect Centroid and take Different Strategies.
D: produce according to cluster algorithm when needing to re-elect high-altitude node.
During communication, the Centroid elected in each node gives token by control centre, node disappearance token regenerates, circulate between the token ring that token forms at Centroid and high-altitude node, node ID centered by its address, other nodes need to use channel transmission information, channel is used after taking token, channel is finished using release token, each node application uses token time to fix, do not transmit complete information again to apply for, token is often taken turns and is turned once, Information Number adds one, if Centroid is applying for that service time, complete not receiving returned token, then assert that token lost efficacy, regenerate new token.
When electing each cluster head node, 1) high-altitude node is produced as shown in Figure 3, tentatively elect cluster head node according to ID and broadcast in sub-clustering, other nodes compete cluster head according to oneself communication capacity after receiving broadcast, final generation cluster head node is called high-altitude node, and other nodes of broadcast announcement become a bunch member; 2) produce Centroid as shown in Figure 4, after Centroid produces, other high-altitude nodes are corresponding becomes sub-clustering member; 3) produce Centroid for subsequent use as shown in Figure 5, after Centroid is elected, comprehensive weigh bunch member communication's priority, specify Centroid for subsequent use, and other nodes in being broadcast to bunch.Election detailed process is as follows:
Step1: during beginning, unique No. ID of distribution node, node periodically broadcast transmission Hello message is set up and is maintained information list between self and neighbor node.
Step2: each node contrasts oneself ID value after obtaining neighbor node hello packet broadcast message, if less, send Join information announce oneself to become cluster head node to the other side, while broadcast oneself cluster head information to its neighbours.
Step3: self ID value compares with it by each node after oneself neighbor node Join information of acquisition, if less, comprise Join information to its transmission and announce oneself become cluster head node and broadcast to its neighbours, to add bunch if not then sending Accept information to the node sending Join information, no longer participating in cluster head election.
Step4 a: if node finds to receive multiple Join information, contrasts ID value and adds the sub-clustering having minimum ID value node and form.
Step5: node is received the Accept information that neighbor node sends and added oneself sub-clustering members list.
Step6 a: if node does not receive any Join information within the given time, sending Join information request to neighbor node becomes bunch member then jump procedure 4.
Step7: if within preset time, the node announcing to become sub-clustering cluster head does not receive any Join information again and then shows that initial sub-clustering election terminates, become the node calculate self communication ability of cluster head, in sub-clustering, member sends nodal information and the communication capacity of Hello information oneself.
Step8: after member receives information in sub-clustering, calculates self communication ability, both contrasts, if oneself communication capacity is strong, then sends Change message to cluster head, otherwise does not respond.
Step9: cluster head, after receiving one or more Change message, selects node that communication capacity is strong to send Accept information, and broadcast its nodal information to bunch in other members, upgrade new cluster head message.If cluster head does not receive response within preset time, or after new cluster head elects, then announce oneself to be high-altitude node and send to the whole network the Hello information comprising self information about firms to broadcast, other sub-clusterings synchronously conduct an election out high-altitude node.
Step10: the ID of oneself compares with it by each high-altitude node after getting Hello information, if find that oneself ID value is less, sends Join information to than Correspondent Node, announces that oneself becomes cluster head node.
Step11: the ID of oneself compares with it by each high-altitude node after getting Join information, if find that oneself ID value is less, send Join information to than Correspondent Node, announce oneself to become cluster head node, otherwise send Accept information and to add bunch, no longer participate in cluster head election.
Step12 a: if node receives other nodes Accept information, added the sub-clustering members list of oneself.
Step13: if within preset time, announce that the high-altitude node becoming cluster head does not receive any Join information again, then show that election terminates, this node becomes the high-altitude node of cluster head, calculates self communication ability and broadcasts to other high-altitude nodes transmissions Hello information.
Step14: after member receives information in sub-clustering, calculates self communication ability, contrasts, if oneself communication capacity is strong, then sends Change message to cluster head, otherwise does not respond.Cluster head, after receiving one or more Change message, selects node that communication priority is the highest to send Accept information, and broadcast its nodal information to bunch in other members, upgrade new cluster head message.If cluster head does not receive response within preset time, or after newly cluster head elects, then announce node centered by oneself and send to the whole network the Hello information comprising self information about firms to broadcast.
Step15: after Centroid produces, each sub-clustering of Hello message asks member communication for coordination priority is sent to its sub-clustering member, inquire the node that communication capacity is the strongest, and broadcast its nodal information and announce that it is as Centroid for subsequent use, in oneself cluster head messaging list, add Centroid information for subsequent use after other bunch of member receives Hello message.
Step16: after Centroid is selected, Control information broadcasting mobile ad hoc network information is sent to control centre, after control centre receives Control information, produce token and send to Centroid together with Sure information, center and high-altitude node use Token Control communication channel, other nodes of cooperation control.
When Centroid or high-altitude node damaged, lose and the contacting of control centre, at this moment just need the center that re-elects and high-altitude node.1) during vote center node, if Centroid for subsequent use is not destroyed, through inquiry, control centre determines that Centroid for subsequent use is not destroyed, then Centroid for subsequent use directly becomes Centroid, then become Centroid to whole Web Publishing Hello message, control centre produces new token and gives Centroid; If Centroid for subsequent use is destroyed, then in the sub-clustering of each high-altitude node composition, re-elect Centroid, as shown in Figure 6, process is as follows for election schematic diagram:
Step1: each high-altitude node sends the hello packet of broadcast packet containing oneself No. ID nodal information such as grade to whole network.
Step2: each high-altitude node compares oneself ID after getting Hello message, if find that oneself ID is less, sends Join message to it and announces oneself to become cluster head node.
Step3: each high-altitude node contrasts ID after getting Join message, if oneself ID is less, sends Join message announce oneself to become cluster head node to the other side, otherwise transmission Accept message broadcasting adds the formation bunch of this node, no longer participates in cluster head election.
Step4: if node receives the sub-clustering members list that Accept message is added oneself.
Step5: if announce that within preset time the node becoming cluster head is not receiving any Join message, show that cluster head election terminates, the node becoming cluster head sends hello packet to other high-altitude nodes and broadcasts this node communication capacity and nodal information.
Step6: after member receives information in sub-clustering, contrast self communication ability, if oneself communication capacity is strong, then sends Change message to cluster head, otherwise does not respond.Cluster head, after receiving one or more Change message, selects node that communication capacity is the strongest to send Accept information, and broadcast its nodal information to bunch in other members, upgrade new cluster head message.If cluster head does not receive response within preset time, or after new cluster head elects, then announce node centered by oneself, and send to the whole network the Hello information comprising self information about firms and broadcast.Elect Centroid for subsequent use simultaneously.
Step7: after Centroid is selected, sends Control information broadcast MANET information to control centre, after control centre receives Control information, produces token and send to Centroid together with Sure information.
2) when re-electing Centroid, if the sub-clustering member at node place, high-altitude is more, then direct election goes out high-altitude node, its election process is consistent with initial high-altitude node election process, just after new high-altitude node produces, send the nodal information of hello packet broadcast oneself to whole network, request adds the sub-clustering of Centroid, Centroid, after receiving Hello message, sends Join message to it and is added oneself bunch member's messaging list; If the sub-clustering member at node place, high-altitude is less than two, then sub-clustering member directly adds contiguous sub-clustering becomes 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 low latitude node after getting Hello message.
Step3: after low latitude node receives Join message, select wherein No. ID minimum one send Accept message and add and wherein become a bunch member.
Step4: low latitude node is added oneself sub-clustering members list by high-altitude node after getting Accept message.
As shown in Figure 7, concrete steps are as follows for tree structure generating algorithm:
Step1: designated centers node is the source of tree generation algorithm, produces the kernel tree only having a node.
Step2: Centroid comprises the Hello message of oneself ID to Web broadcast, after the high-altitude node cluster head not adding kernel tree receives message, clean culture sends and adds kernel tree request Want-Join message.
Step3: receive the Centroid joined request and send Sure-Join message in kernel tree.
Step4: high-altitude node, according to the response received, is selected the sub-clustering of Centroid as oneself cluster head, and broadcast out Member message, include in Member message oneself bunch in the information of all low latitudes node.
Step5: sub-clustering internal information is added sub-clustering members list and is set to oneself submanifold by the Centroid receiving Member message.
Step6: other high-altitude nodes not adding network repeat step 2-5 until high-altitude node all joins in kernel tree.
In bunch maintenance algorithm, add node timer, judge whether bunch member low latitude node or high-altitude node and Centroid also exist by the running of timer, or whether destroyed.Its algorithm flow chart as shown in Figure 8.
Wherein, the message be applied in algorithm, Hello information is that all nodes outwards broadcast Hello information announcement own node situation on each hello time gap periods ground, and the Hello information of each node comprises its neighbor table and cluster head neighbour table.Accept message is used for recovery of node and adds sub-clustering application, Change message is for upgrading cluster head, Control message is used for control centre and exchanges with Centroid, Hello message is for information interchange between broadcast node self information and transferring command node 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 prior art that maybe can adopt all same as the prior art is realized.
Claims (5)
1., towards the two cluster head cluster-dividing method of three grades of tree structure tokens of high speed node Ad Hoc network, it 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; Secondary sub-clustering is carried out to high-altitude node and sets up the step of Centroid and set up the step of Centroid for subsequent use; It specifically comprises the following steps:
(A), the step of initialization sub-clustering; First, be the unique ID of peer distribution each in network, use minimum ID cluster algorithm to carry out initialization sub-clustering to network, form 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, the cluster head node of one-level sub-clustering is tentatively elected according to minimum ID cluster algorithm, and broadcast in one-level sub-clustering, after in bunch, other nodes receive broadcast, according to oneself communication capacity competition cluster head, compete the cluster head of change one-level sub-clustering successfully, the cluster head node of the final one-level sub-clustering produced is called high-altitude node, in the sub-clustering of broadcast announcement one-level, other nodes become a bunch member, i.e. low latitude node;
(C), to high-altitude node carry out secondary sub-clustering and set up the step of Centroid: adopting minimum ID cluster algorithm to carry out secondary sub-clustering to all high-altitudes node in network, forming secondary sub-clustering; In each secondary sub-clustering, the cluster head node of secondary sub-clustering is tentatively elected according to minimum ID cluster algorithm, and broadcast in secondary sub-clustering, after in bunch, other nodes receive broadcast, according to oneself communication capacity competition cluster head, compete the cluster head of change secondary sub-clustering successfully, the cluster head node of the final secondary sub-clustering produced is called Centroid, and is broadcast to all the other high-altitude nodes in secondary sub-clustering;
(D) step of Centroid for subsequent use, is set up: after secondary sub-clustering, in each secondary sub-clustering, select the secondary strong node of communication capacity as the secondary cluster head of the secondary sub-clustering of each bunch, each cluster head high-altitude node as Centroid for subsequent use and in being broadcast to bunch in all the other secondary sub-clusterings, sets up three grades of tree structures.
2. the two cluster head cluster-dividing method of three grades of tree structure tokens towards high speed node Ad Hoc network according to claim 1, it is characterized in that in described step (B), in each one-level sub-clustering and secondary sub-clustering, bunch interior nodes according to the method for oneself communication capacity competition cluster head is:
Step one, set up the set of each point of cluster node: note A={x
1, x
2... x
nfor after initialization and secondary sub-clustering, and the set of all nodes in arbitrary one-level sub-clustering and secondary sub-clustering, n is the number of arbitrary sub-clustering interior joint;
Step 2, in arbitrary sub-clustering, adopt the communication capacity F (x of each node of following formulae discovery
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) represent at t
0-t
1moment, node x
ithe average of the utilance of the communication link set up with all the other each nodes in sub-clustering, t
0-t
1for any time period after initialization sub-clustering; f
2(x
i) representation node x
iwith bunch in the average of all the other each node transmission delay; f
3(x
i) represent node x
iwith bunch in the average of all the other each node communication error rates; A, b, c are the weight coefficient that in communication network, each parameter is corresponding.
3. the two cluster head cluster-dividing method of three grades of tree structure tokens towards high speed node Ad Hoc network according to claim 2, is characterized in that in described step one, if A={x
1, x
2... x
nbe the set of nodes all in arbitrary sub-clustering, use number NUM (the A)=n of NUM () set of computations interior joint.
4. the two cluster head cluster-dividing method of three grades of tree structure tokens towards high speed node Ad Hoc network according to claim 1, it is characterized in that in described step (C), after setting up Centroid, each Centroid circulates a notice of network condition to control centre, control centre produces a token and gives Centroid and root node, and token uses in communication process.
5. the two cluster head cluster-dividing method of three grades of tree structure tokens towards high speed node Ad Hoc network according to claim 1, after it is characterized in that the Centroid elected in each node, token is given by control centre, node disappears, and token regenerates, circulate between the token ring that in each bunch, token forms at Centroid and high-altitude node, node ID centered by its address, in ring, all the other nodes need to use channel transmission information, channel is used after taking token, channel is finished using release token, each node application uses token time to fix, do not transmit complete information again to apply for, token is often taken turns and is turned once, Information Number adds one, if Centroid is applying for that service time, complete not receiving returned token, then assert that token lost efficacy, regenerate 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 CN102857990A (en) | 2013-01-02 |
| CN102857990B true 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) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106900025B (en) * | 2017-03-15 | 2020-11-06 | 重庆邮电大学 | Wireless sensor network clustering routing method based on double cluster heads |
| CN115866070B (en) * | 2023-01-28 | 2023-05-02 | 北京蓝色星际科技股份有限公司 | 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102857990A (en) | 2013-01-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Long et al. | Energy-aware real-time routing for large-scale industrial internet of things | |
| CN104853398B (en) | The routing optimization method of tree-shaped wireless sensor network | |
| CN104734372B (en) | Energy adaptive charging method combined with geographical location routing in WRSNs | |
| Rathi et al. | A review on routing protocols for application in wireless sensor networks | |
| CN105960024B (en) | User's discovery and resource allocation methods in a kind of D2D communication based on social activity perception | |
| CN102970722B (en) | Multicasting route algorithm of low-time-delay delay tolerant and disruption tolerant sensor network | |
| CN104883676B (en) | Cooperative Security communication means under a kind of multiple no-manned plane environment | |
| CN103402234B (en) | A kind of collecting network data of wireless sensor method | |
| CN101197748A (en) | Multi-jump wireless self-organizing network construction method based on partition tree | |
| CN107690167B (en) | Extensible wireless sensor network clustering method | |
| CN104754688A (en) | Routing method for entangled state based wireless Mesh quantum communication network | |
| CN102291448A (en) | Automatic IP (Internet protocol) address allocation method based on geographical position in mobile ad hoc network | |
| CN107690168B (en) | Extensible networking method for wireless sensor network | |
| CN110995333B (en) | Cluster QoS route design method | |
| CN101594281A (en) | Collecting network data of wireless sensor method, system and relevant device | |
| CN103297342A (en) | Energy-saving ZigBee network tree topology formation method | |
| CN106034322A (en) | Routing switching method based on chain quality in mobile ad hoc network | |
| CN103987102B (en) | Topology control method of underwater wireless sensor network based on non-cooperative game | |
| CN102857990B (en) | The two cluster head cluster-dividing method of three grades of tree structure tokens towards high speed node Ad Hoc network | |
| Shah et al. | An Efficient Overlay for Unstructured P2P File Sharing over MANET using Underlying Cluster-based Routing. | |
| CN101867988A (en) | Centralized self-adaptation network manager node selection algorithm in Ad Hoc network | |
| Faheem et al. | SN-MPR: A multi-point relay based routing protocol for wireless sensor networks | |
| CN102325041B (en) | Complex network theory-based wireless sensor network group management method | |
| Aadri et al. | An energy efficient hierarchical routing scheme for wireless sensor networks | |
| CN102905392B (en) | High speed node Ad Hoc network interior joint Safe withdrawing method |
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 for 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 |