Abstract. This paper concerns the problem of optimal monitoring network lay- out using information-theoretical methods. Numerous different objectives based on information measures have been proposed in recent literature, often focusing simultaneously on maximum information and minimum dependence between the chosen locations for data collection. We discuss these objective functions and conclude that a single objective optimization of joint entropy suffices to maximize the collection of information for a given number of sensors. Minimum dependence is a secondary objective that automatically follows from the first, but has no intrinsic justification. In fact, for two networks of equal joint entropy, one with a higher amount of redundant information should be preferred for reasons of robustness against failure. In attaining the maximum joint entropy objective, we investigate exhaustive optimization, a more computationally tractable greedy approach that adds one station at a time, and we introduce the greedy drop approach, where the full set of sensors is reduced one at a time. We show that only exhaustive optimization will give true optimum. The arguments are illustrated by a comparative case study.