Estimating Clock Uncertainty for Efficient Duty-Cycling in Sensor Networks

Ganeriwal, Saurabh; Tsigkogiannis, Ilias; Shim, Hohyun; Tsiatsis, Vlassios; Srivastava, Mani; Ganesan, Deepak

doi:10.1109/tnet.2008.2001953

Cited by 81 publications

(14 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the literature, there are many papers that focus on time synchronization for WSN such as Timing-Sync Protocol for Sensor Networks (TPSN) [9], Reference Broadcast Synchronization (RBS) [10], Flooding Time-Synch Protocol (FTSP) [11], Rate Adaptive Time Synchronization (RATS) [12], Adaptive Time Window [13], etc. With accurate time synchronization, we can introduce a calculated phase offset to the carrier signal at each mote for CB.…”

Section: Related Workmentioning

confidence: 99%

Practical Considerations in the Implementation of Collaborative Beamforming on Wireless Sensor Networks

Felici-Castell

Navarro

Pérez-Solano

et al. 2017

Sensors

View full text Add to dashboard Cite

Wireless Sensor Networks (WSNs) are composed of spatially distributed autonomous sensor devices, named motes. These motes have their own power supply, processing unit, sensors and wireless communications However with many constraints, such as limited energy, bandwidth and computational capabilities. In these networks, at least one mote called a sink, acts as a gateway to connect with other networks. These sensor networks run monitoring applications and then the data gathered by these motes needs to be retrieved by the sink. When this sink is located in the far field, there have been many proposals in the literature based on Collaborative Beamforming (CB), also known as Distributed or Cooperative Beamforming, for these long range communications to reach the sink. In this paper, we conduct a thorough study of the related work and analyze the requirements to do CB. In order to implement these communications in real scenarios, we will consider if these requirements and the assumptions made are feasible from the point of view of commercial motes and their constraints. In addition, we will go a step further and will consider different alternatives, by relaxing these requirements, trying to find feasible assumptions to carry out these types of communications with commercial motes. This research considers the nonavailability of a central clock that synchronizes all motes in the WSN, and all motes have identical hardware. This is a feasibility study to do CB on WSN, using a simulated scenario with randomized delays obtained from experimental data from commercial motes.

show abstract

Section: Related Workmentioning

confidence: 99%

Practical Considerations in the Implementation of Collaborative Beamforming on Wireless Sensor Networks

Felici-Castell

Navarro

Pérez-Solano

et al. 2017

Sensors

View full text Add to dashboard Cite

show abstract

“…Given error bounds, ref. [15] used statistical methods to predict sync error and adjusted sync period multiplicatively. However, their approach was too complicated for tiny nodes' microprocessors.…”

Section: A Related Workmentioning

confidence: 99%

“…4 also illustrates that adaptive-ATS approach has a very quick response to a new error bound, because adaptive-ATS protocol gets the appropriate initial period immediately by querying PE table. Whereas, previous recursive methods [15], [16] need dozens of steps, which brings up more message exchanges. For example, assuming the error bound is 300μs, the recursive method starts from period which is 1 seconds, and multiplies it by 2 every step.…”

Section: E Power Consumption and Convergence Speedmentioning

confidence: 99%

A precision adaptive average time synchronization protocol in wireless sensor networks

Liu

Yang

et al. 2008

2008 International Conference on Information and Automation

View full text Add to dashboard Cite

Time synchronization provides an essential service for wireless sensor networks. Most of previous works focus on improving synchronization accuracy. However, other design concerns, such as global time continuity, power efficiency and adaptability, arise from real applications' requirements and receive more and more attentions. During synchronization, most of approaches choose a specific sensor node's (denoted as leader node) local time to be the global time, which would be disturbed easily due to network dynamics (leader node's re-elections or power down). The disorder global time reference could confuse other sensor nodes and even crash applications based on temporal sequence relationship. This paper first present an average based time synchronization algorithm, which can provide continuous global time in a cluster with similar synchronization precision during leader reelections. Furthermore, in order to meet power efficiency and adaptability requirements from applications, a self measure and query based adaptive mechanism is integrated into it to adjust synchronization period dynamically. Compared with previous adaptive algorithms, the query table method provides one-step convergence while satisfying synchronization error tolerance.

show abstract

“…This high shock durability is necessary to prevent destruction of the accelerometers from the impact of a falling climber. The ten motes run the SOS operating system [4] and use Rate Adaptive Time Synchronization (RATS) [3] to synchronize sampling.…”

Section: System Descriptionmentioning

confidence: 99%