Provable configuration planning for wireless sensor networks

Wireless Sensor Networks (WSNs) provide a flexible communication infrastructure for sensing and control. However, maintaining coverage is one of the most challenging tasks in configuring and deploying WSNs. Although there has been a significant amount research on providing coverage, most of the existing solutions focus on the coverage problem without giving attention to new sensing capabilities and dependability (security and reliability) requirements of WSN. Nevertheless, most of the existing techniques show limited scalability with the increasing number of sensors. In this paper, we present novel Satisfiability Modulo Theories (SMT) based formalizations to find the satisfying coverage configurations considering various practical security and reliability constraints. The presented approaches were implemented using Vices SMT Solver and evaluated extensively to show the feasibility and scalability of deploying our solutions in real-life WSN.