CN103957591A - Node pair based wireless sensor network time synchronization method - Google Patents

Node pair based wireless sensor network time synchronization method Download PDF

Info

Publication number
CN103957591A
CN103957591A CN201410203083.4A CN201410203083A CN103957591A CN 103957591 A CN103957591 A CN 103957591A CN 201410203083 A CN201410203083 A CN 201410203083A CN 103957591 A CN103957591 A CN 103957591A
Authority
CN
China
Prior art keywords
node
synchronization
information
time
network
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.)
Pending
Application number
CN201410203083.4A
Other languages
Chinese (zh)
Inventor
王晶
张帅
高丹
朱文越
何为
王营冠
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shanghai Institute of Microsystem and Information Technology of CAS
Original Assignee
Shanghai Institute of Microsystem and Information Technology of CAS
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Shanghai Institute of Microsystem and Information Technology of CAS filed Critical Shanghai Institute of Microsystem and Information Technology of CAS
Priority to CN201410203083.4A priority Critical patent/CN103957591A/en
Publication of CN103957591A publication Critical patent/CN103957591A/en
Pending legal-status Critical Current

Links

Landscapes

  • Synchronisation In Digital Transmission Systems (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention relates to a node pair based wireless sensor network time synchronization method. The method is characterized in that synchronization reference nodes are selected through a distributive greedy algorithm, all synchronization reference nodes and father nodes form a network synchronization tree, and network time synchronization is performed along the synchronization tree. The method comprises the steps that (1) network initialization configuration and relevant parameter obtaining are performed; (2) a sensor network selects synchronization node pairs through a distributive algorithm; (3) the sensor network performs whole network time synchronization. According to the method, the number of nodes in the synchronization tree can be reduced, and the communication expense during synchronization can be reduced; a reference node broadcasting mode is used for single-hop synchronization, and accurate single-hop time synchronization is achieved; multi-hop synchronization is achieved through a node pair interaction model, the number of synchronization hops is halved, and the synchronization accumulative error is reduced; besides, the reduced communication expense and the halved number of synchronization hops show that the synchronization method has fast synchronization convergence speed, and the method is a time synchronization protocol which is low in communication expense, high in synchronization accuracy and fast in convergence speed.

Description

Based on the right radio sensing network method for synchronizing time of node
Technical field
The present invention relates to a kind of wireless sensor network time synchronization method, the present invention relates to or rather a kind of based on the right radio sensing network method for synchronizing time of node, described synchronous method can provide expense low for Sensor Network, precision is high, restrain fast Time Synchronizing, be particularly useful for extensive multihop network.
Background technology
Wireless sensor network is comprised of a large amount of sensor nodes, can detect the environmental information in certain limit, for producing, living, provides Monitoring Data.Consideration based on cost aspect, the hardware device of sensor node is conventionally limited.This major embodiment is both ways: the convergence process of sensor node often needs to realize by multi-hop; The crystal oscillator precision of sensor node is limited, and each node counts frequency is inconsistent.
Time synchronized is one of important foundation technology of wireless sensor network.Main services is applied in multiclass Sensor Network: dormancy mechanism, data fusion, track and localization, dispatching algorithm etc.In wireless sensor network, obtaining of time synchronized need to be through the adjustment of calendar clock skew and frequency deviation.On the one hand, sensor node power-on time is different, and its clock skew exists initialization difference.On the other hand, the technique of node crystal oscillator is limited, and its count cycle and clock frequency are inconsistent.
There is multinomial challenge in the Time synchronization technique of wireless sensor network.First, sensor node is subject to volume restrictions, and its powered battery is limited in one's ability, and this requires Time synchronization technique to keep lower communication overhead.Document [Noh KL, Serpedin E, Qaraqe K A.A New Approach for Time Synchronization in Wireless Sensor Networks:Pairwise Broadcast Synchronization[J] .IEEE Transactions on Wireless Communications, 2008,7 (9): 3318 – 3322.] propose based on the right time synchronization protocol of node, its single-hop locking range is that node occurs simultaneously to communication range, the synchronous area of single-hop is too small, synchronization node is to more, and its synchronous communication expense is also larger.Limited by hardware performance, there is inevitable error [Elson J E in sensor node single-hop time synchronized, Girod L, Estrin D.Fine-grained Network Time Synchronization Using Reference Broadcasts[J] .ACM SIGOPS Operating Systems Review, 2002,36 (SI): 147-163.].Sensor Network self-characteristic has determined the hysteresis quality of communication, and the temporal information of root node need to experience multi-hop and arrive ordinary node.In this process, single-hop synchronous error can progressively accumulate.The synchronous jumping figure of tradition time synchronization protocol is consistent with the jumping figure that node arrives root node, be difficult to successfully manage accumulated error [the Ganeriwal S in multi-hop time synchronized, Kumar R, Srivastava M B.Timing-sync Protocol for Sensor Networks[C] //Proceedings of the1st international conference on Embedded networked sensor systems.Los Angeles:ACM, 2003:138-149.]; [Mar ó ti M, Kusy B, Simon G, et al.The Flooding Time Synchronization Protocol[C] //Proceedings of the2nd international conference on Embedded networked sensor systems.Baltimore:ACM, 2004:39-49.].In addition, the transmission of multi-hop temporal information has also limited the convergence time of realizing whole network time synchronized.The present invention intends proposing a kind of method for synchronizing time, all kinds of shortcomings that exist to overcome prior art, thereby because deriving design of the present invention.
Summary of the invention
The object of the present invention is to provide a kind of based on the right radio sensing network method for synchronizing time of node, described synchronous method is by distributed greedy algorithm, to set up synchronization node to set, choose synchronization node mutual to the time of carrying out, can be in a synchronizing process synchronous two-layer node, is particularly useful for extensive multihop network.Its synchronizing process mainly comprises the following steps:
(1) netinit configuration and relevant parameter obtain;
(2) Sensor Network adopts distributed algorithm to choose synchronization node pair;
(3) Sensor Network carries out the whole network time synchronized.
Described step (2) also comprises following sub-step:
(21) root node is initiated inundation, and ordinary node is by the number of plies of this Procedure Acquisition oneself, and even level node obtains same layer and the sublayer neighbours' quantity of oneself;
(22) neighbours' quantity that even level node broadcasts oneself is obtained from step (21);
(23) even level node judges oneself whether qualified reference node that becomes;
(24) reference node selects father's layer neighbour to form synchronization node pair at random.
Described step (3) also comprises following sub-step:
(31) whether the father node of even level reference node judgement oneself is synchronous, if synchronous, this reference node is broadcasted a plurality of reference informations;
(32) father node record oneself receives the local zone time of reference information, after being compressed, sends to reference node;
(33) information from father node that reference node broadcast is received;
(34) ordinary node record oneself receives the local zone time of reference information, and utilizes the time interocclusal record of own and father node to carry out synchronously;
(35) above process continues until whole network realizes time synchronized.
Provided by the invention based on the right wireless sense network method for synchronizing time of node, it is characterized in that choosing reference synchronization node by distributed greedy algorithm, all reference synchronization nodes and its father node network consisting synchronization tree, network time synchronization is launched along synchronization tree, specifically comprises the following steps:
(1) netinit configuration and relevant parameter obtain;
(2) Sensor Network adopts distributed algorithm to choose synchronization node pair;
(3) Sensor Network carries out the whole network time synchronized.
Owing to adopting above technical scheme, the present invention compares with existing related method or algorithm, has the following advantages: can reduce synchronous communication expense, promote timing tracking accuracy, and reduce synchronous convergence time.The broadcasting area that single-hop locking range of the present invention is reference node, single-hop synchronously adopts reference node broadcast model, make the synchronous area of single-hop be greater than document [Noh KL, Serpedin E, Qaraqe K A.A New Approach for Time Synchronization in Wireless Sensor Networks:Pairwise Broadcast Synchronization[J] .IEEE Transactions on Wireless Communications, 2008,7 (9): 3318 – 3322.] in based on the right synchronized algorithm of node.Described method is chosen the most rational node as with reference to node by distributed greedy algorithm, not only can effectively reduce synchronization node to quantity, and significantly reduce synchronous communication expense again.By reference to node and synchronous father node, form synchronization node pair, can be in a synchronizing process synchronous two-layer node of the present invention, half [Elson J E that its synchronous jumping figure is traditional algorithm, Girod L, Estrin D.Fine-grained Network Time Synchronization Using Reference Broadcasts[J] .ACM SIGOPS Operating Systems Review, 2002,36 (SI): 147-163.]; [Ganeriwal S, Kumar R, Srivastava M B.Timing-sync Protocol for Sensor Networks[C] //Proceedings of the1st international conference on Embedded networked sensor systems.Los Angeles:ACM, 2003:138-149.]; [Mar ó ti M, Kusy B, Simon G, et al.The Flooding Time Synchronization Protocol[C] //Proceedings of the2nd international conference on Embedded networked sensor systems.Baltimore:ACM, 2004:39-49.].Therefore, this agreement has more much higher jumping synchronization accuracy, can successfully manage the accumulation problem of synchronous error in multi-hop is synchronous.Answer lay special stress on to be pointed out that the minimizing of synchronization node quantity and synchronous jumping figure also means the lifting of convergence rate.
Accompanying drawing explanation
Fig. 1 is the form of father node transmission time information y;
Fig. 2 is the synchronization node pair that even level and odd-level node form.
Embodiment
Below the present invention is described in detail, further to set forth substantive distinguishing features of the present invention and significant progressive.But it is important to emphasize that embodiment is only not used in restriction range of application of the present invention for describing the present invention below.In addition,, after having read the content of the present invention's description, various equivalent modifications can be made various changes or modification to the present invention, the scope that these equivalent form of values limit in appended claims of the present invention equally.
Step 1, netinit configuration and relevant parameter obtain.Initialization procedure, for all nodes in network, comprises root node and ordinary node.Root node represents unique node that has correct time in network, and generally Sensor Network uses gateway node as root node.Root node is responsible for initiating Network Synchronization, and its temporal information is conveyed to whole network in multi-hop mode.Initialization procedure mainly comprises the configuration of following three aspects.
(1) initialization guarantees that each node has the whole network unique identifier, to realize between node, mutually distinguishes.
(2) root node is in covering state, its parameter c root=1; Ordinary node is all in not covering state, its parameter c com=0.
(3) self number of plies is set is l to root node root=1, it is l that ordinary node arranges self number of plies com=255.For guaranteeing that ordinary node obtains number of plies information accurately, root node is initiated the number of plies and is obtained inundation process.
First, root node broadcast inundation is initiated bag, and in bag, data comprise root node identifier and number of plies information thereof.
Suppose that ordinary node i receives the number of plies information from j.If l i-l j≤ 2, the number of plies of oneself is set is l to i i=l j+ 1, and broadcast packet is containing the packets of information of self identification symbol and the rear number of plies of renewal.Otherwise node i is left intact.
Above process continues, until all nodes all no longer send number of plies information in network.
So far, netinit process finishes.Nodes can obtain following information: the number of plies of node self; The neighbor-id of node; Node neighbours place layer information.
Step 2, Sensor Network adopts distributed greedy algorithm to choose synchronization node dual numbers layer and odd-level node forms synchronization node dual numbers 2k node layer initiation synchronization tree selection course.
(1) even number 2k node layer i adds up it with overlay node number not in layer or sublayer neighbours
M i = Σ j ∈ N i ( 1 - c j ) , ( l j ≥ l i ) - - - ( 1 )
N in formula ithe neighborhood of representative.Node i is broadcasted this numerical value M i, and intercept from the identical information bag with layer neighbour.
(2) if the numerical value M that i has ibe greater than the maximum with layer neighbour, satisfy condition
M i＞max(M j),(j∈N i,l j＝l i) (2)
This vertex ticks oneself is reference node, and broadcast message SYNMSG informs all nodes in communication range.If the numerical value M that i has iequal the maximum with layer neighbour, satisfy condition
M i＝max（M j),(j∈N i,l j＝l i) (3)
This node is waited for random time.If i listens to neighbours' broadcast message SYNMSG within the stand-by period, vertex ticks oneself is covering state.Otherwise this vertex ticks oneself is reference node, and broadcast message SYNMSG informs all nodes in communication range.
In other situation, node i is left intact.
(3) ordinary node listens to after the broadcast message SYNMSG of reference synchronization node, and mark oneself is covering state, and c=1 is set.The node broadcasts that enters for the first time covering state covers state information FIRMSG notice neighbor node.
(4) 2k node layer i waits for that the long enough time covers state information bag FIRMSG to collect neighbor node.
(5) above process continues, until all 2k, 2k+1 node layer becomes covering state.Afterwards, all 2k layer reference nodes are random from 2k-1 layer neighbour selects one as father node, forms synchronization node pair.
The realization of this step adopts distributed algorithm, and the right selection of different layers synchronization node can be carried out simultaneously.By synchronization node, to selection course, can be found out to only have even level node can become reference node, only have odd-level node can become father node.The present invention selects reference node by greedy algorithm, and few reference node that can guarantee to try one's best is realized the network coverage.
Step 3, root node is initiated whole network time synchronization process.Suppose that 2k-1 node layer is by synchronously.
(1) K reference information of 2k layer reference node i broadcast.
(2) the not synchronization node in node i broadcasting area receives reference information, records the local zone time of oneself receiving this information, is expressed as X 1x k.The father node of node i receives reference information, records the local zone time while oneself receiving this information, is expressed as Y 1y k.
(3) local zone time that father node records oneself is transmitted to i.The form of father node transmission time information Y as shown in Figure 1.Father node sends Y 1complete time interocclusal record, all the other temporal informations are by time difference Y t+1-Y trepresent.Note, for distinguishing the poor original position of each temporal information, must do whole byte and process temporal information is poor.The poor shared byte number of temporal information must be consistent, and be not less than the byte number that maximum time difference is corresponding.As shown in fig. 1, the poor byte number taking of temporal information is expressed as [max (Y t+1-Y t)], max (Y in formula t+1-Y t) represent all possible time difference to get maximum, [] represents whole byte processing.This byte number and frame format configure by initial phase.By adopting this form, can effectively reduce data package size, promote communication efficiency.
(4) packet from father node that reference node i broadcast is received.
(5) the not synchronization node in reference node i coverage receives the broadcast message from reference node, and obtains the temporal information of father node record.Synchronization node does not utilize local zone time to record the time interocclusal record Y of X and father node, obtains K synchrodata point, thereby calculates time skew and frequency deviation.
(6) above process continues, until all nodes all obtain synchronously in network, so far the whole network time synchronized completes.
As shown in Figure 2, even level and odd-level node form synchronization node pair, synchronous two-layer node in a synchronizing process.Therefore, algorithm can be realized synchronous jumping figure and reduces by half.Owing to can introduce inevitable synchronous error in single-hop synchronizing process, and this error can the progressively accumulation along with the increase of jumping figure.Therefore, the present invention can reduce the time synchronization error of multihop network, for Sensor Network provides temporal information more accurately.In addition, the selection of reference synchronization node adopts distributed greedy algorithm, can realize with less synchronization node covering whole network, brings two aspect advantages: in synchronizing process, communication overhead is low, can reduce the energy consumption of node; The convergence time of realizing the whole network time synchronized reduces.

Claims (10)

1. one kind based on the right wireless sense network method for synchronizing time of node, it is characterized in that choosing reference synchronization node by distributed greedy algorithm, all reference synchronization nodes and its father node network consisting synchronization tree, network time synchronization is launched once along synchronization tree, synchronous two-layer node in synchronizing process, specifically comprises the following steps:
(1) netinit configuration and relevant parameter obtain;
(2) Sensor Network adopts distributed algorithm to choose synchronization node pair;
(3) Sensor Network carries out the whole network time synchronized.
2. method according to claim 1, is characterized in that described step (2) also comprises following sub-step:
(21) root node is initiated inundation, and ordinary node is by the number of plies of this Procedure Acquisition oneself, and even level node obtains same layer and the sublayer neighbours' quantity of oneself;
(22) neighbours' quantity that even level node broadcasts oneself is obtained from step (21);
(23) even level node judges oneself whether qualified reference node that becomes;
(24) reference node selects father's layer neighbour to form synchronization node pair at random.
3. method according to claim 1, is characterized in that, described step (3) also comprises following sub-step:
(31) whether the father node of even level reference node judgement oneself is synchronous, if synchronous, this reference node is broadcasted a plurality of reference informations;
(32) father node record oneself receives the local zone time of reference information, after being compressed, sends to reference node;
(33) information from father node that reference node broadcast is received;
(34) ordinary node record oneself receives the local zone time of reference information, and utilizes the time interocclusal record of own and father node to carry out synchronously;
(35) above process continues until whole network realizes time synchronized.
4. by method claimed in claim 1, it is characterized in that:
1. the initialization procedure of step (1) is for all nodes in network, comprises root node and ordinary node; Root node represents unique node that has correct time in network;
2. initialization procedure mainly comprises the configuration of following three aspects:
(1) initialization guarantees that each node has the whole network unique identifier, to realize between node, mutually distinguishes;
(2) root node is in covering state, its parameter c root=1; Ordinary node is all in not covering state, its parameter c com=0;
(3) self number of plies is set is l to root node root=1, it is l that ordinary node arranges self number of plies com=255; For guaranteeing that ordinary node obtains number of plies information accurately, root node is initiated the number of plies and is obtained inundation initiation bag.
5. by method claimed in claim 4, it is characterized in that:
1. Sensor Network uses gateway node as root node.Root node is responsible for initiating Network Synchronization, and its temporal information is conveyed to whole network in multi-hop mode;
2. described root node broadcast inundation is initiated bag and is referred to the data in bag, comprises root node identifier and number of plies information thereof, and ordinary node i receives the number of plies information from j.If l i-l j≤ 2, the number of plies of oneself is set is l to i i=l j+ 1, and broadcast packet is containing the packets of information of self identification symbol and the rear number of plies of renewal; Otherwise node i is left intact; Above process continues, until all nodes all no longer send number of plies information in network; Netinit process finishes.The information that nodes obtains has the number of plies of node self; The neighbor-id of node; Node neighbours place layer information.
6. by method claimed in claim 1, right process is to it is characterized in that choosing synchronization node by described even number 2K node layer:
1. 2k node layer i adds up it with overlay node number not in layer or sublayer neighbours
M i = Σ j ∈ N i ( 1 - c j ) , ( l j ≥ l i )
N in formula ithe neighborhood of representative.Node i is broadcasted this numerical value M i, and intercept from the identical information bag with layer neighbour;
The numerical value M that 2. if i has ibe greater than the maximum with layer neighbour, satisfy condition
M i＞max(M j),(j∈N i,l j＝l i)
This vertex ticks oneself is reference node, and broadcast message SYNMSG informs all nodes in communication range; If the numerical value M that i has iequal the maximum with layer neighbour, satisfy condition
M i＝max(M j),(j∈N i,l j＝l i)
This node is waited for random time; If i listens to neighbours' broadcast message SYNMSG within the stand-by period, vertex ticks oneself is covering state; Otherwise this vertex ticks oneself is reference node, and broadcast message SYNMSG informs all nodes in communication range; In other situation, node i is left intact;
3. ordinary node listens to after the broadcast message SYNMSG of reference synchronization node, and mark oneself is covering state, and c=1 is set; The node broadcasts that enters for the first time covering state covers state information FIRMSG notice neighbor node;
4. even number 2k node layer i waits for that the long enough time covers state information bag FIRMSG to collect neighbor node;
5. above process continues, until all 2k, 2k+1 node layer becomes covering state; Afterwards, all 2k layer reference nodes are random from 2k-1 layer neighbour selects one as father node, forms synchronization node pair.
7. by method claimed in claim 6, it is characterized in that:
1. even number 2K node layer, becomes reference node, and odd-level node becomes father node;
2. by greedy algorithm, select reference node, with few reference node of trying one's best, realize the network coverage.
8. by the method described in claim 1 or 3, it is characterized in that supposing that 2K-1 node layer is to synchronous, whole network time synchronization process is:
1. even number 2k layer reference node i broadcasts K reference information;
2. the not synchronization node in node i broadcasting area receives reference information, records the local zone time of oneself receiving this information, is expressed as X 1x k; The father node of node i receives reference information, records the local zone time while oneself receiving this information, is expressed as Y 1y k;
3. the local zone time that father node records oneself is transmitted to i; The form of father node transmission time information Y is that father node sends Y 1complete time interocclusal record, all the other temporal informations are by time difference Y t+1-Y trepresent; The poor byte number taking of temporal information is expressed as [max (Y t+1-Y t)], max (Y in formula t+1-Y t) represent all possible time difference to get maximum, [] represents whole byte processing; This byte number and frame format configure by initial phase; By adopting this form, can effectively reduce data package size, promote communication efficiency;
4. the packet from father node that reference node i broadcast is received;
5. the not synchronization node in reference node i coverage receives the broadcast message from reference node, and obtains the temporal information of father node record; Synchronization node does not utilize local zone time to record the time interocclusal record Y of X and father node, obtains K synchrodata point, thereby calculates time skew and frequency deviation;
6. continue above process, until all nodes all obtain synchronously in network, so far the whole network time synchronized completes.
9. by method claimed in claim 8, it is characterized in that for distinguishing the poor original position of each temporal information, must do whole byte and process temporal information is poor; The poor shared byte number of temporal information must be consistent, and be not less than the byte number that maximum time difference is corresponding.
10. by method claimed in claim 8, it is characterized in that synchronization node is to synchronous two-layer node in a synchronizing process; Algorithm is realized synchronous jumping figure and is reduced by half, and reduces the time synchronization error of multihop network, for Sensor Network provides temporal information more accurately.
CN201410203083.4A 2014-05-14 2014-05-14 Node pair based wireless sensor network time synchronization method Pending CN103957591A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410203083.4A CN103957591A (en) 2014-05-14 2014-05-14 Node pair based wireless sensor network time synchronization method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410203083.4A CN103957591A (en) 2014-05-14 2014-05-14 Node pair based wireless sensor network time synchronization method

Publications (1)

Publication Number Publication Date
CN103957591A true CN103957591A (en) 2014-07-30

Family

ID=51334782

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410203083.4A Pending CN103957591A (en) 2014-05-14 2014-05-14 Node pair based wireless sensor network time synchronization method

Country Status (1)

Country Link
CN (1) CN103957591A (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104185268A (en) * 2014-09-13 2014-12-03 郑州航空工业管理学院 Time slot synchronization algorithm suitable for self-organization networking
CN104301988A (en) * 2014-08-17 2015-01-21 宿迁学院 Sensor-network-based geomagnetic induction vehicle clock synchronization technology
CN106358260A (en) * 2016-11-08 2017-01-25 山东大学 Synchronizing method for network time of large-scale wireless sensor
CN110058286A (en) * 2019-05-13 2019-07-26 天津讯联科技有限公司 Space-time synchronous method, apparatus, equipment and medium under the conditions of a kind of defence
CN114362869A (en) * 2021-12-21 2022-04-15 国网江苏省电力有限公司电力科学研究院 Time collaborative synchronization method and device for power Internet of things nodes

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101075926A (en) * 2007-04-03 2007-11-21 西安电子科技大学 Method for synchronizing network time of low-consumption wireless sensor
CN101588628A (en) * 2009-06-19 2009-11-25 山东省计算中心 Clock synchronizing method for wireless sensor network
US8014378B1 (en) * 2003-10-23 2011-09-06 Itt Manufacturing Enterprise, Inc. Method and apparatus for automatic control of time-of-day synchronization and merging of networks
CN103763765A (en) * 2013-10-23 2014-04-30 河南科技大学 Self-synchronizing method of wireless sensor network

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8014378B1 (en) * 2003-10-23 2011-09-06 Itt Manufacturing Enterprise, Inc. Method and apparatus for automatic control of time-of-day synchronization and merging of networks
CN101075926A (en) * 2007-04-03 2007-11-21 西安电子科技大学 Method for synchronizing network time of low-consumption wireless sensor
CN101588628A (en) * 2009-06-19 2009-11-25 山东省计算中心 Clock synchronizing method for wireless sensor network
CN103763765A (en) * 2013-10-23 2014-04-30 河南科技大学 Self-synchronizing method of wireless sensor network

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104301988A (en) * 2014-08-17 2015-01-21 宿迁学院 Sensor-network-based geomagnetic induction vehicle clock synchronization technology
CN104301988B (en) * 2014-08-17 2018-10-12 宿迁学院 A kind of clock synchronizing method of the earth induction Vehicular system based on Sensor Network
CN104185268A (en) * 2014-09-13 2014-12-03 郑州航空工业管理学院 Time slot synchronization algorithm suitable for self-organization networking
CN104185268B (en) * 2014-09-13 2018-02-16 郑州航空工业管理学院 A kind of slot synchronization algorithm suitable for ad hoc networking
CN106358260A (en) * 2016-11-08 2017-01-25 山东大学 Synchronizing method for network time of large-scale wireless sensor
CN106358260B (en) * 2016-11-08 2019-04-16 山东大学 A kind of massive wireless sensor method for synchronizing time
CN110058286A (en) * 2019-05-13 2019-07-26 天津讯联科技有限公司 Space-time synchronous method, apparatus, equipment and medium under the conditions of a kind of defence
CN114362869A (en) * 2021-12-21 2022-04-15 国网江苏省电力有限公司电力科学研究院 Time collaborative synchronization method and device for power Internet of things nodes

Similar Documents

Publication Publication Date Title
CN106488550B (en) Determine the method and apparatus of terminal Yu base station clock time deviation
CN101562489B (en) Method for time synchronization in wireless sensor network
Gong et al. CESP: A low-power high-accuracy time synchronization protocol
CN105188126B (en) Distributed multihop wireless network clock synchronizing method based on mean field
CN104053223A (en) Low-power wireless sensor network time synchronization method
CN103546868B (en) A kind of method for synchronizing time of wireless sensor network, network system and node
Gotzhein et al. Black Burst Synchronization (BBS)–A protocol for deterministic tick and time synchronization in wireless networks
CN103957591A (en) Node pair based wireless sensor network time synchronization method
Sarvghadi et al. Message passing based time synchronization in wireless sensor networks: A survey
CN101982959B (en) Network demand time synchronization method
Kaur et al. A survey of time synchronization protocols for wireless sensor networks
Rahamatkar et al. A reference based, tree structured time synchronization approach and its analysis in WSN
CN103957589A (en) Multi-hop and low-cost distributed clock synchronization method
CN107197514A (en) The cognizable global clock synchronous method of wireless sensor network and the application in multihop network
Gautam et al. A comparative study of time synchronization protocols in wireless sensor networks
CN106162858A (en) Directintermination time synchronization method and device
CN106712879B (en) A kind of method for synchronizing time and device
Bae et al. Time synchronization in wireless sensor networks
Gotzhein et al. Decentralized tick synchronization for multi-hop medium slotting in wireless ad hoc networks using black bursts
Nieminen et al. Network-wide time synchronization in multi-channel wireless sensor networks
Shen et al. Clapping and broadcasting synchronization in wireless sensor networks
CN107959968B (en) High-precision low-overhead wireless sensor network clock synchronization method
Wang et al. A reliable time synchronization protocol for wireless sensor networks
Zhang et al. A Lightweight Time Synchronisation for Wireless Sensor Networks
Li et al. A time synchronization mechanism for heterogeneous wireless sensor networks

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
WD01 Invention patent application deemed withdrawn after publication
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20140730