Inter-Application Redundancy Elimination in Sensor Networks With Compiler-Assisted Scheduling
Wireless sensor network nodes supporting multi-tasking and multiple concurrent applications are becoming increasingly common. These nodes are typically equipped with multiple sensors of various types. This trend has been fostering the design of wireless sensor networks allowing several concurrent users to deploy applications with dissimilar requirements. At the same time, the practical burden of programming individual sensor nodes has led researchers to design macro-programming schemes able to program the network as a whole. In this paper, the authors extend the advantages of a holistic programming scheme by designing a novel compiler-assisted scheduling approach (dubbed REIS) able to identify and eliminate redundancies across applications.