Recent Advances in Precision Clock Synchronization Protocols for Power Grid Control Systems
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
IEEE 1451-- a Universal Transducer Protocol Standard
IEEE 1451-- A Universal Transducer Protocol Standard Dr. Darold Wobschall President, Esensors Inc. IEEE1451 Standard Description 1 Goals To d escribe --- Relationship of smart sensor and sensor networks IEEE 1451 Concepts and History Role of 1451compilers Wireless 1451 NCAPs and TIM examples Relationship to sensor standards harmonization IEEE1451 Standard Description 2 Networked Sensor Block Diagram Parameter in IEEE1451 Standard Description 3 Network Sensor Applications Automatic testing Plug and play Multiple sensors on one network or bus Machine to Machine (M2M) sensor data communications Wide area (Nationwide) data collection ability IEEE1451 Standard Description 4 Sensor/Transducer Networks A network connects more than one addressed sensor (or actuator) to a digital wired or wireless network Both network and sensor digital data protocols are needed Standard data networks can be used but are far from optimum Numerous (>100) incompatible sensor networks are currently in use – each speaking a different language The Tower of Babel IEEE1451 Standard Description 5 IEEE 1451 – the Universal Transducer Language Problem: too many network protocols in common use Narrow solutions and borrowed protocols have not worked Sensor engineers in the fragmented sensor industry need a simple method of implementation How can it be done ? We need something like USB, except for sensors Solution: the IEEE 1451 Smart Transducer Protocol open standard is the best universal solution Supported by NIST, IEEE and many Federal agencies IEEE1451 -
FPGA Based Single Chip Solution with 1-Wire Protocol for the Design of Smart Sensor Nodes
Hindawi Publishing Corporation Journal of Sensors Volume 2014, Article ID 125874, 11 pages http://dx.doi.org/10.1155/2014/125874 Research Article FPGA Based Single Chip Solution with 1-Wire Protocol for the Design of Smart Sensor Nodes M. D. R. Perera,1 R. G. N. Meegama,1 and M. K. Jayananda2 1 Department of Computer Science, University of Sri Jayewardenepura, 10250 Nugegoda, Sri Lanka 2 Department of Physics, University of Colombo, 00300 Colombo 03, Sri Lanka Correspondence should be addressed to R. G. N. Meegama; [email protected] Received 27 May 2014; Revised 26 October 2014; Accepted 30 October 2014; Published 23 November 2014 Academic Editor: Stefania Campopiano Copyright © 2014 M. D. R. Perera et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Applications that involve monitoring of water quality parameters require measuring devices to be placed at different geographical locations but are controlled centrally at a remote site. The measuring devices in such applications need to be small, consume low power, and must be capable of local processing tasks facilitating the mobility to span the measuring area in a vast geographic area. This paper presents the design of a generalized, low-cost, reconfigurable, reprogrammable smart sensor node using aZigBee with a Field-Programmable Gate Array (FPGA) that embeds all processing and communication functionalities based on the IEEE 1451 family of standards. Design of the sensor nodes includes processing and transducer control functionalities in a single core increasing the speedup of processing power due to interprocess communication taking place within the chip itself. -
Lecture 12: March 18 12.1 Overview 12.2 Clock Synchronization
CMPSCI 677 Operating Systems Spring 2019 Lecture 12: March 18 Lecturer: Prashant Shenoy Scribe: Jaskaran Singh, Abhiram Eswaran(2018) Announcements: Midterm Exam on Friday Mar 22, Lab 2 will be released today, it is due after the exam. 12.1 Overview The topic of the lecture is \Time ordering and clock synchronization". This lecture covered the following topics. Clock Synchronization : Motivation, Cristians algorithm, Berkeley algorithm, NTP, GPS Logical Clocks : Event Ordering 12.2 Clock Synchronization 12.2.1 The motivation of clock synchronization In centralized systems and applications, it is not necessary to synchronize clocks since all entities use the system clock of one machine for time-keeping and one can determine the order of events take place according to their local timestamps. However, in a distributed system, lack of clock synchronization may cause issues. It is because each machine has its own system clock, and one clock may run faster than the other. Thus, one cannot determine whether event A in one machine occurs before event B in another machine only according to their local timestamps. For example, you modify files and save them on machine A, and use another machine B to compile the files modified. If one wishes to compile files in order and B has a faster clock than A, you may not correctly compile the files because the time of compiling files on B may be later than the time of editing files on A and we have nothing but local timestamps on different machines to go by, thus leading to errors. 12.2.2 How physical clocks and time work 1) Use astronomical metrics (solar day) to tell time: Solar noon is the time that sun is directly overhead. -
Distributed Synchronization
Distributed Synchronization CIS 505: Software Systems Communication between processes in a distributed system can have Lecture Note on Physical Clocks unpredictable delays, processes can fail, messages may be lost Synchronization in distributed systems is harder than in centralized systems because the need for distributed algorithms. Properties of distributed algorithms: 1 The relevant information is scattered among multiple machines. 2 Processes make decisions based only on locally available information. 3 A single point of failure in the system should be avoided. Insup Lee 4 No common clock or other precise global time source exists. Department of Computer and Information Science Challenge: How to design schemes so that multiple systems can University of Pennsylvania coordinate/synchronize to solve problems efficiently? CIS 505, Spring 2007 1 CIS 505, Spring 2007 Physical Clocks 2 The Myth of Simultaneity Event Timelines (Example of previous Slide) time “Event 1 and event 2 at same time” Event 1 Node 1 Event 2 Event 1 Event 2 Node 2 Observer A: Node 3 Event 2 is earlier than Event 1 Observer B: Node 4 Event 2 is simultaneous to Event 1 Observer C: Node 5 Event 1 is earlier than Event 2 e1 || e2 = e1 e2 | e2 e1 Note: The arrows start from an event and end at an observation. The slope of the arrows depend of relative speed of propagation CIS 505, Spring 2007 Physical Clocks 3 CIS 505, Spring 2007 Physical Clocks 4 1 Causality Event Timelines (Example of previous Slide) time Event 1 causes Event 1 Event 2 Node 1 Event 2 Node 2 Observer A: Event 1 before Event 2 Node 3 Observer B: Event 1 before Event 2 Node 4 Observer C: Event 1 before Event 2 Node 5 Note: In the timeline view, event 2 must be caused by some passage of Requirement: We have to establish causality, i.e., each observer must see information from event 1 if it is caused by event 1 event 1 before event 2 CIS 505, Spring 2007 Physical Clocks 5 CIS 505, Spring 2007 Physical Clocks 6 Why need to synchronize clocks? Physical Time foo.o created Some systems really need quite accurate absolute times. -
Clock Synchronization Clock Synchronization Part 2, Chapter 5
Clock Synchronization Clock Synchronization Part 2, Chapter 5 Roger Wattenhofer ETH Zurich – Distributed Computing – www.disco.ethz.ch 5/1 5/2 Overview TexPoint fonts used in EMF. Motivation Read the TexPoint manual before you delete this box.: AAAA A • Logical Time (“happened-before”) • Motivation • Determine the order of events in a distributed system • Real World Clock Sources, Hardware and Applications • Synchronize resources • Clock Synchronization in Distributed Systems • Theory of Clock Synchronization • Physical Time • Protocol: PulseSync • Timestamp events (email, sensor data, file access times etc.) • Synchronize audio and video streams • Measure signal propagation delays (Localization) • Wireless (TDMA, duty cycling) • Digital control systems (ESP, airplane autopilot etc.) 5/3 5/4 Properties of Clock Synchronization Algorithms World Time (UTC) • External vs. internal synchronization • Atomic Clock – External sync: Nodes synchronize with an external clock source (UTC) – UTC: Coordinated Universal Time – Internal sync: Nodes synchronize to a common time – SI definition 1s := 9192631770 oscillation cycles of the caesium-133 atom – to a leader, to an averaged time, ... – Clocks excite these atoms to oscillate and count the cycles – Almost no drift (about 1s in 10 Million years) • One-shot vs. continuous synchronization – Getting smaller and more energy efficient! – Periodic synchronization required to compensate clock drift • Online vs. offline time information – Offline: Can reconstruct time of an event when needed • Global vs. -
Clock Synchronization
Middleware Laboratory Sapienza Università di Roma MIDLAB Dipartimento di Informatica e Sistemistica Clock Synchronization Marco Platania www.dis.uniroma1.it/~platania [email protected] Sapienza University of Rome Time notion Each computer is equipped with a physical (hardware) clock It can be viewed as a counter incremented by ticks of an oscillator i At time t, the Operating System (OS) of a process y r o t reads the hardware clock H(t) of the processor a r o b a L e r a C = a H(t) + b w Then, it generates the software clock e l d d i M C approximately measures the time t of process i B A L D I M notion among processes among notion isas known evolve executions distributed (DS) Distributed in Systems Time Problems: how to analyze a in DS factor Time a key is The technique used to coordinate a common time time common a techniqueThe used coordinate to common notion time common of a process state during distributed a computation However, it©s important processes for a share to However, Lacking of a global reference time: it©s hard to know Lackingthe time:it©sknow to hard of a global reference ClockSynchronization MIDLAB Middleware Laboratory Clock Synchronization [10] The hardware clock of a set of computers (system nodes) may differ because they count time with different frequencies Clock Synchronization faces this problem by means of synchronization algorithms y r Standard communication infrastructure o t a r o No additional hardware b a L e r a w e l Clock synchronization algorithms d d i External M Internal B -
PTP Background and Overview
PTP Background and Overview by Jeff Laird, July 2012 Introduction Precision Time Protocol (PTP) allows computers in a local area network to synchronize their clocks to within a microsecond of each other. The standard was originally defined in 2002. The second and current version of the standard was published in 2008. It is known as “IEEE 1588-2008” (IEEE Standard for a Precision Clock Synchronization Protocol for Networked Measurement and Control Systems). PTP compared to other synchronization methods PTP is more accurate than NTP but less accurate than GPS. NTP NTP (Network Time Protocol) was standardized in 1985 and is the most common clock synchronization method, being used by tens of millions of client computers to synchronize to NTP servers over the Internet. NTP is primarily used in wide-area networks, where it can achieve accuracy to 10 ms. On a local-area network NTP can achieve accuracy to 200 μs. NTP includes SNTP (Simple NTP), which is stateless (no averaging) and therefore suitable for embedded devices, but less accurate. In NTP terminology, stratum-0 clocks are atomic clocks, GPS satellites, and radio clocks not directly on a network. They provide the time to stratum-1 clocks (network time servers) using a PPS (pulse-per- second) signal over an RS-232 serial connection. Stratum-2 clocks typically synchronize with multiple stratum-1 clocks. Stratum-3 clocks synchronize with one or more stratum-2 clocks, and so on. An NTP timestamp is 64 bits long—32 bits for seconds (to 136 years) and 32 bits for fraction of a second (to <0.25 ns). -
IEEE 802.11Ah, Lorawan Overview
Low Power WAN Protocols for IoT: IEEE 802.11ah, LoRaWAN Overview 1. Low Power WANs 2. IEEE 802.11ah Raj Jain Washington University in Saint Louis 3. LoRaWAN Saint Louis, MO 63130 [email protected] Note: This is the 5th lecture in series of class lectures on IoT. Bluetooth, Audio/Video recordings of this class lecture are available at: Bluetooth Smart, IEEE 802.15.4, ZigBee were covered in the previous lectures. http://www.cse.wustl.edu/~jain/cse574-16/ Washington University in St. Louis http://www.cse.wustl.edu/~jain/cse574-16/ ©2016 Raj Jain Washington University in St. Louis http://www.cse.wustl.edu/~jain/cse574-16/ ©2016 Raj Jain 14-1 14-2 Recent Protocols for IoT 802.11ah Features Aka “WiFi HaLow” by WiFi Alliance. IEEE spec for Low-rate long-range IoT applications. MQTT, SMQTT, CoRE, DDS, AMQP , Security Management Currently in 2nd Sponsor ballot (March 2016). XMPP, CoAP, IEC,… Spectrum: Sub-Giga Hertz license-exempt spectrum. Session Not including TV white spaces (700 MHz for 802.11af). Encapsulation 6LowPAN, 6TiSCH, IEEE 1888.3, IEEE 1905, ¾ 902-928 MHz (USA) 6Lo, Thread… TCG, IEEE 1451, ¾ 863-868.6 MHz (Europe) Routing RPL, CORPL, CARP Oath 2.0, IEEE 1377, Network SMACK, IEEE P1828, ¾ 916.5-927.5 MHz (Japan) WiFi, 802.11ah,Bluetooth Low SASL, IEEE P1856 ¾ 755-587 MHz (China) Energy, Z-Wave, ZigBee Smart, EDSA, ¾ 917.5-923.5 MHz (Korea) DECT/ULE, 3G/LTE, NFC, ace, Sub-GHz frequency Longer range than 2.4 GHz, Weightless, HomePlug GP, 802.15.4e, DTLS, Less congested, better penetration Datalink G.9959, WirelessHART, DASH7, Dice, … Low bit rate for IoT, Short data transmissions, Power savings, ANT+, LTE-A, LoRaWAN, Efficient MAC ISA100.11a, DigiMesh, WiMAX, … Goal: Support at least 4X devices per AP than legacy 802.11 Washington University in St. -
IEEE 1451 Smart Transducer Interface Standards for Iot, Iiot, and CPS
IEEE 1451 Smart Transducer Interface Standards for IoT, IIoT, and CPS IEEE P1451.9 WG Kick-off Meeting January 10, 2020 Kang B. Lee IEEE Life Fellow Chair, IEEE IMS Technical Committee on Sensor Technology TC-9 Internet of Things (IoT) apps and verticals Global are popping up Connectivity everyday Standardized Protocols & Interfaces* IEC IEEE ANSI IEC IEC IEEE OGC- 61968 1815 Modbus C12 61850 60870 SWE CIM (DNP3) 1451 Domains * https://www.postscapes.com/internet-of-things-protocols/ Water ch Healthcare Information & Education Comm Techs ISO/IEC Manufacturing IoT Application Energy Domains & Use Cases Mindmap Infotainment Finance Public Safety, Military Agriculture Hospitality, Retail Transportation Government Residential In all these applications and use cases, smart sensors can play key roles to enable IoT functions. Adjust IEEE 1451 Standards to meet challenges. Courtesy of ISO/IEC/JTC1 SWG5 Industrial Internet Revolution is here Industry consists of many Physical Systems The Internet revolution brings Cyber Systems into the picture The Industrial Internet Revolution combines Cyber with Physical systems leading to: Cyber Physical Systems (CPS) Industrial Internet of Things (IIoT) Internet of Things (IoT) Internet of Every Things (IoET) What is your name ?… CPS & IoT are hybrid networks of cyber and physical components integrated to create systems that have adaptive and predictive capabilities. These systems can respond in real-time to enhance system performance automatically or through human interactions. Industrial Internet Consortium (IIC) also defines IIoT Architecture Framework Functional Domains IoT and CPS IEEE P2413 IoT Architecture Internet of Things (IoT) is a network that connects uniquely identifiable “Things” to the Internet. (IEEE P2413) IoT and CPS Cyber-Physical Systems (CPS) NIST CPS Conceptual Model Cyber-physical systems Cyber (CPS) are smart systems that include engineered interacting networks of physical and computational Sensors Actuators components. -
STP Recommendations for the FINRA Clock Synchronization Requirements
STP recommendations for the FINRA clock synchronization requirements This document can be found on the web, www.ibm.com/support/techdocs Search for document number WP102690 under the category of “White Papers". Version Date: January 20, 2017 George Kozakos [email protected] © IBM Copyright, 2017 Version 1, January 20, 2017 Web location of document ( www.ibm.com/support/techdocs ) ~ 1 ~ STP recommendations for the FINRA clock synchronization requirements Contents Configuring an external time source (ETS) via a network time protocol (NTP) server with pulse per second (PPS) ......................................................................................................... 3 Activating the z/OS time of day (TOD) clock accuracy monitor .............................................. 4 Maintaining time accuracy across power-on-reset (POR) ...................................................... 5 Specifying leap seconds ....................................................................................................... 6 Appendix ............................................................................................................................. 7 References ........................................................................................................................... 8 Trademarks ......................................................................................................................... 8 Feedback ............................................................................................................................ -
Distributed Systems: Synchronization
Chapter 3: Distributed Systems: Synchronization Fall 2013 Jussi Kangasharju Chapter Outline n Clocks and time n Global state n Mutual exclusion n Election algorithms Kangasharju: Distributed Systems 2 Time and Clocks What we need? How to solve? Real time Universal time (Network time) Interval length Computer clock Order of events Network time (Universal time) NOTE: Time is monotonous Kangasharju: Distributed Systems 3 Measuring Time n Traditionally time measured astronomically n Transit of the sun (highest point in the sky) n Solar day and solar second n Problem: Earth’s rotation is slowing down n Days get longer and longer n 300 million years ago there were 400 days in the year ;-) n Modern way to measure time is atomic clock n Based on transitions in Cesium-133 atom n Still need to correct for Earth’s rotation n Result: Universal Coordinated Time (UTC) n UTC available via radio signal, telephone line, satellite (GPS) Kangasharju: Distributed Systems 4 Hardware/Software Clocks n Physical clocks in computers are realized as crystal oscillation counters at the hardware level n Correspond to counter register H(t) n Used to generate interrupts n Usually scaled to approximate physical time t, yielding software clock C(t), C(t) = αH(t) + β n C(t) measures time relative to some reference event, e.g., 64 bit counter for # of nanoseconds since last boot n Simplification: C(t) carries an approximation of real time n Ideally, C(t) = t (never 100% achieved) n Note: Values given by two consecutive clock queries will differ only if clock resolution is sufficiently smaller than processor cycle time Kangasharju: Distributed Systems 5 Problems with Hardware/Software Clocks n Skew: Disagreement in the reading of two clocks n Drift: Difference in the rate at which two clocks count the time n Due to physical differences in crystals, plus heat, humidity, voltage, etc. -
BLAS: Broadcast Relative Localization and Clock Synchronization for Dynamic Dense Multi-Agent Systems Qin Shi, Xiaowei Cui, Sihao Zhao, Shuang Xu, and Mingquan Lu
1 BLAS: Broadcast Relative Localization and Clock Synchronization for Dynamic Dense Multi-Agent Systems Qin Shi, Xiaowei Cui, Sihao Zhao, Shuang Xu, and Mingquan Lu Abstract—The spatiotemporal information plays crucial roles better capabilities beyond only a single agent, in terms of in a multi-agent system (MAS). However, for a highly dynamic robustness, scalability, and effectiveness. and dense MAS in unknown environments, estimating its spa- Realizing this vision will require MASs to overcome some tiotemporal states is a difficult problem. In this paper, we present BLAS: a wireless broadcast relative localization and clock new unique challenges. Among these, real-time precise relative synchronization system to address these challenges. Our BLAS localization and clock synchronization are two key challenges. system exploits a broadcast architecture, under which a MAS Relative localization is the process of determining the multi- is categorized into parent agents that broadcast wireless packets agent dynamic topology, and clock synchronization provides a and child agents that are passive receivers, to reduce the number common time reference for distributed agents. The spatiotem- of required packets among agents for relative localization and clock synchronization. We first propose an asynchronous broad- poral determination is crucial for MASs to perform basic oper- casting and passively receiving (ABPR) protocol. The protocol ations: 1) Coordination: Spatiotemporal coordination between schedules the broadcast of parent agents using a distributed time agents is necessary for a MAS to collaboratively carry out division multiple access (D-TDMA) scheme and delivers inter- tasks effectively. The difficulty of the coordination operations agent information used for joint relative localization and clock strongly lies in the knowledge of the relative position and clock synchronization.