Deductive Framework for Programming Sensor Networks

Abstract

Abstract-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.

“Slow is Fast” for wireless sensor networks in the presence of message losses

“…Programming approaches proposed in [4,8,17,18,23,26,[31][32][33][34][35][36] fall under the category of abstractions based on language aspects. State centric approaches.…”

“…In [18], a deductive framework for specifying sensor network programs are proposed. This approach views the network as a distributed database of facts gathered from the environment.…”

“…Non-collaborative functionality is provided as built-in functions. Unlike [18], the SF shared memory model relies only on the state of the neighbors. The overall collaborative functionality can be built based on the state of the neighbors.…”

“…The overall collaborative functionality can be built based on the state of the neighbors. Moreover, SF shared memory model can be used to specify the built-in functions of [18] easily. In addition, the SF shared memory model enables reuse of existing built-in functions proposed in the literature.…”

Query Processing in a Traceable P2P Record Exchange Framework

“…As proved in the declarative networking project [9], [26], [28], a declarative recursive query is a very powerful tool for network-oriented database applications such as P2P and sensor data aggregation. We can find several related ideas for executing and optimizing declarative queries in a network [16], [25], [32].…”