CN106332264A - Ad-hoc network node synchronization method combining cluster management mechanism - Google Patents
Ad-hoc network node synchronization method combining cluster management mechanism Download PDFInfo
- Publication number
- CN106332264A CN106332264A CN201510386811.4A CN201510386811A CN106332264A CN 106332264 A CN106332264 A CN 106332264A CN 201510386811 A CN201510386811 A CN 201510386811A CN 106332264 A CN106332264 A CN 106332264A
- Authority
- CN
- China
- Prior art keywords
- node
- clock
- bunch
- priority
- synchronization
- 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
- 238000000034 method Methods 0.000 title claims abstract description 69
- 230000005484 gravity Effects 0.000 claims description 30
- 230000009191 jumping Effects 0.000 claims description 22
- 230000001360 synchronised effect Effects 0.000 claims description 18
- 230000000737 periodic effect Effects 0.000 claims description 16
- 230000005540 biological transmission Effects 0.000 claims description 5
- 238000012423 maintenance Methods 0.000 claims description 5
- 230000001143 conditioned effect Effects 0.000 claims description 4
- 230000000977 initiatory effect Effects 0.000 claims description 2
- 238000006424 Flood reaction Methods 0.000 claims 1
- 238000004891 communication Methods 0.000 description 5
- 238000010586 diagram Methods 0.000 description 3
- 230000002085 persistent effect Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W56/00—Synchronisation arrangements
- H04W56/001—Synchronization between nodes
- H04W56/002—Mutual synchronization
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Synchronisation In Digital Transmission Systems (AREA)
Abstract
The invention provides an ad-hoc network node synchronization method. An ad-hoc network node is divided into multiple clusters, and the maximum search window lengths of nodes in the same cluster satisfy the following condition: a cluster node having an external clock source < a cluster member node having the external clock source << a cluster node having no external clock source << a cluster member node having no external clock source; for the nodes in the same cluster, during the startup of the nodes: if a new startup node searching synchronizing signals searches synchronizing signals within a synchronizing cycle or synchronizing signals higher than the lowest available synchronization priority, the new startup node selects the synchronizing signal having the highest synchronization priority as a reference clock, otherwise repeats the process until searching or arriving at the maximum search window length, and if the node does not search the synchronizing signals after arriving at the maximum search window length, the node uses the clock of the node as the reference clock. According to the ad-hoc network node synchronization method provided by the invention, different maximum search window lengths are set, so that the nodes with high synchronization priority indirectly become synchronization sources easily, thereby reducing the occurrence probability of multi-clock domain in the cluster.
Description
Technical field
The present invention relates to wireless communication field, particularly relate to the self-organizing network nodes synchronous method of a kind of combination sub-clustering administrative mechanism.
Background technology
In self-organizing network system, a kind of common synchronous method is search synchronizing signal after node start, selecting the clock synchronizing priority the highest from the multiple synchronizing signals searched is reference clock, send the synchronizing signal of this node according to reference clock cycle, and the synchronizing signal intercepting other node synchronizes to obtain the reception to multiple different clocks nodes.The node having reference clock carries out clock gravity treatment with the longer cycle, also will trigger clock gravity treatment when node reference clock state changes, and the process of clock gravity treatment is similar with the process selecting reference clock after node start.
The shortcoming of said method includes: first, when selecting reference clock, the most general synchronization priority criterion includes without external clock reference (including base station clock source), synchronizes jumping figure, received signal power etc., priority criterion is synchronized based on above, without in the MANET of external clock reference, if, at a distance of relatively near, easily there is the multi-clock zone phenomenon being difficult to eliminate voluntarily in multiple node available machine times；Secondly, when node loses reference clock, or after the synchronization priority of reference clock reduces (a common example is that synchronization one hop node having external clock reference loses suddenly external clock reference), the process of Network Synchronization source convergence is typically more slow, the most notable in the case of or net inter-sync jumping figure intensive at node is more.
Summary of the invention
The present invention proposes the self-organizing network nodes synchronous method of a kind of combination sub-clustering administrative mechanism, and the method is:
Self-organizing network nodes is divided into some bunches, it is long that the whole network node presets maximum search window, the lower relation that be enough to is covered with: < < < < < without bunch member node of external clock reference, described external clock reference includes base station clock source without the leader cluster node of external clock reference bunch member node of external clock reference the leader cluster node of external clock reference with the maximum search window of cluster interior nodes；
For nodes all in same cluster, when node is started shooting, use following synchronization mechanism:
After node start, if any external clock reference, then using external clock reference is reference clock or search synchronizing signal；As without external clock reference, then search for synchronizing signal；For searching for the node of newly starting shooting of synchronizing signal, if searching synchronizing signal within a synchronizing cycle or searching the synchronizing signal higher than minimum available synchronization priority, then selecting wherein to synchronize the highest synchronizing signal of priority is reference clock, otherwise repeat this process to searching synchronizing signal or reaching maximum search window length, node does not searches out synchronizing signal yet or does not searches the synchronizing signal higher than minimum available synchronization priority after such as reaching maximum search window length, the clock used with this node, as reference clock, becomes independent clock source.The criterion of described synchronization priority can use the combination of one or more of node parameter: the identity of synchronizing signal, the attribute-bit of synchronizing signal, synchronizes jumping figure, synchronous signal receiver power, the synchronizing sequence of use.
In said method, for bunch clocks of different bunches, (there is unique synchronisation source or the identical synchronisation source of multiple time point in can being guaranteed in bunch in bunch interior nodes synchronization mechanism, the clock that in one bunch, unique synchronisation source uses, or the common clock that multiple synchronisation source uses is referred to as bunch clock), can use following synchronization mechanism:
In bunch, all nodes are in addition to periodic broadcast sends synchronizing signal, also safeguard this bunch of current bunch clock priority and flood bunch clock and bunch clock priority information of (can be by across modes such as bunch routes) this bunch；If node listens to the synchronizing signal of the node broadcasts of other bunch or receives bunch clock and bunch clock priority information of other bunches, then compare bunch clock priority of other bunch and this bunch, if other bunches are higher than bunch clock priority of this bunch, then trigger bunch clock and adjust (the most complete bunch of all node side-play amount that tunes/rear phase modulation is same before point is simultaneously by nodal clock in following certain preset time), this bunch bunch clock is adjusted to the highest with bunch clock priority bunch consistent.The criterion of described bunch of clock priority may include that bunch type in internal clock source (external clock reference, non-external clock reference), bunch clock adjust situation (for clock source be non-external clock reference bunch, whether in window length sometime, adjusted a bunch clock, the jumping figure that this bunch of clock adjusts by the synchronizing signal of external clock reference), bunch identity or bunch in the identity of special joint.
In said method, node triggers bunch clock and adjusts, this bunch bunch clock is adjusted to the highest with bunch clock priority bunch consistent after, for the node of the synchronizing signal of the adjacent bunch bunch clock of high priority can be listened to, the one in following two bunch internal clock maintenance mode can be used:
Mode one: if this category node is unique, this exclusive node automatically becomes bunch inter-sync one hop node；If this category node has multiple, then selecting one according to the priority comparison criterion preset becomes bunch inter-sync one hop node, or all becomes synchronization one hop node；The identity (such as: node ID, random number etc.) that the priority criterion of described default priority comparison criterion may include that synchronizing signal, the jumping figure of neighbour bunch bunch clock listened to, adjacent bunch of bunch clock sync signal receive power, the adjacent bunch of synchronizing sequence that bunch clock uses.
Mode two: bunch internal clock is safeguarded that not producing impact, i.e. bunch interior synchronization jumping figure relation does not changes because bunch clock adjusts by the synchronizing signal whether listening to the adjacent bunch bunch clock of high priority.
In said method, preferably, using bunch in meet pre-conditioned node as synchronize alternate node, synchronize alternate node by other node in the synchronous regime of self and synchronization jumping figure notice bunch, in bunch, all node maintenances synchronize synchronous regime and the jumping figure of alternate node, described pre-conditioned for synchronizing jumping figure no more than setting value or having external clock reference, described synchronous regime includes without external clock reference, synchronizing signal identity, the synchronous signal receiver power of an asynchronous hop node, the upper hop synchronizing signal identity of an asynchronous hop node.Synchronizing alternate node can be by the following method by the synchronous regime of self and other node in synchronizing jumping figure notice bunch: carries in route message, sends with data broadcast service form, or uses to specialize in and synchronize the mechanism that reports.
Based on above-mentioned synchronization alternate node can to bunch in the synchronous regime of other node safeguard, it is preferred that for nodes all in same cluster, when node carries out periodic clock gravity treatment, use following synchronization mechanism:
(by the synchronization jumping figure of synchronisation source, one jumping is referred to as an asynchronous hop node, i.e. synchronisation source is for synchronizing a hop node), periodically clock reuse adoption process selects the process of reference clock identical with node start, and the process of selection reference clock is started shooting in the synchronizations priority criterion that it is used with minimum available synchronization priority and node can be identical or differ；
For synchronizing a hop node, if this node has external clock reference, one of employing following two mode:
Mode one: do not carry out clock gravity treatment, still using external clock reference is reference clock；
Mode two: search synchronizing signal, if the minimum deflection of the clock that uses of all the searched bunches of synchronizing signals external clock reference current with node is not less than setting threshold value, node is with external clock reference as reference clock；Otherwise node is temporarily with the highest synchronizing signal of the synchronization priority searched as reference clock, retains synchronisation source identity, and triggers bunch clock and adjust, and adjusts and repeats mode two after terminating；
For synchronizing a hop node, if this node is without external clock reference, synchronization priority higher synchronization one hop node whether is there is in then inquiring about current cluster from bunch inter-sync alternate node safeguarded, as existed, then abandon this node synchronisation source identity, carry out clock gravity treatment, with the highest clock signal of the synchronization priority searched as reference clock, if do not existed, the most do not abandon synchronisation source identity, continue according to current reference clock cycle property broadcast transmission synchronizing signal.
Based on above-mentioned synchronization alternate node can to bunch in the synchronous regime of other node safeguard, it is preferred that for nodes all in same cluster, when the reference clock state of node changes triggering clock gravity treatment, use following synchronization mechanism:
When the reference clock of node is external clock reference (this scene lower node is for synchronizing a hop node), and become losing the state of external clock reference from the state having external clock reference: whether bunch inter-sync alternate node that querying node is safeguarded there are the node of external clock reference, as existed, then abandon synchronisation source identity, carrying out clock gravity treatment, reuse adoption process is identical with the periodic clock reuse adoption process of an asynchronous hop node；If do not existed, the most do not abandon synchronisation source identity, continue according to current reference clock cycle property broadcast transmission synchronizing signal；
When the reference clock of node is not external clock reference (this scene lower node may be for synchronizing a hop node or an asynchronous hop node), and obtaining external clock reference from the state having external clock reference: node judges the degrees of offset of currently used reference clock and external clock reference, if offset error is less than given threshold value, node, with external clock as reference clock, becomes synchronisation source；The reference clock that otherwise node keeps current is constant with Tong Bu jumping figure, and triggers a bunch clock adjustment, makes a bunch clock align with external clock reference, again judges degrees of offset, repeat this process after adjustment；
When the reference clock of node is not external clock reference, node is an asynchronous hop node, and lose upper hop reference clock: whether bunch inter-sync alternate node that querying node is safeguarded there are the node of external clock reference, as existed, carrying out clock gravity treatment, reuse adoption process is identical with the periodic clock reuse adoption process of an asynchronous hop node；Otherwise node judges whether self is bunch node that inter-sync priority is the highest, if it is, node becomes new synchronisation source, otherwise carries out clock gravity treatment, and reuse adoption process is identical with the periodic clock reuse adoption process of an asynchronous hop node；
When the reference clock of node is not external clock reference, node is for synchronizing a hop node, and occur synchronizing priority other node higher in node discovery bunch: node abandons synchronisation source identity, carries out clock gravity treatment, and reuse adoption process is identical with the periodic clock reuse adoption process of an asynchronous hop node；
When the reference clock of node is not external clock reference, node is an asynchronous hop node, and node receives synchronization priority other reference clock higher: node carries out clock gravity treatment immediately or waits initiation periodic clock gravity treatment, and selecting the clock synchronizing priority the highest is reference clock；
When the node having external clock reference adds certain bunch, or carry out clock search when having the node opening initialization of external clock reference and search out the synchronizing signal of some bunches: node judges the degrees of offset of currently used reference clock and external clock reference, if offset error is less than given threshold value, node, with external clock as reference clock, becomes synchronisation source；Otherwise node uses the signal that the synchronization priority searched is the highest to be reference clock, and triggers a bunch clock adjustment, again judges degrees of offset, repeat this process after adjustment.
The invention provides a kind of method being capable of the synchronization of the whole network all nodes, with in cluster, long by the different maximum search window that sets, the high priority node that synchronizes indirectly is made to be more easy to become synchronisation source, thus reduce some same cluster node available machine times when being closer to, the probability of multi-clock zone occurs in causing bunch due to the propagation delay of multi-hop clock；With bunch attribute in internal clock source and bunch identity priority tag bunch clock priority, what bunch clock priority was relatively low bunch adjust the clock zone used in its bunch to higher with bunch clock priority bunch consistent, thus realize the whole network and synchronize, multiple bunches of system converge to same clock zone the most at last.Additionally, by bunch in the synchronous regime of other node safeguard so that during node generation clock gravity treatment, convergence rate is faster, and avoids bunch endogenous cause of ill present clock source node to disappear the multi-clock zone problem caused, thus reduces the convergence time of Network Synchronization variation.
Accompanying drawing explanation
In order to be illustrated more clearly that the embodiment of the present invention or technical scheme of the prior art, the accompanying drawing used required in embodiment or description of the prior art will be briefly described below, apparently, accompanying drawing in describing below is some embodiments of the present invention, for those of ordinary skill in the art, on the premise of not paying creative work, it is also possible to obtain other accompanying drawing according to these accompanying drawings.
Fig. 1 is that bunch interior nodes of embodiment 1 synchronizes schematic diagram；
Fig. 2 is that the node reference clock state of embodiment 2 changes and triggers the synchronization schematic diagram of clock gravity treatment；
Fig. 3 be embodiment 3 bunch between clock synchronize schematic diagram.
Detailed description of the invention
For making the purpose of the embodiment of the present invention, technical scheme and advantage clearer, below in conjunction with the accompanying drawing in the embodiment of the present invention, technical scheme in the embodiment of the present invention is clearly and completely described, obviously, described embodiment is a part of embodiment of the present invention rather than whole embodiments；It should be noted that in the case of not conflicting, the embodiment in the application and the feature in embodiment can be mutually combined.Based on the embodiment in the present invention, the every other embodiment that those of ordinary skill in the art are obtained under not making creative work premise, broadly fall into the scope of protection of the invention.
Embodiment 1
In this embodiment use topology as it is shown in figure 1, figure is one containing 4 nodes bunch, its interior joint 1 is leader cluster node, and node 2～4 is ordinary node.Whether node has external clock reference (it is assumed herein that being GPS) to mark in the drawings.
In Fig. 1 (a), node 1 is the acquiescence leader cluster node having GPS, a length of a of maximum search window after its start；Node 2～4 is the ordinary node without GPS, a length of d of maximum search window after its start.In Fig. 1 (b), node 1 is the acquiescence leader cluster node without GPS, a length of c of maximum search window after its start；Node 2 is the ordinary node having GPS, a length of b of maximum search window after its start；Node 3,4 is the ordinary node without GPS, a length of d of maximum search window after its start.The length relation of above a, b, c, d meets: a <b < < c < < d.
In Fig. 1 (a) and Fig. 1 (b), node 1～4 within shorter a period of time in succession start (it is assumed herein that start maximum search window length time scale much larger than node start time pre-post difference away from, therefore represent the node available machine time with unified origin coordinates point).
For Fig. 1 (a), node 1 searches for synchronizing signal, and the persistent period is the long a of maximum search window.After reaching the long a of maximum search window, node 1 starts broadcast transmission synchronizing signal.Node 2,3 searches for synchronizing signal, listens to the synchronizing signal of node 1, as reference clock and forward synchronizing signal with the clock of node 1 before reaching the long d of maximum search window.Node 4 searches for synchronizing signal, listens to the synchronizing signal that node 2 forwards, as reference clock and forward synchronizing signal with the clock of node 2 before reaching the long d of maximum search window.
For Fig. 1 (b), node 2 searches for synchronizing signal, and the persistent period is the long b of maximum search window.After reaching the long b of maximum search window, node 2 starts broadcast transmission synchronizing signal.Node 1 searches for synchronizing signal, listens to the synchronizing signal of node 2 before reaching the long c of maximum search window, as reference clock and forwards synchronizing signal with the clock of node 2.Node 4 searches for synchronizing signal, listens to the synchronizing signal of node 2 before reaching the long d of maximum search window, as reference clock and forwards synchronizing signal with the clock of node 2.Node 3 searches for synchronizing signal, listens to the synchronizing signal that node 1 forwards, as reference clock and forward synchronizing signal with the clock of node 1 before reaching the long d of maximum search window.
Embodiment 2
In this embodiment use topology as in figure 2 it is shown, figure is one containing 5 nodes bunch, its interior joint 1 is leader cluster node, and node 2～5 is ordinary node.
Fig. 2 (a) interior joint 1～5 is all without external clock reference, and a bunch internal clock is stable convergence state, and node 1 is a bunch clock source (unique synchronization one hop node in bunch), and node 2,3,5 is for synchronizing two hop nodes, and node 4 is for synchronizing three hop nodes.Node 2 and 3,3 and 5 is mutually in communication range.
Disappearing in this bunch after leader cluster node 1 moves subsequently, a bunch inter-sync situation is changed into shown in Fig. 2 (b).Node 2,3,5 as losing the asynchronous hop node of upper hop reference clock, bunch inter-sync alternate node of inquiry maintenance.Synchronizing alternate node be that all synchronizations one are jumped and two hop nodes in the present embodiment, namely node 1 and node 2,3,5, and node 1,2,3,5 is all without GPS.This information by bunch in route and transmit.Node 2,3,5 carries out following judgement:
(1) synchronize whether alternate node list there are the node of GPS: do not exist, the most do not carry out clock gravity treatment；
(2) judge whether self is the node (namely bunch node that inter-sync priority is the highest) that list medium priority is the highest；For all synchronization two hop nodes in the present embodiment, it synchronizes priority is node ID.Node 2 thinks it self is bunch node that inter-sync priority is the highest, becomes new synchronisation source；Node 3,5 thinks it self is not bunch node that inter-sync priority is the highest, carries out clock gravity treatment.
A bunch inter-sync situation is changed into shown in Fig. 2 (c) subsequently, wherein: node 2 is for synchronizing a hop node；Node 3 selects node 2 to be reference clock after carrying out clock gravity treatment, node 3 is for synchronizing two hop nodes；Selecting node 2 after node 4 periodic reselection is reference clock, and node 4 is for synchronizing two hop nodes；Node 5 selects node 3 to be reference clock after carrying out clock gravity treatment, node 5 is for synchronizing three hop nodes.Bunch internal clock is again in stable convergence state.
Implement 3
The topology used in this embodiment is as it is shown on figure 3, be three bunch A/B/C each containing 3 nodes in figure, and its interior joint A1, B1, C1 are leader cluster node, and remaining node is ordinary node.Original state such as Fig. 3 (a), any two node of different bunches is not in communication range, and bunch interior nodes is the most two-by-two in communication range, and bunch inter-sync state is as shown in the figure.
A bunch A/B/C moves subsequently, and node A3 and B2, node B3 and C2 mutually enter in communication range.
Bunch clock B that node B2 sends is listened to for a bunch A, node A3, finds that bunch clock priority of bunch clock B, less than this bunch of clock (a bunch clock A has GPS > bunch clock B without GPS), does not carry out clock adjustment.
Bunch clock A that A3 sends is listened to for a bunch B, node B2, finds that bunch clock priority of bunch clock A is higher than this bunch of clock (a bunch clock A has GPS > bunch clock B without GPS)；Node B3 listens to bunch clock C that C2 sends, and finds that bunch clock priority of bunch clock C (when all without GPS and carrying out adjustment not according to bunch clock having GPS, judged according to identity priority higher than this bunch of clock；Assuming that the identity priority that the identity priority of bunch C is higher than bunch B).Bunch B compares bunch clock A and bunch clock C, on the basis of bunch clock A, (a bunch clock A has GPS > bunch clock C without GPS) carries out bunch clock and adjusts, bunch clock A that node B2 sends with A3 is as reference clock, and is designated by a bunch clock B without GPS but carries out oversampling clock adjustment (1 jumps) by GPS.
Bunch clock B that B3 sends is listened to for a bunch C, node C2, finds that the clock priority of bunch clock B, less than this bunch of clock, does not carry out bunch clock and adjusts.
Fig. 3 (b) show the clock status of lower bunch of A/B/C of this state.
Subsequently, for a bunch C, node C2 listens to bunch clock B that B3 sends, find that the clock priority of bunch clock B is higher than this bunch of clock (bunch clock B without GPS but carries out oversampling clock adjustment by GPS > bunch clock C without GPS), bunch C carries out bunch clock and adjusts, bunch clock B that node C2 sends with B3 is as reference clock, and is designated by a bunch clock C without GPS but carries out oversampling clock adjustment (2 jump) by GPS.
Fig. 3 (c) show the clock status of lower bunch of A/B/C of this state, bunch internal clock state of the most each bunch and bunch clock status of each bunch of the whole network and is stable state, and achieves the whole network synchronization.
One of ordinary skill in the art will appreciate that: all or part of step realizing said method embodiment can be completed by the hardware that programmed instruction is relevant, aforesaid program can be stored in a computer read/write memory medium, this program upon execution, performs to include the step of said method embodiment；And aforesaid storage medium includes: the various media that can store program code such as ROM, RAM, magnetic disc or CDs.
Last it is noted that above example is only in order to illustrate technical scheme, it is not intended to limit；Although the present invention being described in detail with reference to previous embodiment, it will be understood by those within the art that: the technical scheme described in foregoing embodiments still can be modified by it, or wherein portion of techniques feature is carried out equivalent；And these amendments or replacement, do not make the essence of appropriate technical solution depart from the spirit and scope of various embodiments of the present invention technical scheme.
Claims (12)
1. combining a self-organizing network nodes synchronous method for sub-clustering administrative mechanism, the method includes:
Self-organizing network nodes is divided into some bunches, and it is long that the whole network node presets maximum search window, with cluster interior nodes
Maximum search window cover with the lower relation that be enough to: have external clock reference leader cluster node < have external clock reference bunch
Member node < < without external clock reference leader cluster node < < without bunch member node of external clock reference, described outside
Portion's clock source includes base station clock source；
For nodes all in same cluster, when node is started shooting, use following synchronization mechanism:
After node start, if any external clock reference, then external clock reference is used to be reference clock or search for same
Step signal；As without external clock reference, then search for synchronizing signal；For searching for the node of newly starting shooting of synchronizing signal,
If searching synchronizing signal within a synchronizing cycle or searching higher than minimum available synchronization priority
Synchronizing signal, then selecting wherein to synchronize the highest synchronizing signal of priority is reference clock, otherwise repeats this mistake
Journey is to searching synchronizing signal or reaching maximum search window length, and node such as reaches after maximum search window length still
Do not search synchronizing signal or do not search the synchronizing signal higher than minimum available synchronization priority, with this node
The clock used is reference clock, becomes independent clock source.
Method the most according to claim 1, it is characterised in that the judgement mark of described synchronization priority
The accurate combination using one or more of node parameter: the identity of synchronizing signal, the genus of synchronizing signal
Property mark, synchronize jumping figure, synchronous signal receiver power, the synchronizing sequence of use.
Method the most according to claim 1, it is characterised in that described method also includes:
For bunch clock of different bunches, use following synchronization mechanism:
In bunch, all nodes are in addition to periodic broadcast sends synchronizing signal, also safeguard that this bunch of current bunch clock is excellent
First level also floods bunch clock and bunch clock priority information of this bunch；If node listens to the node of other bunch
The synchronizing signal of broadcast or receive bunch clock of other bunches and bunch clock priority information, then compare other bunch with
Bunch clock priority of this bunch, if other bunches are higher than bunch clock priority of this bunch, then trigger bunch clock and adjusts
Whole, this bunch bunch clock is adjusted to the highest with bunch clock priority bunch consistent.
Method the most according to claim 1, it is characterised in that the judgement of described bunch of clock priority
Standard includes: the type in bunch internal clock source, bunch clock adjust situation, bunch identity or bunch in special joint
Identity.
Method the most according to claim 3, it is characterised in that described method also includes:
Node triggers bunch clock and adjusts, this bunch bunch clock is adjusted to the highest with bunch clock priority bunch consistent
After, for the node of the synchronizing signal of the adjacent bunch bunch clock of high priority can be listened to, use following two bunch
One in internal clock maintenance mode:
Mode one: if this category node is unique, this exclusive node automatically becomes bunch inter-sync one hop node；As
Really this category node has multiple, then selecting one according to the priority comparison criterion preset becomes bunch inter-sync one jumping
Node, or all become synchronization one hop node；
Mode two: bunch interior synchronization jumping figure relation does not changes because bunch clock adjusts.
Method the most according to claim 5, it is characterised in that:
The priority criterion of described default priority comparison criterion includes: the identity mark of synchronizing signal
The jumping figure of the neighbour bunch bunch clock know, listened to, adjacent bunch of bunch clock sync signal receive power, adjacent bunch bunch clock
The synchronizing sequence used.
7. according to the method described in claim 1 or 3, it is characterised in that described method also includes:
Using bunch in meet pre-conditioned node as synchronizing alternate node, synchronize same by self of alternate node
Other node in step state and synchronization jumping figure notice bunch, in bunch, all node maintenances synchronize the synchronization of alternate node
State and jumping figure, described pre-conditioned for synchronizing jumping figure no more than setting value or having external clock reference, described
Synchronous regime includes the synchronization without external clock reference, synchronizing signal identity, an asynchronous hop node and believes
Number receive power, the upper hop synchronizing signal identity of an asynchronous hop node.
Method the most according to claim 7, it is characterised in that synchronize alternate node by with lower section
Method is by other node in the synchronous regime of self and synchronization jumping figure notice bunch:
Carry in route message, send with data broadcast service form, or employing specializes in what synchronization reported
Mechanism.
Method the most according to claim 7, it is characterised in that described method also includes:
For nodes all in same cluster, when node carries out periodic clock gravity treatment, use following synchronization
Mechanism:
For an asynchronous hop node, periodic clock reuse adoption process selects reference clock with node start
Process is identical；
For synchronizing a hop node, if this node has external clock reference, one of employing following two mode:
Mode one: do not carry out clock gravity treatment, still using external clock reference is reference clock；
Mode two: search synchronizing signal, if the clock of all searched bunches of synchronizing signal uses and node
The minimum deflection of current external clock reference is not less than setting threshold value, when node is with external clock reference for reference
Clock；Otherwise node is temporarily with the highest synchronizing signal of the synchronization priority searched as reference clock, retain with
Step source identity, and trigger a bunch clock adjustment, adjust and repeat mode two after terminating；
For synchronizing a hop node, if this node is without external clock reference, then from the alternative joint of bunch inter-sync safeguarded
Whether there is synchronization priority higher synchronization one hop node in point is inquired about current cluster, as existed, then abandon
This node synchronisation source identity, carries out clock gravity treatment, with the clock signal that the synchronization priority that searches is the highest is
Reference clock, if do not existed, does not the most abandon synchronisation source identity, continues wide according to current reference clock cycle property
Broadcast and send synchronizing signal.
Method the most according to claim 9, it is characterised in that:
The synchronization priority criterion that the periodic clock reuse adoption process of an asynchronous hop node is used and
The synchronization priority that minimum available synchronization priority selects the process of reference clock to be used with node start is sentenced
Calibrate accurate and minimum available synchronization priority different.
11. methods according to claim 9, it is characterised in that:
The synchronization priority criterion that the periodic clock reuse adoption process of an asynchronous hop node is used and
The synchronization priority that minimum available synchronization priority selects the process of reference clock to be used with node start is sentenced
Calibrate accurate and minimum available synchronization priority identical.
12. methods according to claim 7, it is characterised in that described method also includes:
For nodes all in same cluster, trigger clock gravity treatment when the reference clock state of node changes
Time, use following synchronization mechanism:
When the reference clock of node is external clock reference, and become losing outside from the state having external clock reference
The state of clock source: whether there are external clock reference in bunch inter-sync alternate node that querying node is safeguarded
Node, as existed, then abandons synchronisation source identity, carries out clock gravity treatment, and reuse adoption process jumps joint with asynchronous one
The periodic clock reuse adoption process of point is identical；If do not existed, the most do not abandon synchronisation source identity, continue according to working as
Front reference clock cycle broadcast transmission synchronizing signal；
When the reference clock of node is not external clock reference, and when the state having external clock reference obtains outside
Zhong Yuan: node judges the degrees of offset of currently used reference clock and external clock reference, as offset error is low
In given threshold value, node, with external clock as reference clock, becomes synchronisation source；Otherwise node keeps current
Reference clock is constant with Tong Bu jumping figure, and triggers a bunch clock adjustment, makes a bunch clock align with external clock reference,
Again judge degrees of offset after adjustment, repeat this process；
When the reference clock of node is not external clock reference, and node is an asynchronous hop node, and loses one
Jump reference clock: whether bunch inter-sync alternate node that querying node is safeguarded there are the joint of external clock reference
Point, as existed, carries out the periodic clock gravity treatment of clock gravity treatment, reuse adoption process and an asynchronous hop node
Cheng Xiangtong；Otherwise node judges whether self is bunch node that inter-sync priority is the highest, if it is, node
Become new synchronisation source, when otherwise carrying out the periodicity of clock gravity treatment, reuse adoption process and an asynchronous hop node
Clock reuse adoption process is identical；
When the reference clock of node is not external clock reference, node is for synchronizing a hop node, and node discovery bunch
Interior occur synchronizing priority other node higher: node abandons synchronisation source identity, carries out clock gravity treatment, weight
Select process identical with the periodic clock reuse adoption process of an asynchronous hop node；
When the reference clock of node is not external clock reference, node is an asynchronous hop node, and node receives
To synchronizing priority other reference clock higher: node carries out clock gravity treatment immediately or waits the initiation cycle
Property clock gravity treatment, selecting to synchronize the highest clock of priority is reference clock；
When the node having external clock reference adds certain bunch, or when having the node opening initialization of external clock reference
Carry out clock search and search out the synchronizing signal of some bunches: node judges currently used reference clock and outside
The degrees of offset of clock source, if offset error is less than given threshold value, node with external clock as reference clock,
Become synchronisation source；Otherwise node uses the signal that the synchronization priority searched is the highest to be reference clock, and touches
Send out bunch clock to adjust, again judge degrees of offset after adjustment, repeat this process.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510386811.4A CN106332264B (en) | 2015-07-03 | 2015-07-03 | A kind of self-organizing network nodes synchronous method of combination sub-clustering administrative mechanism |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510386811.4A CN106332264B (en) | 2015-07-03 | 2015-07-03 | A kind of self-organizing network nodes synchronous method of combination sub-clustering administrative mechanism |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106332264A true CN106332264A (en) | 2017-01-11 |
| CN106332264B CN106332264B (en) | 2019-06-21 |
Family
ID=57728050
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510386811.4A Expired - Fee Related CN106332264B (en) | 2015-07-03 | 2015-07-03 | A kind of self-organizing network nodes synchronous method of combination sub-clustering administrative mechanism |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106332264B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113359838A (en) * | 2021-06-25 | 2021-09-07 | 中国人民解放军火箭军工程大学 | Multi-UAV cooperative flight control system and method |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1870467A (en) * | 2005-05-23 | 2006-11-29 | 北京三星通信技术研究有限公司 | Network synchronous method |
| WO2007035729A3 (en) * | 2005-09-20 | 2008-11-06 | Freescale Semiconductor Inc | Method of synchronizing a wireless device using an external clock |
| CN103813437A (en) * | 2012-11-07 | 2014-05-21 | 北京信威通信技术股份有限公司 | Mobile wireless ad hoc network clock synchronization method based on time domain narrow pulse |
| CN104053223A (en) * | 2013-03-13 | 2014-09-17 | 中国科学院大学 | A Time Synchronization Method for Low-power Wireless Sensor Networks |
-
2015
- 2015-07-03 CN CN201510386811.4A patent/CN106332264B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1870467A (en) * | 2005-05-23 | 2006-11-29 | 北京三星通信技术研究有限公司 | Network synchronous method |
| WO2007035729A3 (en) * | 2005-09-20 | 2008-11-06 | Freescale Semiconductor Inc | Method of synchronizing a wireless device using an external clock |
| CN103813437A (en) * | 2012-11-07 | 2014-05-21 | 北京信威通信技术股份有限公司 | Mobile wireless ad hoc network clock synchronization method based on time domain narrow pulse |
| CN104053223A (en) * | 2013-03-13 | 2014-09-17 | 中国科学院大学 | A Time Synchronization Method for Low-power Wireless Sensor Networks |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113359838A (en) * | 2021-06-25 | 2021-09-07 | 中国人民解放军火箭军工程大学 | Multi-UAV cooperative flight control system and method |
| CN113359838B (en) * | 2021-06-25 | 2022-10-18 | 中国人民解放军火箭军工程大学 | A multi-UAV cooperative flight control system and method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106332264B (en) | 2019-06-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106804058B (en) | clustering time synchronization method combined with topology maintenance | |
| JP5318928B2 (en) | Node in wireless system and method of synchronizing time and frequency of node | |
| Chen et al. | Connectivity based k-hop clustering in wireless networks | |
| US8374163B2 (en) | Synchronization of wireless nodes | |
| US7649873B2 (en) | Method and apparatus for merging independently synchronized networks | |
| US9252901B2 (en) | Method and apparatus for managing synchronization groups in wireless communication system | |
| CN109412736B (en) | Timing synchronization method for narrowband ad hoc network | |
| JP6456940B2 (en) | Distributed algorithm for constructing and maintaining a hierarchical structure for device-to-device synchronization | |
| US8804603B2 (en) | TDMA wireless communications system and related methods | |
| RU2012125261A (en) | SYNCHRONIZING NETWORK CONFIGURATION | |
| CN105052181A (en) | Systems and methods for synchronization within a neighborhood aware network | |
| US11228919B2 (en) | Network synchronization for shared spectrum systems | |
| KR20100056745A (en) | Method for decreasing a power consumption in a wireless sensor network | |
| CN107222923A (en) | Clock synchronizing method and device | |
| CN103595494B (en) | A kind of non-stop layer time division multiple access synchronous method being applicable to wireless self-networking | |
| CN104904284A (en) | Systems and methods for hierarchical time source usage in near-me area network discovery and synchronization | |
| CN102457346A (en) | Time synchronization implementation method and clock node | |
| CN111107620B (en) | Method and device for determining reference timing, storage medium and electronic device | |
| CN106162810B (en) | A kind of new node networking synchronous method of wireless multi-hop collaborative network | |
| CN105959977A (en) | Hybrid synchronous method in D2D Mesh network including support nodes in scene without honeycomb covering | |
| CN108174427B (en) | Fusion method and device for same-frequency mobile ad hoc network, terminal equipment and storage medium | |
| CN106332264A (en) | Ad-hoc network node synchronization method combining cluster management mechanism | |
| KR102174377B1 (en) | Apparatus and method for controlling time-synch of node | |
| CN115665028B (en) | Subnet fusion and subnet splitting method and system of mobile ad hoc network | |
| CN102076079A (en) | Double bounce time slot allocation method of randomly-deployed sensor node without identification (ID) |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| PP01 | Preservation of patent right |
Effective date of registration: 20191121 Granted publication date: 20190621 |
|
| PP01 | Preservation of patent right | ||
| PD01 | Discharge of preservation of patent |
Date of cancellation: 20200710 Granted publication date: 20190621 |
|
| PD01 | Discharge of preservation of patent | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20190621 Termination date: 20200703 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |