Proceedings 12th Euromicro Conference on Real-Time Systems. Euromicro RTS 2000
DOI: 10.1109/emrts.2000.854006
|View full text |Cite
|
Sign up to set email alerts
|

Clock synchronization for wireless local area networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
24
0

Publication Types

Select...
3
3
1

Relationship

1
6

Authors

Journals

citations
Cited by 40 publications
(24 citation statements)
references
References 7 publications
0
24
0
Order By: Relevance
“…There has been much other work on clock synchronization. [2] showed an approach similar to [5], but focusing more on sensor-networks and their low-power constrains as well as their multi-hop nature. For this purpose, they calculate a linear regression for the time values obtained from a time server, and they propose a scheme for synchronizing time for more than one broadcast domain.…”
Section: Related Workmentioning
confidence: 97%
See 1 more Smart Citation
“…There has been much other work on clock synchronization. [2] showed an approach similar to [5], but focusing more on sensor-networks and their low-power constrains as well as their multi-hop nature. For this purpose, they calculate a linear regression for the time values obtained from a time server, and they propose a scheme for synchronizing time for more than one broadcast domain.…”
Section: Related Workmentioning
confidence: 97%
“…As a result, several clock synchronization protocols for wireless sensor networks have been designed in the recent past. WVe presented a protocol in [5], [6], which is based on an idea which can be found in [1], [8]. The idea is also utilized in the clock synchronization protocol of the CAN standard [3].…”
Section: Related Workmentioning
confidence: 99%
“…For the sake of simplicity, a linear function is used and clock correction is achieved by changing the parameters of this function after every synchronization round so that the slave's virtual clock matches the master's physical clock as closely as possible. The algorithm assumes that message reception is tight, such that a master node receives its own broadcast message at approximately the same time as the slave nodes [8]. Each synchronization frame contains the time at which the master node received the last synchronization message sent and by comparing this value with its own reception time for the same message, a slave is able to achieve synchronization with the master.…”
Section: Description Of Three Selected Algorithmsmentioning
confidence: 99%
“…In the proposed protocol, synchronized clocks [14][15] [16] between V and U i 's home network H are assumed. In addition, the security of our authentication key is based on Diffie-Hellman problem.…”
Section: Proposed Roaming Service Authentication Protocolmentioning
confidence: 99%