TY - GEN
T1 - Localization for anchoritic sensor networks
AU - Baryshnikov, Yuliy
AU - Tan, Jian
PY - 2007
Y1 - 2007
N2 - We introduce a class of anchoritic sensor networks, where communications between sensor nodes are undesirable or infeasible due to, e.g., harsh environments, energy constraints, or security considerations. Instead, we assume that the sensors buffer the measurements over the lifetime and report them directly to a sink without necessarily requiring communications. Upon retrieval of the reports, all sensor data measurements will be available to a central entity for post processing. Our algorithm is based on the further assumption that some of the data fields that are being observed by the sensors can be modeled as a local (i.e. having decaying spatial correlations) stochastic process; if not, then choose an auxiliary field, e.g., carefully engineered random signals intentionally generated by arranged devices, "cloud shadows" cast on the ground, or animal heat. The sensor nodes record the measurements, or a function of the measurements, e.g., "1" when the measured signal is above a threshold, and "0" otherwise. These time-stamped sequences are ultimately transferred to the sink. The localization problem is then approached by analyzing the correlations between these sequences at pairs of nodes. As for applications, we discuss the localization scheme for large-scaled sensor networks deployed on the seabed and study a two-tiered architecture that organizes deaf sensors with local masters.
AB - We introduce a class of anchoritic sensor networks, where communications between sensor nodes are undesirable or infeasible due to, e.g., harsh environments, energy constraints, or security considerations. Instead, we assume that the sensors buffer the measurements over the lifetime and report them directly to a sink without necessarily requiring communications. Upon retrieval of the reports, all sensor data measurements will be available to a central entity for post processing. Our algorithm is based on the further assumption that some of the data fields that are being observed by the sensors can be modeled as a local (i.e. having decaying spatial correlations) stochastic process; if not, then choose an auxiliary field, e.g., carefully engineered random signals intentionally generated by arranged devices, "cloud shadows" cast on the ground, or animal heat. The sensor nodes record the measurements, or a function of the measurements, e.g., "1" when the measured signal is above a threshold, and "0" otherwise. These time-stamped sequences are ultimately transferred to the sink. The localization problem is then approached by analyzing the correlations between these sequences at pairs of nodes. As for applications, we discuss the localization scheme for large-scaled sensor networks deployed on the seabed and study a two-tiered architecture that organizes deaf sensors with local masters.
UR - http://www.scopus.com/inward/record.url?scp=38149079975&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=38149079975&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-73090-3_6
DO - 10.1007/978-3-540-73090-3_6
M3 - Conference contribution
AN - SCOPUS:38149079975
SN - 3540730893
SN - 9783540730897
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 82
EP - 95
BT - Distributed Computing in Sensor Systems - Third IEEE International Conference, DCOSS 2007, Proceedings
PB - Springer
T2 - 3rd IEEE International Conference on Distributed Computing in Sensor Systems, DCOSS 2007
Y2 - 18 June 2007 through 20 June 2007
ER -