Abstract
For a meaningful processing of the information sensed by a wireless sensor network (WSN), the clocks of the individual nodes need to be matched through some well-defined procedures. Extending the idea of having silent nodes in a WSN overhear the two-way timing message communication between two active (master and slave) nodes, this paper derives the maximum-likelihood estimator (MLE) for the clock offsets of the listening nodes located within the communication range of the active nodes by assuming an exponential link delay modeling, hence synchronizing with the reference node at a very low cost. A vital advantage for adopting such an approach is that the performance of sender-receiver protocols can be compared with receiver-receiver protocols on equal footings, because their main critical aspect was associated with the high-communication overhead induced by the point-to-point nature of communication links relative to broadcast communications. The MLE is also shown to be the minimum variance unbiased estimator (MVUE) of the clock offset when the mean of exponential link delays is known. Since it is attractive to know in advance the extent to which an estimator can perform through its lower bound, the Chapman-Robbins bound and the Barankin bound for the clock offset estimator are also derived. It is shown that for an exponential link delay model, the mean square error of the clock offset estimator is inversely proportional to the square of the number of observations, and hence its performance is on a similar scale, albeit slightly lesser, as compared to the usual sender-receiver clock offset estimator. In addition, a novel method referred to as the Gaussian mixture Kalman particle filter (GMKPF) is proposed herein to estimate the clock offsets of the listening nodes in a WSN. GMKPF represents a better and flexible alternative to the MLE for the clock offset estimation problem due to its improved performance and applicability in arbitrary and generalized non-Gaussian random delay models.
| Original language | English |
|---|---|
| Article number | 5361493 |
| Pages (from-to) | 582-596 |
| Number of pages | 15 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 56 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - Jan 2010 |
| Externally published | Yes |
Fingerprint
Keywords
- Clock
- Estimation
- Sensor
- Synchronization
- Timing
ASJC Scopus subject areas
- Information Systems
- Computer Science Applications
- Library and Information Sciences
Cite this
Energy-efficient estimation of clock offset for inactive nodes in wireless sensor networks. / Chaudhari, Qasim M.; Serpedin, Erchin; Kim, Jang Sub.
In: IEEE Transactions on Information Theory, Vol. 56, No. 1, 5361493, 01.2010, p. 582-596.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Energy-efficient estimation of clock offset for inactive nodes in wireless sensor networks
AU - Chaudhari, Qasim M.
AU - Serpedin, Erchin
AU - Kim, Jang Sub
PY - 2010/1
Y1 - 2010/1
N2 - For a meaningful processing of the information sensed by a wireless sensor network (WSN), the clocks of the individual nodes need to be matched through some well-defined procedures. Extending the idea of having silent nodes in a WSN overhear the two-way timing message communication between two active (master and slave) nodes, this paper derives the maximum-likelihood estimator (MLE) for the clock offsets of the listening nodes located within the communication range of the active nodes by assuming an exponential link delay modeling, hence synchronizing with the reference node at a very low cost. A vital advantage for adopting such an approach is that the performance of sender-receiver protocols can be compared with receiver-receiver protocols on equal footings, because their main critical aspect was associated with the high-communication overhead induced by the point-to-point nature of communication links relative to broadcast communications. The MLE is also shown to be the minimum variance unbiased estimator (MVUE) of the clock offset when the mean of exponential link delays is known. Since it is attractive to know in advance the extent to which an estimator can perform through its lower bound, the Chapman-Robbins bound and the Barankin bound for the clock offset estimator are also derived. It is shown that for an exponential link delay model, the mean square error of the clock offset estimator is inversely proportional to the square of the number of observations, and hence its performance is on a similar scale, albeit slightly lesser, as compared to the usual sender-receiver clock offset estimator. In addition, a novel method referred to as the Gaussian mixture Kalman particle filter (GMKPF) is proposed herein to estimate the clock offsets of the listening nodes in a WSN. GMKPF represents a better and flexible alternative to the MLE for the clock offset estimation problem due to its improved performance and applicability in arbitrary and generalized non-Gaussian random delay models.
AB - For a meaningful processing of the information sensed by a wireless sensor network (WSN), the clocks of the individual nodes need to be matched through some well-defined procedures. Extending the idea of having silent nodes in a WSN overhear the two-way timing message communication between two active (master and slave) nodes, this paper derives the maximum-likelihood estimator (MLE) for the clock offsets of the listening nodes located within the communication range of the active nodes by assuming an exponential link delay modeling, hence synchronizing with the reference node at a very low cost. A vital advantage for adopting such an approach is that the performance of sender-receiver protocols can be compared with receiver-receiver protocols on equal footings, because their main critical aspect was associated with the high-communication overhead induced by the point-to-point nature of communication links relative to broadcast communications. The MLE is also shown to be the minimum variance unbiased estimator (MVUE) of the clock offset when the mean of exponential link delays is known. Since it is attractive to know in advance the extent to which an estimator can perform through its lower bound, the Chapman-Robbins bound and the Barankin bound for the clock offset estimator are also derived. It is shown that for an exponential link delay model, the mean square error of the clock offset estimator is inversely proportional to the square of the number of observations, and hence its performance is on a similar scale, albeit slightly lesser, as compared to the usual sender-receiver clock offset estimator. In addition, a novel method referred to as the Gaussian mixture Kalman particle filter (GMKPF) is proposed herein to estimate the clock offsets of the listening nodes in a WSN. GMKPF represents a better and flexible alternative to the MLE for the clock offset estimation problem due to its improved performance and applicability in arbitrary and generalized non-Gaussian random delay models.
KW - Clock
KW - Estimation
KW - Sensor
KW - Synchronization
KW - Timing
UR - http://www.scopus.com/inward/record.url?scp=73849126261&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=73849126261&partnerID=8YFLogxK
U2 - 10.1109/TIT.2009.2034817
DO - 10.1109/TIT.2009.2034817
M3 - Article
AN - SCOPUS:73849126261
VL - 56
SP - 582
EP - 596
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
SN - 0018-9448
IS - 1
M1 - 5361493
ER -