Inter-application Redundancy Elimination in Sensor Networks with Compiler-Assisted Scheduling VG-CAS-11
Ref: SIES-RED-2012 Publication Date: 20 to 22, Jun, 2012
Inter-application Redundancy Elimination in Sensor Networks with Compiler-Assisted Scheduling VG-CAS-11Ref: SIES-RED-2012 Publication Date: 20 to 22, Jun, 2012
Most current-generation Wireless Sensor Network (WSN) nodes are equipped with multiple sensors of various types, and therefore support for multi-tasking and multiple concurrent applications is becoming increasingly common. This trend has been fostering the design of WSNs allowing several concurrent users to deploy applications with dissimilar requirements. In this paper, we extend the advantages of a holistic programming scheme by designing a novel compiler-assisted scheduling approach (called REIS) able to identify and eliminate redundancies across applications. To achieve this useful high-level optimization, we model each user application as a linear sequence of executable instructions. We show how well-known string-matching algorithms such as the Longest Common Subsequence (LCS) and the Shortest Common Super-sequence (SCS) can be used to produce an optimal merged monolithic sequence of the deployed applications that takes into account embedded scheduling information. We show that our approach can help in achieving about 60% average energy savings in processor usage compared to the normal execution of concurrent applications.
7th IEEE International Symposium on Industrial Embedded Systems (SIES 2012), pp 112-119.