Paper Info
Title
Inter-application redundancy elimination in Wireless Sensor Networks with compiler-assisted scheduling
Abstract
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.
Year
DOI
Venue
2012
10.1109/SIES.2012.6356576
Industrial Embedded Systems
Keywords
Field
DocType
multiprogramming,processor scheduling,program compilers,redundancy,string matching,telecommunication computing,wireless sensor networks,LCS,REIS,SCS,WSN nodes,compiler-assisted scheduling,concurrent users,current-generation wireless sensor network nodes,dissimilar requirements,embedded scheduling information,energy savings,executable instructions,high-level optimization,holistic programming scheme,inter-application redundancy elimination,linear sequence,longest common subsequence,multiple concurrent applications,multiple sensors,multitasking,optimal merged monolithic sequence,processor usage,shortest common super-sequence,string-matching algorithms,wireless sensor networks,Compilers,Energy Optimization,Scheduling,Wireless Sensor Networks
Longest common subsequence problem,Algorithm design,Computer science,Scheduling (computing),Real-time computing,Compiler,Redundancy (engineering),Computer multitasking,Wireless sensor network,Executable,Embedded system,Distributed computing
Conference
ISBN
Citations 
PageRank 
978-1-4673-2683-4
2
0.36
References 
Authors
9
4
Name
Order
Citations
PageRank
Vikram Gupta131.05
Eduardo Tovar296197.03
Karthik Lakshmanan373231.22
Ragunathan Rajkumar41608240.79