a random scheme to implement m-connected k-covering wireless sensor networks

Deploying the m-connected k-covering (mk) wireless sensor networks (wsns) is crucial for a reliable packet delivery and target coverage. this paper proposes implementing random mk wsns based on the expected m-connected k-covering (emk) wsns. we define emk wsns as random wsns mathematically, expected to be both m-connected and k-covering. deploying random emk wsns is conducted by deriving a relationship between m-connectivity and k-coverage, together with a lower bound for the required number of nodes. it is shown that emk wsns tend to be mk asymptotically. a polynomial worst-case and linear average-case complexity algorithm is presented in order to turn an emk wsn into mk in non-asymptotic conditions. the m-connectivity is founded on the concept of support sets to strictly guarantee the existence of m disjoint paths between every node and the sink. the theoretical results are assessed via the experiments, and several metaheuristic solutions are benchmarked to reveal the appropriate size of the generated mk wsns.