Algorithms for local sensor synchronization

Lixing Wang, Yin Yang, Xin Miao, Dimitris Papadias, Yunhao Liu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In a wireless sensor network (WSN), each sensor monitors environmental parameters, and reports its readings to a base station, possibly through other nodes. A sensor works in cycles, in each of which it stays active for a fixed duration, and then sleeps until the next cycle. The frequency of such cycles determines the portion of time that a sensor is active, and is the dominant factor on its battery life. The majority of existing work assumes globally synchronized WSN where all sensors have the same frequency. This leads to waste of battery power for applications that entail different accuracy of measurements, or environments where sensor readings have large variability. To overcome this problem, we propose LS, a query processing framework for locally synchronized WSN. We consider that each sensor ni has a distinct sampling frequency fi, which is determined by the application or environment requirements. The complication of LS is that ni has to wake up with a network frequency Fifi, in order to forward messages of other sensors. Our goal is to minimize the sum of Fi without delaying packet transmissions. Specifically, given a routing tree, we first present a dynamic programming algorithm that computes the optimal network frequency of each sensor; then, we develop a heuristic for finding the best tree topology, if this is not fixed in advance.

Original languageEnglish
Title of host publication2011 IEEE 27th International Conference on Data Engineering, ICDE 2011
Pages147-158
Number of pages12
DOIs
Publication statusPublished - 2011
Externally publishedYes
Event2011 IEEE 27th International Conference on Data Engineering, ICDE 2011 - Hannover, Germany
Duration: 11 Apr 201116 Apr 2011

Other

Other2011 IEEE 27th International Conference on Data Engineering, ICDE 2011
CountryGermany
CityHannover
Period11/4/1116/4/11

Fingerprint

Synchronization
Sensors
Wireless sensor networks
Query processing
Dynamic programming
Base stations
Topology
Sampling

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Information Systems

Cite this

Wang, L., Yang, Y., Miao, X., Papadias, D., & Liu, Y. (2011). Algorithms for local sensor synchronization. In 2011 IEEE 27th International Conference on Data Engineering, ICDE 2011 (pp. 147-158). [5767841] https://doi.org/10.1109/ICDE.2011.5767841

Algorithms for local sensor synchronization. / Wang, Lixing; Yang, Yin; Miao, Xin; Papadias, Dimitris; Liu, Yunhao.

2011 IEEE 27th International Conference on Data Engineering, ICDE 2011. 2011. p. 147-158 5767841.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Wang, L, Yang, Y, Miao, X, Papadias, D & Liu, Y 2011, Algorithms for local sensor synchronization. in 2011 IEEE 27th International Conference on Data Engineering, ICDE 2011., 5767841, pp. 147-158, 2011 IEEE 27th International Conference on Data Engineering, ICDE 2011, Hannover, Germany, 11/4/11. https://doi.org/10.1109/ICDE.2011.5767841
Wang L, Yang Y, Miao X, Papadias D, Liu Y. Algorithms for local sensor synchronization. In 2011 IEEE 27th International Conference on Data Engineering, ICDE 2011. 2011. p. 147-158. 5767841 https://doi.org/10.1109/ICDE.2011.5767841
Wang, Lixing ; Yang, Yin ; Miao, Xin ; Papadias, Dimitris ; Liu, Yunhao. / Algorithms for local sensor synchronization. 2011 IEEE 27th International Conference on Data Engineering, ICDE 2011. 2011. pp. 147-158
@inproceedings{06d92a740a8d40ccbb4e160b2c959e9e,
title = "Algorithms for local sensor synchronization",
abstract = "In a wireless sensor network (WSN), each sensor monitors environmental parameters, and reports its readings to a base station, possibly through other nodes. A sensor works in cycles, in each of which it stays active for a fixed duration, and then sleeps until the next cycle. The frequency of such cycles determines the portion of time that a sensor is active, and is the dominant factor on its battery life. The majority of existing work assumes globally synchronized WSN where all sensors have the same frequency. This leads to waste of battery power for applications that entail different accuracy of measurements, or environments where sensor readings have large variability. To overcome this problem, we propose LS, a query processing framework for locally synchronized WSN. We consider that each sensor ni has a distinct sampling frequency fi, which is determined by the application or environment requirements. The complication of LS is that ni has to wake up with a network frequency Fifi, in order to forward messages of other sensors. Our goal is to minimize the sum of Fi without delaying packet transmissions. Specifically, given a routing tree, we first present a dynamic programming algorithm that computes the optimal network frequency of each sensor; then, we develop a heuristic for finding the best tree topology, if this is not fixed in advance.",
author = "Lixing Wang and Yin Yang and Xin Miao and Dimitris Papadias and Yunhao Liu",
year = "2011",
doi = "10.1109/ICDE.2011.5767841",
language = "English",
isbn = "9781424489589",
pages = "147--158",
booktitle = "2011 IEEE 27th International Conference on Data Engineering, ICDE 2011",

}

TY - GEN

T1 - Algorithms for local sensor synchronization

AU - Wang, Lixing

AU - Yang, Yin

AU - Miao, Xin

AU - Papadias, Dimitris

AU - Liu, Yunhao

PY - 2011

Y1 - 2011

N2 - In a wireless sensor network (WSN), each sensor monitors environmental parameters, and reports its readings to a base station, possibly through other nodes. A sensor works in cycles, in each of which it stays active for a fixed duration, and then sleeps until the next cycle. The frequency of such cycles determines the portion of time that a sensor is active, and is the dominant factor on its battery life. The majority of existing work assumes globally synchronized WSN where all sensors have the same frequency. This leads to waste of battery power for applications that entail different accuracy of measurements, or environments where sensor readings have large variability. To overcome this problem, we propose LS, a query processing framework for locally synchronized WSN. We consider that each sensor ni has a distinct sampling frequency fi, which is determined by the application or environment requirements. The complication of LS is that ni has to wake up with a network frequency Fifi, in order to forward messages of other sensors. Our goal is to minimize the sum of Fi without delaying packet transmissions. Specifically, given a routing tree, we first present a dynamic programming algorithm that computes the optimal network frequency of each sensor; then, we develop a heuristic for finding the best tree topology, if this is not fixed in advance.

AB - In a wireless sensor network (WSN), each sensor monitors environmental parameters, and reports its readings to a base station, possibly through other nodes. A sensor works in cycles, in each of which it stays active for a fixed duration, and then sleeps until the next cycle. The frequency of such cycles determines the portion of time that a sensor is active, and is the dominant factor on its battery life. The majority of existing work assumes globally synchronized WSN where all sensors have the same frequency. This leads to waste of battery power for applications that entail different accuracy of measurements, or environments where sensor readings have large variability. To overcome this problem, we propose LS, a query processing framework for locally synchronized WSN. We consider that each sensor ni has a distinct sampling frequency fi, which is determined by the application or environment requirements. The complication of LS is that ni has to wake up with a network frequency Fifi, in order to forward messages of other sensors. Our goal is to minimize the sum of Fi without delaying packet transmissions. Specifically, given a routing tree, we first present a dynamic programming algorithm that computes the optimal network frequency of each sensor; then, we develop a heuristic for finding the best tree topology, if this is not fixed in advance.

UR - http://www.scopus.com/inward/record.url?scp=79957868259&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79957868259&partnerID=8YFLogxK

U2 - 10.1109/ICDE.2011.5767841

DO - 10.1109/ICDE.2011.5767841

M3 - Conference contribution

SN - 9781424489589

SP - 147

EP - 158

BT - 2011 IEEE 27th International Conference on Data Engineering, ICDE 2011

ER -