Yet another distributed depth-first-search algorithm
Information Processing Letters
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Fine-grained network time synchronization using reference broadcasts
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
An algorithmic strategy for in-network distributed spatial analysis in wireless sensor networks
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
This paper presents a novel Chained-RIpple Time Synchronization (CRIT) protocol that is scalable, flexible, and high-precise in Wireless Sensor Networks (WSN). CRIT adopts hierarchical and multi-hop time synchronization architecture with contributing energy-saving effects in WSN. The algorithm works in two phases. In the first phase, a horizontal structure between Missionary Nodes (MN) is established in the network by Piggy-Back Neighbor Time Synchronization (PBNT) algorithm. In the second phase, a vertical structure between a MN and Sensor Nodes (SN) is set up in each sensor group (SG) by Distributed Depth First Search (DDFS) algorithm. By applying these two phases repeatedly, all nodes in WSN efficiently synchronize to each other. For the purpose of performance evaluation, we first study the error sources of CRIT. In addition, we simulate CRIT in terms of synchronization errors of two phases using network simulator.