Security-aware optimization for ubiquitous computing systems with SEAT graph approach

► Propose a novel graph model SEAT that can express security requirements of each task. ► Use the security probability to measure security strength of a cryptographic algorithm. ► Optimal strategy achieved by our ILP while guaranteeing the system schedulability ► Two dynamic programming algorithms generate the optimal strategy in polynomial time.