Timing-sync protocol for sensor networks
By Saurabh Ganeriwal, Ram Kumar, Mani B. Srivastava. ACM International Conference on Embedded Networked Sensor Systems, 2003
2,386 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Computer Vision and Pattern Recognition
View Paper: https://www.semanticscholar.org/paper/22116f00faf9d2b6953c0ff4c923915c2cb9625b
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- Deborah Estrin
- John S. Heidemann
- Ramesh Govindan
- Ian F. Akyildiz
- Samuel Madden
- David E. Culler
- Hari Balakrishnan
- David B. Johnson
In Computer Vision and Pattern Recognition
- Deborah Estrin
- Samuel Madden
- Luca Schenato
- Ian F. Akyildiz
- Biswanath Mukherjee
- Dipak Ghosal
- Jennifer Yick
- Weilian Su
Citations in the corpus
- A Review of Data Fusion Techniques (2013, methodology): “The distributed Kalman filter requires a correct clock synchronization between each source, as demonstrated in [41].”
- Time-diffusion synchronization protocol for wireless sensor networks (2005, background): “It is argued that RBS can provide multi-hop synchronization by translating the time between different broadcast domains.”
- Clock synchronization for wireless sensor networks: a survey (2005, methodology): “RBS [19], the protocol by Mock et al. [49], asynchronous diffusion [42], and TDP [62] have higher computational and storage complexity compared to Romer (cid:1) s protocol [56], network-wide time synchronization [25], and the protocol by Sic-hitiu and Veerarittiphan [58].”
- Structural Health Monitoring Using Smart Sensors (2007, background): “, 2004) and Timing-sync Protocol for Sensor Networks (TPSN; Ganeriwal et al., 2003) are among the well-known synchronization methods.”
- Z-MAC: a hybrid MAC for wireless sensor networks (2005, methodology): “When those nodes start transmission, their clock values are unsynchronized (note that the maximum clock drift rate of Mica2 is around 40μs [15] per second).”
- RMAC: A Routing-Enhanced Duty-Cycle MAC Protocol for Wireless Sensor Networks (2007, background): “, [2], [3]), operating during the SYNC period, synchronizes the clocks on sensor nodes with the required precision.”
- Gradient clock synchronization in wireless sensor networks (2009, background): “5.3 MAC Layer Timestamping Broadcasting time information using periodic beacons is optimal in terms of the message complexity since the neighbor is not forced to acknowledge the message as in sender-receiver synchronization schemes (e.g., TPSN).”
- On k-coverage in a mostly sleeping sensor network (2004, background): “This, in turn requires a network-wide time synchronization service [6, 7].”
- DW-MAC: a low latency, energy efficient demand-wakeup MAC protocol for wireless sensor networks (2008, methodology): “, [6,9]) is used to synchronize the clocks in Sync Sleep Data S”
- EmStar: A Software Environment for Developing and Deploying Wireless Sensor Networks (2004, background): “as TPSN[9], are not generally applicable without support at the MAC layer.”
- Wireless sensor networks for personal health monitoring: Issues and an implementation (2006, background): “Several protocols have been specifically developed for wireless sensor networks [24] [25] [26] [28] [29].”
- The Emergence of Networking Abstractions and Techniques in TinyOS (2004, neutral): “Some applications may prefer to focus on robustness rather than maximizing the precision of time synchronization, as most algorithms proposed in the literature [16, 18] and included in the TinyOS repository strive to do.”
- The flooding time synchronization protocol (2004, methodology): “We shall use the following decomposition of the sources of the message delivery delays first introduced by Kopetz and Ochsenreiter [7], [8] and later extended in [3] and [5].”
- Underwater sensor networks: applications, advances and challenges (2012, background): “, 2002), and integration with hardware to reduce jitter (Ganeriwal et al., 2003).”
- Optimal Synchronization for Networks of Noisy Double Integrators (2011, background): “The challenge with this approach is to dynamically elect a root and reconstruct the tree whenever nodes fail or new nodes appear, as proposed by Ganeriwaletal. [ 4 ] and Maroti et al. [6] for example.”