TY - GEN
T1 - Deductive framework for programming sensor networks
AU - Gupta, Himanshu
AU - Zhu, Xianjin
AU - Xu, Xiang
PY - 2009
Y1 - 2009
N2 - Developing powerful paradigms for programming sensor networks is critical to realize the full potential of sensor networks as collaborative data processing engines. In this article, we motivate and develop a deductive framework for programming sensor networks, extending the prior vision of viewing sensor network as a distributed database. The deductive programming approach is declarative, very expressive, and amenable to automatic optimizations. Such a framework allows users to program sensor network applications at a high-level without worrying about the low-level tedious details. Our system translates a given deductive program to efficient distributed code that runs on individual nodes. To facilitate the above translation, we develop techniques for distributed and asynchronous evaluation of deductive programs in sensor networks. Our techniques generalize to recursive programs without negations, arbitrary nonrecursive programs with negations, and in general to arbitrary "locally non-recursive" programs with function symbols. We present performance results on TOSSIM, a network simulator, and a small network testbed.
AB - Developing powerful paradigms for programming sensor networks is critical to realize the full potential of sensor networks as collaborative data processing engines. In this article, we motivate and develop a deductive framework for programming sensor networks, extending the prior vision of viewing sensor network as a distributed database. The deductive programming approach is declarative, very expressive, and amenable to automatic optimizations. Such a framework allows users to program sensor network applications at a high-level without worrying about the low-level tedious details. Our system translates a given deductive program to efficient distributed code that runs on individual nodes. To facilitate the above translation, we develop techniques for distributed and asynchronous evaluation of deductive programs in sensor networks. Our techniques generalize to recursive programs without negations, arbitrary nonrecursive programs with negations, and in general to arbitrary "locally non-recursive" programs with function symbols. We present performance results on TOSSIM, a network simulator, and a small network testbed.
UR - https://www.scopus.com/pages/publications/67649668629
U2 - 10.1109/ICDE.2009.52
DO - 10.1109/ICDE.2009.52
M3 - Conference contribution
AN - SCOPUS:67649668629
SN - 9780769535456
T3 - Proceedings - International Conference on Data Engineering
SP - 281
EP - 292
BT - Proceedings - 25th IEEE International Conference on Data Engineering, ICDE 2009
T2 - 25th IEEE International Conference on Data Engineering, ICDE 2009
Y2 - 29 March 2009 through 2 April 2009
ER -