Algorithms for joint coverage, routing and scheduling problem in wireless sensor networks

Abstract

A new decision making problem for wireless sensor networks is considered in the paper. A coverage of data sources, the routing of measured data as well as a scheduling of working periods of sensors are assumed as the decision to be made. All decisions as interconnected are determined jointly. The energy consumption and execution time of sensors are used as criteria. The corresponding combinatorial NP-hard optimization problem is formulated. To solve it, two heuristic algorithms are proposed. Some initial analitical evaluations of algorithms are presented as well as the result of computational experiments are given.