2015
DOI: 10.1016/j.micpro.2015.07.006
|View full text |Cite
|
Sign up to set email alerts
|

STETS: A novel energy-efficient time synchronization scheme based on embedded networking devices

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
13
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 33 publications
(13 citation statements)
references
References 34 publications
0
13
0
Order By: Relevance
“…The flooding provides an easy way to achieve a synchronized network, regardless of the messaging scheme utilized to exchange the time information. The Tiny-Sync and Mini-Sync [ 98 ], the Lightweight Time Synchronization (LTS) [ 97 ], and the Timing-sync Protocol for Sensor Networks (TPSN) [ 82 ] use two-way message exchanges; the Spanning Tree-based Energy-efficient Time Synchronization (STETS) [ 99 ], its improved version R-Sync [ 37 ] and self-recovering version Self-Recoverable Time Synchronization (SRTS) [ 100 ] use receiver-only scheme; and the Flooding Time Synchronization Protocol (FTSP) [ 56 ], which is the de-facto synchronization protocol in WSN literature, uses one-way message dissemination.…”
Section: Time Synchronization Messagingmentioning
confidence: 99%
See 1 more Smart Citation
“…The flooding provides an easy way to achieve a synchronized network, regardless of the messaging scheme utilized to exchange the time information. The Tiny-Sync and Mini-Sync [ 98 ], the Lightweight Time Synchronization (LTS) [ 97 ], and the Timing-sync Protocol for Sensor Networks (TPSN) [ 82 ] use two-way message exchanges; the Spanning Tree-based Energy-efficient Time Synchronization (STETS) [ 99 ], its improved version R-Sync [ 37 ] and self-recovering version Self-Recoverable Time Synchronization (SRTS) [ 100 ] use receiver-only scheme; and the Flooding Time Synchronization Protocol (FTSP) [ 56 ], which is the de-facto synchronization protocol in WSN literature, uses one-way message dissemination.…”
Section: Time Synchronization Messagingmentioning
confidence: 99%
“…One way to implement this idea is to use the receiver-only messaging scheme, where the high-end nodes perform two-way time information exchanges, while the low-end nodes overhear these packets. The Group-wise Pair selection Algorithm (GMA) is a multi-hop scheme presented by Noh et al [ 104 ] and STETS [ 99 ] enable such deployments, but suffer from isolated nodes and sensitivity to group leaders problems. A solution to the first problem is provided in R-Sync [ 37 ], and a solution to the second is provided in SRTS [ 100 ].…”
Section: Time Synchronization Messagingmentioning
confidence: 99%
“…Variable max child weight index is the index of max child weight in array child[]. At first, the sink node needs to clear array child[] (Line 1), then it sends a P T REELECT SIN K packet to all the child nodes for Algorithm 5 Network for the child nodes 1: clear array child[] 2: send P T REELECT SIN K to the child nodes 3: start a timer 4: if a node receives P T REELECT SIN K then 5: ava sink num ← 0 and clears optional sink[]; 6: broadcast P T SIN K SEARCH 7: calculate the weights of sink nodes; 8: send the biggest weight is to the sink node 9: end if 10: the sink node selects the maximum weight from child[] 11: send P T REJOIN REQU EST to child[max child weight index] 12: if a child node receives P T REJOIN REQU EST then 13: is net node ← f alse 14: execute algorithm 2 15: if is net node = true then 16: add the old sink node to its child node table 17: send P T REJOIN OK to the old sink node 18: else 19: is net node ← true 20: sent P T REJOIN F AILED to the old sink node 21: end if 22: end if 23: if sink node receives P T REJOIN OK then 24: delete child[max child weight index] 25: is net node ← true 26: return 27: else if sink node receives P T REJOIN F AILED then 28: i ← 0, max child weight ← 0 go to Line 12; 47: end if reelecting sink node (Line 2). At the same time, it starts a timer (Line 3).…”
Section: End If 21: End Ifmentioning
confidence: 99%
“…The memory, energy and ability of computing are limited by network nodes [8], [9]. In order to maximize lifetime, many researchers [10] apply themselves to control network topology [11], build better data transmission route and balance energy consumption of nodes [12], [13], [14].…”
Section: Introductionmentioning
confidence: 99%
“…Over the past decades, we have witnessed the development of automotive electronics [1] and IoTs [2]. Nowadays, modern vehicles have already equipped with dozens or even hundreds of sensors onboard, like oxygen sensor, speedometer, temperature sensor and etc [3].…”
Section: Introductionmentioning
confidence: 99%